IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v23y2006i01ns0217595906000759.html
   My bibliography  Save this article

Delay Guarantee Backup Route Planning For Multicast Networks

Author

Listed:
  • CHYI-BAO YANG

    (Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan, ROC)

  • UE-PYNG WEN

    (Department of Industrial Engineering and Engineering Management, National Tsing Hua University, Hsinchu, Taiwan, ROC)

  • CHING-CHIR SHYUR

    (Chunghwa Telecom Co., Ltd., Taipei, Taiwan, ROC)

Abstract

This paper considers quality of service in terms of end-to-end delay in planning backup routes for multicast communications. The problem of preplanning backup routes considering both cost minimization and end-to-end delay guarantee for multicast communications in the case a single link failure is investigated. Two delay labels, the limited label and the tolerable label, are defined to evaluate the end-to-end delay requirement. Four heuristic algorithms, including two tree-based algorithms, one subtree-based algorithm, and one link-based algorithm, are proposed to determine the delay-constrained backup routes having the minimum costs. Two procedures to determine a node selection sequence,RandomandMinimum-Cost, are used in the tree-based algorithm. Experimental results show that the tree-based algorithm by theMinimum-Costsequence yields the best performance in cost minimization with guarantee of end-to-end delay.

Suggested Citation

  • Chyi-Bao Yang & Ue-Pyng Wen & Ching-Chir Shyur, 2006. "Delay Guarantee Backup Route Planning For Multicast Networks," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 23(01), pages 25-39.
    • Handle: RePEc:wsi:apjorx:v:23:y:2006:i:01:n:s0217595906000759
    DOI: 10.1142/S0217595906000759
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595906000759
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595906000759?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:wsi:apjorx:v:23:y:2006:i:01:n:s0217595906000759. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.