메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Joint optimization in capacity design of networks with p-cycle using the fundamental cycle set

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CAPACITY; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; OPTIMIZATION; TELECOMMUNICATION LINKS;

EID: 50949130088     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2006.428     Document Type: Conference Paper
Times cited : (13)

References (8)
  • 1
    • 0031628329 scopus 로고    scopus 로고
    • Cycle-oriented distributed preconfiguration: Ring-like speed with mesh-like capacity for self-planning network restoration
    • June
    • W. D. Grover and D. Stamatelakis, "Cycle-oriented distributed preconfiguration: ring-like speed with mesh-like capacity for self-planning network restoration," in In Proc. of IEEE ICC 1998, pp. 537-543, June 1998.
    • (1998) In Proc. of IEEE ICC 1998 , pp. 537-543
    • Grover, W.D.1    Stamatelakis, D.2
  • 2
    • 0036283284 scopus 로고    scopus 로고
    • H. Zhang and O. Yang, Finding protection cycles in DWDM networks, ICC-2002, pp. 2756-2760, 2002.
    • H. Zhang and O. Yang, "Finding protection cycles in DWDM networks," ICC-2002, pp. 2756-2760, 2002.
  • 4
    • 84945972941 scopus 로고    scopus 로고
    • J. Doucette, D. He, and W. D. Grover, Algorithm approachs for efficient enumeration of candidate p-cycle network design, Proc. Fourth International Workshop on the Design of Reliable Communication Networks (DRCN 2003), Banff, Alberta, Canada, Oct., pp. 212-220, 2003.
    • J. Doucette, D. He, and W. D. Grover, "Algorithm approachs for efficient enumeration of candidate p-cycle network design," Proc. Fourth International Workshop on the Design of Reliable Communication Networks (DRCN 2003), Banff, Alberta, Canada, vol. Oct., pp. 212-220, 2003.
  • 5
    • 0014567146 scopus 로고
    • An algorithm for finding a fundamental set of cycles of a graph
    • September
    • K. Paton, "An algorithm for finding a fundamental set of cycles of a graph," Communications of the ACM, vol. 12, no. 9, September, 1969.
    • (1969) Communications of the ACM , vol.12 , Issue.9
    • Paton, K.1
  • 6
    • 0012099127 scopus 로고
    • Algorithm for finding a fundamental set of cycles for an undirected linear graph
    • December
    • C. C. Gotlieb and D. G. Corneil, "Algorithm for finding a fundamental set of cycles for an undirected linear graph," Communications of the ACM, vol. 10, no. 12, December, 1967.
    • (1967) Communications of the ACM , vol.10 , Issue.12
    • Gotlieb, C.C.1    Corneil, D.G.2
  • 7
    • 0003677229 scopus 로고    scopus 로고
    • New York: Springer-Verlag
    • R. Diestel, Graph Theory. New York: Springer-Verlag, 2000.
    • (2000) Graph Theory
    • Diestel, R.1


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