메뉴 건너뛰기




Volumn 3230, Issue , 1997, Pages 277-287

Allocation of wavelength convertible nodes and routing in all-optical networks

Author keywords

ADD algorithm; Approximation analysis; Blocking minimization problem; Descent algorithm; Heuristic; Node allocation; Routing; Wavelength conversion

Indexed keywords

APPROXIMATION ALGORITHMS; BLOCKING PROBABILITY; COMMUNICATION SYSTEMS; COMPUTER NETWORKS; FIBER OPTIC NETWORKS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; METROPOLITAN AREA NETWORKS; OPTICAL DATA PROCESSING; OPTICAL MATERIALS; OPTIMIZATION; PHOTONICS; POLYNOMIAL APPROXIMATION; PORTALS; ROUTING ALGORITHMS; SYSTEMS ENGINEERING; WAVELENGTH;

EID: 0009546129     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.290387     Document Type: Conference Paper
Times cited : (10)

References (12)
  • 1
    • 0000298923 scopus 로고
    • Routing and wavelength assignment methods in single-hop all-optical networks with blocking
    • A. Birman and A. Kershenbaum, "Routing and wavelength assignment methods in single-hop all-optical networks with blocking," in Proceedings of IEEE INFOCOM '95, pp. 431-438, 1995.
    • (1995) Proceedings of IEEE INFOCOM '95 , pp. 431-438
    • Birman, A.1    Kershenbaum, A.2
  • 2
    • 0030173086 scopus 로고    scopus 로고
    • Benefits of wavelength tramslation in all-optical clear-channel networks
    • June
    • M. Kovačević and A. Acampora, "Benefits of wavelength tramslation in all-optical clear-channel networks," IEEE J. Select. Areas in Commun. 14, pp. 868-880, June 1996.
    • (1996) IEEE J. Select. Areas in Commun , vol.14 , pp. 868-880
    • Kovačević, M.1    Acampora, A.2
  • 3
    • 0030171479 scopus 로고    scopus 로고
    • Computing approximate blocking probabilities for a class of all-optical networks
    • June
    • A. Birman, "Computing approximate blocking probabilities for a class of all-optical networks," IEEE J. Select. Areas in Commun. 14, pp. 852-857, June 1996.
    • (1996) IEEE J. Select. Areas in Commun , vol.14 , pp. 852-857
    • Birman, A.1
  • 4
    • 0029734741 scopus 로고    scopus 로고
    • Connectivity and sparse wavelength conversion in wavelength-routing networks
    • S. Subramaniam, M. Azizoglu, and A. K. Somani, "Connectivity and sparse wavelength conversion in wavelength-routing networks," in Proceedings of IEEE INFOCOM '96, pp. 148-155, 1996.
    • (1996) Proceedings of IEEE INFOCOM '96 , pp. 148-155
    • Subramaniam, S.1    Azizoglu, M.2    Somani, A.K.3
  • 6
    • 0031337128 scopus 로고    scopus 로고
    • Performance of alternate routing methods in all-optical switching networks
    • April
    • H. Harai, M. Murata, and H. Miyahara, "Performance of alternate routing methods in all-optical switching networks," in Proceedings of IEEE INFOCOM '97, vol. 2, pp. 517-525, April 1997.
    • (1997) Proceedings of IEEE INFOCOM '97 , vol.2 , pp. 517-525
    • Harai, H.1    Murata, M.2    Miyahara, H.3
  • 7
    • 0028481771 scopus 로고
    • Four-wave mixing wavelength conversion efficiency in semiconductor traveling-wave amplifiers measoured to 65nm of wavelength shift
    • August
    • J. Zhou, N. Park, K. J. Vahala, M. A. Newkirk, and B. I. Miller, "Four-wave mixing wavelength conversion efficiency in semiconductor traveling-wave amplifiers measoured to 65nm of wavelength shift," IEEE Photonics Technology Letters 6, pp. 984-987, August 1994.
    • (1994) IEEE Photonics Technology Letters , vol.6 , pp. 984-987
    • Zhou, J.1    Park, N.2    Vahala, K.J.3    Newkirk, M.A.4    Miller, B.I.5
  • 9
    • 0000369468 scopus 로고
    • A heuristic program for locating warehouses
    • July
    • A. A. Kuehn and M. J. Hamburger, "A heuristic program for locating warehouses," Management Science 9, pp. 643-666, July 1963.
    • (1963) Management Science , vol.9 , pp. 643-666
    • Kuehn, A.A.1    Hamburger, M.J.2
  • 10
    • 0021635709 scopus 로고
    • Sequential routing optimization for circuit switched networks
    • December
    • A. Girard and Y. Côté, "Sequential routing optimization for circuit switched networks," IEEE Transactions on Communications COM-32, pp. 1234-1242, December 1984.
    • (1984) IEEE Transactions on Communications , vol.COM-32 , pp. 1234-1242
    • Girard, A.1    Côté, Y.2
  • 12
    • 0027542341 scopus 로고
    • Computing approximate blocking probabilities for large loss networks with state-dependent routing
    • February
    • S.-P. Chung, A. Kashper, and K. W. Ross, "Computing approximate blocking probabilities for large loss networks with state-dependent routing," IEEE/ACM Transactions on Networking 1, pp. 105-115, February 1993.
    • (1993) IEEE/ACM Transactions on Networking , vol.1 , pp. 105-115
    • Chung, S.-P.1    Kashper, A.2    Ross, K.W.3


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