W.-H. Hsu, J. Chen, S.-T. Sheu, and C.-F. Chao
[1] L. Zhang, S. Deering, D. Estrin, S. Shenker, & D. Zappala,RSVP: A new resource reservation protocol, IEEE Network,7(5), 1993, 8–18. doi:10.1109/65.238150 [2] S. Blake et al., An architecture for differentiated services, RFC2475, 1998. [3] P. Winter, Steiner problem in networks: A survey, Networks,17, 1987, 129–167. doi:10.1002/net.3230170203 [4] Karp R.M., Reducibility among combinatorial problems, inR.E. Miller and J.W. Thatcher (Eds.), Complexity of ComputerApplication (New York: Plenum Press, 1972), 85–103.97 [5] B.M. Waxman, Routing of multipoint connections, IEEE Journal of Selected Areas in Communications, 6(9), 1988, 1617–1622. doi:10.1109/49.12889 [6] H. Takahashi & A. Matsuyama, An approximate solution forthe Steiner problem in graphs, Mathematica Japonica, 24,1980, 573–577. [7] L. Kou, G. Markowsky, & L. Berman, A fast algorithm forSteiner trees, Acta Informatica, 15, 1981, 141–145. doi:10.1007/BF00288961 [8] T.H. Cormen, C.E. Leiserson, & R.L. Rivest, Introduction toalgorithms (Cambridge, MA: MIT Press, 1990). [9] R. Dighe, Q. Ren, & B. Sengupta, A link based alternativerouting scheme for network restoration under failure, Proc.IEEE INFOCOM’95, Boston, MA, 1995, 2118–2123. doi:10.1109/GLOCOM.1995.502778 [10] J. Anderson, B. Doshi, S. Dravida, & P. Harshavardhana, Fastrestoration of ATM networks, IEEE Journal of Selected Areasin Communications, 12(1), 1994, 128–138. doi:10.1109/49.265712 [11] H. Sakauchi, Y. Nishimura, & S. Hasegawa, A self-healingnetwork with an economical spare-channel assignment, Proc.IEEE GLOBECOM’90, San Diego, CA, 1990, 438–443. doi:10.1109/GLOCOM.1990.116551 [12] D.R. Byrkit, Statistics today: A comprehensive introduction(Menlo Park, CA: Benjamin-Cummings Publishing, 1987). [13] M.R. Garey & D.S. Johnson, Computers and intractability:A guide to the theory of NP-completeness (New York: W.H.Freeman, 1979).
Important Links:
Go Back
