Routing and capacity allocation in networks with trunk reservation
Mathematics of Operations Research
Computing approximate blocking probabilities for large loss networks with state-dependent routing
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
All-optical networks with sparse wavelength conversion
IEEE/ACM Transactions on Networking (TON)
Blocking in all-optical networks
IEEE/ACM Transactions on Networking (TON)
A Performance Evaluation of Time Switching in TDM Wavelength Routing Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Limited-range wavelength translation in all-optical networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
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
A novel all-optical transport network with time-shared wavelength channels
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
A generalized framework for analyzing time-space switched optical networks
IEEE Journal on Selected Areas in Communications
Routing and time-slot assignment in optical TDM networks
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Previous works have proposed analytical models of TDM wavelength networks to evaluate the blocking performance, but they differ in their underlying assumptions and have varying computation complexities. In this paper, we propose an analytical model of TDM WDM optical networks with optical time-slot interchangers and without wavelength converter for minimum fixed hop routing. In order to make the analysis tractable, we propose a schema that work for any number of partition patterns regardless of numbers of links, wavelengths in each link, and time-slots in each wavelength. Our analytical model provides good accuracies in individual routes and average network blocking probability when compared with the simulation results.