Load-balanced routing in counter rotated SONET rings

被引:0
作者
Wan, PJ
Yang, YY [1 ]
机构
[1] SUNY Stony Brook, Dept ECE, Stony Brook, NY 11794 USA
[2] IIT, Dept Comp Sci, Chicago, IL 60616 USA
关键词
SONET; counter rotated rings; routing; load balancing; approximation algorithms;
D O I
10.1002/1097-0037(200007)35:43.0.CO;2-P
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Load-balanced routing in SONET rings has attracted much attention recently. Most prior works modeled 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 an 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. Afterward, an optimal integral routing algorithm is provided. Finally, we show the up-completeness of optimal unsplit routing and present several polynomial-time approximation algorithms. (C) 2000 John Wiley & Sons, Inc.
引用
收藏
页码:279 / 286
页数:8
相关论文
共 10 条
  • [1] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
  • [2] CLARK D, 1998, IEEE COMPUT DEC, P17
  • [3] AN OPTIMIZATION PROBLEM RELATED TO BALANCING LOADS ON SONET RINGS
    COSARES, S
    SANIEE, I
    [J]. TELECOMMUNICATION SYSTEMS, 1994, 3 (02) : 165 - 181
  • [4] HAQUE I, 1996, SONET SDH SOURCEBOOK, P131
  • [5] KHANNA S, 1997, BELL LAB TECH J, V2
  • [6] MULTICOMMODITY FLOWS IN PLANAR GRAPHS
    OKAMURA, H
    SEYMOUR, PD
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1981, 31 (01) : 75 - 81
  • [7] Saniee I., 1996, International Transactions in Operational Research, V3, P187, DOI 10.1111/j.1475-3995.1996.tb00045.x
  • [8] The ring loading problem
    Schrijver, A
    Seymour, P
    Winkler, P
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 1998, 11 (01) : 1 - 14
  • [9] Vachani R., 1996, INFORMS Journal on Computing, V8, P235, DOI 10.1287/ijoc.8.3.235
  • [10] WILFONG P, 1998, P 9 ANN ACM SIAM S D, P333