IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v10y2005i2d10.1007_s10878-005-2263-0.html
   My bibliography  Save this article

Maximizing Profits of Routing in WDM Networks

Author

Listed:
  • Jianping Li

    (Yunnan University
    City University of Hong Kong)

  • Kang Li

    (Shandong University)

  • Lusheng Wang

    (City University of Hong Kong)

  • Hao Zhao

    (City University of Hong Kong)

Abstract

Let G = (V, E) be a ring (or chain) network representing an optical wavelength division multiplexing (WDM) network with k channels, where each edge e j has an integer capacity c j . A request s i ,t i is a pair of two nodes in G. Given m requests s i ,t i , i = 1, 2, ..., m, each with a profit value p i , we would like to design/route a k-colorable set of paths for some (may not be all) of the m requests such that each edge e j in G is used at most c j times and the total profit of the set of designed paths is maximized. Here two paths cannot have the same color (channel) if they share some common edge(s). This problem arises in optical communication networks. In this paper, we present a polynomial-time algorithm to solve the problem when G is a chain. When G is a ring, however, the optimization problem is NP-hard (Wan and Liu, 1998), we present a 2-approximation algorithm based on our solution to the chain network. Similarly, some results in a bidirected chain and a bidirected ring are obtained.

Suggested Citation

  • Jianping Li & Kang Li & Lusheng Wang & Hao Zhao, 2005. "Maximizing Profits of Routing in WDM Networks," Journal of Combinatorial Optimization, Springer, vol. 10(2), pages 99-111, September.
    • Handle: RePEc:spr:jcomop:v:10:y:2005:i:2:d:10.1007_s10878-005-2263-0
    DOI: 10.1007/s10878-005-2263-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-005-2263-0
    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-005-2263-0?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.

    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:10:y:2005:i:2:d:10.1007_s10878-005-2263-0. 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.