Scalable survivable ATM group communications
暂无分享,去创建一个
[1] K. K. Ramakrishnan,et al. SEAM: Scalable and efficient ATM multicast , 1997, Proceedings of INFOCOM '97.
[2] Alon Itai,et al. The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.
[3] Deep Medhi,et al. Providing Net-work Survivability to ATM Group Com-munications Via Self-Healing Survivable Rings , 1998 .
[4] M. Herzberg,et al. An optimal spare-capacity assignment model for survivable networks with hop limits , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.
[5] 尾家 祐二,et al. IEEE INFOCOM '97 , 1997 .
[6] Eiji Oki,et al. Recursive matrix-calculation method for disjoint path search with hop link number constraints , 1995 .
[7] William Yurcik. Providing ATM multipoint survivability via disjoint VC mesh backup groups , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).
[8] S. Choudhury,et al. Two methods for minimum cost synthesis of link-disjoint, hop-limited Virtual Paths in ATM networks , 1999 .
[9] M. Herzberg,et al. The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.
[10] Yoram Ofek,et al. Reliable concurrent multicast from bursty sources , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[11] M. Herzberg,et al. Optimal resource allocation for path restoration in mesh-type self-healing networks , 1997 .
[12] Jean-Yves Le Boudec,et al. SMART: A Many-to-Many Multicast Protocol for ATM , 1997, IEEE J. Sel. Areas Commun..