메뉴 건너뛰기




Volumn 31, Issue 3, 2009, Pages 679-683

Study on dynamic routing, wavelength and timeslot assignment algorithm in WDM-TDM optical networks

Author keywords

Optical network; Routing wavelength and timeslot assignment; Time Division Multiplexing (TDM); Wavelength Division Multiplexing (WDM)

Indexed keywords

FIBER OPTIC NETWORKS; OPTICAL MATERIALS; TIME DIVISION MULTIPLE ACCESS; TIME DIVISION MULTIPLEXING; WAVELENGTH; WAVELENGTH DIVISION MULTIPLEXING;

EID: 63749088255     PISSN: 10095896     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (3)

References (8)
  • 1
    • 0034997991 scopus 로고    scopus 로고
    • A generalized framework for analyzing time-space switched optical networks
    • Anchorage, Alaska, USA
    • Srinivasan R and Somani A K. A generalized framework for analyzing time-space switched optical networks[C]. 2001 IEEE Conference on Computer Communications (INFOCOM'01). Anchorage, Alaska, USA. April 2001, Vol. 1: 179-188.
    • (2001) 2001 IEEE Conference on Computer Communications (INFOCOM'01) , vol.1 , pp. 179-188
    • Srinivasan, R.1    Somani, A.K.2
  • 2
    • 26844550898 scopus 로고    scopus 로고
    • Routing, wavelength and time-slot-assignment algorithms for wavelength-routed optical WDM/TDM networks
    • Wen B, Shenai R, and Sivalingam K. Routing, wavelength and time-slot-assignment algorithms for wavelength-routed optical WDM/TDM networks[J]. Journal of Lightwave Technology, 2005, 23(9): 2598-2609.
    • (2005) Journal of Lightwave Technology , vol.23 , Issue.9 , pp. 2598-2609
    • Wen, B.1    Shenai, R.2    Sivalingam, K.3
  • 3
    • 0002344410 scopus 로고    scopus 로고
    • A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks
    • Zang H, Jue J P, and Mukherjee B. A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks[J]. Optical Networks Magazine, 2000, 1(1): 47-63.
    • (2000) Optical Networks Magazine , vol.1 , Issue.1 , pp. 47-63
    • Zang, H.1    Jue, J.P.2    Mukherjee, B.3
  • 4
    • 33646391514 scopus 로고    scopus 로고
    • On-line routing in WDM-TDM switched optical mesh networks
    • Vishwannath A and Liang W. On-line routing in WDM-TDM switched optical mesh networks[J]. Photon Network Communication, 2006, 12(11): 287-299.
    • (2006) Photon Network Communication , vol.12 , Issue.11 , pp. 287-299
    • Vishwannath, A.1    Liang, W.2
  • 5
    • 39049159083 scopus 로고    scopus 로고
    • Distributed dynamic routing, wavelength and timeslot assignment for bandwidth on demand in agile all-optical networks
    • Ottawa, Canada
    • Yang W and Hall T J. Distributed dynamic routing, wavelength and timeslot assignment for bandwidth on demand in agile all-optical networks[C]. 2006 Canadian Conference on Electrical and Computer Engineering (CCECE'06), Ottawa, Canada. May 2006: 136-139.
    • (2006) 2006 Canadian Conference on Electrical and Computer Engineering (CCECE'06) , pp. 136-139
    • Yang, W.1    Hall, T.J.2
  • 6
    • 18944365384 scopus 로고    scopus 로고
    • Adaptive routing and resource assignment in WDM-TDM networks with multi-rate sessions
    • Bellingham
    • Lee Peiyuan, Gong Yongtao, and Gu Wanyi. Adaptive routing and resource assignment in WDM-TDM networks with multi-rate sessions[C]. Proceedings of SPIE Vol. 5626. Bellingham. February 2005: 593-601.
    • (2005) Proceedings of SPIE , vol.5626 , pp. 593-601
    • Lee, P.1    Gong, Y.2    Gu, W.3
  • 7
    • 34547118336 scopus 로고    scopus 로고
    • A routing algorithm framework for survivable optical networks based on resource consumption minimization
    • Sivakumar M and Sivalingam K M. A routing algorithm framework for survivable optical networks based on resource consumption minimization[J]. IEEE Journal of Lightwave Technology, 2007, 25(7): 1684-1692.
    • (2007) IEEE Journal of Lightwave Technology , vol.25 , Issue.7 , pp. 1684-1692
    • Sivakumar, M.1    Sivalingam, K.M.2
  • 8
    • 0000663732 scopus 로고
    • Finding the k shortest loopless paths in a network
    • Yen J. Finding the k shortest loopless paths in a network[J]. Management Science, 1971, 17(11): 712-716.
    • (1971) Management Science , vol.17 , Issue.11 , pp. 712-716
    • Yen, J.1


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