Innovative method of the evaluation of multicriterial multicast routing algorithms
暂无分享,去创建一个
[1] BERNARD M. WAXMAN,et al. Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..
[2] Sugih Jamin,et al. Inet: Internet Topology Generator , 2000 .
[3] Piotr Zwierzykowski,et al. Efficiency Analysis of Multicast Routing Algorithms in Large Networks , 2007, International Conference on Networking and Services (ICNS '07).
[4] Gang Feng. The revisit of QoS routing based on non-linear Lagrange relaxation: Research Articles , 2007 .
[5] Bal Azs. Lagrange Relaxation Based Method for the QoS Routing Problem , 2001 .
[6] Ellen W. Zegura,et al. How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[7] Ailsa H. Land,et al. An Automatic Method of Solving Discrete Programming Problems , 1960 .
[8] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[9] Piotr Zwierzykowski,et al. Lagrangian relaxation in the multicriterial routing , 2011, IEEE Africon '11.
[10] A. Land,et al. An Automatic Method for Solving Discrete Programming Problems , 1960, 50 Years of Integer Programming.
[11] David Bawden,et al. Book Review: Evolution and Structure of the Internet: A Statistical Physics Approach. , 2006 .
[12] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[13] M. Stasiak,et al. Multicast Routing Algorithm for packet networks with the application of the Lagrange Relaxation , 2010, 2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS).
[14] Jian-guo Zhou,et al. Multi-constrained Least Cost QoS Routing Algorithm , 2004, ICT.
[15] Klara Nahrstedt,et al. An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..
[16] Marwan Krunz,et al. Multi-constrained optimal path selection , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[17] Mark E. J. Newman,et al. Structure and Dynamics of Networks , 2009 .
[18] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[19] Maciej Stasiak,et al. The Application of K-Shortest Path Algorithm in Multicast Routing , 2009 .
[20] Ding Wei. A multi-constrained multicast QoS routing algorithm , 2003 .
[21] John Moy,et al. OSPF Version 2 , 1998, RFC.
[22] Duncan J. Watts,et al. The Structure and Dynamics of Networks: (Princeton Studies in Complexity) , 2006 .
[23] Piotr Zwierzykowski,et al. A new delay-constrained multicast routing algorithm for packet networks , 2009, AFRICON 2009.
[24] Niki Pissinou,et al. Efficient implementations of a delay-constrained least-cost multicast algorithm , 2002, Journal of Communications and Networks.
[25] Ibrahim Matta,et al. BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.
[26] Ellen W. Zegura,et al. A quantitative comparison of graph-based models for Internet topology , 1997, TNET.
[27] Qing Zhu,et al. A source-based algorithm for delay-constrained minimum-cost multicasting , 1995, Proceedings of INFOCOM'95.