On finding disjoint paths in single and dual link cost networks
暂无分享,去创建一个
Chunming Qiao | Xin He | Dahai Xu | Yang Chen | Yizhi Xiong | C. Qiao | Xin He | Dahai Xu | Yizhi Xiong | Yang Chen
[1] Polina Bayvel,et al. On the number of wavelengths in arbitrarily-connected wavelength-routed optical networks , 1998 .
[2] Chunming Qiao,et al. Distributed partial information management (DPIM) schemes for survivable networks .1 , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[3] Chunming Qiao,et al. Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .
[4] Yu Liu,et al. Approximating optimal spare capacity allocation by successive survivable routing , 2005, TNET.
[5] Jian-Qiang Hu,et al. Diverse routing in optical mesh networks , 2003, IEEE Trans. Commun..
[6] Chunming Qiao,et al. An ultra-fast shared path protection scheme - distributed partial information management, part II , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..
[7] Eric Bouillet,et al. Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths , 2002, Optical Fiber Communication Conference and Exhibit.
[8] Arunabha Sen,et al. Survivability of lightwave networks - path lengths in WDM protection scheme , 2001, J. High Speed Networks.
[9] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .
[10] Robert D. Doverspike,et al. Efficient distributed path selection for shared restoration connections , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[11] Charles Kalmanek,et al. Fiber span failure protection in mesh optical networks , 2001, OptiComm: Optical Networking and Communications Conference.
[12] Eric Bouillet,et al. Lightpath Re-optimization in mesh optical networks , 2005, IEEE/ACM Transactions on Networking.
[13] J. W. Suurballe. Disjoint paths in a network , 1974, Networks.
[14] Robert E. Tarjan,et al. A quick method for finding shortest pairs of disjoint paths , 1984, Networks.
[15] Chunming Qiao,et al. Achieving fast and bandwidth-efficient shared-path protection , 2003 .
[16] Yu Liu,et al. Successive survivable routing for node failures , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[17] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[18] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[19] Ramesh Bhandari. Optimal diverse routing in telecommunication fiber networks , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.
[20] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..
[21] Pin-Han Ho,et al. Spare Capacity Allocation , 2003 .
[22] Murali S. Kodialam,et al. Dynamic routing of bandwidth guaranteed tunnels with restoration , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[23] Chung-Lun Li,et al. Finding disjoint paths with different path-costs: Complexity and algorithms , 1992, Networks.
[24] Murti V. Salapaka,et al. Approaches for capacity and revenue optimization in survivable WDM networks , 2001, J. High Speed Networks.
[25] Chung-Lun Li,et al. The complexity of finding two disjoint paths with min-max objective function , 1989, Discret. Appl. Math..