IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v5y2009i1p50-50.html
   My bibliography  Save this article

A Distributed Overlay Multicast Tree Reconstruction Algorithm for Live Streaming Media Applications

Author

Listed:
  • Shan Jin
  • Qin Xia
  • Lin-Feng Liu
  • Yi-Zhong Li

Abstract

Recently overlay multicast has become one of the hot issues on multicast research, as it is more flexible than IP multicast and can facilitate application-specific optimization. However, the intermediate nodes in overlay multicast are easier to be faulted compared to those in IP multicast. So it is significant to design an efficient topology maintenance algorithm in overlay multicast, especially for the live streaming media applications. In this paper, the degree and delay constrained topology maintenance problem is studied, and a novel distributed multicast tree reconstruction algorithm called LOcal Topology maintenance Algorithm (LOTA) is proposed. By adopting the active strategy and avoiding package duplicates, LOTA triggers nodes pre-calculate a backup parent periodically before the multicast tree splits rather than letting downstream nodes find a new parent after a node's departure. When a node which is neither root nor leaf is gone, all its children can interact with their respective backup parents to restore the tree immediately in order to enhance the reconstruction performance and save the system maintenance cost effectively. The results of simulation and experiment show that, in both the small-scale and the large-scale group, LOTA's efficiency of tree reconstruction is much higher than the passive strategies, and its control overhead is comparatively low. Therefore, the algorithm is quite suitable for the real-time streaming media applications.

Suggested Citation

  • Shan Jin & Qin Xia & Lin-Feng Liu & Yi-Zhong Li, 2009. "A Distributed Overlay Multicast Tree Reconstruction Algorithm for Live Streaming Media Applications," International Journal of Distributed Sensor Networks, , vol. 5(1), pages 50-50, January.
  • Handle: RePEc:sae:intdis:v:5:y:2009:i:1:p:50-50
    DOI: 10.1080/15501320802540678
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1080/15501320802540678
    Download Restriction: no

    File URL: https://libkey.io/10.1080/15501320802540678?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:sae:intdis:v:5:y:2009:i:1:p:50-50. 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: SAGE Publications (email available below). General contact details of provider: .

    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.