http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Chong_et_al_2010aChong et al 2010a - Revision history2026-05-11T06:20:40ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10http://www.colloquiam.com/wd/index.php?title=Chong_et_al_2010a&diff=199985&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 864782599 to Chong et al 2010a2021-02-02T00:44:52Z<p>Scipediacontent moved page <a href="/public/Draft_Content_864782599" class="mw-redirect" title="Draft Content 864782599">Draft Content 864782599</a> to <a href="/public/Chong_et_al_2010a" title="Chong et al 2010a">Chong et al 2010a</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 00:44, 2 February 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttp://www.colloquiam.com/wd/index.php?title=Chong_et_al_2010a&diff=199984&oldid=prevScipediacontent: Created page with " == Abstract == We present an online distributed traffic engineering method for ISP networks with multi-path routing. The method is based on edge-to-edge aggregate flow contr..."2021-02-02T00:44:47Z<p>Created page with " == Abstract == We present an online distributed traffic engineering method for ISP networks with multi-path routing. The method is based on edge-to-edge aggregate flow contr..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
We present an online distributed traffic engineering method for ISP networks with multi-path routing. The method is based on edge-to-edge aggregate flow control that balances load and makes the network congestion-free in real time, responding to actual traffic demands whether they are underload or overloaded. Moreover, it allows ISPs to apply various bandwidth-sharing policies to edge-to-edge flows, as desired. Our simulations confirm that the proposed method works as designed for TCP sources that have their own end-to-end congestion control mechanism and enhance the performance and the efficiency of the the network.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://koasas.kaist.ac.kr/bitstream/10203/11547/1/%5BC44%5DMulti-path%20Aggregate%20flow.pdf http://koasas.kaist.ac.kr/bitstream/10203/11547/1/%5BC44%5DMulti-path%20Aggregate%20flow.pdf]<br />
<br />
* [http://xplorestaging.ieee.org/ielx5/4697774/4697775/04698051.pdf?arnumber=4698051 http://xplorestaging.ieee.org/ielx5/4697774/4697775/04698051.pdf?arnumber=4698051],<br />
: [http://dx.doi.org/10.1109/glocom.2008.ecp.276 http://dx.doi.org/10.1109/glocom.2008.ecp.276]<br />
<br />
* [https://dblp.uni-trier.de/db/conf/globecom/globecom2008.html#YunLC08 https://dblp.uni-trier.de/db/conf/globecom/globecom2008.html#YunLC08],<br />
: [http://koasas.kaist.ac.kr/handle/10203/11547 http://koasas.kaist.ac.kr/handle/10203/11547],<br />
: [http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4698051 http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4698051],<br />
: [http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004698051 http://yadda.icm.edu.pl/yadda/element/bwmeta1.element.ieee-000004698051],<br />
: [https://koasas.kaist.ac.kr/bitstream/10203/11547/1/%5bC44%5dMulti-path%20Aggregate%20flow.pdf https://koasas.kaist.ac.kr/bitstream/10203/11547/1/%5bC44%5dMulti-path%20Aggregate%20flow.pdf],<br />
: [https://academic.microsoft.com/#/detail/2101892519 https://academic.microsoft.com/#/detail/2101892519]</div>Scipediacontent