IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v1y1997i2d10.1023_a1009759916586.html
   My bibliography  Save this article

Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network

Author

Listed:
  • Peng-Jun Wan

    (Honeywell Technology Center)

Abstract

Recently a class of scalable multi-star optical networks is proposed. Inthis network class nodes are grouped into clusters. Each cluster employs aseparate pair of broadcast and select couplers. The clusters areinterconnected via fiber links according to a regular topology. This approachefficiently combines time and/or wavelength division with direct spacedivision. One important issue for this network class is the conflict-freechannel set assignment that maximizes spatial re-use of channels. This paperstudies the conflict-free channel set assignment for the hypercube clusterinterconnection topology. The approach in this paper is novel and isconjectured to be optimal.

Suggested Citation

  • Peng-Jun Wan, 1997. "Near-Optimal Conflict-Free Channel Set Assignments for an Optical Cluster-Based Hypercube Network," Journal of Combinatorial Optimization, Springer, vol. 1(2), pages 179-186, June.
    • Handle: RePEc:spr:jcomop:v:1:y:1997:i:2:d:10.1023_a:1009759916586
    DOI: 10.1023/A:1009759916586
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009759916586
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009759916586?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yuehua Bu & Xubo Zhu, 2012. "An optimal square coloring of planar graphs," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 580-592, November.
    2. Sun-Yuan Hsieh & Pei-Yu Yu, 2007. "Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges," Journal of Combinatorial Optimization, Springer, vol. 13(2), pages 153-162, February.

    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:spr:jcomop:v:1:y:1997:i:2:d:10.1023_a:1009759916586. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.