Introduction to algorithms
Multiwavelength optical networks with limited wavelength conversion
IEEE/ACM Transactions on Networking (TON)
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Nonblocking WDM Multicast Switching Networks
IEEE Transactions on Parallel and Distributed Systems
Optical networks: a practical perspective
Optical networks: a practical perspective
IEEE Transactions on Parallel and Distributed Systems
Techniques for optical packet switching and optical burst switching
IEEE Communications Magazine
Benefits of wavelength translation in all-optical clear-channel networks
IEEE Journal on Selected Areas in Communications
WDM optical communication networks: progress and challenges
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Slotted Optical Burst Switching (SOBS) networks
Computer Communications
Agile bandwidth management techniques in slotted all-optical packet switched networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optical packet switches enhanced with electronic buffering and fixed wavelength conversion
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Optimal FDL design for time-wavelength crossconnects and optical packet switches
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Buffered time-wavelength cross-connects: Architectures and performance evaluation
Optical Switching and Networking
| Hi-index | 14.98 |
All optical networking is a promising candidate for supporting high-speed communications because of the huge bandwidth of optics. In this paper, we study optimal scheduling in buffered WDM interconnects with limited range wavelength conversion capability. We formalize the problem of maximizing network throughput and minimizing total delay as a problem of finding an optimal matching in a weighted bipartite graph. We then give a simple algorithm, called the Scan and Swap Algorithm, that finds the optimal matching in O(kB) time, where k is the number of wavelengths per fiber and B is the buffer length, as compared to directly adopting other existing algorithms that need at least O(k^{2} N^{2}+k^{2}BN) time, where N is the number of input fibers.