TY - GEN
T1 - Achieving bursty traffic guarantees by integrating traffic engineering and buffer management tools
AU - Allalouf, Miriam
AU - Shavitt, Yuval
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33745902794&partnerID=8YFLogxK
U2 - 10.1007/11753810_6
DO - 10.1007/11753810_6
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:33745902794
SN - 3540341927
SN - 9783540341925
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 63
EP - 74
BT - Networking 2006 - Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Com. Syst. - 5th Int. IFIP-TC6 Netw. Conf. Proc.
A2 - Plagemann, Thomas
A2 - Stiller, Burkhard
A2 - Westphal, Cedric
A2 - Boavida, Fernando
A2 - Monteiro, Edmundo
PB - Springer Verlag
T2 - 5th International IFIP-TC6 Networking Conference, Networking 2006
Y2 - 15 May 2006 through 19 May 2006
ER -