Proactive route maintenance for tree-based application layer multicast and its implementations

Tetsuya Kusumoto, Jiro Katto, Sakae Okubo

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    The purpose of this study is to maintain efficient backup routes for reconstructing overlay trees quickly. In most conventional methods, after a node leaves the trees, its child nodes start searching for the new parents. In this reactive approach, it takes a lot of time to find a new parent. In this paper, we propose a proactive approach to finding a next parent as the backup route node over the overlay tree before the current parent leaves. A proactive approach allows a node to find its new parent node immediately and switch to the backup route node smoothly. In our proposal, the structure of the overlay tree using a redundant degree can decide a backup route node without so much overhead. Simulations demonstrate our proactive approach can recover from node departures 2 times faster than reactive approaches, and can construct overlay trees with lower overheads than another proactive method. Additionally we carried out experiments over actual networks and their results support the effectiveness of our approach. We confirmed that our proposal achieved better streaming quality than conventional approaches.

    Original languageEnglish
    Pages (from-to)2856-2866
    Number of pages11
    JournalIEICE Transactions on Information and Systems
    VolumeE89-D
    Issue number12
    DOIs
    Publication statusPublished - 2006 Dec

    Fingerprint

    Switches
    Experiments

    Keywords

    • Application layer multicast
    • Overlay tree
    • Peer to peer streaming
    • Proactive route maintenance

    ASJC Scopus subject areas

    • Information Systems
    • Computer Graphics and Computer-Aided Design
    • Software

    Cite this

    Proactive route maintenance for tree-based application layer multicast and its implementations. / Kusumoto, Tetsuya; Katto, Jiro; Okubo, Sakae.

    In: IEICE Transactions on Information and Systems, Vol. E89-D, No. 12, 12.2006, p. 2856-2866.

    Research output: Contribution to journalArticle

    @article{fef936d9dc2c4d5fb8578c1dd38b7b87,
    title = "Proactive route maintenance for tree-based application layer multicast and its implementations",
    abstract = "The purpose of this study is to maintain efficient backup routes for reconstructing overlay trees quickly. In most conventional methods, after a node leaves the trees, its child nodes start searching for the new parents. In this reactive approach, it takes a lot of time to find a new parent. In this paper, we propose a proactive approach to finding a next parent as the backup route node over the overlay tree before the current parent leaves. A proactive approach allows a node to find its new parent node immediately and switch to the backup route node smoothly. In our proposal, the structure of the overlay tree using a redundant degree can decide a backup route node without so much overhead. Simulations demonstrate our proactive approach can recover from node departures 2 times faster than reactive approaches, and can construct overlay trees with lower overheads than another proactive method. Additionally we carried out experiments over actual networks and their results support the effectiveness of our approach. We confirmed that our proposal achieved better streaming quality than conventional approaches.",
    keywords = "Application layer multicast, Overlay tree, Peer to peer streaming, Proactive route maintenance",
    author = "Tetsuya Kusumoto and Jiro Katto and Sakae Okubo",
    year = "2006",
    month = "12",
    doi = "10.1093/ietisy/e89-d.12.2856",
    language = "English",
    volume = "E89-D",
    pages = "2856--2866",
    journal = "IEICE Transactions on Information and Systems",
    issn = "0916-8532",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "12",

    }

    TY - JOUR

    T1 - Proactive route maintenance for tree-based application layer multicast and its implementations

    AU - Kusumoto, Tetsuya

    AU - Katto, Jiro

    AU - Okubo, Sakae

    PY - 2006/12

    Y1 - 2006/12

    N2 - The purpose of this study is to maintain efficient backup routes for reconstructing overlay trees quickly. In most conventional methods, after a node leaves the trees, its child nodes start searching for the new parents. In this reactive approach, it takes a lot of time to find a new parent. In this paper, we propose a proactive approach to finding a next parent as the backup route node over the overlay tree before the current parent leaves. A proactive approach allows a node to find its new parent node immediately and switch to the backup route node smoothly. In our proposal, the structure of the overlay tree using a redundant degree can decide a backup route node without so much overhead. Simulations demonstrate our proactive approach can recover from node departures 2 times faster than reactive approaches, and can construct overlay trees with lower overheads than another proactive method. Additionally we carried out experiments over actual networks and their results support the effectiveness of our approach. We confirmed that our proposal achieved better streaming quality than conventional approaches.

    AB - The purpose of this study is to maintain efficient backup routes for reconstructing overlay trees quickly. In most conventional methods, after a node leaves the trees, its child nodes start searching for the new parents. In this reactive approach, it takes a lot of time to find a new parent. In this paper, we propose a proactive approach to finding a next parent as the backup route node over the overlay tree before the current parent leaves. A proactive approach allows a node to find its new parent node immediately and switch to the backup route node smoothly. In our proposal, the structure of the overlay tree using a redundant degree can decide a backup route node without so much overhead. Simulations demonstrate our proactive approach can recover from node departures 2 times faster than reactive approaches, and can construct overlay trees with lower overheads than another proactive method. Additionally we carried out experiments over actual networks and their results support the effectiveness of our approach. We confirmed that our proposal achieved better streaming quality than conventional approaches.

    KW - Application layer multicast

    KW - Overlay tree

    KW - Peer to peer streaming

    KW - Proactive route maintenance

    UR - http://www.scopus.com/inward/record.url?scp=33845581816&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=33845581816&partnerID=8YFLogxK

    U2 - 10.1093/ietisy/e89-d.12.2856

    DO - 10.1093/ietisy/e89-d.12.2856

    M3 - Article

    AN - SCOPUS:33845581816

    VL - E89-D

    SP - 2856

    EP - 2866

    JO - IEICE Transactions on Information and Systems

    JF - IEICE Transactions on Information and Systems

    SN - 0916-8532

    IS - 12

    ER -