A congestion-aware rerouting scheme in RPR networks

Ching Fang Hsu, Huan Ru Zeng, Jyun Yu Ke

Research output: Chapter in Book/Report/Conference proceedingConference 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 languageEnglish
Title of host publication2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011
DOIs
Publication statusPublished - 2011 Dec 1
Event2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011 - Chapel Hill, NC, United States
Duration: 2011 Oct 132011 Oct 14

Publication series

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

Other

Other2011 18th IEEE Workshop on Local and Metropolitan Area Networks, LANMAN 2011
CountryUnited States
CityChapel Hill, NC
Period11-10-1311-10-14

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Software
  • Electrical and Electronic Engineering
  • Communication

Fingerprint Dive into the research topics of 'A congestion-aware rerouting scheme in RPR networks'. Together they form a unique fingerprint.

Cite this