Multipath QoS routing with bandwidth guarantee

Yun Wen Chen; Ren Hung Hwang; Ying-Dar Lin

doi:10.1109/GLOCOM.2001.966170

Multipath QoS routing with bandwidth guarantee

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

^*Corresponding author for this work

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

6 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 language	English
Pages	2199-2203
Number of pages	5
DOIs	https://doi.org/10.1109/GLOCOM.2001.966170
State	Published - 2001
Event	IEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States Duration: 25 Nov 2001 → 29 Nov 2001

Conference

Conference	IEEE Global Telecommunicatins Conference GLOBECOM'01
Country/Territory	United States
City	San Antonio, TX
Period	25/11/01 → 29/11/01

Access to Document

10.1109/GLOCOM.2001.966170

Cite this

@conference{b53a8cad9f6e45fd9aecc439a1a0f925,

title = "Multipath QoS routing with bandwidth guarantee",

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.",

author = "Chen, {Yun Wen} and Hwang, {Ren Hung} and Ying-Dar Lin",

year = "2001",

doi = "10.1109/GLOCOM.2001.966170",

language = "English",

pages = "2199--2203",

note = "IEEE Global Telecommunicatins Conference GLOBECOM'01 ; Conference date: 25-11-2001 Through 29-11-2001",

}

TY - CONF

T1 - Multipath QoS routing with bandwidth guarantee

AU - Chen, Yun Wen

AU - Hwang, Ren Hung

AU - Lin, Ying-Dar

PY - 2001

Y1 - 2001

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0035681362&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2001.966170

DO - 10.1109/GLOCOM.2001.966170

M3 - Paper

AN - SCOPUS:0035681362

SP - 2199

EP - 2203

T2 - IEEE Global Telecommunicatins Conference GLOBECOM'01

Y2 - 25 November 2001 through 29 November 2001

ER -

Multipath QoS routing with bandwidth guarantee

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this