Multipath QoS routing with bandwidth guarantee

Yun Wen Chen*, Ren Hung Hwang, Ying-Dar Lin

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations

Abstract

Recently, QoS routing has been studied intensively. In QoS routing, an essential issue is routing granularity. Most of the researches adopt per-flow granularity in the forwarding table. Some researches advocate per-source-destination pair granularity in the forwarding table with route pinning. Flow based approach has finer granularity, thus is more efficient on traffic engineering and resource utilization. However, the computation overhead and storage overhead are also higher. On the other hand, the source-destination based granularity is more efficient on packet processing and forwarding, but has higher blocking probability. In this paper, 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 yields very competitive performance in terms of fractional reward loss.

Original languageEnglish
Pages2199-2203
Number of pages5
DOIs
StatePublished - 1 Dec 2001
EventIEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States
Duration: 25 Nov 200129 Nov 2001

Conference

ConferenceIEEE Global Telecommunicatins Conference GLOBECOM'01
CountryUnited States
CitySan Antonio, TX
Period25/11/0129/11/01

Fingerprint Dive into the research topics of 'Multipath QoS routing with bandwidth guarantee'. Together they form a unique fingerprint.

Cite this