IDEAS home Printed from https://ideas.repec.org/a/igg/jdst00/v3y2012i4p52-62.html
   My bibliography  Save this article

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

Author

Listed:
  • Risto Honkanen

    (Kajaani University Consortium, Kajaani, Finland)

  • Ville Leppänen

    (Department of Information Technology, University of Turku, Turku, Finland)

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.

Suggested Citation

  • Risto Honkanen & Ville Leppänen, 2012. "Routing in Coloured Sparse Optical Tori by Using Balanced WDM and Network Sparseness," International Journal of Distributed Systems and Technologies (IJDST), IGI Global Scientific Publishing, vol. 3(4), pages 52-62, October.
    • Handle: RePEc:igg:jdst00:v:3:y:2012:i:4:p:52-62
    as

    Download full text from publisher

    File URL: https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jdst.2012100105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jdst00:v:3:y:2012:i:4:p:52-62. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.