Serial Array Time Slot Interchangers and Optical Implementations
IEEE Transactions on Computers
IEEE/ACM Transactions on Networking (TON)
Adaptive wavelength routing in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols
Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols
Cost-effective traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
On the wavelength assignment problem in multifiber WDM star and ring networks
IEEE/ACM Transactions on Networking (TON)
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Dynamic lightpath establishment in wavelength routed WDM networks
IEEE Communications Magazine
Photonic slot routing: a cost effective approach to designing all-optical access and metro networks
IEEE Communications Magazine
A generalized framework for analyzing time-space switched optical networks
IEEE Journal on Selected Areas in Communications
Traffic grooming in mesh WDM optical networks - performance analysis
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
Traffic grooming in optical networks has gained significance due to the prevailing sub-wavelength requirement of end users. Optical networks get upgraded to the latest technology slowly with time with only a subset of nodes being upgraded to the latest technology. The networks are thus comprised of nodes employing heterogeneous switching architectures. In this paper, we develop a framework called Methodology for Information Collection and Routing in Optical Networks (MICRON) for connection establishment in optical grooming networks with heterogeneous switching architectures. We illustrate with examples the information that may be collected from the links, and operators that may be used to obtain information along a path. The information can be used to select a path dynamically depending on the network status. We complete the MICRON framework by providing a generic channel assignment procedure that could be employed to implement different channel assignment schemes. Various routing and channel assignment algorithms can be developed from the proposed framework. The framework may be easily implemented with simple traffic engineering extensions to the already existing routing protocols in the wide-area networks.