A new approach for automatic grooming of SONET circuits to optical express links

We consider meshed optical transport networks having multiple levels of hierarchy whereby cross-connects in different levels perform multiplexing and demultiplexing functions at different granularities. We present a traffic grooming approach that can be implemented in a centralized or distributed fashion, based on the novel design that takes advantage of algorithm efficiency and a simple threshold mechanism to decide when grooming is economical. Our approach allows nodes to perform grooming and degrooming automatically, which is desired in the next-generation optical network where circuits are setup and torn-down dynamically through signaling. We present several experiments using different network topologies. The results indicate that the flow pattern influences the port requirement behavior, and that the flow thickness influences the optimal value of the threshold.

[1]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Eric Mannie,et al.  Generalized Multi-Protocol Label Switching (GMPLS) Architecture , 2004, RFC.

[4]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[5]  Wayne D. Grover,et al.  PARTIAL EXPRESS ROUTING OF BROADBAND TRANSPORT NETWORK DEMANDS , 1997 .

[6]  Chunming Qiao,et al.  An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings , 2000, TNET.