메뉴 건너뛰기




Volumn 6490 LNCS, Issue , 2010, Pages 443-458

Optimizing regenerator cost in traffic grooming (extended abstract)

Author keywords

Optical Networks; Regenerators; Traffic Grooming; Tree Networks; Wavelength Division Multiplexing(WDM)

Indexed keywords

APPROXIMATION RATIOS; EXTENDED ABSTRACTS; GENERAL TOPOLOGY; GROOMING FACTORS; INTERNAL NODES; LIGHT PATH; OPTICAL NETWORKS; PATH TOPOLOGY; TRAFFIC GROOMING; TREE NETWORK; TREE TOPOLOGY; WAVELENGTH DIVISION MULTIPLEXING(WDM);

EID: 78650862948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-17653-1_32     Document Type: Conference Paper
Times cited : (5)

References (16)
  • 1
    • 77951210452 scopus 로고    scopus 로고
    • The regenerator location problem
    • Chen, S., Ljubic, I., Raghavan, S.: The regenerator location problem. Networks 55(3), 205-220 (2010)
    • (2010) Networks , vol.55 , Issue.3 , pp. 205-220
    • Chen, S.1    Ljubic, I.2    Raghavan, S.3
  • 2
    • 0031209110 scopus 로고    scopus 로고
    • Graph decomposition is NP-complete: A complete proof of Holyer's conjecture
    • PII S0097539792229507
    • Dor, D., Tarsi, M.: Graph decomposition is np-complete: A complete proof of holyer's conjecture. SIAM Journal on Computing 26(4), 1166-1187 (1997) (Pubitemid 127599141)
    • (1997) SIAM Journal on Computing , vol.26 , Issue.4 , pp. 1166-1187
    • Dor, D.1    Tarsi, M.2
  • 3
    • 0000927535 scopus 로고
    • Paths, trees, and flowers
    • Edmonds, J.: Paths, trees, and flowers. Canad. J. Math. 17, 449-467 (1965)
    • (1965) Canad. J. Math. , vol.17 , pp. 449-467
    • Edmonds, J.1
  • 8
    • 51849102465 scopus 로고    scopus 로고
    • Approximating the traffic grooming problem with respect to adms and oadms
    • Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. Springer, Heidelberg
    • Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., Zaks, S.: Approximating the traffic grooming problem with respect to adms and oadms. In: Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. LNCS, vol. 5168, pp. 920-929. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.5168 , pp. 920-929
    • Flammini, M.1    Monaco, G.2    Moscardelli, L.3    Shalom, M.4    Zaks, S.5
  • 10
    • 0035245501 scopus 로고    scopus 로고
    • Regenerator placement algorithms for connection establishment in all-optical networks
    • Kim, S.W., Seo, S.W.: Regenerator placement algorithms for connection establishment in all-optical networks. IEE Proceedings Communications 148(1), 25-30 (2001)
    • (2001) IEE Proceedings Communications , vol.148 , Issue.1 , pp. 25-30
    • Kim, S.W.1    Seo, S.W.2
  • 11
    • 77955333302 scopus 로고    scopus 로고
    • Placing regenerator in optical networks: New model, hardness results and algorithms
    • Gavoille, C. (ed.) ICALP 2010, Part II. Springer, Heidelberg
    • Mertzios, G.B., Sau, I., Shalom, M., Zaks, S.: Placing regenerator in optical networks: New model, hardness results and algorithms. In: Gavoille, C. (ed.) ICALP 2010, Part II. LNCS, vol. 6199, pp. 333-344. Springer, Heidelberg (2010)
    • (2010) LNCS , vol.6199 , pp. 333-344
    • Mertzios, G.B.1    Sau, I.2    Shalom, M.3    Zaks, S.4
  • 14
    • 0038415955 scopus 로고    scopus 로고
    • Wavelength assignment and generalized interval graph coloring
    • Winkler, P., Zhang, L.: Wavelength assignment and generalized interval graph coloring. In: SODA, pp. 830-831 (2003)
    • (2003) SODA , pp. 830-831
    • Winkler, P.1    Zhang, L.2
  • 16
    • 21244476317 scopus 로고    scopus 로고
    • Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing
    • Yang, X., Ramamurthy, B.: Sparse Regeneration in Translucent Wavelength-Routed Optical Networks: Architecture, Network Design and Wavelength Routing. Photonic Network Communications 10(1), 39-53 (2005)
    • (2005) Photonic Network Communications , vol.10 , Issue.1 , pp. 39-53
    • Yang, X.1    Ramamurthy, B.2


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