Journal of High Speed Networks - Special issue on optical networking
Optical burst switching (OBS) - a new paradigm for an optical Internet
Journal of High Speed Networks - Special issue on optical networking
Scheduling Parallel Communication: The h-relation Problem
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Solving Fundamental Problems on Sparse-Meshes
SWAT '98 Proceedings of the 6th Scandinavian Workshop on Algorithm Theory
"Balls into Bins" - A Simple and Tight Analysis
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Hot-Potato Routing Algorithms for Sparse Optical Torus
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
Nearly-All-Optical Routing in Sparse Optical Tori
PARELEC '06 Proceedings of the international symposium on Parallel Computing in Electrical Engineering
On-line routing and wavelength assignment for dynamic traffic in WDM ring and torus networks
IEEE/ACM Transactions on Networking (TON)
Work-Optimal Routing in Wavelength-Division Multiplexed Dense Optical Tori
CSE '08 Proceedings of the 2008 11th IEEE International Conference on Computational Science and Engineering
Work-optimal routing in wavelength-division multiplexed three-dimensional dense optical tori
Proceedings of the 11th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing on International Conference on Computer Systems and Technologies
Balanced WDM and TDM Routing in Coloured Sparse Optical Tori
PARELEC '11 Proceedings of the 2011 Sixth International Symposium on Parallel Computing in Electrical Engineering
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications - Part Supplement
| Hi-index | 0.00 |
The authors present a WDM Wavelength-Division Multiplexing based all-optical network architecture, and study scheduled routing on it. Their architecture can be seen as a communication system of parallel multi-core computer or a large-scale high bandwidth routing switch of e.g., telecommunication network. The goal is to construct such a scalable architecture and a supporting routing protocol for it so that no electro-optical conversions are needed on the routing paths, all packets are routed along one of the shortest paths, processor nodes can inject packets constantly into the network, and all the packets injected into the routing machinery reach their targets without collisions. The authors' CSOT is a sparse network. A large fraction of the nodes are intermediate nodes instead of processor nodes. Only the processor nodes are sources and sinks of packets. The number of all nodes is and is the number of processor nodes in our construction. For scheduled routing to work, the authors consider routing problems as a set of h-relations. They achieved work-optimal routing of -relations for a reasonable size of. The efficiency of routing is based on routing latency hiding which is made possible by WDM and sparseness based increase bandwidth per processor node.