IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v43y1995i1p102-116.html
   My bibliography  Save this article

A Logical Topology and Discrete Capacity Assignment Algorithm for Reconfigurable Networks

Author

Listed:
  • Ming-Jeng Lee

    (IBM, Research Triangle Park, North Carolina)

  • James R. Yee

    (University of Hawaii, Honolulu, Hawaii)

Abstract

A reconfigurable network is a circuit-switched network where the effective topology and capacities can be dynamically adapted to changes in the traffic requirements or to changes in the structure of the network due to failures. The application of reconfigurable networks considered in this paper is data communications. We formulated the joint topology, capacity and routing problem in a reconfigurable network as a nonlinear, mixed integer programming problem. To solve this problem, we present a partial branch-and-bound algorithm. The reduced gradient method is used to solve the problem with the integrality constraints relaxed. Lagrangian relaxation is applied to obtain lower bounds. In the computational experiments, the algorithm found good solutions in a few minutes of CPU time. In addition, the reduction in the minimal delay due to the reconfiguration capability can be as large as 62%.

Suggested Citation

  • Ming-Jeng Lee & James R. Yee, 1995. "A Logical Topology and Discrete Capacity Assignment Algorithm for Reconfigurable Networks," Operations Research, INFORMS, vol. 43(1), pages 102-116, February.
    • Handle: RePEc:inm:oropre:v:43:y:1995:i:1:p:102-116
    DOI: 10.1287/opre.43.1.102
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.43.1.102
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.43.1.102?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
    ---><---

    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:inm:oropre:v:43:y:1995:i:1:p:102-116. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.