Allalouf Shavitt 2006a - Revision history

Scipediacontent at 13:23, 21 January 2021

2021-01-21T13:23:55Z

Scipediacontent: Scipediacontent moved page Draft Content 814015250 to Allalouf Shavitt 2006a

2020-10-14T11:59:36Z

Scipediacontent moved page Draft Content 814015250 to Allalouf Shavitt 2006a

Scipediacontent: Created page with " == Abstract == Traffic engineering tools are applied to design a set of paths, e.g., using MPLS, in the network in order to achieve global network utilization. Usually, path..."

2020-10-14T11:59:34Z

Created page with " == Abstract == Traffic engineering tools are applied to design a set of paths, e.g., using MPLS, in the network in order to achieve global network utilization. Usually, path..."

New page

== Abstract ==

Traffic engineering tools are applied to design a set of paths, e.g., using MPLS, in the network in order to achieve global network utilization. Usually, paths are guaranteed long-term traffic rates, while the short-term rates of bursty traffic are not guaranteed. The resource allocation scheme, suggested in this paper, handles bursts based on maximal traffic volume allocation (termed TVAfB) instead of a single maximal or sustained rate allocation. This translates to better SLAs to the network customers, namely SLAs with higher traffic peaks, that guarantees burst non-dropping. Given a set of paths and bandwidth allocation along them, the suggested algorithm finds a special collection of bottleneck links, which we term the first cut, as the optimal buffering location for bursts. In these locations, the buffers act as an additional resource to improve the network short-term behavior, allowing traffic to take advantage of the under-used resources at the links that precede and follow the bottleneck links. The algorithm was implemented in MATLAB. The resulted provisioning parameters were simulated using NS-2 to demonstrate the effectiveness of the proposed scheme.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_814015250-beopen435-5196-document.pdf</pdf>

== Original document ==

The different versions of the original document can be found in:

* [https://link.springer.com/content/pdf/10.1007%2F11753810_6.pdf https://link.springer.com/content/pdf/10.1007%2F11753810_6.pdf]

← Older revision		Revision as of 13:23, 21 January 2021
Line 3:		Line 3:

	Traffic engineering tools are applied to design a set of paths, e.g., using MPLS, in the network in order to achieve global network utilization. Usually, paths are guaranteed long-term traffic rates, while the short-term rates of bursty traffic are not guaranteed. The resource allocation scheme, suggested in this paper, handles bursts based on maximal traffic volume allocation (termed TVAfB) instead of a single maximal or sustained rate allocation. This translates to better SLAs to the network customers, namely SLAs with higher traffic peaks, that guarantees burst non-dropping. Given a set of paths and bandwidth allocation along them, the suggested algorithm finds a special collection of bottleneck links, which we term the first cut, as the optimal buffering location for bursts. In these locations, the buffers act as an additional resource to improve the network short-term behavior, allowing traffic to take advantage of the under-used resources at the links that precede and follow the bottleneck links. The algorithm was implemented in MATLAB. The resulted provisioning parameters were simulated using NS-2 to demonstrate the effectiveness of the proposed scheme.		Traffic engineering tools are applied to design a set of paths, e.g., using MPLS, in the network in order to achieve global network utilization. Usually, paths are guaranteed long-term traffic rates, while the short-term rates of bursty traffic are not guaranteed. The resource allocation scheme, suggested in this paper, handles bursts based on maximal traffic volume allocation (termed TVAfB) instead of a single maximal or sustained rate allocation. This translates to better SLAs to the network customers, namely SLAs with higher traffic peaks, that guarantees burst non-dropping. Given a set of paths and bandwidth allocation along them, the suggested algorithm finds a special collection of bottleneck links, which we term the first cut, as the optimal buffering location for bursts. In these locations, the buffers act as an additional resource to improve the network short-term behavior, allowing traffic to take advantage of the under-used resources at the links that precede and follow the bottleneck links. The algorithm was implemented in MATLAB. The resulted provisioning parameters were simulated using NS-2 to demonstrate the effectiveness of the proposed scheme.
−
−	~~Document type: Part of book or chapter of book~~
−
−	~~== Full document ==~~
−	~~<pdf>Media:Draft_Content_814015250-beopen435-5196-document.pdf</pdf>~~


Line 15:		Line 10:

	* [https://link.springer.com/content/pdf/10.1007%2F11753810_6.pdf https://link.springer.com/content/pdf/10.1007%2F11753810_6.pdf]		* [https://link.springer.com/content/pdf/10.1007%2F11753810_6.pdf https://link.springer.com/content/pdf/10.1007%2F11753810_6.pdf]
		+
		+	* [http://link.springer.com/content/pdf/10.1007/11753810_6 http://link.springer.com/content/pdf/10.1007/11753810_6],
		+	: [http://dx.doi.org/10.1007/11753810_6 http://dx.doi.org/10.1007/11753810_6] under the license http://www.springer.com/tdm
		+
		+	* [https://dblp.uni-trier.de/db/conf/networking/networking2006.html#AllaloufS06 https://dblp.uni-trier.de/db/conf/networking/networking2006.html#AllaloufS06],
		+	: [https://link.springer.com/chapter/10.1007/11753810_6 https://link.springer.com/chapter/10.1007/11753810_6],
		+	: [https://www.scipedia.com/public/Allalouf_Shavitt_2006a https://www.scipedia.com/public/Allalouf_Shavitt_2006a],
		+	: [https://www.eng.tau.ac.il/~shavitt/pub/Networking06.pdf https://www.eng.tau.ac.il/~shavitt/pub/Networking06.pdf],
		+	: [https://rd.springer.com/chapter/10.1007/11753810_6 https://rd.springer.com/chapter/10.1007/11753810_6],
		+	: [https://academic.microsoft.com/#/detail/1589227767 https://academic.microsoft.com/#/detail/1589227767]

← Older revision	Revision as of 11:59, 14 October 2020
(No difference)