Padded Frames: A Novel Algorithm for Stable Scheduling in Load-Balanced Switches

The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a load balancer and a deterministic input-queued crossbar switch. The advantages of this architecture are its simplicity and scalability, while its main drawback is the possible out-of-sequence reception of packets...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking 2008-10, Vol.16 (5), p.1212-1225
Hauptverfasser:	Jaramillo, J.J., Milan, F., Srikant, R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Architecture Balancing Birkhoff-von Neumann switch Computer architecture Costs Delay Fabrics Frames load-balanced switch Scalability scheduling Scheduling algorithm Spreading Switches Switching Throughput Traffic control
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	1225
container_issue	5
container_start_page	1212
container_title	IEEE/ACM transactions on networking
container_volume	16
creator	Jaramillo, J.J. Milan, F. Srikant, R.
description	The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a load balancer and a deterministic input-queued crossbar switch. The advantages of this architecture are its simplicity and scalability, while its main drawback is the possible out-of-sequence reception of packets belonging to the same flow. Several solutions have been proposed to overcome this problem; among the most promising are the Uniform Frame Spreading (UFS) and the Full Ordered Frames First (FOFF) algorithms. In this paper, we present a new algorithm called Padded Frames (PF), which eliminates the packet reordering problem, achieves 100% throughput, and improves the delay performance of previously known algorithms.
doi_str_mv	10.1109/TNET.2007.906654
format	Article
fullrecord	<record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_889379051</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4469907</ieee_id><sourcerecordid>889379051</sourcerecordid><originalsourceid>FETCH-LOGICAL-c322t-7dbe9eafaf49ea72d70034b829701f0cc66ccc8ca7d2aeb9adca3bcb5fc3e7933</originalsourceid><addsrcrecordid>eNpdkM1Lw0AUxIMoWKt3wcvixVPqy26ym_VWS6tCqYXW87LZfWlT8qG7ieJ_b0LFg6d58H4zDBME1xFMogjk_XY1304ogJhI4DyJT4JRlCRpSBPOT_sbOAs5l_Q8uPD-ABAxoHwUrNfaWrRk4XSF_oFMyar5xJJMy13jinZfkbxxZNPqrESyMXu0XVnUO1LUZNloGz7qUtemD9h8FW3_9pfBWa5Lj1e_Og7eFvPt7Dlcvj69zKbL0DBK21DYDCXqXOdxL4JaAcDiLKVSQJSDMZwbY1KjhaUaM6mt0SwzWZIbhkIyNg7ujrnvrvno0LeqKrzBsq-DTedVmkomJCRRT97-Iw9N5-q-nEo54wKEGCA4QsY13jvM1bsrKu2-VQRqGFgNA6thYHUcuLfcHC0FIv7hccylBMF-AK5tdws</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>863670771</pqid></control><display><type>article</type><title>Padded Frames: A Novel Algorithm for Stable Scheduling in Load-Balanced Switches</title><source>IEEE Electronic Library (IEL)</source><creator>Jaramillo, J.J. ; Milan, F. ; Srikant, R.</creator><creatorcontrib>Jaramillo, J.J. ; Milan, F. ; Srikant, R.</creatorcontrib><description>The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a load balancer and a deterministic input-queued crossbar switch. The advantages of this architecture are its simplicity and scalability, while its main drawback is the possible out-of-sequence reception of packets belonging to the same flow. Several solutions have been proposed to overcome this problem; among the most promising are the Uniform Frame Spreading (UFS) and the Full Ordered Frames First (FOFF) algorithms. In this paper, we present a new algorithm called Padded Frames (PF), which eliminates the packet reordering problem, achieves 100% throughput, and improves the delay performance of previously known algorithms.</description><identifier>ISSN: 1063-6692</identifier><identifier>EISSN: 1558-2566</identifier><identifier>DOI: 10.1109/TNET.2007.906654</identifier><identifier>CODEN: IEANEP</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Architecture ; Balancing ; Birkhoff-von Neumann switch ; Computer architecture ; Costs ; Delay ; Fabrics ; Frames ; load-balanced switch ; Scalability ; scheduling ; Scheduling algorithm ; Spreading ; Switches ; Switching ; Throughput ; Traffic control</subject><ispartof>IEEE/ACM transactions on networking, 2008-10, Vol.16 (5), p.1212-1225</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c322t-7dbe9eafaf49ea72d70034b829701f0cc66ccc8ca7d2aeb9adca3bcb5fc3e7933</citedby><cites>FETCH-LOGICAL-c322t-7dbe9eafaf49ea72d70034b829701f0cc66ccc8ca7d2aeb9adca3bcb5fc3e7933</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4469907$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4469907$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Jaramillo, J.J.</creatorcontrib><creatorcontrib>Milan, F.</creatorcontrib><creatorcontrib>Srikant, R.</creatorcontrib><title>Padded Frames: A Novel Algorithm for Stable Scheduling in Load-Balanced Switches</title><title>IEEE/ACM transactions on networking</title><addtitle>TNET</addtitle><description>The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a load balancer and a deterministic input-queued crossbar switch. The advantages of this architecture are its simplicity and scalability, while its main drawback is the possible out-of-sequence reception of packets belonging to the same flow. Several solutions have been proposed to overcome this problem; among the most promising are the Uniform Frame Spreading (UFS) and the Full Ordered Frames First (FOFF) algorithms. In this paper, we present a new algorithm called Padded Frames (PF), which eliminates the packet reordering problem, achieves 100% throughput, and improves the delay performance of previously known algorithms.</description><subject>Algorithms</subject><subject>Architecture</subject><subject>Balancing</subject><subject>Birkhoff-von Neumann switch</subject><subject>Computer architecture</subject><subject>Costs</subject><subject>Delay</subject><subject>Fabrics</subject><subject>Frames</subject><subject>load-balanced switch</subject><subject>Scalability</subject><subject>scheduling</subject><subject>Scheduling algorithm</subject><subject>Spreading</subject><subject>Switches</subject><subject>Switching</subject><subject>Throughput</subject><subject>Traffic control</subject><issn>1063-6692</issn><issn>1558-2566</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkM1Lw0AUxIMoWKt3wcvixVPqy26ym_VWS6tCqYXW87LZfWlT8qG7ieJ_b0LFg6d58H4zDBME1xFMogjk_XY1304ogJhI4DyJT4JRlCRpSBPOT_sbOAs5l_Q8uPD-ABAxoHwUrNfaWrRk4XSF_oFMyar5xJJMy13jinZfkbxxZNPqrESyMXu0XVnUO1LUZNloGz7qUtemD9h8FW3_9pfBWa5Lj1e_Og7eFvPt7Dlcvj69zKbL0DBK21DYDCXqXOdxL4JaAcDiLKVSQJSDMZwbY1KjhaUaM6mt0SwzWZIbhkIyNg7ujrnvrvno0LeqKrzBsq-DTedVmkomJCRRT97-Iw9N5-q-nEo54wKEGCA4QsY13jvM1bsrKu2-VQRqGFgNA6thYHUcuLfcHC0FIv7hccylBMF-AK5tdws</recordid><startdate>20081001</startdate><enddate>20081001</enddate><creator>Jaramillo, J.J.</creator><creator>Milan, F.</creator><creator>Srikant, R.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20081001</creationdate><title>Padded Frames: A Novel Algorithm for Stable Scheduling in Load-Balanced Switches</title><author>Jaramillo, J.J. ; Milan, F. ; Srikant, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c322t-7dbe9eafaf49ea72d70034b829701f0cc66ccc8ca7d2aeb9adca3bcb5fc3e7933</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithms</topic><topic>Architecture</topic><topic>Balancing</topic><topic>Birkhoff-von Neumann switch</topic><topic>Computer architecture</topic><topic>Costs</topic><topic>Delay</topic><topic>Fabrics</topic><topic>Frames</topic><topic>load-balanced switch</topic><topic>Scalability</topic><topic>scheduling</topic><topic>Scheduling algorithm</topic><topic>Spreading</topic><topic>Switches</topic><topic>Switching</topic><topic>Throughput</topic><topic>Traffic control</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jaramillo, J.J.</creatorcontrib><creatorcontrib>Milan, F.</creatorcontrib><creatorcontrib>Srikant, R.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE/ACM transactions on networking</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jaramillo, J.J.</au><au>Milan, F.</au><au>Srikant, R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Padded Frames: A Novel Algorithm for Stable Scheduling in Load-Balanced Switches</atitle><jtitle>IEEE/ACM transactions on networking</jtitle><stitle>TNET</stitle><date>2008-10-01</date><risdate>2008</risdate><volume>16</volume><issue>5</issue><spage>1212</spage><epage>1225</epage><pages>1212-1225</pages><issn>1063-6692</issn><eissn>1558-2566</eissn><coden>IEANEP</coden><abstract>The load-balanced Birkhoff-von Neumann switching architecture consists of two stages: a load balancer and a deterministic input-queued crossbar switch. The advantages of this architecture are its simplicity and scalability, while its main drawback is the possible out-of-sequence reception of packets belonging to the same flow. Several solutions have been proposed to overcome this problem; among the most promising are the Uniform Frame Spreading (UFS) and the Full Ordered Frames First (FOFF) algorithms. In this paper, we present a new algorithm called Padded Frames (PF), which eliminates the packet reordering problem, achieves 100% throughput, and improves the delay performance of previously known algorithms.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TNET.2007.906654</doi><tpages>14</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 1063-6692
ispartof	IEEE/ACM transactions on networking, 2008-10, Vol.16 (5), p.1212-1225
issn	1063-6692 1558-2566
language	eng
recordid	cdi_proquest_miscellaneous_889379051
source	IEEE Electronic Library (IEL)
subjects	Algorithms Architecture Balancing Birkhoff-von Neumann switch Computer architecture Costs Delay Fabrics Frames load-balanced switch Scalability scheduling Scheduling algorithm Spreading Switches Switching Throughput Traffic control
title	Padded Frames: A Novel Algorithm for Stable Scheduling in Load-Balanced Switches
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T23%3A32%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Padded%20Frames:%20A%20Novel%20Algorithm%20for%20Stable%20Scheduling%20in%20Load-Balanced%20Switches&rft.jtitle=IEEE/ACM%20transactions%20on%20networking&rft.au=Jaramillo,%20J.J.&rft.date=2008-10-01&rft.volume=16&rft.issue=5&rft.spage=1212&rft.epage=1225&rft.pages=1212-1225&rft.issn=1063-6692&rft.eissn=1558-2566&rft.coden=IEANEP&rft_id=info:doi/10.1109/TNET.2007.906654&rft_dat=%3Cproquest_RIE%3E889379051%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=863670771&rft_id=info:pmid/&rft_ieee_id=4469907&rfr_iscdi=true