Dynamic Multicast Routing Algorithm Using Predetermined Path Search

@inproceedings{Asaka2000DynamicMR,
  title={Dynamic Multicast Routing Algorithm Using Predetermined Path Search},
  author={Takuya Asaka and Takumi Miyoshi and Yoshiaki Tanaka},
  year={2000}
}
With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multicast 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… CONTINUE READING

Figures, Tables, and Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

How bad is naive multicast routing?

  • IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings
  • 1993
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

VTDM-a dynamic multicast routing algorithm

  • Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98
  • 1998
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Routing of multipoint connections

  • IEEE Journal on Selected Areas in Communications
  • 1988
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL