https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Teng_Rouskas_2006aTeng Rouskas 2006a - Revision history2026-04-18T11:40:33ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Teng_Rouskas_2006a&diff=192087&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 739667070 to Teng Rouskas 2006a2021-01-28T17:16:09Z<p>Scipediacontent moved page <a href="/public/Draft_Content_739667070" class="mw-redirect" title="Draft Content 739667070">Draft Content 739667070</a> to <a href="/public/Teng_Rouskas_2006a" title="Teng Rouskas 2006a">Teng Rouskas 2006a</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 17:16, 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>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Teng_Rouskas_2006a&diff=192086&oldid=prevScipediacontent: Created page with " == Abstract == It is usually assumed that optical burst switched (OBS) networks employ shortest path routing along with next- hop burst forwarding. Shortest path routing min..."2021-01-28T17:16:06Z<p>Created page with " == Abstract == It is usually assumed that optical burst switched (OBS) networks employ shortest path routing along with next- hop burst forwarding. Shortest path routing min..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
It is usually assumed that optical burst switched (OBS) networks employ shortest path routing along with next- hop burst forwarding. Shortest path routing minimizes delay and optimizes the utilization of resources, however, it often causes certain links to become congested while others remain underutilized. In a buffer-less OBS network in which burst drop probability is the primary metric of interest, the existence of a few highly congested links may lead to unacceptable performance for the entire network. In this paper, we take a traffic engineering approach to path selection in OBS networks with the objective of balancing the traffic across the network links in order to reduce congestion and improve overall performance. We present an approximate integer linear optimization problem, as well as a simple integer relaxation heuristic to solve the problem efficiently for large networks. Numerical results demonstrate that our approach is effective in reducing the network-wide burst drop probability, in many cases significantly, over shortest path routing.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [http://www.csc.ncsu.edu/faculty/rouskas//Publications/Conferences/ONDM-Teng-2005.pdf http://www.csc.ncsu.edu/faculty/rouskas//Publications/Conferences/ONDM-Teng-2005.pdf]<br />
<br />
* [http://xplorestaging.ieee.org/ielx5/9770/30813/01426980.pdf?arnumber=1426980 http://xplorestaging.ieee.org/ielx5/9770/30813/01426980.pdf?arnumber=1426980],<br />
: [http://dx.doi.org/10.1109/ondm.2005.1426980 http://dx.doi.org/10.1109/ondm.2005.1426980]<br />
<br />
* [https://www.csc.ncsu.edu/faculty/rouskas/Publications/Conferences/ONDM-Teng-2005.pdf https://www.csc.ncsu.edu/faculty/rouskas/Publications/Conferences/ONDM-Teng-2005.pdf],<br />
: [https://rouskas.csc.ncsu.edu/Publications/Conferences/ONDM-Teng-2005.pdf https://rouskas.csc.ncsu.edu/Publications/Conferences/ONDM-Teng-2005.pdf],<br />
: [https://ieeexplore.ieee.org/document/1426980 https://ieeexplore.ieee.org/document/1426980],<br />
: [https://academic.microsoft.com/#/detail/2099327246 https://academic.microsoft.com/#/detail/2099327246]</div>Scipediacontent