DocumentCode :
2501876
Title :
G-RDM: A New Bandwidth Constraints Model for DS-TE Networks
Author :
Adami, D. ; Callegari, C. ; Giordano, S. ; Pagano, M. ; Toninelli, M.
Author_Institution :
Univ. of Pisa, Pisa
fYear :
2007
fDate :
26-30 Nov. 2007
Firstpage :
2472
Lastpage :
2476
Abstract :
MPLS traffic engineering (TE) allows the creation of end-to-end paths across the network with bandwidth reservations. The main drawback of the basic MPLS-TE model is that it operates at an aggregate level and so it is unaware of traffic classes. DiffServ-aware MPLS-TE (DS- TE) refines the MPLS-TE model by allowing bandwidth reservations to be carried out on a per-class basis. The result is the ability to give strict QoS guarantees while optimizing the use of network resources. Bandwidth constraints models play a key role in the DS-TE architecture, since they establish how bandwidth is distributed among different classes. In this paper, we first present a new bandwidth constraints model, called G-RDM. Then, we compare the performance of G-RDM with respect to MAM and RDM in different scenarios by means of an analytical model based on Markov-chains. The results show that G-RDM, joining the best features of MAM and RDM, allows to improve their performance.
Keywords :
Markov processes; multiprotocol label switching; quality of service; telecommunication traffic; traffic engineering computing; DS-TE networks; G-RDM; MPLS; Markov chains; QoS; bandwidth constraints model; traffic engineering; Aggregates; Analytical models; Bandwidth; Electronic mail; Jitter; Multiprotocol label switching; Telecommunication traffic; Tellurium; Traffic control; Virtual private networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location :
Washington, DC
Print_ISBN :
978-1-4244-1042-2
Electronic_ISBN :
978-1-4244-1043-9
Type :
conf
DOI :
10.1109/GLOCOM.2007.470
Filename :
4411380
Link To Document :
بازگشت