Fast approximate dimensioning and performance analysis of mesh optical networks
暂无分享,去创建一个
[1] S. Chaudhuri,et al. OPTICAL MESH NETWORK MODELING: SIMULATION AND ANALYSIS OF RESTORATION PERFORMANCE , 2002 .
[2] R.W. Tkach,et al. Fast restoration in a mesh network of optical cross-connects , 1999, OFC/IOOC . Technical Digest. Optical Fiber Communication Conference, 1999, and the International Conference on Integrated Optics and Optical Fiber Communication.
[3] 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.
[4] Eric Bouillet,et al. Enhanced algorithm cost model to control tradeoffs in provisioning shared mesh restored lightpaths , 2002, Optical Fiber Communication Conference and Exhibit.
[5] Eric Bouillet,et al. Invited: Routing Strategies for Capacity-Efficient and Fast-Restorable Mesh Optical Networks , 2004, Photonic Network Communications.
[6] 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).
[7] Eric Bouillet,et al. Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[8] Ramu Ramamurthy,et al. Fast approximate dimensioning and performance analysis of mesh optical networks , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..
[9] Chunming Qiao,et al. Novel models for efficient shared-path protection , 2002, Optical Fiber Communication Conference and Exhibit.
[10] S.K. Korotky,et al. Network global expectation model: a statistical formalism for quickly quantifying network needs and costs , 2004, Journal of Lightwave Technology.
[11] Wayne D. Grover,et al. Comparison of Mesh Protection and Restoration Schemes and the Dependency of Graph Connectivity , 2001, DRCN.
[12] 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.
[13] Chunming Qiao,et al. Distributed Partial Information Management (DPIM) schemes for survivable networks - Part I , 2002 .
[14] Sudipta Sengupta,et al. Efficient channel reservation for backup paths in optical mesh networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).
[15] W.D. Grover,et al. Bi-criteria studies of mesh network restoration path-length versus capacity tradeoffs , 2001, OFC 2001. Optical Fiber Communication Conference and Exhibit. Technical Digest Postconference Edition (IEEE Cat. 01CH37171).
[16] Yu Liu,et al. Approximating optimal spare capacity allocation by successive survivable routing , 2001, IEEE/ACM Transactions on Networking.
[17] S. Chaudhuri,et al. Limiting sharing on protection channels in mesh optical networks , 2003, OFC 2003 Optical Fiber Communications Conference, 2003..
[18] Gordon F. Royle,et al. Algebraic Graph Theory , 2001, Graduate texts in mathematics.
[19] Yufei Wang,et al. Optical network design and restoration , 1999, Bell Labs Technical Journal.
[20] N. Biggs. Algebraic Graph Theory , 1974 .