The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

An efficient dynamic routing scheme for delay-bounded multicasting

  • Kang, Moon-Sik (Dept. of Electronic Engineering, Kangnung National Univ.)
  • Published : 1997.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

The purpose of multicasting is to reduce the network costs for transmitting the same traffic to multiple destinations. In this paper, an efficient delay-bounded multicasting routing algorithm is proposed, which satistifies the network conditions of cost minimization and can adjust the dynamic events, such as 'leave and/or join ones' from the multicast group. Also, our algorithm is designed for various network requirements such as the efficiet dynamic group support, high-quality data distribution, and adaptability to variable situation. After the delay tolerance and the maximum group size are determined according to network state and requirements for delay and cost, the dynamic delay-bounded multicast tree is constructed using partial multicast routing. We evaluate the performance of the proposed algorithm by running simulations on randomly generated test networks using a Sun Sparc 20 workstation. We were able to obtain good simulation resutls, which means solutions that lies between the minimum cost solution and the minimum delay one.

Keywords

References

  1. Communications of the ACM v.37 no.8 Multicast Routing Extensions for OSPF John Moy
  2. IEEE Journal of on Seleted Area on Communications v.6 no.9 Routing of Multipoint connections Bernard M. Waxman
  3. IEEE Proceeding A Source-Based Algorithm for Delay-Constrained Minimum Cost Multicasting Qing Zhu;M. Parsa;J. J. Garcia-Luna-Aceves
  4. IEEE/ACM Transaction Networking v.1 no.3 Multicast Routing for Multimedia Communication Vschaspathl P. Kompella;J. C. Pasquale;G. C. Polyzos
  5. Proceedings of Infocom '94 Probabilistic Multicast:Generalizing the Multicast Paradigm to Improve Scalability Mostafa H. Ammar
  6. Proc. of Infocom'94 Efficient Quorumcast Routing Algorithm Shun Yan Cheung
  7. IEEE/ACM Transaction on Networking v.4 no.2 Disgributed Algorithms for Multicast Path Setup in Data Networks Fred Bauer;Anujan Varma
  8. Proc. of Infocom'94 An Algorithm for optimal multicast of multimedia streams Nachum Shacham
  9. RFC 1112 Host Extension for IP Multicasting Stephen Deering
  10. IEEE/ACM Transactions on Networking v.4 no.2 The PIM Architecture for Wide-Area Multicast Routing Stephen Deering(et al.)
  11. Proc. of Infocom'95 A General Packet Replication Scheme for Multicasting in Interconnection Networks Song C Liew
  12. Optimum routing of multicast Stremas Ciro A;Noronha Jr;Fouad A Tobagi
  13. Communications of the ACM M bone:The Multicast Back-bone Hans Ericsson
  14. IEEE Proceeding Address Management and Connection Control for Multicast Communication Application A. Eleftherials;S. Pejhan
  15. Proceeding of Infocom'95 Multicast Routing with End to End delay and Delay Variation Constraints George N. Rouskas;Ilia Baldine
  16. Proc. Of Infocom'95 Adaptive Multicast Routing in Single Rate Loss Networks Ren Hung Hwang
  17. Data Networks D. Bersekas;R. G. Gallager
  18. Interconnections:Bridges and Routers Radia Perlman
  19. RFC 1075 Distance Vecter Multicast Routing Protocol D. Waitman;S. Deering;C. Partridge
  20. RFC 1458 Requirements for Multicast Protocols R. Braudes;S. Zabele
  21. Networks v.22 Steiner Tree Problems F. K. Hwang;Dana S. Richards
  22. IEEE Journal on Selected Area in Communications v.14 no.7 Quality-of-Service Routing for Supporting Multimedia Applications Zheung Wang;Jon Crowcroft
  23. Infocom'92 Multicast Routing Algorithm for Nodal Load Balancing Hideki TODE;Y. SAKAI(et al.)
  24. Networks v.17 Steiner Problem in networks:A survey P. Winter