A congestion-aware rerouting scheme in RPR networks

Ching Fang Hsu; Huan Ru Zeng; Jyun Yu Ke

doi:10.1109/LANMAN.2011.6076937

A congestion-aware rerouting scheme in RPR networks

Ching Fang Hsu, Huan Ru Zeng, Jyun Yu Ke

Department of Computer Science and Information Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, a congestion-aware rerouting (CAR) scheme is proposed based on the fairness mechanism of RPR for better throughput. If all flows competing for the bandwidth of the congested link converge to the steady rate, we try to find an alternate path to gain more bandwidth than the current path for some traffic flow passing through the congested link. Meanwhile, the throughput of flows traversing the congested link is improved as well since there are fewer competitors contending for the bandwidth. To verify the effect of rerouting, we perform simulations in single RPR and bridged RPR networks. Simulation results show that CAR can significantly improve throughput performance in various scenarios.

Original language	English
Title of host publication	2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011
DOIs	https://doi.org/10.1109/LANMAN.2011.6076937
Publication status	Published - 2011 Dec 1
Event	2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011 - Chapel Hill, NC, United States Duration: 2011 Oct 13 → 2011 Oct 14

Publication series

Name	IEEE Workshop on Local and Metropolitan Area Networks
ISSN (Print)	1944-0367
ISSN (Electronic)	1944-0375

Other

Other	2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011
Country/Territory	United States
City	Chapel Hill, NC
Period	11-10-13 → 11-10-14

All Science Journal Classification (ASJC) codes

Computer Networks and Communications
Software
Electrical and Electronic Engineering
Communication

Access to Document

10.1109/LANMAN.2011.6076937

Cite this

@inproceedings{7b340d575b00493fbc6d1e5e6beaecad,

title = "A congestion-aware rerouting scheme in RPR networks",

abstract = "In this paper, a congestion-aware rerouting (CAR) scheme is proposed based on the fairness mechanism of RPR for better throughput. If all flows competing for the bandwidth of the congested link converge to the steady rate, we try to find an alternate path to gain more bandwidth than the current path for some traffic flow passing through the congested link. Meanwhile, the throughput of flows traversing the congested link is improved as well since there are fewer competitors contending for the bandwidth. To verify the effect of rerouting, we perform simulations in single RPR and bridged RPR networks. Simulation results show that CAR can significantly improve throughput performance in various scenarios.",

author = "Hsu, {Ching Fang} and Zeng, {Huan Ru} and Ke, {Jyun Yu}",

year = "2011",

month = dec,

day = "1",

doi = "10.1109/LANMAN.2011.6076937",

language = "English",

isbn = "9781457712654",

series = "IEEE Workshop on Local and Metropolitan Area Networks",

booktitle = "2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011",

note = "2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011 ; Conference date: 13-10-2011 Through 14-10-2011",

}

Hsu, CF, Zeng, HR & Ke, JY 2011, A congestion-aware rerouting scheme in RPR networks. in 2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011., 6076937, IEEE Workshop on Local and Metropolitan Area Networks, 2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011, Chapel Hill, NC, United States, 11-10-13. https://doi.org/10.1109/LANMAN.2011.6076937

TY - GEN

T1 - A congestion-aware rerouting scheme in RPR networks

AU - Hsu, Ching Fang

AU - Zeng, Huan Ru

AU - Ke, Jyun Yu

PY - 2011/12/1

Y1 - 2011/12/1

N2 - In this paper, a congestion-aware rerouting (CAR) scheme is proposed based on the fairness mechanism of RPR for better throughput. If all flows competing for the bandwidth of the congested link converge to the steady rate, we try to find an alternate path to gain more bandwidth than the current path for some traffic flow passing through the congested link. Meanwhile, the throughput of flows traversing the congested link is improved as well since there are fewer competitors contending for the bandwidth. To verify the effect of rerouting, we perform simulations in single RPR and bridged RPR networks. Simulation results show that CAR can significantly improve throughput performance in various scenarios.

AB - In this paper, a congestion-aware rerouting (CAR) scheme is proposed based on the fairness mechanism of RPR for better throughput. If all flows competing for the bandwidth of the congested link converge to the steady rate, we try to find an alternate path to gain more bandwidth than the current path for some traffic flow passing through the congested link. Meanwhile, the throughput of flows traversing the congested link is improved as well since there are fewer competitors contending for the bandwidth. To verify the effect of rerouting, we perform simulations in single RPR and bridged RPR networks. Simulation results show that CAR can significantly improve throughput performance in various scenarios.

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

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

U2 - 10.1109/LANMAN.2011.6076937

DO - 10.1109/LANMAN.2011.6076937

M3 - Conference contribution

AN - SCOPUS:84856148346

SN - 9781457712654

T3 - IEEE Workshop on Local and Metropolitan Area Networks

BT - 2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011

T2 - 2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011

Y2 - 13 October 2011 through 14 October 2011

ER -

A congestion-aware rerouting scheme in RPR networks

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this