Premium
A path accommodation method for reliable ring networks with optical compression TDM
Author(s) -
Baba K.,
Yamaguchi T.,
Gokyuu K.,
Murata M.
Publication year - 2002
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.529
Subject(s) - computer science , path (computing) , survivability , accommodation , path protection , optical path , computer network , algorithm , distributed computing , wavelength division multiplexing , wavelength , physics , optoelectronics , neuroscience , optics , biology
Abstract Very high‐speed optical ring networks were recently developed for metropolitan area network (MAN). In such high‐speed networks, survivability is a very important issue since a single failure leads to a disastrous service interruption. In this paper, we propose a design method for the reliable ring network based on optical compression TDM. We assume a single failure; at most a single link fails at a time. We then propose methods to establish paths accommodating all traffic demands among nodes. As protection/restoration methods, we consider a dedicated path protection, a shared path protection, and a path restoration method. For these networks, we first derive theoretical lower bounds on the numbers of slots and frames in order to accommodate all paths among nodes. We next propose path accommodation algorithms which allocate paths to slots in order to achieve the theoretical lower bound as closely as possible. Our proposed path accommodation methods are evaluated through several numerical examples. Three protection/restoration methods are also compared by applying our algorithms in order to investigate which method is suitable for optical compression TDM. The numerical results show that the shared path protection and path restoration methods can achieve better performance than the dedicated path protection method. Copyright © 2002 John Wiley & Sons, Ltd.