http://www.colloquiam.com/wd/index.php?action=history&feed=atom&title=Casaca_et_al_2007aCasaca et al 2007a - Revision history2026-05-11T09:45:14ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10http://www.colloquiam.com/wd/index.php?title=Casaca_et_al_2007a&diff=181497&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 241505764 to Casaca et al 2007a2021-01-21T12:03:12Z<p>Scipediacontent moved page <a href="/public/Draft_Content_241505764" class="mw-redirect" title="Draft Content 241505764">Draft Content 241505764</a> to <a href="/public/Casaca_et_al_2007a" title="Casaca et al 2007a">Casaca et al 2007a</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 12:03, 21 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>Scipediacontenthttp://www.colloquiam.com/wd/index.php?title=Casaca_et_al_2007a&diff=181496&oldid=prevScipediacontent: Created page with " == Abstract == This paper describes two traffic engineering techniques for implementing proportional differentiated services based on Multiprotocol Label Switching constrain..."2021-01-21T12:03:09Z<p>Created page with " == Abstract == This paper describes two traffic engineering techniques for implementing proportional differentiated services based on Multiprotocol Label Switching constrain..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
This paper describes two traffic engineering techniques for implementing proportional differentiated services based on Multiprotocol Label Switching constraint based routing. Both use a dynamic bandwidth allocation scheme to modify the bandwidth reserved by each traffic class according to the current network load. The first scheme uses an adaptive algorithm that qualitatively determines the required average throughput per source for each class and moves bandwidth between classes for each path as necessary. The second scheme mathematically divides the existing bandwidth through the traffic classes for each path. The quality of service that users get with both techniques is assessed by simulation and compared with a fixed bandwidth allocation scheme.<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://link.springer.com/content/pdf/10.1007%2F978-0-387-34827-8_13.pdf https://link.springer.com/content/pdf/10.1007%2F978-0-387-34827-8_13.pdf]<br />
<br />
* [http://www.springerlink.com/index/pdf/10.1007/978-0-387-34827-8_13 http://www.springerlink.com/index/pdf/10.1007/978-0-387-34827-8_13],<br />
: [http://dx.doi.org/10.1007/978-0-387-34827-8_13 http://dx.doi.org/10.1007/978-0-387-34827-8_13]<br />
<br />
* [https://link.springer.com/chapter/10.1007%2F978-0-387-34827-8_13 https://link.springer.com/chapter/10.1007%2F978-0-387-34827-8_13],<br />
: [https://dblp.uni-trier.de/db/conf/ifip6-2/ifip6-2-2006.html#NevesPC06 https://dblp.uni-trier.de/db/conf/ifip6-2/ifip6-2-2006.html#NevesPC06],<br />
: [https://rd.springer.com/chapter/10.1007/978-0-387-34827-8_13 https://rd.springer.com/chapter/10.1007/978-0-387-34827-8_13],<br />
: [http://dx.doi.org/10.1007/978-0-387-34827-8_13 http://dx.doi.org/10.1007/978-0-387-34827-8_13],<br />
: [http://mariel.inesc-id.pt/~prbp/publica/mpls_netcon2006.pdf http://mariel.inesc-id.pt/~prbp/publica/mpls_netcon2006.pdf],<br />
: [https://academic.microsoft.com/#/detail/34472580 https://academic.microsoft.com/#/detail/34472580]</div>Scipediacontent