DocumentCode
3220233
Title
Load balancing in counter-rotated SONET rings
Author
Wan, Peng-Jun ; Yang, Yuanyuan
Author_Institution
Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
fYear
1999
fDate
1999
Firstpage
542
Lastpage
550
Abstract
Load-balanced routing in SONET rings has attracted much attention recently. Most prior works model the SONET rings as undirected rings and the traffic as undirected chords. While this model fits well to the traditional telephony applications, it is inefficient for the explosive Internet traffic and multimedia data communications, which exhibit unidirectional and asymmetric nature. For these applications, it is proper to model the SONET rings as a pair of counter-rotated rings and the traffic as directed chords. In this paper we first explore general flow properties in counter-rotated rings, and then introduce flow rounding and unsplitting techniques. Afterwards an optimal integral routing algorithm is provided. Finally, we show the NP-completeness of optimal unsplit routing, and present several polynomial-time approximation algorithms
Keywords
Internet; SONET; computational complexity; multimedia communication; polynomial approximation; resource allocation; Internet traffic; NP-completeness; counter-rotated SONET rings; counter-rotated rings; directed chords; load-balanced routing; multimedia data communications; optimal integral routing algorithm; optimal unsplit routing; polynomial-time approximation algorithms; undirected rings; Approximation algorithms; Data communication; Explosives; Internet telephony; Load management; Multimedia communication; Polynomials; Routing; SONET; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel Processing, 1999. Proceedings. 1999 International Conference on
Conference_Location
Aizu-Wakamatsu City
ISSN
0190-3918
Print_ISBN
0-7695-0350-0
Type
conf
DOI
10.1109/ICPP.1999.797443
Filename
797443
Link To Document