메뉴 건너뛰기




Volumn , Issue , 2005, Pages 63-97

Design of protected working capacity envelopes based on p-cycles: An alternative framework for survivable automated lightpath provisioning

Author keywords

[No Author keywords available]

Indexed keywords


EID: 22744458891     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/0-387-25551-6_3     Document Type: Chapter
Times cited : (5)

References (34)
  • 1
    • 84892216876 scopus 로고    scopus 로고
    • Report to the National Science Foundation Directorate for Computer and Information Science and Engineering (CISE)
    • Ammar, M., and 26 others (2003). Report of NSF Workshop on Fundamental Research in Networking. Report to the National Science Foundation Directorate for Computer and Information Science and Engineering (CISE). http://www.cs.virginia.edu/~jorg/workshopl.
    • (2003) Report of NSF Workshop on Fundamental Research in Networking
    • Ammar, M.1
  • 2
    • 0003213730 scopus 로고    scopus 로고
    • RSVP-TE: Extensions to RSVP for LSP tunnels
    • Standards Track
    • Awduche, D. et al, (2001). RSVP-TE: Extensions to RSVP for LSP tunnels. IETF RFC 3209, (Standards Track).
    • (2001) IETF RFC 3209
    • Awduche, D.1
  • 3
    • 0036343704 scopus 로고    scopus 로고
    • Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures
    • Bouillet, E., Labourdette, J.F., Ellinas, G., Ramamurthy, R., and Chaudhuri, S. (2002). Stochastic approaches to compute shared mesh restored lightpaths in optical network architectures. INFOCOM'02, 2:801-807.
    • (2002) INFOCOM'02 , vol.2 , pp. 801-807
    • Bouillet, E.1    Labourdette, J.F.2    Ellinas, G.3    Ramamurthy, R.4    Chaudhuri, S.5
  • 5
    • 27844591409 scopus 로고    scopus 로고
    • Node-inclusive span survivability in an optical mesh transport network
    • Orlando, FL
    • Doucette, J. and Grover, W.D. (2003). Node-inclusive span survivability in an optical mesh transport network. In: NFOEC'03, pp. 634-643, Orlando, FL.
    • (2003) NFOEC'03 , pp. 634-643
    • Doucette, J.1    Grover, W.D.2
  • 7
    • 0033897573 scopus 로고    scopus 로고
    • Optical layer survivability: A services perspective
    • Gerstel, O. and Ramaswami, R. (2000). Optical layer survivability: A services perspective. IEEE Communications Magazine, 38(3): 104-113.
    • (2000) IEEE Communications Magazine , vol.38 , Issue.3 , pp. 104-113
    • Gerstel, O.1    Ramaswami, R.2
  • 8
    • 0031245867 scopus 로고    scopus 로고
    • Self-organizing broadband transport networks
    • Grover, W.D. (1997). Self-organizing broadband transport networks. Proceedings of IEEE, 85(10):1582-1611.
    • (1997) Proceedings of IEEE , vol.85 , Issue.10 , pp. 1582-1611
    • Grover, W.D.1
  • 10
    • 1642455835 scopus 로고    scopus 로고
    • The protected working capacity PWCE concept: An alternate paradigm for automated service provisioning
    • Grover, W.D. (2004b). The protected working capacity PWCE concept: An alternate paradigm for automated service provisioning. IEEE Communications Magazine, 42(l):62-69.
    • (2004) IEEE Communications Magazine , vol.42 , Issue.1 , pp. 62-69
    • Grover, W.D.1
  • 11
    • 84948755425 scopus 로고    scopus 로고
    • Advances in optical network design with pcycles: Joint optimization and pre-selection of candidate p-cycles
    • Quebec, Canada
    • Grover, W.D. and Doucette, J. (2002). Advances in optical network design with pcycles: Joint optimization and pre-selection of candidate p-cycles. In: IEEE-LEOS Topical Meetings, pp. 49-50, Quebec, Canada.
    • (2002) IEEE-LEOS Topical Meetings , pp. 49-50
    • Grover, W.D.1    Doucette, J.2
  • 12
    • 0031628329 scopus 로고    scopus 로고
    • Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network restoration
    • Atlanta
    • Grover, W.D. and Stamatelakis, D. (1998). Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration. In: ICC 98, pp. 537-543, Atlanta.
    • (1998) ICC 98 , pp. 537-543
    • Grover, W.D.1    Stamatelakis, D.2
  • 13
    • 0001056185 scopus 로고    scopus 로고
    • Bridging the ring-mesh dichotomy with p-cycles
    • Munich, Germany
    • Grover, W.D. and Stamatelakis, D. (2000). Bridging the ring-mesh dichotomy with p-cycles. In: DRCN'00, pp. 92-104, Munich, Germany.
    • (2000) DRCN'00 , pp. 92-104
    • Grover, W.D.1    Stamatelakis, D.2
  • 14
    • 0029533861 scopus 로고
    • The hop-limit approach for spare capacity assignment in survivable networks
    • Herzberg, M., Bye, S., and Utano, A. (1995). The hop-limit approach for sparecapacity assignment in survivable networks. IEEE/ACM Transactions on Networking, 3(6):775-784.
    • (1995) IEEE/ACM Transactions on Networking , vol.3 , Issue.6 , pp. 775-784
    • Herzberg, M.1    Bye, S.2    Utano, A.3
  • 16
    • 0003903315 scopus 로고    scopus 로고
    • Shared backup label switched path restoration
    • draft-kini-restoration-sharedbackup- 00.txt
    • Kini, S., Kodialam, M., Laksham, T.V., and Villamizar, C. (2000). Shared backup label switched path restoration. IETF Internet Draft, draft-kini-restoration-sharedbackup- 00.txt.
    • (2000) IETF Internet Draft
    • Kini, S.1    Kodialam, M.2    Laksham, T.V.3    Villamizar, C.4
  • 17
    • 0033879895 scopus 로고    scopus 로고
    • Dynamic routing of bandwidth guaranteed tunnels with restoration
    • Tel Aviv, Israel
    • Kodialam, M. and Lakshman, T.V. (2000). Dynamic routing of bandwidth guaranteed tunnels with restoration. INFOCOM'OO, 2:902-911, Tel Aviv, Israel.
    • (2000) Infocom'Oo , vol.2 , pp. 902-911
    • Kodialam, M.1    Lakshman, T.V.2
  • 18
    • 0036346129 scopus 로고    scopus 로고
    • Efficient distributed path selection for shared restoration connections
    • New York, NY
    • Li, G., Wang, D., Kalmanek, C, and Doverspike, R. (2002). Efficient distributed path selection for shared restoration connections. INFOCOM'02, 1:140-149, New York, NY.
    • (2002) INFOCOM'02 , vol.1 , pp. 140-149
    • Li, G.1    Wang, D.2    Kalmanek, C.3    Doverspike, R.4
  • 19
    • 3042742292 scopus 로고    scopus 로고
    • Generalized multi-protocol label switching architecture
    • draft-ietf-ccamp-gmpls-architecture-07.txt, (Standard Track
    • Mannie, E. (editor) (2003). Generalized multi-protocol label switching architecture. IETF Internet Draft, draft-ietf-ccamp-gmpls-architecture-07.txt, (Standard Track).
    • (2003) IETF Internet Draft
    • Mannie, E.1
  • 21
    • 0037969357 scopus 로고    scopus 로고
    • Nearoptimal approaches for shared-path protection in WDM mesh networks
    • Anchorage, Alaska
    • Ou, C., Zhang, J., Zang, H., Sahasrabuddhe, L., and Mukherjee, B. (2003). Nearoptimal approaches for shared-path protection in WDM mesh networks. In: ICC03, pp. 1320-1324, Anchorage, Alaska.
    • (2003) ICC03 , pp. 1320-1324
    • Ou, C.1    Zhang, J.2    Zang, H.3    Sahasrabuddhe, L.4    Mukherjee, B.5
  • 22
    • 0003496450 scopus 로고    scopus 로고
    • IP over optical networks: A framework
    • draft-ietf-ipo-framework-05.txt
    • Rajagopalan, B. et al. (2003). IP over optical networks: A framework. IETF Internet Draft, draft-ietf-ipo-framework-05.txt.
    • (2003) IETF Internet Draft
    • Rajagopalan, B.1
  • 23
    • 2342512216 scopus 로고    scopus 로고
    • Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks
    • Sack, A. and Grover, W.D. (2004). Hamiltonian p-cycles for fiber-level protection in homogeneous and semi-homogeneous optical networks. IEEE Network, 18(2) :49-56.
    • (2004) IEEE Network , vol.18 , Issue.2 , pp. 49-56
    • Sack, A.1    Grover, W.D.2
  • 25
    • 0036286449 scopus 로고    scopus 로고
    • Optimal configuration of p-cycles in WDM networks
    • New York, NY
    • Schupke, D.A., Gruber, C.G., and Autenrieth, A. (2002). Optimal configuration of p-cycles in WDM networks. IEEE ICC'02, 5:2761-2765, New York, NY.
    • (2002) IEEE ICC'02 , vol.5 , pp. 2761-2765
    • Schupke, D.A.1    Gruber, C.G.2    Autenrieth, A.3
  • 26
    • 1242307779 scopus 로고    scopus 로고
    • Exploiting forcer structure to serve uncertain demands and minimize redundancy of p-cycle networks
    • Dallas
    • Shen, G. and Grover, W.D. (2003). Exploiting forcer structure to serve uncertain demands and minimize redundancy of p-cycle networks. In: SPIE OPTICOMM'03, pp. 59-70, Dallas.
    • (2003) SPIE OPTICOMM'03 , pp. 59-70
    • Shen, G.1    Grover, W.D.2
  • 27
    • 84892357406 scopus 로고    scopus 로고
    • Adaptive self-protecting transport networks based on p-cycles under the working capacity envelope concept
    • Special Issue on Autonomic Communication Systems
    • Shen, G. and Grover, W.D. (2004). Adaptive self-protecting transport networks based on p-cycles under the working capacity envelope concept. Submitted to IEEE Journal on Selected Areas in Communications, Special Issue on Autonomic Communication Systems.
    • (2004) IEEE Journal on Selected Areas in Communications
    • Shen, G.1    Grover, W.D.2
  • 29
    • 0012056866 scopus 로고    scopus 로고
    • OPNET simulation of self-organizing restorable SONET mesh transport networks
    • (CD-ROM) paper 04, Washington, D.C
    • Stamatelakis, D. and Grover, W.D. (1998). OPNET simulation of self-organizing restorable SONET mesh transport networks. OPNETWORKS'98, (CD-ROM) paper 04, Washington, D.C.
    • (1998) OPNETWORKS'98
    • Stamatelakis, D.1    Grover, W.D.2
  • 30
    • 0034250080 scopus 로고    scopus 로고
    • Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles ("p-cycles"
    • Stamatelakis, D. and Grover, W.D. (2000a). Theoretical underpinnings for the efficiency of restorable networks using pre-configured cycles ("p-cycles"). IEEE Transactions on Communications, 48(8): 1262-1265.
    • (2000) IEEE Transactions on Communications , vol.48 , Issue.8 , pp. 1262-1265
    • Stamatelakis, D.1    Grover, W.D.2
  • 31
    • 0034292038 scopus 로고    scopus 로고
    • IP layer restoration and network planning based on virtual protection cycles
    • Stamatelakis, D. and Grover, W.D. (2000b). IP layer restoration and network planning based on virtual protection cycles. IEEE Journal on Selected Areas in Communications, 18(10):1938-1949.
    • (2000) IEEE Journal on Selected Areas in Communications , vol.18 , Issue.10 , pp. 1938-1949
    • Stamatelakis, D.1    Grover, W.D.2
  • 32
    • 0021441708 scopus 로고
    • A quick method for finding shortest pairs of disjoint paths
    • Surrballe, J.W. and Tarjan, R.E. (1984). A quick method for finding shortest pairs of disjoint paths. Networks, 14(2):325-336.
    • (1984) Networks , vol.14 , Issue.2 , pp. 325-336
    • Surrballe, J.W.1    Tarjan, R.E.2
  • 33
    • 0038065447 scopus 로고    scopus 로고
    • Dynamic survivability in WDM mesh networks under dynamic traffic
    • Yang, Y., Zeng, Q., and Zhao, H. (2003). Dynamic survivability in WDM mesh networks under dynamic traffic. Photonic Network Communications, 6(l):5-24.
    • (2003) Photonic Network Communications , vol.6 , Issue.1 , pp. 5-24
    • Yang, Y.1    Zeng, Q.2    Zhao, H.3
  • 34
    • 0002978486 scopus 로고    scopus 로고
    • Connection management for survivable wavelength-routed WDM mesh networks
    • Zang, H. and Mukherjee, B. (2001). Connection management for survivable wavelength-routed WDM mesh networks. SPIE Optical Network Magazine, 2(4):17-28.
    • (2001) SPIE Optical Network Magazine , vol.2 , Issue.4 , pp. 17-28
    • Zang, H.1    Mukherjee, B.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.