New distributed multicast routing and its performance evaluation

Takuya Asaka, Takumi Miyoshi, Yoshiaki Tanaka

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    1 Citation (Scopus)

    Abstract

    With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multi-cast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

    Original languageEnglish
    Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    PublisherSpringer Verlag
    Pages835-846
    Number of pages12
    Volume1815
    ISBN (Print)354067506X, 9783540675068
    Publication statusPublished - 2000
    EventIFIP-TC6/European Commission International Conference on Networking, NETWORKING 2000 - Paris, France
    Duration: 2000 May 142000 May 19

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume1815
    ISSN (Print)03029743
    ISSN (Electronic)16113349

    Other

    OtherIFIP-TC6/European Commission International Conference on Networking, NETWORKING 2000
    CountryFrance
    CityParis
    Period00/5/1400/5/19

    Fingerprint

    Dynamic routing algorithms
    Dynamic Routing
    Multicast Routing
    Dynamic Algorithms
    Routing Algorithm
    Multicast
    Performance Evaluation
    Traffic
    Path
    Distributed Environment
    Vertex of a graph
    Simulation
    Query

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Cite this

    Asaka, T., Miyoshi, T., & Tanaka, Y. (2000). New distributed multicast routing and its performance evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1815, pp. 835-846). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1815). Springer Verlag.

    New distributed multicast routing and its performance evaluation. / Asaka, Takuya; Miyoshi, Takumi; Tanaka, Yoshiaki.

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1815 Springer Verlag, 2000. p. 835-846 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1815).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Asaka, T, Miyoshi, T & Tanaka, Y 2000, New distributed multicast routing and its performance evaluation. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 1815, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1815, Springer Verlag, pp. 835-846, IFIP-TC6/European Commission International Conference on Networking, NETWORKING 2000, Paris, France, 00/5/14.
    Asaka T, Miyoshi T, Tanaka Y. New distributed multicast routing and its performance evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1815. Springer Verlag. 2000. p. 835-846. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    Asaka, Takuya ; Miyoshi, Takumi ; Tanaka, Yoshiaki. / New distributed multicast routing and its performance evaluation. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 1815 Springer Verlag, 2000. pp. 835-846 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
    @inproceedings{f309fbf037f14d858dcaaaab0373fd1d,
    title = "New distributed multicast routing and its performance evaluation",
    abstract = "With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multi-cast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.",
    author = "Takuya Asaka and Takumi Miyoshi and Yoshiaki Tanaka",
    year = "2000",
    language = "English",
    isbn = "354067506X",
    volume = "1815",
    series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
    publisher = "Springer Verlag",
    pages = "835--846",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

    }

    TY - GEN

    T1 - New distributed multicast routing and its performance evaluation

    AU - Asaka, Takuya

    AU - Miyoshi, Takumi

    AU - Tanaka, Yoshiaki

    PY - 2000

    Y1 - 2000

    N2 - With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multi-cast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

    AB - With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multi-cast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

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

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

    M3 - Conference contribution

    SN - 354067506X

    SN - 9783540675068

    VL - 1815

    T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    SP - 835

    EP - 846

    BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

    PB - Springer Verlag

    ER -