https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Hamilton_et_al_2013a 2026-04-23T19:36:03Z Revision history for this page on the wiki MediaWiki 1.27.0-wmf.10 https://www.scipedia.com/wd/index.php?title=Hamilton_et_al_2013a&diff=193310&oldid=prev 2021-01-28T18:59:11Z

<p>Scipediacontent moved page <a href="/public/Draft_Content_250549639" class="mw-redirect" title="Draft Content 250549639">Draft Content 250549639</a> to <a href="/public/Hamilton_et_al_2013a" title="Hamilton et al 2013a">Hamilton et al 2013a</a></p> <table class="diff diff-contentalign-left" data-mw="interface"> <tr style='vertical-align: top;' lang='en'> <td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td> <td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 18:59, 28 January 2021</td> </tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div> </td></tr></table>

Scipediacontent https://www.scipedia.com/wd/index.php?title=Hamilton_et_al_2013a&diff=193309&oldid=prev 2021-01-28T18:59:06Z

<p>Created page with &quot; == Abstract == Data Center (DC) networks exhibit much more centralized characteristics than the legacy Internet, yet they are operated by similar distributed routing and con...&quot;</p> <p><b>New page</b></p><div><br /> == Abstract ==<br /> <br /> Data Center (DC) networks exhibit much more centralized characteristics than the legacy Internet, yet they are operated by similar distributed routing and control algorithms that fail to exploit topological redundancy to deliver better and more sustainable performance. Multipath protocols, for example, use node-local and heuristic information to only exploit path diversity between shortest paths. In this paper, we use a measurement-based approach to schedule flows over both shortest and non-shortest paths based on temporal network-wide utilization. We present the Baatdaat flow scheduling algorithm which uses spare DC network capacity to mitigate the performance degradation of heavily utilized links. Results show that Baatdaat achieves close to optimal Traffic Engineering by reducing network-wide maximum link utilization by up to 18% over Equal-Cost Multi-Path (ECMP) routing, while at the same time improving flow completion time by 41% - 95%.<br /> <br /> <br /> == Original document ==<br /> <br /> The different versions of the original document can be found in:<br /> <br /> * [http://csperkins.org/publications/2013/07/tso2013longer.pdf http://csperkins.org/publications/2013/07/tso2013longer.pdf]<br /> <br /> * [http://xplorestaging.ieee.org/ielx7/6679374/6681559/06681612.pdf?arnumber=6681612 http://xplorestaging.ieee.org/ielx7/6679374/6681559/06681612.pdf?arnumber=6681612],<br /> : [http://dx.doi.org/10.1109/icdcs.2013.36 http://dx.doi.org/10.1109/icdcs.2013.36]<br /> <br /> * [https://csperkins.org/publications/2013/07/tso2013longer.pdf https://csperkins.org/publications/2013/07/tso2013longer.pdf],<br /> : [http://eprints.gla.ac.uk/77332 http://eprints.gla.ac.uk/77332],<br /> : [https://dblp.uni-trier.de/db/conf/icdcs/icdcs2013.html#TsoHWPP13 https://dblp.uni-trier.de/db/conf/icdcs/icdcs2013.html#TsoHWPP13],<br /> : [https://ieeexplore.ieee.org/document/6681612 https://ieeexplore.ieee.org/document/6681612],<br /> : [http://ieeexplore.ieee.org/document/6681612 http://ieeexplore.ieee.org/document/6681612],<br /> : [https://dx.doi.org/10.1109/ICDCS.2013.36 https://dx.doi.org/10.1109/ICDCS.2013.36],<br /> : [https://dl.acm.org/citation.cfm?id=2549753 https://dl.acm.org/citation.cfm?id=2549753],<br /> : [https://academic.microsoft.com/#/detail/2001128841 https://academic.microsoft.com/#/detail/2001128841]</div>

Scipediacontent