IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v12y2006i1d10.1007_s10878-006-8905-z.html
   My bibliography  Save this article

Optimization of loss-balanced multicast in all-optical WDM networks

Author

Listed:
  • Yuan Cao

    (University of Illinois at Chicago)

  • Oliver Yu

    (University of Illinois at Chicago)

Abstract

In wavelength-division multiplexing (WDM) optical networks, multicast is implemented by constructing a light-forest, which is a set of light-trees with each light-tree rooted from the multicast source and terminated at a partition subset of the destination nodes. Multicast routing scenario has considerable impact on the quality of optical signal received at each destination. To guarantee the fairness of signal quality at different destinations in a multicast session, it is desirable to construct a loss-balanced light-forest to deliver the multicast traffic. A loss-balanced light-forest is composed of a set of light-trees bounded in size (number of destinations per multicast tree), in size variation (difference in the number of destinations among different multicast trees), and in dimension (maximum source-to-destination distance on each multicast tree). This paper investigates the multicast routing and wavelength assignment (MC-RWA) problem under the loss-balance constraint. The problem is formulated as an optimization model using integer linear programming (ILP). Numerical solutions to the optimization model can supply useful performance benchmarks for loss-balance-constrained optical multicast in WDM networks.

Suggested Citation

  • Yuan Cao & Oliver Yu, 2006. "Optimization of loss-balanced multicast in all-optical WDM networks," Journal of Combinatorial Optimization, Springer, vol. 12(1), pages 71-82, September.
    • Handle: RePEc:spr:jcomop:v:12:y:2006:i:1:d:10.1007_s10878-006-8905-z
    DOI: 10.1007/s10878-006-8905-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-006-8905-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-006-8905-z?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. Amiyne Zakouni & Jiawei Luo & Fouad Kharroubi, 2017. "Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 726-741, 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:12:y:2006:i:1:d:10.1007_s10878-006-8905-z. 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.