메뉴 건너뛰기




Volumn 21, Issue 1, 2005, Pages 85-108

A genetic algorithm for multicast routing under delay constraint in WDM network with different light splitting

Author keywords

Delay constraint; Genetic algorithm; Multicast routing; NP hard; Splitting degree; WDM network

Indexed keywords

BANDWIDTH; CONSTRAINT THEORY; CONTROL SYSTEMS; GENETIC ALGORITHMS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS; VIDEO CONFERENCING; WAVELENGTH DIVISION MULTIPLEXING;

EID: 12744256702     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (28)

References (20)
  • 2
    • 0031996609 scopus 로고    scopus 로고
    • Current European WDM development trends
    • E. Lowe, "Current European WDM development trends," IEEE Communications Magazine, Vol. 36, 1998, pp. 46-50.
    • (1998) IEEE Communications Magazine , vol.36 , pp. 46-50
    • Lowe, E.1
  • 3
    • 0033078487 scopus 로고    scopus 로고
    • Light-trees: Optical multicasting for improved performance in wavelength-routed networks
    • L. H. Sahasrabuddhe and B. Mukherjee, "Light-trees: optical multicasting for improved performance in wavelength-routed networks," IEEE Communications Magazine, Vol. 37, 1999, pp. 67-73.
    • (1999) IEEE Communications Magazine , vol.37 , pp. 67-73
    • Sahasrabuddhe, L.H.1    Mukherjee, B.2
  • 5
    • 0003205525 scopus 로고    scopus 로고
    • Core based tree (CBT) multicast routing architecture
    • A. Ballardie, "Core based tree (CBT) multicast routing architecture," Internet RFC 2201, 1996.
    • (1996) Internet RFC , vol.2201
    • Ballardie, A.1
  • 6
    • 0020717353 scopus 로고
    • Routing to multiple destinations in computer network
    • B. K. Kadaba and J. M. Jaffe, "Routing to multiple destinations in computer network," IEEE Transactions on Communications, Vol. COM-31, 1983, pp. 343-351.
    • (1983) IEEE Transactions on Communications , vol.COM-31 , pp. 343-351
    • Kadaba, B.K.1    Jaffe, J.M.2
  • 7
    • 0031125310 scopus 로고    scopus 로고
    • Multicast routing with end-to-end delay and delay variation constraints
    • G. N. Rouskas and I. Baldine, "Multicast routing with end-to-end delay and delay variation constraints," IEEE Journal on Selection Areas in Communications, Vol. 15, 1997, pp. 346-356.
    • (1997) IEEE Journal on Selection Areas in Communications , vol.15 , pp. 346-356
    • Rouskas, G.N.1    Baldine, I.2
  • 8
    • 0003037529 scopus 로고
    • Reducibility among combinational problems
    • R. E. Miller and J. W. Thatcher (eds.), Plenum Press, New York
    • R. M. Karp, "Reducibility among combinational problems," in R. E. Miller and J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 9
    • 0033889593 scopus 로고    scopus 로고
    • Constrained multicast routing in WDM networks with sparse light splitting
    • X. Zhang, J. Wei, and C. Qiao "Constrained multicast routing in WDM networks with sparse light splitting," in Proceedings of IEEE INFOCOM 2000, Vol. 3, 2000, pp. 1781-1790.
    • (2000) Proceedings of IEEE INFOCOM 2000 , vol.3 , pp. 1781-1790
    • Zhang, X.1    Wei, J.2    Qiao, C.3
  • 11
    • 0035884140 scopus 로고    scopus 로고
    • Integrated algorithm for delay bounded multicast routing and wavelength assignment in all optical networks
    • X. H. Jia, D. Z. Du, and X. D. Hu, "Integrated algorithm for delay bounded multicast routing and wavelength assignment in all optical networks," Computer Communications, Vol. 24, 2001, pp. 1390-1399.
    • (2001) Computer Communications , vol.24 , pp. 1390-1399
    • Jia, X.H.1    Du, D.Z.2    Hu, X.D.3
  • 12
    • 0036173359 scopus 로고    scopus 로고
    • Efficient routing and wavelength assignment for multicast in WDM networks
    • B. Chen and J. Wang, "Efficient routing and wavelength assignment for multicast in WDM networks," IEEE Journal on Selection Areas in Communications, Vol. 20, 2002, pp. 97-109.
    • (2002) IEEE Journal on Selection Areas in Communications , vol.20 , pp. 97-109
    • Chen, B.1    Wang, J.2
  • 13
    • 12744256449 scopus 로고    scopus 로고
    • Multicast routing under delay constraint in WDM network with different light splitting
    • M. T. Chen and S. S. Tseng, "Multicast routing under delay constraint in WDM network with different light splitting," in Proceedings of International Computer Symposium (ICS 2002), Vol. 1, 2002, pp. 272-279.
    • (2002) Proceedings of International Computer Symposium (ICS 2002) , vol.1 , pp. 272-279
    • Chen, M.T.1    Tseng, S.S.2
  • 14
    • 84911584312 scopus 로고
    • Shortest connection networks and some generations
    • R. C. Prim, "Shortest connection networks and some generations," Bell System Technical Journal, Vol. 36, 1957, pp. 1389-1401.
    • (1957) Bell System Technical Journal , vol.36 , pp. 1389-1401
    • Prim, R.C.1
  • 15
    • 0036836967 scopus 로고    scopus 로고
    • A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network
    • D. R. Din and S. S. Tseng "A genetic algorithm for solving dual-homing cell assignment problem of the two-level wireless ATM network," Computer Communication, Vol. 25, 2002, pp. 1536-1547.
    • (2002) Computer Communication , vol.25 , pp. 1536-1547
    • Din, D.R.1    Tseng, S.S.2
  • 19
    • 34250246836 scopus 로고
    • A fast algorithm for Steiner trees
    • L. Kou, G. Markowsky, and L. Berman, "A fast algorithm for Steiner trees," Acta Informatica, Vol. 15, 1981, pp. 141-145.
    • (1981) Acta Informatica , vol.15 , pp. 141-145
    • Kou, L.1    Markowsky, G.2    Berman, L.3
  • 20
    • 0003037529 scopus 로고
    • Reducibility among combinational problems
    • R. E. Miller and J. W. Thatcher (eds.), Plenum Press, New York
    • R. M. Karp, "Reducibility among combinational problems," in R. E. Miller and J. W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 1972, pp. 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1


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