Evaluación de Algoritmos de Ruteamiento Multipunto en Redes de ...

More documents

Recommendations

Info

S 9 Agradecimientos e agradece a Carlos Gaule y Christian Bravo, administradores de ATMLAB de la Universidad Técnica Federico Santa María, y Manuel Jander por ser habilitantes en la obtención de las herramientas de simulación. A D. Reeves de N.C. State University por el envío de un experimento de simulación utilizado en [56]. A L. Guo de Boston University por el envío del código de QDMR utilizado en [40] para ser incorporado en MCRSIM. A Patricio Moya y Ezequiel Muñoz, por posibilitar los viajes necesarios para la finalización de este trabajo de tesis. 10 Referencias [1] R. Talpade, M. Ammar, ʺSingle Connection Emulation (SCE): An Architecture for Providing a Reliable Multicast Transport Service,ʺ 15th IEEE International Conference on Distributed Computing Systems, 1995. [2] S. Liang, D. Cheriton, “TCP‐SMO: Extending TCP to Support Medium‐Scale Multicast Applications”, INFOCOM 2002. [3] V. Visoottiviseth, T. Mogami, N. Demizu, Y. Kadobayashi, S. Yamaguchi, “M/TCP: The Multicast‐extension to Transmission Control Protocol”, Muju, Korea, ICACT 2001. [4] K. Jeacle, “TCP‐XM: Multicast Transport for Grid Computing” Cosener’s House, Abingdon, Multi‐Service Networks 2003. [5] S. Casner, S. Deering, “First IETF Internet Audiocast”, ACM Computer Communication Review, Vol. 22, no.3, pp. 92‐97. July 1992. [6] R. Vallejos, A. Zapata. ʺ“A Conceptualization for Classifying Multicast Routing Algorithms”. Universidad Técnica Federico Santa María, 2000. [7] S. Deering, D. Cheriton, “Multicast Routing in Datagram Internetworks and Extended LANs”, ACM Transactions on Computer Systems, vol 8, no2, May 1990. [8] A. Streigel, G. Manimaran, “A Survey of QoS Multicasting Issues”, IEEE Communications Magazine, Jun 2002. [9] M. Ramalho, “Intra‐ and Inter‐Domain Multicast Routing Protocols: A Survey and Taxonomy”, IEEE Surveys & Tutorials, vol3, no.1, First Quarter 2000. [10] B. Wang, J. Hou, “Multicast Routing and Its Extension: Problems, algorithms, and Protocols”, IEEE Network, Jan/Feb 2000. [11] P. Pragyansmita, S. V. Raghavan, “Survey of Multicast Routing and Protocols”, Indian Institute of Technology Madras. [12] T. Cormen, C. Leiserson, R. L. Rivest, C. Stein, “Introduction to algorithms”, Second Edition MIT, 2001 [13] M. Garey, D. Jonson, “Computers and Intractability. A Guide to the Theory of NP‐ Completeness”, 22th Edition, 2000. [14] V. Kompella, J. Pasquale, G. Polyzos, “Multicast Routing for Multimedia Communication”, IEEE/ACM Transactions on Networking, vol.1, no. 3, Jun 1993. [15] R. Prim, “Shortest Connection Networks and Some Generalizations”, The Bell Technical Journal, vol 36, no. 6. pp 1389‐1401, Nov 1957. 78
[16] M. Barría, R. Vallejos, “Algoritmo para Recuperación de Errores en Comunicaciones Multipunto”, Informe Técnico UTFSM ‐ UV, Ago 2003. [17] A. El‐Sayed, V. Roca, “A survey of Proposals for an Alternative Group Communication Service”, IEEE Network, Jan/Feb 2003. [18] K. C. Almeroth, “The Evolution of Multicast: From the Mbone to Interdomain Multicast to Internet2 Deployment”, IEEE Network, Jun 2000. [19] R. Chalmers, K. C. Almeroth, “On Topology of Multicast Trees”, IEEE/ACM Transanctions on Networking, Jun 2003. [20] J. Chuang, M. Sirbu, “Pricing Multicast Communications: A Cost Based Approach”. Proceedings of INET, 1998. [21] M. Faloutsos, P. Faloutsos, C. Faloutsos, ʺOn Power‐Law Relationships of the Internet Topologyʺ, Proceedings of the ACM SIGCOMM, Sept. 1999. [22] R. Chalmers, K. Almeroth, “Modeling the Branching Characteristics and Efficiency Gains in global Multicast Trees”, IEEE INFOCOM 2001. [23] D. Waitzman, C. Partridge, S. Deering, “Distance Vector Multicast Routing Protocol”, RFC 1075, 1988. [24] B. Cain, S. Deering, I. Kouvelas, B. Fenner, A. Thyagarajan, “Internet Group Management Protocol, Version 3”, RFC 3376, 2002. [25] J. Moy, “Multicast Extensions to OSPF”, RFC 1584, 1994. [26] A. Ballardie, “Core Based Trees (CBT) Multicast Routing Architecture”, RFC 2201, 1997. [27] D. Thaler, C. Ravishankar, ʺDistributed Center Location Algorithmsʺ, IEEE JSAC, vol.15, no.3, pp.291‐303, Apr. 1997. [28] A. Adams, J. Nicholas, W. Siadak, “Protocol Independent Multicast ‐ Dense Mode (PIM‐DM): Protocol Specification (Revised)”, Draft IETF, Feb 2003. [29] B. Fenner, M. Handley, H. Holbrook, I. Kouvelas, “Protocol Independent Multicast ‐ Sparce Mode (PIM‐SM): Protocol Specification (Revised)”, Draft IETF, Mar 2003. [30] S. Deering, “Host Extensions for IP Multicasting”, RFC 1112, August 1989. [31] S. Deering, W. Fenner, B. Haberman, “Multicast Listener Discovery (MLD) for IPv6”, RFC 2710, (Update by RFC3590, Sep 2003) October 1999. [32] D. Thaler, “Border Gateway Multicast Protocol (BGMP)”, Internet Draft, June 2003. [33] Y. Dalal, R. Metcalfe, “Reverse Path forwarding of Broadcast Packets” ACM Communications, vol.21, no. 12, pp. 1040‐1048. Dec 1978. [34] L. Sahasrabuddhe , B. Mukherjee, “Multicast Routing Algorithms and Protocols: A Tutorial”, IEEE Network, Jan/Feb 2000. [35] L. Kuo, G. Markowsky, L. Berman, “A Fast Algorithm for Steiner Trees”, Acta Informatica 15, pp. 141 – 145, 1981. [36] R. Vallejos, W. Creixell, A. Zapata, “A Multicast Routing Algorithm based on Link Contribution”, 9th IFIP Conference on Performance Modelling and Evaluation of ATM & IP Networks, Budapest, 2001. [37] Q. Sun, H. Langendörfer, ʺEfficient Multicast Routing for Delay‐Sensitive Applicationsʺ, Proceedings of the second Workshop on Protocols for Multimedia Systems (PROMSʹ95), pp. 452‐458, October 1995. [38] R. Widyono, ʺThe Design and Evaluation of Routing Algorithms for Real‐‐time Channels.ʺ Technical Report (TR‐94‐024), International Computer Science Institute, UC Berkeley, 1994. [39] Q. Zhu, M. Parsa, J. Garcia‐Luna‐Aceves, ʺA Source‐Based Algorithm for Delay‐ Constrained Minimum‐Cost Multicastingʺ, Proceeding of IEEE INFOCOMʹ95, pp. 337 ‐ 385, 1995. 79
Page 1 and 2:
UNIVERSIDAD TECNICA FEDERICO SANTA
Page 3 and 4:
6 Comparación de Algoritmos median
Page 5 and 6:
Listado de Tablas Tabla 1 Problemas
Page 7 and 8:
Miembros de la Comisión Ph.D. Rein
Page 9 and 10:
de ruteamiento multipunto (ARM) par
Page 11 and 12:
Dinámica: Los grupos estáticos so
Page 13 and 14:
2.3 Construcción de las Rutas de C
Page 15 and 16:
A 3 Modelo de Red y Formulación de
Page 17 and 18:
clasificarse en dos categorías pri
Page 19 and 20:
En general, los enlaces de la red s
Page 21 and 22:
Por otro lado, aparentemente la ven
Page 23 and 24:
(join) al grupo, y además permita
Page 25 and 26:
compartido unidireccional basados e
Page 27 and 28: 4.1.5 BGMP [32] Border Gateway Mult
Page 29 and 30: A continuación se mencionan tres a
Page 31 and 32: (b) Grafo G1 (c) Árbol T1 de G1 (d
Page 33 and 34: A modo de ejemplo, tres funciones f
Page 35 and 36: 4.2.2.1 Simplificación Heurística
Page 37 and 38: Pseudocódigo Huerística BCL INPUT
Page 39 and 40: (a) Grafo que representa la red (b)
Page 41 and 42: (a) (b) Fig. 11 Refinamiento de los
Page 43 and 44: Fig. 12 Red de ejemplo para ilustra
Page 45 and 46: 4.2.7 QDMR [40] Esta heurística ut
Page 47 and 48: RESUMEN En la Tabla 2 se muestra a
Page 49 and 50: cambios topológicos, del tráfico,
Page 51 and 52: Tabla 4 Algunas Herramientas de Sim
Page 53 and 54: 5.2.3 Configuración de los Experim
Page 55 and 56: Tabla 5 Algunas Herramientas de Mon
Page 57 and 58: 6. PRUNED (pruned minimum spanning
Page 59 and 60: 1. Generar un grupo aleatorio en un
Page 61 and 62: A 7 Resultados de la Simulación co
Page 63 and 64: generados por BC‐BW tienen menos
Page 65 and 66: Trafico Background 45 - 85 [Mbps] C
Page 67 and 68: Trafico Background 5 - 125 [Mbps] C
Page 69 and 70: Trafico Background 100 - 120 [Mbps]
Page 73 and 74: Trafico Background 45 - 85 [Mbps] B
Page 77: L 8 Conclusiones os protocolos actu
Page 81 and 82: [63] S. Ross. “Simulation”. Aca
Page 83 and 84: Sea g(n) una función que determina
Page 85 and 86: ANEXO B: Breve Tutorial de Ns‐2 1
Page 87 and 88: objetos que son componentes básico
Page 89 and 90: intérprete calcule el valor de la
Page 91 and 92: Figura 6: Ejemplo de una topología
Page 93 and 94: En general, un script de Ns comienz
Page 95 and 96: Esta línea establece una conexión
Page 97 and 98: export NS_HOME=$HOME/ns-allinone-2.
Page 99 and 100: Cuando la implementación de un nue
Page 101 and 102: ANEXO C: Breve Manual de Uso MCRSIM
Page 103 and 104: Tabla 8 Archivos de MCRSIM NOMBRE D
Page 105 and 106: NodeListEntry *Entra1; int NumDestA
Page 107 and 108: nLinkCount ++; avgLkCost += adjac->
Page 109 and 110: FIN/////////CASO ALCANCE///////////
Page 111 and 112: if (Contribucion != NULL) delete []
Page 113: if (Entra0 != NULL) delete [] Entra
show all

Evaluación de Algoritmos de Ruteamiento Multipunto en Redes de ...

Create successful ePaper yourself

Delete template?

Save as template?