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.

[1]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[2]  Sridhar Radhakrishnan,et al.  On multicasting with minimum end-to-end delay , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[3]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[4]  Nageswara S. V. Rao,et al.  On update algorithms for quickest paths , 2000, Comput. Commun..

[5]  Leandros Tassiulas,et al.  Cut-through switching, pipelining, and scheduling for network evacuation , 1999, TNET.

[6]  Lionel M. Ni,et al.  Design of scalable and multicast capable cut-through switches for high-speed LANs , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[7]  Kang G. Shin,et al.  Analysis and Implementation of Hybrid Switching , 1995, IEEE Trans. Computers.

[8]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[9]  F. A. Mohammed,et al.  Performance analysis of a cut-through vs. packet-switching techniques , 1997, Proceedings Second IEEE Symposium on Computer and Communications.

[10]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[11]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[12]  Qing Zhu,et al.  A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.

[13]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..