Routing and capacity allocation in networks with trunk reservation
Mathematics of Operations Research
A path decomposition approach for computing blocking probabilities in wavelength-routing networks
IEEE/ACM Transactions on Networking (TON)
Introduction to algorithms
A tutorial on optical networks
Advanced lectures on networking
Performance of Alternate Routing Methods in All--Optical Switching Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Computing approximate blocking probabilities for a class of all-optical networks
IEEE Journal on Selected Areas in Communications
Models of blocking probability in all-optical networks with and without wavelength changers
IEEE Journal on Selected Areas in Communications
Benefits of wavelength translation in all-optical clear-channel networks
IEEE Journal on Selected Areas in Communications
Wavelength conversion in WDM networking
IEEE Journal on Selected Areas in Communications
Performance of WDM transport networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Wavelength-routed networks can effectively utilize the bandwidth of the optical fibers. Wavelength converters help to reduce the blocking probability of the network and enhance the fiber utilization. We use the iterative path decomposition algorithm to evaluate accurately and efficiently the blocking performance of 14-node NSFNet with and without wavelength converters. The iterative algorithm analyzes the original network by decomposing it into single-path subsystems. These subsystems are analyzed in isolation, and the individual results are appropriately combined to obtain a solution for the overall network.