Citation: | Zhang Tao, Liu Zhongkan, Zhang Junet al. Algorithm for delay constraints optimal path calculation[J]. Journal of Beijing University of Aeronautics and Astronautics, 2006, 32(02): 209-213. (in Chinese) |
[1] Wang Z, Crowcroft J. Quality of service routing for supporting multimedia applications[J] IEEE Journal on Selected Areas in Communications, 1996, 14(7):1219~1234 [2] Cheng S, Nahrstedt K. On finding multi-constrained paths . In:IEEE ICC`98 . Atlanta:IEEE Communication Society,1998. 874~879 [3] Korkmaz T, Krunz M. An efficient algorithm for finding a path subject to two additive constraints[J] Computer Communications, 2002, 25(3):225~238 [4] Hussein F, Douglas S, Viniotis Y. Evaluation of multicast routing algorithm for real-time communication on high-speed networks[J] IEEE Journal on Selected Areas in Communications, 1997, 15(3):332~345 [5] Widyono R. The design and evaluation of routing algorithms for real-time channels . TR-94-024, 1994 [6] Yuan X, Liu X. Heuristic algorithms for multi-constrained quality of service routing . In:Proceedings of the IEEE INFOCOM 2001 . Piscataway, NJ:IEEE Communication Society, 2001. 844~853 [7] Korkmaz T, Krunz M. Multi-constrained optimal path selection . In:Proc of the IEEE INFOCOM 2001.Conference Proc . Anchorage, Alaska:IEEE Communication Society, 2001. 834~843 [8] Calvert K I, Doar M B, Zegura E W. Modeling internet topology[J] IEEE Communications Magazine, 1997,35(6):160~163
|