IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v52y2001i4d10.1057_palgrave.jors.2601104.html
   My bibliography  Save this article

Assignment of add–drop multiplexer (ADM) rings and digital cross-connect system (DCS) mesh in telecommunication networks

Author

Listed:
  • C Y Lee

    (KAIST)

  • S J Koh

    (ETRI)

Abstract

This paper discusses a design of a hybrid ring–mesh network in a survivable communication network. Given a set of traffic demands, the problem is to assign each traffic demand to rings and mesh such that the cost of add–drop multiplexer (ADM) and digital cross-connect system (DCS) equipment required is minimized. This assignment problem can be considered together with the fibre routing of nodes on rings and mesh. As a solution procedure, a tabu search is developed with recency-based short-term and frequency-based long-term memory structures. In computational experiments, the proposed tabu search is compared with the solutions obtained by the branch and bound procedure of CPLEX. We see that the tabu search provides a nearly optimal solution within sufficiently short time periods for all test problems with a gap of approximately 1–4% from the lower bound.

Suggested Citation

  • C Y Lee & S J Koh, 2001. "Assignment of add–drop multiplexer (ADM) rings and digital cross-connect system (DCS) mesh in telecommunication networks," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(4), pages 440-448, April.
    • Handle: RePEc:pal:jorsoc:v:52:y:2001:i:4:d:10.1057_palgrave.jors.2601104
    DOI: 10.1057/palgrave.jors.2601104
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601104
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601104?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. M Riis & A J V Skriver & S F Møller, 2005. "Internet protocol network design with uncertain demand," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1184-1195, October.

    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:pal:jorsoc:v:52:y:2001:i:4:d:10.1057_palgrave.jors.2601104. 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.palgrave-journals.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.