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

  • Authors:

  • Xiang-Yang Li;Liwu Liu;Peng-Jun Wan;Ophir Frieder

  • Affiliations:

  • Department of Computer Science, Illinois Institute of Technology, Chicago, IL;Department of Computer Science, Illinois Institute of Technology, Chicago, IL;Department of Computer Science, Illinois Institute of Technology, Chicago, IL;Department of Computer Science, Illinois Institute of Technology, Chicago, IL

  • Venue:
  • Journal of High Speed Networks
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

In SONET/WDM networks, one fiber supports multiple wavelengths and each wavelength supports several low rate tributary streams. 'Traffic grooming' then is defined as properly using SONET Add/Drop Multiplexer to electronically multiplex and demultiplex required tributary traffic patterns with minimal resource cost (wavelengths and ADMs).This paper studies 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 cases. We prove that BLSR/2 would never be more expensive than UPSR under any traffic pattern. We also present the exact minimum costs of uniform traffic in both UPSR and BLSR/2. We give approximation algorithms for optimal grooming of non-uniform traffic. Finally, we consider how to select the line speeds if there are two different line speeds available.