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

    ASJC Scopus subject areas

    • Computer Science(all)
    • Theoretical Computer Science

    Fingerprint Dive into the research topics of 'New distributed multicast routing and its performance evaluation'. Together they form a unique fingerprint.

    Cite this