Traffic grooming in mesh WDM optical networks - Performance analysis

被引:39
作者
Xin, CS [1 ]
Qiao, CM
Dixit, S
机构
[1] Norfolk State Univ, Dept Comp Sci, Norfolk, VA 23504 USA
[2] SUNY Buffalo, Dept Comp Sci & Engn, Buffalo, NY 14260 USA
[3] Nokia Res Ctr, Boston, MA 01803 USA
基金
美国国家科学基金会;
关键词
dynamic traffic grooming; link blocking model; optical network; performance analysis; reduced load approximation; stochastic knapsack; traffic grooming;
D O I
10.1109/JSAC.2004.829641
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Traffic grooming is an important task in interworking between the wavelength-division multiplexing (WDM) optical network that supplies "pipes" at the wavelength granularity, and the attached client networks that usually require connections of subwavelength granularity. The focus of this paper is to conduct performance analysis of grooming dynamic client traffic in WDM optical networks with a mesh topology. This paper first briefly introduces the traffic grooming problem in WDM optical networks and the issues related to performance analysis. It then develops two link blocking models, an exact model based on the stochastic knapsack problem and an approximation model based on an approximate continuous time Markov chain (CTMC). The end-to-end performance analysis is conducted using the reduced load approximation. The result obtained from analysis is shown to be accurate compared with the numerical result obtained from simulation.
引用
收藏
页码:1658 / 1669
页数:12
相关论文
共 29 条
[1]   Models of blocking probability in all-optical networks with and without wavelength changers [J].
Barry, RA ;
Humblet, PA .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1996, 14 (05) :858-867
[2]   Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic [J].
Berry, R ;
Modiano, E .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2000, 18 (10) :1961-1971
[3]   Computing approximate blocking probabilities for a class of all-optical networks [J].
Birman, A .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1996, 14 (05) :852-857
[4]  
Bolch Gunter, 1998, Queueing Networks and Markov Chains: Modeling and Performance Evaluation With Computer Science Applications
[5]   Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks [J].
Chiu, AL ;
Modiano, EH .
JOURNAL OF LIGHTWAVE TECHNOLOGY, 2000, 18 (01) :2-12
[6]   Computing Approximate Blocking Probabilities for Large Loss Networks with State-Dependent Routing [J].
Chung, Shun-Ping ;
Kashper, Arik ;
Ross, Keith W. .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1993, 1 (01) :105-115
[7]   REDUCED LOAD APPROXIMATIONS FOR MULTIRATE LOSS NETWORKS [J].
CHUNG, SP ;
ROSS, KW .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1993, 41 (08) :1222-1231
[8]  
GALLAGER R, 1995, DICRETE STOCHASTIC P
[9]  
Girard Andre, 1990, ROUTING DIMENSIONING
[10]   BLOCKING IN A SHARED RESOURCE ENVIRONMENT [J].
KAUFMAN, JS .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1981, 29 (10) :1474-1481