October 7, 2005 [Friday], 9:00 AM – 5:00 PM 

Session 1: Keynote Speech [9:00 AM - 10:00 AM]

Traffic Grooming, Inverse Grooming, and Corresponding Survivability Problems in Optical Networks

Prof. Biswanath Mukherjee [University of California, Davis, CA, US]

Coffee Break [10:00 AM - 10:30 AM]

Session 2: Dynamic Traffic Grooming  [10:30 AM - 12:00 PM]

Practical Dynamic Traffic Grooming in Large WDM Mesh Networks

Quang-Dzung Ho and Man-Seop Lee [Information and Communications University, KR]

A Route Segment Technique for Blocking Analysis of Dynamic Traffic

Grooming

Chunsheng Xin [Norfolk State University, US], Jikai Li [The College

of New Jersey, US], Xiaojun Cao [Rochester Institute of Technology,

US] and Bin Wang [Wright State University, US]

Formulation of Multi-Hop Dynamic Traffic Grooming in WDM Optical

Networks

Chunsheng Xin [Norfolk State University, US], Bin Wang [Wright

State University, US], Xiaojun Cao [Rochester Institute of Technology, US] and Jikai Li [The College of New Jersey, US]

Lunch Break [12:00 PM - 1:30 PM]

Session 3: Network Design for Traffic Grooming  [1:30 PM-

3:00 PM]

Network Nodes Dimensioning assuming Electrical Traffic Grooming in an Hybrid OXC/EXC WDM Network

Elias Doumith, Maurice Gagnaire [GET/ENST, FR], Olivier Audouin and Richard Douville [Alcatel, FR]

On the Application of K-Center Algorithms to Hierarchical Traffic

Grooming

Rudra Dutta, Bensong Chen and George Rouskas [North Carolina State University, US]

A Pure Framework for Cost-Effective Virtual Ring based Traffic Grooming

in WDM Optical Networks

Yufeng Xin [University of Maryland, US]

Coffee Break [3:00 PM - 3:30 PM]

Session 4: Traffic Grooming Algorithms [3:30 PM - 5:00 PM] 

On the Complexity of Path Network Grooming

Prashant Iyer, Rudra Dutta, and Carla Savage [North Carolina State University, US]

A Time and Cost Efficient Dynamic Traffic Grooming Algorithm for

Optical Mesh Networks with Sparse Wavelength Conversions

Thanh-Thao Nguyen Thi, Trung Tran Minh, Quang-Dzung Ho and Man-Seop Lee [Information and Communications University, KR]

Single Shortest Path Based Logical Topologies for Grooming IP Traffic

over Wavelength-Routed Networks

Gaurav Agrawal and Deep Medhi [University of Missouri-Kansas City, US]