Traffic grooming based on Shortest path in optical WDM mesh networks

Lecture Notes in Computer Science

Volumn 3516, Issue III, 2005, Pages 1120-1124

  Yoon, Yeo Ran ^a   Lee, Tae Jin ^a   Chung, Min Young ^a   Choo, Hyunseung ^a  

^a Sungkyunkwan University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; TELECOMMUNICATION TRAFFIC; WAVELENGTH DIVISION MULTIPLEXING; BLOCKING PROBABILITY; GRAPH THEORY; MESH GENERATION; WIRELESS MESH NETWORKS (WMN);

SHORTEST-PATH FIRST TRAFFIC GROOMING (SFT); TRAFFIC GROOMING; WDM MESH NETWORK; NETWORK THROUGHPUT; OPTICAL MESH NETWORK; SHORTEST PATH; SHORTEST-PATH FIRST TRAFFIC GROOMING; STATIC TRAFFIC;

TELECOMMUNICATION NETWORKS; MESH NETWORKING;

EID: 25144448683     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11428862_187     Document Type: Conference Paper

References (5)

1. R. Ramaswami and K. N. Sivarajan, Optical Networks: A Practical Perspective. San Francisco, CA: Morgan Kaufmann, 1998.
2. A.S. Rodionov and H. Choo,"On generating random network structures: Connected Graphs," Springer-Verlag Lecture Notes in Computer Science, vol. 3090, pp. 483 491, Sep. 2004.
3. S. Thiagarajan and A. K. Somani,"Capacity fairness of WDMnetworks with grooming capability," Opt. Networks Mag., vol. 2, no. 3, pp. 24-31, May/June 2001.
4. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee,"A novel, generic graph model for traffic grooming in heterogeneous WDM mesh networks," IEEE/ACM Trans. Networking, vol. 11, pp. 285-299, Apr. 2003.
5. K. Zhu and B. Mukherjee,"Traffic grooming in an optical WDM mesh network," IEEE J. Select. Areas Commun., vol. 20, pp. 122-133, Jan. 2002.