메뉴 건너뛰기




Volumn 1, Issue , 2005, Pages 71-77

Applying p-cycles to multi-service photonic network

Author keywords

Availability; Design; Heuristic methods; Multi service photonic network; Optimization; p cycles

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; NETWORK PROTOCOLS; OPTIMIZATION; SEARCH ENGINES;

EID: 33745725789     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTON.2005.1505842     Document Type: Conference Paper
Times cited : (6)

References (8)
  • 1
    • 33744969322 scopus 로고    scopus 로고
    • Multi-service photonic network
    • to appear, Zagreb, Croatia, June 15-17
    • R. Inkret, M. Lackovic, "Multi-Service Photonic Network", to appear in Proc. of Contel, Zagreb, Croatia, June 15-17, 2005.
    • (2005) Proc. of Contel
    • Inkret, R.1    Lackovic, M.2
  • 2
    • 0031628329 scopus 로고    scopus 로고
    • Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network restoration
    • Atlanta, June 7-11
    • W. D. Graver, D. Stamatelakis: Cycle-Oriented Distributed Preconfiguration: Ring-Like Speed with Mesh-Like Capacity for Self-Planning Network Restoration, in Proc. International Conference on Communications (ICC), vol. 1, Atlanta, June 7-11, 1998, pp. 537-543.
    • (1998) Proc. International Conference on Communications (ICC) , vol.1 , pp. 537-543
    • Graver, W.D.1    Stamatelakis, D.2
  • 4
    • 84948755425 scopus 로고    scopus 로고
    • Advances in optical network design with p-cycles: Joint optimization and pre-selection of Candidate p-cycles
    • Mont Tremblant, Quebec
    • W. D. Graver, J. Doucette: Advances in Optical Network Design with p-cycles: Joint Optimization and Pre-selection of Candidate p-Cycles, in Proc. IEEE/LEOS Summer Topical Meetings 2002: All Optical Networking, Mont Tremblant, Quebec.
    • Proc. IEEE/LEOS Summer Topical Meetings 2002: All Optical Networking
    • Graver, W.D.1    Doucette, J.2
  • 5
    • 0001909598 scopus 로고
    • Finding all the elementary circuits of a directed graph
    • March
    • D. B. Johnson: Finding All the Elementary Circuits of a Directed Graph, SIAM J. Computing, vol. 4, no. 1, March 1975, pp. 77-84.
    • (1975) SIAM J. Computing , vol.4 , Issue.1 , pp. 77-84
    • Johnson, D.B.1
  • 6
    • 33750992194 scopus 로고    scopus 로고
    • Analytical vs. Simulation approach to availability calculation of circuit switched optical transmission network
    • Zagreb, Croatia, June 11-13
    • M. Lackovic, B. Mikac: Analytical vs. Simulation Approach to Availability Calculation of Circuit Switched Optical Transmission Network, In Proceedings of ConTel (Zagreb, Croatia, June 11-13, 2003), pp.743-750.
    • (2003) Proceedings of ConTel , pp. 743-750
    • Lackovic, M.1    Mikac, B.2
  • 8
    • 0037257309 scopus 로고    scopus 로고
    • Pan-european optical transport networks: An availability-based comparison
    • May
    • S. De Maesschalck et al: Pan-European Optical Transport Networks: an Availability-based Comparison, Photonic Network Communications, May 2003, vol. 5 (3), pp. 203-225.
    • (2003) Photonic Network Communications , vol.5 , Issue.3 , pp. 203-225
    • De Maesschalck, S.1


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