Premium
Minimizing drop cost for SONET/WDM networks with ⅛ wavelength requirements
Author(s) -
Colbourn Charles J.,
Wan PengJun
Publication year - 2001
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/1097-0037(200103)37:2<107::aid-net6>3.0.co;2-a
Subject(s) - synchronous optical networking , wavelength division multiplexing , traffic grooming , combinatorial design , computer science , multiplexing , drop (telecommunication) , wavelength , optical add drop multiplexer , graph , mathematics , computer network , topology (electrical circuits) , theoretical computer science , combinatorics , telecommunications , optical performance monitoring , optics , physics
SONET/WDM networks using wavelength add—drop multiplexing can be constructed using certain graph decompositions used to form a “grooming,” consisting of unions of certain primitive rings. The existence of such decompositions when every pair of sites employs no more than ⅛ of the wavelength capacity is determined, with few possible exceptions, when the ring size is a multiple of four. The techniques developed rely heavily on tools from combinatorial design theory. © 2001 John Wiley & Sons, Inc.