Load Balancing by Network Curvature Control
The traditional heavy-tailed interpretation of congestion is challenged in this paper. A counter example shows that a network with uniform degree can have significant traffic congestion when the degree is larger than 6. A profound understanding of what causes congestion is reestablished, based on th...
Gespeichert in:
| Veröffentlicht in: | International Journal of Computers Communications & Control 2011-03, Vol.6 (1), p.134 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 1 |
| container_start_page | 134 |
| container_title | International Journal of Computers Communications & Control |
| container_volume | 6 |
| creator | Lou, Mingji Jonckheere, Edmond Bonahon, Francis Krishnamachari, Bhaskar Baryshnikov, Yuliy |
| description | The traditional heavy-tailed interpretation of congestion is challenged in this paper. A counter example shows that a network with uniform degree can have significant traffic congestion when the degree is larger than 6. A profound understanding of what causes congestion is reestablished, based on the network curvature theorem. A load balancing algorithm based on curvature control is presented with network applications. |
| doi_str_mv | 10.15837/ijccc.2011.1.2208 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2518393789</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2518393789</sourcerecordid><originalsourceid>FETCH-LOGICAL-c275t-d43dbfaeeed8b648b647b5958f01f79c863ab9ee15eea9ef86851111e96df8e03</originalsourceid><addsrcrecordid>eNpNkMFKxDAQhoMouKz7Ap4KHqU1k2zayVGLrsKiFz2HNJ1I19qsaavs27vd9eAPwz-Hjxn4GLsEnoFCWdw0G-dcJjhABpkQHE_YDHAJqUaZn_7bz9mi75uKSyG5yrGYset1sHVyZ1vbuaZ7T6pd8kzDT4gfSTnGbzuMkZIydEMM7QU787btafHXc_b2cP9aPqbrl9VTebtOnSjUkNZLWVfeElGNVb6cpqiUVug5-EI7zKWtNBEoIqvJY44K9iGd1x6Jyzm7Ot7dxvA1Uj-YTRhjt39phAKUWhao95Q4Ui6Gvo_kzTY2nzbuDHBz8GIOXszkxYCZvMhfSMZWRQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2518393789</pqid></control><display><type>article</type><title>Load Balancing by Network Curvature Control</title><source>DOAJ Directory of Open Access Journals</source><creator>Lou, Mingji ; Jonckheere, Edmond ; Bonahon, Francis ; Krishnamachari, Bhaskar ; Baryshnikov, Yuliy</creator><creatorcontrib>Lou, Mingji ; Jonckheere, Edmond ; Bonahon, Francis ; Krishnamachari, Bhaskar ; Baryshnikov, Yuliy</creatorcontrib><description>The traditional heavy-tailed interpretation of congestion is challenged in this paper. A counter example shows that a network with uniform degree can have significant traffic congestion when the degree is larger than 6. A profound understanding of what causes congestion is reestablished, based on the network curvature theorem. A load balancing algorithm based on curvature control is presented with network applications.</description><identifier>ISSN: 1841-9836</identifier><identifier>EISSN: 1841-9836</identifier><identifier>EISSN: 1841-9844</identifier><identifier>DOI: 10.15837/ijccc.2011.1.2208</identifier><language>eng</language><publisher>Oradea: Agora University of Oradea</publisher><subject>Algorithms ; Curvature ; Load balancing ; Traffic congestion</subject><ispartof>International Journal of Computers Communications & Control, 2011-03, Vol.6 (1), p.134</ispartof><rights>2011. This work is published under http://creativecommons.org/licenses/by-nc/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c275t-d43dbfaeeed8b648b647b5958f01f79c863ab9ee15eea9ef86851111e96df8e03</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,864,27924,27925</link.rule.ids></links><search><creatorcontrib>Lou, Mingji</creatorcontrib><creatorcontrib>Jonckheere, Edmond</creatorcontrib><creatorcontrib>Bonahon, Francis</creatorcontrib><creatorcontrib>Krishnamachari, Bhaskar</creatorcontrib><creatorcontrib>Baryshnikov, Yuliy</creatorcontrib><title>Load Balancing by Network Curvature Control</title><title>International Journal of Computers Communications & Control</title><description>The traditional heavy-tailed interpretation of congestion is challenged in this paper. A counter example shows that a network with uniform degree can have significant traffic congestion when the degree is larger than 6. A profound understanding of what causes congestion is reestablished, based on the network curvature theorem. A load balancing algorithm based on curvature control is presented with network applications.</description><subject>Algorithms</subject><subject>Curvature</subject><subject>Load balancing</subject><subject>Traffic congestion</subject><issn>1841-9836</issn><issn>1841-9836</issn><issn>1841-9844</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNpNkMFKxDAQhoMouKz7Ap4KHqU1k2zayVGLrsKiFz2HNJ1I19qsaavs27vd9eAPwz-Hjxn4GLsEnoFCWdw0G-dcJjhABpkQHE_YDHAJqUaZn_7bz9mi75uKSyG5yrGYset1sHVyZ1vbuaZ7T6pd8kzDT4gfSTnGbzuMkZIydEMM7QU787btafHXc_b2cP9aPqbrl9VTebtOnSjUkNZLWVfeElGNVb6cpqiUVug5-EI7zKWtNBEoIqvJY44K9iGd1x6Jyzm7Ot7dxvA1Uj-YTRhjt39phAKUWhao95Q4Ui6Gvo_kzTY2nzbuDHBz8GIOXszkxYCZvMhfSMZWRQ</recordid><startdate>20110301</startdate><enddate>20110301</enddate><creator>Lou, Mingji</creator><creator>Jonckheere, Edmond</creator><creator>Bonahon, Francis</creator><creator>Krishnamachari, Bhaskar</creator><creator>Baryshnikov, Yuliy</creator><general>Agora University of Oradea</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope></search><sort><creationdate>20110301</creationdate><title>Load Balancing by Network Curvature Control</title><author>Lou, Mingji ; Jonckheere, Edmond ; Bonahon, Francis ; Krishnamachari, Bhaskar ; Baryshnikov, Yuliy</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c275t-d43dbfaeeed8b648b647b5958f01f79c863ab9ee15eea9ef86851111e96df8e03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Curvature</topic><topic>Load balancing</topic><topic>Traffic congestion</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lou, Mingji</creatorcontrib><creatorcontrib>Jonckheere, Edmond</creatorcontrib><creatorcontrib>Bonahon, Francis</creatorcontrib><creatorcontrib>Krishnamachari, Bhaskar</creatorcontrib><creatorcontrib>Baryshnikov, Yuliy</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><jtitle>International Journal of Computers Communications & Control</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lou, Mingji</au><au>Jonckheere, Edmond</au><au>Bonahon, Francis</au><au>Krishnamachari, Bhaskar</au><au>Baryshnikov, Yuliy</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Load Balancing by Network Curvature Control</atitle><jtitle>International Journal of Computers Communications & Control</jtitle><date>2011-03-01</date><risdate>2011</risdate><volume>6</volume><issue>1</issue><spage>134</spage><pages>134-</pages><issn>1841-9836</issn><eissn>1841-9836</eissn><eissn>1841-9844</eissn><abstract>The traditional heavy-tailed interpretation of congestion is challenged in this paper. A counter example shows that a network with uniform degree can have significant traffic congestion when the degree is larger than 6. A profound understanding of what causes congestion is reestablished, based on the network curvature theorem. A load balancing algorithm based on curvature control is presented with network applications.</abstract><cop>Oradea</cop><pub>Agora University of Oradea</pub><doi>10.15837/ijccc.2011.1.2208</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1841-9836 |
| ispartof | International Journal of Computers Communications & Control, 2011-03, Vol.6 (1), p.134 |
| issn | 1841-9836 1841-9836 1841-9844 |
| language | eng |
| recordid | cdi_proquest_journals_2518393789 |
| source | DOAJ Directory of Open Access Journals |
| subjects | Algorithms Curvature Load balancing Traffic congestion |
| title | Load Balancing by Network Curvature Control |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-30T03%3A00%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Load%20Balancing%20by%20Network%20Curvature%20Control&rft.jtitle=International%20Journal%20of%20Computers%20Communications%20&%20Control&rft.au=Lou,%20Mingji&rft.date=2011-03-01&rft.volume=6&rft.issue=1&rft.spage=134&rft.pages=134-&rft.issn=1841-9836&rft.eissn=1841-9836&rft_id=info:doi/10.15837/ijccc.2011.1.2208&rft_dat=%3Cproquest_cross%3E2518393789%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2518393789&rft_id=info:pmid/&rfr_iscdi=true |