DocumentCode
1903031
Title
Multipath QoS routing with bandwidth guarantee
Author
Chen, Yun-Wen ; Hwang, Ren-Hung ; Lin, Ying-Dar
Author_Institution
Dept. of Comput. Sci. & Inf. Eng., Nat. Chung Cheng Univ., Chia-Yi, Taiwan
Volume
4
fYear
2001
fDate
2001
Firstpage
2199
Abstract
Recently, QoS routing has been studied intensively. In QoS routing, an essential issue is routing granularity. Most of the research adopts per-flow granularity in the forwarding table. Some research advocates per-source-destination pair granularity in the forwarding table with route pinning. The flow based approach has finer granularity, thus is more efficient in traffic engineering and resource utilization. However, the computation overhead and storage overhead are also higher. On the other hand, source-destination based granularity is more efficient on packet processing and forwarding, but has higher blocking probability. We propose the concept of forwarding with routing marks. With a limited number of routing marks, the proposed routing algorithm reduces the forwarding complexity and storage overhead significantly while yielding very competitive performance in terms of fractional reward loss
Keywords
probability; quality of service; resource allocation; telecommunication network routing; telecommunication traffic; bandwidth guarantee; blocking probability; computation overhead; forwarding table; multipath QoS routing; packet forwarding; packet processing; per-flow granularity; per-source-destination pair granularity; resource utilization; route pinning; routing granularity; routing marks; storage overhead; traffic engineering; Bandwidth; Communication system traffic control; Computer science; Data mining; Internet; Performance loss; Quality of service; Resource management; Routing; Spine;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE
Conference_Location
San Antonio, TX
Print_ISBN
0-7803-7206-9
Type
conf
DOI
10.1109/GLOCOM.2001.966170
Filename
966170
Link To Document