Practical traffic grooming scheme for single-hub SONET/WDM rings

被引:10
作者
Li, XY [1 ]
Liu, LW [1 ]
Wan, PJ [1 ]
Frieder, O [1 ]
机构
[1] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
来源
25TH ANNUAL IEEE CONFERENCE ON LOCAL COMPUTER NETWORKS - PROCEEDINGS | 2000年
关键词
traffic grooming; SONET/WDM ring; UPSR; BLSR/2; single-hub; bin packing;
D O I
10.1109/LCN.2000.891100
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In SONET/WDM networks, one fiber supports multiple wavelengths and each wavelength supports several low rate tributary streams. Traffic grooming is then defined as properly using SONET Add/Drop Multiplexer (ADM) to electronically multiplex and demultiplex required tributary traffic patterns with minimal resource cost (wavelengths and ADMs) This paper studies the traffic-grooming problem in single hub SONET/WDM networks and extends existing results. We analyze the real deployments, generalize their results, and study the practical special cares. We prove that BLSR/2 would never be more expensive than UPSR under any traffic pattern. We: present the exact minimum costs of uniform traffic it: both UPSR and BLSR/2. We also give approximation algorithms for optimal grooming of non-uniform traffic after showing that this problem is NP-complete. Finally, we consider how to select the line speeds if there are two different line speeds available.
引用
收藏
页码:556 / 564
页数:9
相关论文
共 14 条
[1]  
CALINESCU G, 1999, RING GROOMING OPTICA
[2]  
CALINESCU G, 1999, UNPUB APPROXIMATION
[3]  
Coffman, 1996, APPROXIMATION ALGORI
[4]  
COLBOURN C, 1999, MINIMIZING DROP COST
[5]  
GERSTEL O, P IEEE INF 99
[6]  
GERSTEL O, P IEEE INF 98, V1, P94
[7]  
GERSTEL O, P IEEE INF 98, V1, P69
[8]  
LI XY, 2000, P INT C COMM ICC00
[9]  
LIU LW, P IEEE INF 2000
[10]  
MODIANO E, 1998, CISS 98