Welcome to the InfoSci Platform
Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness

Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness

Risto Honkanen, Ville Leppänen
Copyright: © 2012 |Volume: 3 |Issue: 4 |Pages: 11
ISSN: 1947-3532|EISSN: 1947-3540|EISBN13: 9781466611788|DOI: 10.4018/jdst.2012100105
Cite Article Cite Article

MLA

Honkanen, Risto, and Ville Leppänen. "Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness." IJDST vol.3, no.4 2012: pp.52-62. http://doi.org/10.4018/jdst.2012100105

APA

Honkanen, R. & Leppänen, V. (2012). Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness. International Journal of Distributed Systems and Technologies (IJDST), 3(4), 52-62. http://doi.org/10.4018/jdst.2012100105

Chicago

Honkanen, Risto, and Ville Leppänen. "Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness," International Journal of Distributed Systems and Technologies (IJDST) 3, no.4: 52-62. http://doi.org/10.4018/jdst.2012100105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.