Select line speeds for single-hub SONET/WDM ring networks

Minimizing SONET ADM costs in single-hub SONET/WDM ring networks via traffic grooming has been discussed in a number of previous works. Previous work gives the exact minimum costs of uniform traffic in both unidirectional path-switched ring (UPSR) and two-fiber bidirectional line-switched ring (BLSR/2) and proves that the BLSR/2 would never be more expensive than UPSR under any traffic pattern, if all wavelengths have the same capacity. We consider how to groom both uniform and non-uniform traffic to minimize the cost of ADMs in the single-hub UPSR and BLSR/2 with mixed line speeds. We especially explore the grooming of traffic when wavelengths have two different capacities g/sub 1/=1 and g/sub 2/=4. We show that the problem can be confined to just consider the traffic request r/sub i//spl les/4 for all non-hub nodes i. By adopting the same cost model of Gerstel, Lin and Sasaki (see Proc. IEEE Infocom 99), i.e., ADMs with speed g/sub 1/=1 and g/sub 2/=4 cost 1 and 2.5 respectively, we provide optimal traffic partition and grooming for uniform traffic demands, and develop optimal or suboptimal solutions for non-uniform traffic demands, depending on the range of all demands from non-hub nodes.

[1]  W. Kremer,et al.  Self-healing rings in a synchronous environment , 1991, IEEE LTS.

[2]  Xiang-Yang Li,et al.  Wavelength assignment in WDM rings to minimize SONET ADMs , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Xiang-Yang Li,et al.  Practical traffic grooming scheme for single-hub SONET/WDM rings , 2000, Proceedings 25th Annual IEEE Conference on Local Computer Networks. LCN 2000.

[4]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[5]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[6]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[7]  Andrew Chi-Chih Yao,et al.  New Algorithms for Bin Packing , 1978, JACM.

[8]  Ori Gerstel,et al.  Combined WDM and SONET network design , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[9]  Adel A. M. Saleh,et al.  Quantifying the benefit of wavelength add-drop in WDM rings with distance-independent and dependent traffic , 1999 .

[10]  Ori Gerstel,et al.  Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[11]  Charles J. Colbourn,et al.  Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements , 2001 .

[12]  Charles J. Colbourn,et al.  Minimizing drop cost for SONET/WDM networks with wavelength requirements , 2001, Networks.

[13]  Curtis A. Siller,et al.  SONET/SDH: A Sourcebook of Synchronous Networking , 1996 .