[40] L. Guo, I. Matta, ʺQDMR: An Effici<strong>en</strong>t QoS Dep<strong>en</strong><strong>de</strong>nt Multicast Routing Algorithmʺ, Proceeding of 5 th IEEE realtime technology and application symposium (RTAS ʹ99), Vancouver, Canada, June 1999. [41] M. Arav<strong>en</strong>a. Tesis <strong>de</strong> Magister (<strong>en</strong> Desarrollo). Universidad Técnica Fe<strong>de</strong>rico Santa María, Dic 2003. [42] A. Shaikh, K. Shin, ʺDestination‐Driv<strong>en</strong> Routing for Low‐Cost Multicastʺ, IEEE JSAC, vol.15, no.3, pp. 373 ‐ 381, April 1997. [43] A. Cobhan, ʺThe Intrinsic Computational Difficulty of Functionsʺ. Proc. International Congress for Logic Methodology and Philosophy of Sci<strong>en</strong>ce, North Holland, Amsterdam. 1964. [44] J. Edmonds, ʺPaths, Trees and Flowersʺ, Canad. J. Math. 1965. [45] S. Cook. “The complexity of Theorem‐Proving Procedures”. Proc. 3 rd Ann. ACM Symp. On Theory of computing, Association for Compiting Machinery, N.Y. 1971. [46] R. Karp, “Reducibility Among Combinatorial Problems”, Complexity of Computer Compatations, Pl<strong>en</strong>um Press, N.Y. 1972. [47] P. Huang, “Enabling Large‐scale Network Simulations: Selective Abstraction Approach”, Ph.D. Thesis, University Of Southern California, Dec 1999. [48] B. Waxman. “Routing of Multipoint Connections”. IEEE Journal on Selected Areas in Communications, 6(9):1671‐‐1622, 1988. [49] The Network Simulator ‐ ns‐2, http://www.isi.edu/nsnam/ns/. [50] Mars Software, http://www.ccs.neu.edu/home/matta/software.html [51] OMNet++, Discrete Ev<strong>en</strong>ts Simulation System, http://www.omnetpp.org/in<strong>de</strong>x.php. [52] M. Thomas, E. Zegura. ʺG<strong>en</strong>eration and Analysis of Random Graphs to Mo<strong>de</strong>l Internetworks.ʺ Technical Report GIT‐CC‐94‐46, College of Computing, Georgia Tech, 1994. (Software: GT‐ITM: Georgia Tech Internetwork Topology Mo<strong>de</strong>ls). [53] A. Medina, A. Lakhina, I. Matta, J. Byers, “BRITE: An Approach to Universal Topology G<strong>en</strong>eration”, in Proceedings of MASCOTS 2001. [54] J. Winick, S. Jamin, “Inet‐3.0: Internet Topology G<strong>en</strong>erator”, Tech Report UM‐CSE‐TR‐ 456‐02, Departm<strong>en</strong>t of EECS, University of Michigan, 2002. [55] C. Noronha, F. Tobagi ʺEvaluation of Multicast Routing Algorithms for Multimedia Streamsʺ IEEE ITS94 Proceeding, Rio <strong>de</strong> Janeiro, Brazil,pp.1‐8 Aug. 1994. [56] H. Salama ʺMulticast Routing for Real‐Time Communication on High‐Speed Networksʺ, Ph.D. thesis, Departm<strong>en</strong>t of Electrical and Computer Engineering, N.C. State University, November 1996. [57] H. Salama, D. Reeves, Y. Viniotis, ʺThe Delayed‐Constrained Minimum Spanning Tree Problemʺ, Procs. Of 2 nd IEEE Symposium on Computers and Comunications (ISCCʹ97), Alexandria, Egypt, July 1997. [58] http://imj.ucsb.edu/mantra/ [59] H. Salama, “MCRSIM: The Multicast Routing Simulator. Version 2”, http://rtcomm.csc.ncsu.edu/qos.htm, released September 1997. [60] B. Maglaris, D. Anastassiou, P. S<strong>en</strong>, G. Karlsson, J. Robbins, ʺPerformance Mo<strong>de</strong>ls of Statistical Multiplexing in Packet Vi<strong>de</strong>o Communications,ʺ IEEE Trans. on Comm., vol. 36, pp. 834‐843, July 1988. [61] A.G. Waters, “A new heuristic for ATM multicast routing”. 2nd IFIP Workshop on Performance Mo<strong>de</strong>lling and Evaluation of ATM Networks, pages 8/1‐8/9. University of Bradford, July 1994. [62] H. Salama, D. Reeves, Y. Viniotis. “Evaluation of Multicast Routing Algorithms for Real‐Time Communication on High‐Speed Networks”. IEEE Journal on Selected Areas in Communications, 15(3):332‐345, (p 77), April 1997. 80
[63] S. Ross. “Simulation”. Aca<strong>de</strong>mic Press N.Y. 1997. [64] R. Guérin. “Equival<strong>en</strong>t Capacity and Its Application to Bandwidth Allocation in High Speed Networks”. IEEE Journal on Selected Areas in Communications, vol. 9, no 7, 1991. 81
Change language