<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0012-7353</journal-id>
<journal-title><![CDATA[DYNA]]></journal-title>
<abbrev-journal-title><![CDATA[Dyna rev.fac.nac.minas]]></abbrev-journal-title>
<issn>0012-7353</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional de Colombia]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0012-73532018000300016</article-id>
<article-id pub-id-type="doi">10.15446/dyna.v85n206.71626</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Dynamic adjustment of a MLFQ flow scheduler to improve cloud applications performance]]></article-title>
<article-title xml:lang="es"><![CDATA[Ajuste dinámico de un programador de flujos MLFQ para mejorar el desempeño de aplicaciones en la nube]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gutiérrez]]></surname>
<given-names><![CDATA[Sergio Armando]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
<xref ref-type="aff" rid="Aaf"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Barcellos]]></surname>
<given-names><![CDATA[Marinho]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Branch]]></surname>
<given-names><![CDATA[John Willian]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Nacional de Colombia Facultad de Minas ]]></institution>
<addr-line><![CDATA[Medellín ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidade Federal do Rio Grande do Sul Instituto de Informática ]]></institution>
<addr-line><![CDATA[Porto Alegre ]]></addr-line>
<country>Brazil</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad de Medellín Facultad de Ingenierías ]]></institution>
<addr-line><![CDATA[Medellín ]]></addr-line>
<country>Colombia</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2018</year>
</pub-date>
<volume>85</volume>
<numero>206</numero>
<fpage>16</fpage>
<lpage>23</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_arttext&amp;pid=S0012-73532018000300016&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_abstract&amp;pid=S0012-73532018000300016&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.co/scielo.php?script=sci_pdf&amp;pid=S0012-73532018000300016&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract State-of-the-art solutions for flow scheduling propose the use of Multi Level Feedback Queue (MLFQ) as a mechanism to avoid the requirement of prior information (i.e. agnosticism) regarding flow sizes. This is an important aspect to achieve the performance goals of high responsiveness and high throughput that is expected in Cloud Applications (e.g. search engines, social networks, and e-commerce sites). These goals are tightly associated with the prioritization of short flows (a few KB in size), the majority for these applications rather than long flows (several MB in size). However, these applications usually cannot provide information in advance about the size of the flows. In this paper, we analyze the feasibility of providing dynamic adjustment for a MLFQ-based scheduling system in such a way that it adapts itself to the time and space variations exhibited by Data Center Network (DCN) traffic without requiring prior information about workload properties.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Las soluciones presentes actualmente en el área de conmutación de flujos proponen el uso del concepto de Colas Multinivel con Realimentación (MLFQ por su sigla en inglés) como mecanismo para evitar el requerimiento de información previa (mecanismo agnóstico) con respecto al tamaño de los flujos de datos. Este es un aspecto importante para el logro de las metas de desempeño de alta capacidad de respuesta y alto rendimiento, esperadas en las aplicaciones en la nube (Por ejemplo, motores de búsqueda, redes sociales y sitios de comercio electrónico). Estas metas están estrechamente asociadas a la priorización de los flujos cortos (con tamaños de unos pocos KB), mayoritarios en estas aplicaciones, sobre los flujos largos (con tamaños de varios MB). Sin embargo, estas aplicaciones usualmente no son capaces de proporcionar de antemano la información acerca del tamaño de los flujos. En este artículo, analizamos la viabilidad de proporcionar ajuste dinámico a un esquema de conmutación basado en MLFQ, de tal manera que éste sea capaz de adaptarse a las variaciones espacio temporales que se observan en el tráfico presente en las redes de centro de datos, sin que se requiera información previa sobre las propiedades de las cargas de trabajo.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Flow scheduling]]></kwd>
<kwd lng="en"><![CDATA[data center networks]]></kwd>
<kwd lng="en"><![CDATA[MLFQ]]></kwd>
<kwd lng="en"><![CDATA[agnostic flow scheduling]]></kwd>
<kwd lng="es"><![CDATA[Conmutación de flujos]]></kwd>
<kwd lng="es"><![CDATA[redes de centro de datos]]></kwd>
<kwd lng="es"><![CDATA[MLFQ]]></kwd>
<kwd lng="es"><![CDATA[conmutación agnóstica de flujos]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>[1]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alizadeh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Greenberg]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Maltz]]></surname>
<given-names><![CDATA[D.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Padhye]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Patel]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Prabhakar]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Sengupta]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Sridharan]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Data Center TCP (DCTCP)]]></source>
<year></year>
<conf-name><![CDATA[ Proceedings of the ACM SIGCOMM 2010 Conference]]></conf-name>
<conf-date>2010</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>63-74</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>[2]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alizadeh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Javanmard]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Prabhakar]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Analysis of DCTCP: stability, convergence, and fairness.]]></source>
<year></year>
<conf-name><![CDATA[ Proceedings of the ACM SIGMETRICS Joint International Conference on Measurement and Modeling of Computer Systems]]></conf-name>
<conf-date>2011</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>73-84</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>[3]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alizadeh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kabbani]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Edsall]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Prabhakar]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Vahdat]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Yasuda]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Less is more: trading a little bandwidth for ultra-low latency in the data center]]></source>
<year></year>
<conf-name><![CDATA[ 9thUSENIX Conference on Networked Systems Design and Implementation]]></conf-name>
<conf-date>2012</conf-date>
<conf-loc>Berkeley, CA, USA </conf-loc>
<page-range>19</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>[4]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alizadeh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Yang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Sharif]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Katti]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[McKeown]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Prabhakar]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Shenker]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[pFabric: minimal near-optimal datacenter transport]]></source>
<year></year>
<conf-name><![CDATA[ ACM SIGCOMM 2013 Conference on SIGCOMM]]></conf-name>
<conf-date>2013</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>435-46</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>[5]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bai]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Tian]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Information-agnostic flow scheduling for commodity data centers]]></source>
<year></year>
<conf-name><![CDATA[ 12thUSENIX Conference on Networked Systems Design and Implementation]]></conf-name>
<conf-date>2015</conf-date>
<conf-loc>Berkeley, CA, USA </conf-loc>
<page-range>455-68</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>[6]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bai]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Han]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Tian]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<source><![CDATA[PIAS: practical Information-agnostic flow scheduling for commodity data centers]]></source>
<year>2017</year>
<volume>25</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>1954-67</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>[7]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Benson]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Akella]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Maltz]]></surname>
<given-names><![CDATA[D.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Network traffic characteristics of data centers in the wild]]></source>
<year></year>
<conf-name><![CDATA[ 10thACM SIGCOMM Conference on Internet Measurement]]></conf-name>
<conf-date>2010</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>267-80</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>[8]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bosshart]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Daly]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Gibb]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Izzard]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[McKeown]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Rexford]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Schlesinger]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Talayco]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vahdat]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Varghese]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Walker]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[P4: programming protocol-independent packet processors]]></article-title>
<source><![CDATA[SIGCOMM Comput. Commun. Rev.]]></source>
<year>2014</year>
<volume>44</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>87-95</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>[9]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Bai]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Alizadeh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Scheduling mix-flows in commodity datacenters with Karuna]]></source>
<year></year>
<conf-name><![CDATA[ 2016 ACM SIGCOMM Conference]]></conf-name>
<conf-date>2016</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>174-87</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>[10]</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Corbato]]></surname>
<given-names><![CDATA[F.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Merwin-Daggett]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Daley]]></surname>
<given-names><![CDATA[R.C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[An experimental time-sharing system]]></article-title>
<source><![CDATA[Classic Operating Systems]]></source>
<year>2001</year>
<page-range>117-37</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>[11]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Grosvenor]]></surname>
<given-names><![CDATA[M.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Schwarzkopf]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Gog]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Watson]]></surname>
<given-names><![CDATA[R.N.]]></given-names>
</name>
<name>
<surname><![CDATA[Moore]]></surname>
<given-names><![CDATA[A.W.]]></given-names>
</name>
<name>
<surname><![CDATA[Hand]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Crowcroft]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Queues don&#8217;t matter when you can JUMP Them!]]></source>
<year></year>
<conf-name><![CDATA[ 12thUSENIX Symposium on Networked Systems Design and Implementation (NSDI&#8217;15)]]></conf-name>
<conf-date>2015</conf-date>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B12">
<label>[12]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoganson]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Brown]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Intelligent mitigation in multilevel feedback queues]]></source>
<year></year>
<conf-name><![CDATA[ ACM SE&#8217;17 Proceedings of the SouthEast Conference]]></conf-name>
<conf-date>2017</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>158-63</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>[13]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hong]]></surname>
<given-names><![CDATA[C.-Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Caesar]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Godfrey]]></surname>
<given-names><![CDATA[P.B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Finishing flows quickly with preemptive scheduling]]></source>
<year></year>
<conf-name><![CDATA[ ACM SIGCOMM 2012 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication]]></conf-name>
<conf-date>2012</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
</nlm-citation>
</ref>
<ref id="B14">
<label>[14]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Joy]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Nayak]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Improving flow completion time for short flows in datacenter networks]]></source>
<year></year>
<conf-name><![CDATA[ 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM)]]></conf-name>
<conf-date>2015</conf-date>
<conf-loc> </conf-loc>
<page-range>700-5</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>[15]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Munir]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Baig]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Irteza]]></surname>
<given-names><![CDATA[S.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Qazi]]></surname>
<given-names><![CDATA[I.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[A.X.]]></given-names>
</name>
<name>
<surname><![CDATA[Dogar]]></surname>
<given-names><![CDATA[F.R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Friends, not foes: synthesizing existing transport strategies for data center networks]]></source>
<year></year>
<conf-name><![CDATA[ 2014 ACM Conference on SIGCOMM]]></conf-name>
<conf-date>2014</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>491-502</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>[16]</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Noormohammadpour]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Raghavendra]]></surname>
<given-names><![CDATA[C.S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Datacenter traffic control: understanding techniques and trade-offs]]></article-title>
<source><![CDATA[IEEE Communications Surveys Tutorials]]></source>
<year>2017</year>
<numero>99</numero>
<issue>99</issue>
<page-range>1492-1 152</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>[17]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pfaff]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Pettit]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Koponen]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Jackson]]></surname>
<given-names><![CDATA[E.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhou]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rajahalme]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Gross]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Stringer]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Shelar]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<source><![CDATA[The design and implementation of Open vSwitch]]></source>
<year></year>
<conf-name><![CDATA[ 12thUSENIX Symposium on Networked Systems Design and Implementation (NSDI&#8217;15)]]></conf-name>
<conf-date>2015</conf-date>
<conf-loc> </conf-loc>
<page-range>117-30</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>[18]</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rojas-Cessa]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Kaymak]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Dong]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[Schemes for fast transmission of flows in data center networks]]></source>
<year>2015</year>
<volume>17</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>1391-422</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>[19]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Roy]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Zeng]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Bagga]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Porter]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Snoeren]]></surname>
<given-names><![CDATA[A.C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Inside the social Network&#8217;s (datacenter) Network]]></source>
<year></year>
<conf-name><![CDATA[ 2015 ACM Conference on Special Interest Group on Data Communication]]></conf-name>
<conf-date>2015</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>123-37</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>[20]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sivaraman]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Cheung]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Budiu]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Alizadeh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Balakrishnan]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Varghese]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[McKeown]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Licking]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Packet transactions: high-level programming for line-rate switches]]></source>
<year></year>
<conf-name><![CDATA[ 2016 ACM SIGCOMM Conference]]></conf-name>
<conf-date>2016</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>15-28</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>[21]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sivaraman]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Kim]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Krishnamoorthy]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Dixit]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Budiu]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[DC.P4: programming the forwarding plane of a data-center switch]]></source>
<year></year>
<conf-name><![CDATA[ 1stACM SIGCOMM Symposium on Software Defined Networking Research]]></conf-name>
<conf-date>2015</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
</nlm-citation>
</ref>
<ref id="B22">
<label>[22]</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sivaraman]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Subramanian]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Alizadeh]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Chole]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Chuang]]></surname>
<given-names><![CDATA[S.-T.]]></given-names>
</name>
<name>
<surname><![CDATA[Agrawal]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Balakrishnan]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Edsall]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Katti]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[McKeown]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[Programmable packet scheduling at line rate]]></source>
<year></year>
<conf-name><![CDATA[ 2016 ACM SIGCOMM Conference]]></conf-name>
<conf-date>2016</conf-date>
<conf-loc>New York, NY, USA </conf-loc>
<page-range>44-57</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
