An Efficient Distributed Dynamic Multicast Routing with Delay and Delay Variation Constraints

1. Rouskas, G.N., Baldine, I.: Multicast Routing with End-to-End Delay and Delay Variation Constraints. IEEE Journal on Selected Areas in Communications 15(3), 346–356 (1997)

   Article  Google Scholar 

2. Sheu, P.R., Chen, S.T.: A Fast and Efficient Heuristic Algorithm for the Delay- and Delay Variation-bounded Multicast Tree Problem. Computer Communications 25(8), 825–833 (2002)

   Article  Google Scholar 

3. Yu, Y.P., Qiu, P.L.: A Heuristic of Multicast Routing with Delay and Delay Variation Constraints. Journal of China Institute of Communications 24(2), 132–137 (2003)

   MathSciNet  Google Scholar 

4. Zhang, K., Wang, H., Liu, F.Y.: Distributed Multicast Routing for Delay and Delay Variation-bounded Steiner Tree using Simulated Annealing. Computer Communications 28 (2005) (to be published)

   Google Scholar 

5. Jia, Z.F., Varaiya, P.: Heuristic Methods for Delay Constrained Least Cost Routing Using k-Shortest-Paths. In: Proc. of IEEE INFOCOM 2001 (2001)

   Google Scholar 

6. Bellman, R.E.: Dynamic Programming. Princeton University Press, New Jersy (1997)

   Google Scholar 

7. Waxman, B.M.: Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988)

   Article  Google Scholar 

8. Salama, H.F.: Multicast Routing for Real-time Communication on High-speed Networks. PhD Dissertation, North Carolina State University, Department of Electrical and Computer Engineering (1996)

   Google Scholar 

Download references