Application layer multicast with proactive route maintenance over redundant overlay trees

Yohei Kunichika, Jiro Katto, Sakae Okubo

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    In this paper, an efficient algorithm to look for backup parents in preparation of parent leaving is proposed for application layer multicasting whose topology is constituted in the shape of a tree from a single source node. In most conventional methods, each child node starts searching for its new parent after its parent node leaves from a multicasting tree. This reactive operation often causes long interruption period. In our proposal, each node holds its parent candidate proactively over redundant overlay trees. Proactive route maintenance leads to smooth switching to a new parent after node leaving and failure, and redundant structure of a multicasting tree avoids exhausting search of a backup parent. Computer simulations are also carried out and effectiveness of the proposed approach is verified.

    Original languageEnglish
    Pages (from-to)306-313
    Number of pages8
    JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume3333
    Publication statusPublished - 2004

    Fingerprint

    Pavement overlays
    Multicasting
    Multicast
    Overlay
    Maintenance
    Structure Collapse
    Vertex of a graph
    Computer Simulation
    Parents
    Topology
    Computer simulation
    Preparation
    Efficient Algorithms

    ASJC Scopus subject areas

    • Computer Science(all)
    • Biochemistry, Genetics and Molecular Biology(all)
    • Theoretical Computer Science

    Cite this

    @article{b2451aec5a5d4ec8a6f56c2fea7fb669,
    title = "Application layer multicast with proactive route maintenance over redundant overlay trees",
    abstract = "In this paper, an efficient algorithm to look for backup parents in preparation of parent leaving is proposed for application layer multicasting whose topology is constituted in the shape of a tree from a single source node. In most conventional methods, each child node starts searching for its new parent after its parent node leaves from a multicasting tree. This reactive operation often causes long interruption period. In our proposal, each node holds its parent candidate proactively over redundant overlay trees. Proactive route maintenance leads to smooth switching to a new parent after node leaving and failure, and redundant structure of a multicasting tree avoids exhausting search of a backup parent. Computer simulations are also carried out and effectiveness of the proposed approach is verified.",
    author = "Yohei Kunichika and Jiro Katto and Sakae Okubo",
    year = "2004",
    language = "English",
    volume = "3333",
    pages = "306--313",
    journal = "Lecture Notes in Computer Science",
    issn = "0302-9743",
    publisher = "Springer Verlag",

    }

    TY - JOUR

    T1 - Application layer multicast with proactive route maintenance over redundant overlay trees

    AU - Kunichika, Yohei

    AU - Katto, Jiro

    AU - Okubo, Sakae

    PY - 2004

    Y1 - 2004

    N2 - In this paper, an efficient algorithm to look for backup parents in preparation of parent leaving is proposed for application layer multicasting whose topology is constituted in the shape of a tree from a single source node. In most conventional methods, each child node starts searching for its new parent after its parent node leaves from a multicasting tree. This reactive operation often causes long interruption period. In our proposal, each node holds its parent candidate proactively over redundant overlay trees. Proactive route maintenance leads to smooth switching to a new parent after node leaving and failure, and redundant structure of a multicasting tree avoids exhausting search of a backup parent. Computer simulations are also carried out and effectiveness of the proposed approach is verified.

    AB - In this paper, an efficient algorithm to look for backup parents in preparation of parent leaving is proposed for application layer multicasting whose topology is constituted in the shape of a tree from a single source node. In most conventional methods, each child node starts searching for its new parent after its parent node leaves from a multicasting tree. This reactive operation often causes long interruption period. In our proposal, each node holds its parent candidate proactively over redundant overlay trees. Proactive route maintenance leads to smooth switching to a new parent after node leaving and failure, and redundant structure of a multicasting tree avoids exhausting search of a backup parent. Computer simulations are also carried out and effectiveness of the proposed approach is verified.

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

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

    M3 - Article

    AN - SCOPUS:35048867384

    VL - 3333

    SP - 306

    EP - 313

    JO - Lecture Notes in Computer Science

    JF - Lecture Notes in Computer Science

    SN - 0302-9743

    ER -