Traffic Grooming Algorithm Using Shortest EDPs Table in WDM Mesh Networks
Traffic Grooming Algorithm Using Shortest EDPs Table in WDM Mesh Networks
Seungsoo Lee,Tae-Jin Lee,M. Chung,Hyunseung Choo
2005 · DOI: 10.1007/11428848_73
International Conference on Conceptual Structures · 12 Citations
TLDR
A traffic grooming algorithm that employs the table for shortest Edge Disjoint Paths (EDPs) with clever selection on demands is proposed that outperforms well-known Maximizing Resource Utilization (MRU).