메뉴 건너뛰기




Volumn 177, Issue 2, 2006, Pages 1167-1179

Routing and wavelength assignment in optical networks using bin packing based algorithms

Author keywords

Bin packing; Optical networks; OR in telecommunications; Routing and wavelength assignment

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTICAL COMMUNICATION; PROBLEM SOLVING; ROUTERS;

EID: 33750449297     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.01.003     Document Type: Article
Times cited : (63)

References (17)
  • 1
    • 3543061170 scopus 로고    scopus 로고
    • A hybrid improvement heuristic for the one-dimensional bin packing problem
    • Alvim A.C.F., Glover F., Ribeiro C.C., and Aloise D.J. A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics 10 (2004) 205-229
    • (2004) Journal of Heuristics , vol.10 , pp. 205-229
    • Alvim, A.C.F.1    Glover, F.2    Ribeiro, C.C.3    Aloise, D.J.4
  • 2
    • 0030170139 scopus 로고    scopus 로고
    • A practical approach for routing and wavelength assignment in large wavelength-routed optical networks
    • Banerjee D., and Mukherjee B. A practical approach for routing and wavelength assignment in large wavelength-routed optical networks. IEEE Journal on Selected Areas in Communications 14 (1996) 903-908
    • (1996) IEEE Journal on Selected Areas in Communications , vol.14 , pp. 903-908
    • Banerjee, D.1    Mukherjee, B.2
  • 3
    • 0026891893 scopus 로고
    • Lightpath communications: An approach to high-bandwidth optical WANs
    • Chlamtac I., Ganz A., and Karmi G. Lightpath communications: An approach to high-bandwidth optical WANs. IEEE Transactions on Communications 40 (1992) 1171-1182
    • (1992) IEEE Transactions on Communications , vol.40 , pp. 1171-1182
    • Chlamtac, I.1    Ganz, A.2    Karmi, G.3
  • 4
    • 33750493675 scopus 로고    scopus 로고
    • J.S. Choi, N. Golmie, F. Lapeyere, F. Mouveaux, D. Su, A functional classification of routing and wavelength assignment schemes in DWDM networks: Static case, in: Proceedings of the VII International Conference on Optical Communication and Networks, January 2000.
  • 8
    • 1542596344 scopus 로고    scopus 로고
    • Wavelength assignment and routing in WDM networks
    • Hyytiä E., and Virtamo J. Wavelength assignment and routing in WDM networks. Nordic Telegraffic Seminar 14 (1998) 31-40
    • (1998) Nordic Telegraffic Seminar , vol.14 , pp. 31-40
    • Hyytiä, E.1    Virtamo, J.2
  • 9
    • 33750492351 scopus 로고    scopus 로고
    • R. Inkret, A. Kuchar, B. Mikac, Advanced Infrastructure for Photonic Networks: Extended Final Report of COST Acteion 266, Zagreb: Faculty of Electrical Engineering and Computing, University of Zagreb, 2003, pp. 19-21.
  • 11
    • 0036537857 scopus 로고    scopus 로고
    • An optimization approach to routing and wavelength assignment in WDM all-optical mesh networks without wavelength conversion
    • Lee K., Kang K.C., Lee T., and Park S. An optimization approach to routing and wavelength assignment in WDM all-optical mesh networks without wavelength conversion. ETRI Journal 24 2 (2002) 131-141
    • (2002) ETRI Journal , vol.24 , Issue.2 , pp. 131-141
    • Lee, K.1    Kang, K.C.2    Lee, T.3    Park, S.4
  • 12
    • 33750431115 scopus 로고    scopus 로고
    • G. Li, R. Simha, The partition coloring problem and its application to wavelength routing and assignment, in: Proceedings of Optical Networks Workshop, Richardson, Texas, February 2000.
  • 13
    • 0036576745 scopus 로고    scopus 로고
    • Routing and wavelengths assignment in optical networks from edge disjoint path algorithms
    • Manohar P., Manjunath D., and Shevgaonkar R.K. Routing and wavelengths assignment in optical networks from edge disjoint path algorithms. IEEE Communication Letters 6 5 (2002) 211-213
    • (2002) IEEE Communication Letters , vol.6 , Issue.5 , pp. 211-213
    • Manohar, P.1    Manjunath, D.2    Shevgaonkar, R.K.3
  • 17
    • 3543013753 scopus 로고    scopus 로고
    • The most congested cutset: Deriving a tight lower bound for the chromatic number in the RWA problem
    • Sharafat A.R. The most congested cutset: Deriving a tight lower bound for the chromatic number in the RWA problem. IEEE Communication Letters 8 7 (2004) 473-475
    • (2004) IEEE Communication Letters , vol.8 , Issue.7 , pp. 473-475
    • Sharafat, A.R.1


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