An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks
Cloud applications are an important phenomenon on the modern use of Internet. Search engines, social networks, content delivery and retail and e-commerce sites belong to this group of applications. These applications run on specialized facilities called data centers. An important element in the arch...
- Autores:
-
Gutiérrez Betancur, Sergio Armando
- Tipo de recurso:
- Doctoral thesis
- Fecha de publicación:
- 2018
- Institución:
- Universidad Nacional de Colombia
- Repositorio:
- Universidad Nacional de Colombia
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.unal.edu.co:unal/63797
- Acceso en línea:
- https://repositorio.unal.edu.co/handle/unal/63797
http://bdigital.unal.edu.co/64348/
- Palabra clave:
- 0 Generalidades / Computer science, information and general works
62 Ingeniería y operaciones afines / Engineering
Data Center Networks
Flow Scheduling
Programmable Switches
MLFQ
Redes de Data center
Conmutación de fujos
Siches programables (MLFQ)
- Rights
- openAccess
- License
- Atribución-NoComercial 4.0 Internacional
id |
UNACIONAL2_57888e98aad7d9f93c3a9547d234568e |
---|---|
oai_identifier_str |
oai:repositorio.unal.edu.co:unal/63797 |
network_acronym_str |
UNACIONAL2 |
network_name_str |
Universidad Nacional de Colombia |
repository_id_str |
|
dc.title.spa.fl_str_mv |
An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks |
title |
An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks |
spellingShingle |
An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks 0 Generalidades / Computer science, information and general works 62 Ingeniería y operaciones afines / Engineering Data Center Networks Flow Scheduling Programmable Switches MLFQ Redes de Data center Conmutación de fujos Siches programables (MLFQ) |
title_short |
An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks |
title_full |
An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks |
title_fullStr |
An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks |
title_full_unstemmed |
An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks |
title_sort |
An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks |
dc.creator.fl_str_mv |
Gutiérrez Betancur, Sergio Armando |
dc.contributor.advisor.spa.fl_str_mv |
Barcellos, Marinho (Thesis advisor) |
dc.contributor.author.spa.fl_str_mv |
Gutiérrez Betancur, Sergio Armando |
dc.contributor.spa.fl_str_mv |
Branch Bedoya, John Willian |
dc.subject.ddc.spa.fl_str_mv |
0 Generalidades / Computer science, information and general works 62 Ingeniería y operaciones afines / Engineering |
topic |
0 Generalidades / Computer science, information and general works 62 Ingeniería y operaciones afines / Engineering Data Center Networks Flow Scheduling Programmable Switches MLFQ Redes de Data center Conmutación de fujos Siches programables (MLFQ) |
dc.subject.proposal.spa.fl_str_mv |
Data Center Networks Flow Scheduling Programmable Switches MLFQ Redes de Data center Conmutación de fujos Siches programables (MLFQ) |
description |
Cloud applications are an important phenomenon on the modern use of Internet. Search engines, social networks, content delivery and retail and e-commerce sites belong to this group of applications. These applications run on specialized facilities called data centers. An important element in the architecture of data centers is the communication infrastructure, commonly known as data center network (DCN). One of the challenges that DCN have to address is the satisfaction of service requirements of the applications expressed in terms of high responsiveness and high performance. In order to address this challenge, the traffic associated to these applications needs an special handling due to its properties which makes it essentially different to the traffic of other Internet applications such as mail or multimedia services. In order to contribute to the achievement of the previously mentioned performance goals, DCN should be able to prioritize the short flows (a few KB) over the long flows (several MB). However, given the time and space variations that the traffic presents, the information about flow sizes is not available in advance in order to plan the flow scheduling. In this thesis we present an adaptable workload-agnostic flow scheduling mechanism called AWAFS. It is an adaptable approach capable to agnostically adjust the scheduling configuration within DCN switches. This agnostic adjustment contributes to reduce the Flow Completion Time (FCT) of those short flows representing around 85 % of the traffic handled by cloud applications. Our results show that AWAFS can reduce the average FCT of short flows up to 24 % when compared to an agnostic non-adaptable state-of-the-art solution. Indeed, it can provide improvements of up to 60 % for medium flows and 39 % for long flows. Also, AWAFS can improve the FCT for short flows in scenarios with high heterogeneity in the traffic present in the network with a reduction of up to 35 %. |
publishDate |
2018 |
dc.date.issued.spa.fl_str_mv |
2018-04-30 |
dc.date.accessioned.spa.fl_str_mv |
2019-07-02T22:09:23Z |
dc.date.available.spa.fl_str_mv |
2019-07-02T22:09:23Z |
dc.type.spa.fl_str_mv |
Trabajo de grado - Doctorado |
dc.type.driver.spa.fl_str_mv |
info:eu-repo/semantics/doctoralThesis |
dc.type.version.spa.fl_str_mv |
info:eu-repo/semantics/acceptedVersion |
dc.type.coar.spa.fl_str_mv |
http://purl.org/coar/resource_type/c_db06 |
dc.type.content.spa.fl_str_mv |
Text |
dc.type.redcol.spa.fl_str_mv |
http://purl.org/redcol/resource_type/TD |
format |
http://purl.org/coar/resource_type/c_db06 |
status_str |
acceptedVersion |
dc.identifier.uri.none.fl_str_mv |
https://repositorio.unal.edu.co/handle/unal/63797 |
dc.identifier.eprints.spa.fl_str_mv |
http://bdigital.unal.edu.co/64348/ |
url |
https://repositorio.unal.edu.co/handle/unal/63797 http://bdigital.unal.edu.co/64348/ |
dc.language.iso.spa.fl_str_mv |
spa |
language |
spa |
dc.relation.ispartof.spa.fl_str_mv |
Universidad Nacional de Colombia Sede Medellín Facultad de Minas Escuela de Sistemas Ingeniería de Sistemas e Informática Ingeniería de Sistemas e Informática |
dc.relation.references.spa.fl_str_mv |
Gutiérrez Betancur, Sergio Armando (2018) An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks. Doctorado thesis, Universidad Nacional de Colombia - Sede Medellín. |
dc.rights.spa.fl_str_mv |
Derechos reservados - Universidad Nacional de Colombia |
dc.rights.coar.fl_str_mv |
http://purl.org/coar/access_right/c_abf2 |
dc.rights.license.spa.fl_str_mv |
Atribución-NoComercial 4.0 Internacional |
dc.rights.uri.spa.fl_str_mv |
http://creativecommons.org/licenses/by-nc/4.0/ |
dc.rights.accessrights.spa.fl_str_mv |
info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Atribución-NoComercial 4.0 Internacional Derechos reservados - Universidad Nacional de Colombia http://creativecommons.org/licenses/by-nc/4.0/ http://purl.org/coar/access_right/c_abf2 |
eu_rights_str_mv |
openAccess |
dc.format.mimetype.spa.fl_str_mv |
application/pdf |
institution |
Universidad Nacional de Colombia |
bitstream.url.fl_str_mv |
https://repositorio.unal.edu.co/bitstream/unal/63797/1/71264649.2018.pdf https://repositorio.unal.edu.co/bitstream/unal/63797/2/71264649.2018.pdf.jpg |
bitstream.checksum.fl_str_mv |
07827b2000b7429c82a56a67366d7ba9 cd7e3ea7debc1c73d2fd167f41f474bb |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 |
repository.name.fl_str_mv |
Repositorio Institucional Universidad Nacional de Colombia |
repository.mail.fl_str_mv |
repositorio_nal@unal.edu.co |
_version_ |
1814090190877097984 |
spelling |
Atribución-NoComercial 4.0 InternacionalDerechos reservados - Universidad Nacional de Colombiahttp://creativecommons.org/licenses/by-nc/4.0/info:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Branch Bedoya, John WillianBarcellos, Marinho (Thesis advisor)0f99f4d2-c6f0-4193-82ce-56b226bce7e8-1Gutiérrez Betancur, Sergio Armando1eb8ff6d-16b2-4d57-bb03-301ae36bb8a33002019-07-02T22:09:23Z2019-07-02T22:09:23Z2018-04-30https://repositorio.unal.edu.co/handle/unal/63797http://bdigital.unal.edu.co/64348/Cloud applications are an important phenomenon on the modern use of Internet. Search engines, social networks, content delivery and retail and e-commerce sites belong to this group of applications. These applications run on specialized facilities called data centers. An important element in the architecture of data centers is the communication infrastructure, commonly known as data center network (DCN). One of the challenges that DCN have to address is the satisfaction of service requirements of the applications expressed in terms of high responsiveness and high performance. In order to address this challenge, the traffic associated to these applications needs an special handling due to its properties which makes it essentially different to the traffic of other Internet applications such as mail or multimedia services. In order to contribute to the achievement of the previously mentioned performance goals, DCN should be able to prioritize the short flows (a few KB) over the long flows (several MB). However, given the time and space variations that the traffic presents, the information about flow sizes is not available in advance in order to plan the flow scheduling. In this thesis we present an adaptable workload-agnostic flow scheduling mechanism called AWAFS. It is an adaptable approach capable to agnostically adjust the scheduling configuration within DCN switches. This agnostic adjustment contributes to reduce the Flow Completion Time (FCT) of those short flows representing around 85 % of the traffic handled by cloud applications. Our results show that AWAFS can reduce the average FCT of short flows up to 24 % when compared to an agnostic non-adaptable state-of-the-art solution. Indeed, it can provide improvements of up to 60 % for medium flows and 39 % for long flows. Also, AWAFS can improve the FCT for short flows in scenarios with high heterogeneity in the traffic present in the network with a reduction of up to 35 %.Resumen: Las denominadas aplicaciones en nube son un fenómeno importante en el uso moderno de internet. Los motores de búsqueda, las redes sociales, los sistemas de distribución de contenido y los sitios de comercio electrónico, entre otros, pertenecen a este tipo de aplicaciones. Éstas corren en instalaciones especializadas denominadas centros de datos. Un elemento importante en la arquitectura de los centros de datos es la infraestructura de comunicaciones, conocida como la red del centro de datos. Un desafio crı́tico que la red de centro de datos tiene que abordar es el procesamiento del tráfico de las aplicaciones, el cual debido a sus propiedades es esencialmente diferente de el de otras aplicaciones de Internet tales como el correo electrónico o los servicios multimediales. Para contribuir al logro de las metas de desempeño de alta capacidad de respuesta y alto desempeño, la red del centro de datos deberı́a ser capaz de diferenciar y priorizar adecuadamente los flujos pequeños (Unos cuantos Kilobytes) con respecto a los flujos grandes (Varios Megabytes). Sin embargo, dadas las variaciones espacio temporales que presenta el tráfico de las aplicaciones, la información de los tamaños de los flujos no está disponible de antemano para poder programar la tranmisión de los mismos. En esta tesis presentamos un mecanismo de conmutación de flujos adaptable y agnóstico con respecto a las cargas de trabajo presentes en la red denominado AWAFS por su sigla en inglés. AWAFS plantea un enfoque adaptable, capaz de ajustar de manera agnóstica la configuración de conmutación al interior de los suiches de la red del centro de datos. Este ajuste agnóstico contribuye a reducir el tiempo de completación de los flujos pequeños, los cuales representan entre un 85 % y un 95 % del tráfico manejado por las aplicaciones. Nuestros resultados muestran que AWAFS puede reducir hasta en un 24 % el tiempo promedio de completación de los flujos cuando se compara con una técnica agnóstica no adaptable presentada en el estado del arte, sin inducir inanicción en los flujos grandes. En efecto, AWAFS puede proporcionar mejoras de hasta un 60 % para los flujos medios y 39 % para los flujos grandes. Por su adaptabilidad, AWAFS también logra obtener esta mejora en escenarios con alta heterogeneidad en el tráfico presente en la red, ofreciendo una reducción de hasta 35 % en el tiempo promedio de completación para los flujos pequeños.Doctoradoapplication/pdfspaUniversidad Nacional de Colombia Sede Medellín Facultad de Minas Escuela de Sistemas Ingeniería de Sistemas e InformáticaIngeniería de Sistemas e InformáticaGutiérrez Betancur, Sergio Armando (2018) An adaptable workload-agnostic flow scheduling mechanism for Data Center Networks. Doctorado thesis, Universidad Nacional de Colombia - Sede Medellín.0 Generalidades / Computer science, information and general works62 Ingeniería y operaciones afines / EngineeringData Center NetworksFlow SchedulingProgrammable SwitchesMLFQRedes de Data centerConmutación de fujosSiches programables (MLFQ)An adaptable workload-agnostic flow scheduling mechanism for Data Center NetworksTrabajo de grado - Doctoradoinfo:eu-repo/semantics/doctoralThesisinfo:eu-repo/semantics/acceptedVersionhttp://purl.org/coar/resource_type/c_db06Texthttp://purl.org/redcol/resource_type/TDORIGINAL71264649.2018.pdfTesis de Doctorado en Ingeniería - Sistemasapplication/pdf1427400https://repositorio.unal.edu.co/bitstream/unal/63797/1/71264649.2018.pdf07827b2000b7429c82a56a67366d7ba9MD51THUMBNAIL71264649.2018.pdf.jpg71264649.2018.pdf.jpgGenerated Thumbnailimage/jpeg3883https://repositorio.unal.edu.co/bitstream/unal/63797/2/71264649.2018.pdf.jpgcd7e3ea7debc1c73d2fd167f41f474bbMD52unal/63797oai:repositorio.unal.edu.co:unal/637972024-04-30 23:11:12.278Repositorio Institucional Universidad Nacional de Colombiarepositorio_nal@unal.edu.co |