On Bandwidth Adjusted Multicast in Pipelined Routing Architecture for Mobile Environment
We have developed a novel algorithm to adjust link-bandwidths of a given multicast tree, which sends a message with size r from a source to a multiple destinations taking into consideration pipelined routing architecture for the mobile environment. The algorithm that we have developed tries to minimize the end-to-end delay time and resources such as bandwidths of a multicast tree, and performs admirably well in any given multicast tree. Our evaluation shows that the proposed algorithm dramatically reduces the end-to-end delay time and resources reserved to satisfy the time-constraints.
Unable to display preview. Download preview PDF.
- 1.Y. C. Bang, S. Radhakrishnan, N. S. V. Rao, and S. G. Batsell, On update algorithms for quickest paths, Computer Communications, vol. 23, pp. 1064–1068.Google Scholar
- 2.B. K. Kadaba and J. M. Jaffe, Routing to multiple destinations in computer networks, IEEE Transactions on Communicaitons, COM-31, no. 3, pp. 343–351, 1983.Google Scholar
- 4.B. M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, vol. 6, no. 9, 1988.Google Scholar
- 5.Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, A source-based algorithm for delay constrained minimum-cost multicasting, Proceedings of INFOCOM, pp. 377–385, 1995.Google Scholar
- 6.Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms, MIT Press, 1996.Google Scholar
- 8.Y. C. Bang, S. Radharkrishnan, N. S. V. Rao, and S. G. Batsell, On Multicasting with Minimum End-to-End Delay, ICCCN, pp. 604–609, 1999.Google Scholar
- 10.Ayad N.M.A., and Mohamed F.A., Performance analysis of a cut-through vs. packet-switching techniques, Proceedings of the Second IEEE Symposium on Computers and Communications, pp. 230–234, 1997.Google Scholar
- 13.Mingyao Y., and Ni L.M., Design of scalable and multicast capable cut-through switches for high-speed LANs, Proceedings of the 1997 International Conference on Parallel Processing, pp. 324–332, 1997.Google Scholar
- 14.S. Radharkrishan, Pipeline Routing Architecture in Wide Area Networks, Technical Report, University of Oklahoma, 2001Google Scholar
- 15.P. Kermani and L. Kleinrock, Virtual Cut-Through: A New Computer Communication Switching Technique, Computer Networks, vol. 3, no. 4, 1979.Google Scholar
- 16.Ellen W. Zegura, Kenneth L. Calvert, and Michael J. Donahoo, A quantitative comparison of graph-based models for internet topology, IEEE/ACM Transactions on Networking, vol. 5, no. 6, 1997.Google Scholar