메뉴 건너뛰기




Volumn 29, Issue 12, 2006, Pages 2217-2229

QoS multicast routing for multimedia group communications using intelligent computational methods

Author keywords

Intelligent computational methods; Multicast tree; Multimedia group communications; QoS multicast

Indexed keywords

COMPUTATIONAL METHODS; MULTICASTING; NETWORK PROTOCOLS; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION SERVICES; TREES (MATHEMATICS);

EID: 33745914999     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2006.02.015     Document Type: Article
Times cited : (62)

References (38)
  • 1
    • 2442609850 scopus 로고    scopus 로고
    • T. Tojo, T. Enokido, M. Takizawa, Notification-based QoS control protocol for multimedia group communication in high-speed networks, in: Proceedings of IEEE ICDCS, 2004, pp. 644-651.
  • 2
    • 0035281982 scopus 로고    scopus 로고
    • MQ: an integrated mechanism for multimedia multicasting
    • Yang D.-N., Liao W.J., and Lin Y.-T. MQ: an integrated mechanism for multimedia multicasting. IEEE Trans. Multimedia vol. 3 no. 1 (2001) 82-97
    • (2001) IEEE Trans. Multimedia , vol.3 , Issue.1 , pp. 82-97
    • Yang, D.-N.1    Liao, W.J.2    Lin, Y.-T.3
  • 3
    • 0001776520 scopus 로고    scopus 로고
    • Group communication specification: a comprehensive study
    • Gregory V.C., Idit K., and Roman V. Group communication specification: a comprehensive study. ACM Comput. Surv. vol. 33 (2001) 427-469
    • (2001) ACM Comput. Surv. , vol.33 , pp. 427-469
    • Gregory, V.C.1    Idit, K.2    Roman, V.3
  • 4
    • 0033909171 scopus 로고    scopus 로고
    • A survey on multicast routing and its QoS extensions: problems, algorithms, and protocols
    • Wang B., and Hou J.C. A survey on multicast routing and its QoS extensions: problems, algorithms, and protocols. IEEE Netw. vol. 14 no. 1 (2000) 22-36
    • (2000) IEEE Netw. , vol.14 , Issue.1 , pp. 22-36
    • Wang, B.1    Hou, J.C.2
  • 5
    • 0038043322 scopus 로고    scopus 로고
    • Many-to-many multicast routing with temporal Quality of Service guarantees
    • Tyan H.-Y., Hou J.C., and Wang B. Many-to-many multicast routing with temporal Quality of Service guarantees. IEEE Trans. Comput. vol. 52 no. 6 (2003)
    • (2003) IEEE Trans. Comput. , vol.52 , Issue.6
    • Tyan, H.-Y.1    Hou, J.C.2    Wang, B.3
  • 6
    • 0033873720 scopus 로고    scopus 로고
    • Distributed multicast routing, with end-to-end delay and delay variation constraints
    • Low C.P., and Lee Y.J. Distributed multicast routing, with end-to-end delay and delay variation constraints. Comput. Commun. vol. 23 no. 9 (2000) 848-862
    • (2000) Comput. Commun. , vol.23 , Issue.9 , pp. 848-862
    • Low, C.P.1    Lee, Y.J.2
  • 7
    • 0031272928 scopus 로고    scopus 로고
    • A real-time multicast routing algorithm for multimedia applications
    • Jia X.H., Pissinou N., and Makki K. A real-time multicast routing algorithm for multimedia applications. Comput. Commun. vol. 20 no. 12 (1997) 1098-1106
    • (1997) Comput. Commun. , vol.20 , Issue.12 , pp. 1098-1106
    • Jia, X.H.1    Pissinou, N.2    Makki, K.3
  • 8
    • 0037093558 scopus 로고    scopus 로고
    • MAMCRA: a constrained-based multicast routing algorithm
    • Kuipers F., and Mieghem P.V. MAMCRA: a constrained-based multicast routing algorithm. Comput. Commun. vol. 25 no. 8 (2002) 802-811
    • (2002) Comput. Commun. , vol.25 , Issue.8 , pp. 802-811
    • Kuipers, F.1    Mieghem, P.V.2
  • 9
    • 0037093561 scopus 로고    scopus 로고
    • A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem
    • Sheu P.R., and Chen S.T. A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem. Comput. Commun. vol. 25 no. 8 (2002) 825-833
    • (2002) Comput. Commun. , vol.25 , Issue.8 , pp. 825-833
    • Sheu, P.R.1    Chen, S.T.2
  • 10
    • 0037701239 scopus 로고    scopus 로고
    • Minimum-cost QoS multicast and unicast routing in communication networks
    • Xue G.L. Minimum-cost QoS multicast and unicast routing in communication networks. IEEE Trans. Commun. vol. 51 no. 5 (2003) 817-824
    • (2003) IEEE Trans. Commun. , vol.51 , Issue.5 , pp. 817-824
    • Xue, G.L.1
  • 11
    • 0032678509 scopus 로고    scopus 로고
    • Internet QoS: a big picture
    • Xiao X., and Ni L.M. Internet QoS: a big picture. IEEE Netw. vol. 13 no. 2 (1999) 8-18
    • (1999) IEEE Netw. , vol.13 , Issue.2 , pp. 8-18
    • Xiao, X.1    Ni, L.M.2
  • 12
    • 84863090748 scopus 로고
    • Steiner tree problems
    • Hwang F.K., and Richards D.S. Steiner tree problems. Networks vol. 22 no. 1 (1992) 55-89
    • (1992) Networks , vol.22 , Issue.1 , pp. 55-89
    • Hwang, F.K.1    Richards, D.S.2
  • 13
    • 0034466560 scopus 로고    scopus 로고
    • New dynamic algorithms for shortest path tree computation
    • Narvaez P., Siu K.-Y., and Tzeng H.-Y. New dynamic algorithms for shortest path tree computation. IEEE/ACM Trans. Netw. vol. 8 no. 6 (2000)
    • (2000) IEEE/ACM Trans. Netw. , vol.8 , Issue.6
    • Narvaez, P.1    Siu, K.-Y.2    Tzeng, H.-Y.3
  • 14
    • 0027577969 scopus 로고
    • Solving the graphical Steiner tree problem using genetic algorithm
    • Kapsalis A., Rayward-Smith V.J., and Smith G.D. Solving the graphical Steiner tree problem using genetic algorithm. J. Oper. Res. Soc. vol. 44 no. 4 (1993) 397-406
    • (1993) J. Oper. Res. Soc. , vol.44 , Issue.4 , pp. 397-406
    • Kapsalis, A.1    Rayward-Smith, V.J.2    Smith, G.D.3
  • 15
    • 21844491158 scopus 로고
    • Compute near-optimal solutions to the Steiner problem in a graph using a genetic algorithm
    • Esbensen H. Compute near-optimal solutions to the Steiner problem in a graph using a genetic algorithm. Networks vol. 26 (1995) 173-185
    • (1995) Networks , vol.26 , pp. 173-185
    • Esbensen, H.1
  • 16
    • 0032095757 scopus 로고    scopus 로고
    • Restricted dynamic Steiner trees for scalable multicast in datagram networks
    • Aharoni E., and Cohen R. Restricted dynamic Steiner trees for scalable multicast in datagram networks. IEEE/ACM Trans. Netw. vol. 6 no. 3 (1998) 286-297
    • (1998) IEEE/ACM Trans. Netw. , vol.6 , Issue.3 , pp. 286-297
    • Aharoni, E.1    Cohen, R.2
  • 18
    • 0035218510 scopus 로고    scopus 로고
    • An improved approximation scheme for the group Steiner problem
    • Helvig C.S., Robins G., and Zelikovsky A. An improved approximation scheme for the group Steiner problem. Networks vol. 37 no. 1 (2000) 8-20
    • (2000) Networks , vol.37 , Issue.1 , pp. 8-20
    • Helvig, C.S.1    Robins, G.2    Zelikovsky, A.3
  • 19
    • 34249756853 scopus 로고
    • Balancing minimum spanning and shortest path trees
    • Khuller S., Raghavachari B., and Young N. Balancing minimum spanning and shortest path trees. Algorithmica vol. 14 no. 4 (1995) 305-321
    • (1995) Algorithmica , vol.14 , Issue.4 , pp. 305-321
    • Khuller, S.1    Raghavachari, B.2    Young, N.3
  • 20
    • 0032139255 scopus 로고    scopus 로고
    • An iterative algorithm for delay-constrained minimum-cost multicasting
    • Parsa M., Zhu Q., and Garcia-Luna-Aceves J.J. An iterative algorithm for delay-constrained minimum-cost multicasting. IEEE/ACM Trans. Netw. vol. 6 no. 4 (1998) 461-474
    • (1998) IEEE/ACM Trans. Netw. , vol.6 , Issue.4 , pp. 461-474
    • Parsa, M.1    Zhu, Q.2    Garcia-Luna-Aceves, J.J.3
  • 21
    • 0002991522 scopus 로고    scopus 로고
    • A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks
    • Jia X.H. A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Trans. Netw. vol. 6 no. 6 (1998) 828-837
    • (1998) IEEE/ACM Trans. Netw. , vol.6 , Issue.6 , pp. 828-837
    • Jia, X.H.1
  • 22
    • 0348223637 scopus 로고    scopus 로고
    • A QoS-guaranteed multicast routing protocol
    • Li L., and Li C. A QoS-guaranteed multicast routing protocol. Comput. Commun. vol. 27 no. 1 (2004) 59-69
    • (2004) Comput. Commun. , vol.27 , Issue.1 , pp. 59-69
    • Li, L.1    Li, C.2
  • 23
    • 2442545463 scopus 로고    scopus 로고
    • Resource optimization in QoS multicast routing of real-time multimedia
    • Charikar M., Naor J., and Schieber B. Resource optimization in QoS multicast routing of real-time multimedia. IEEE/ACM Trans. Netw. vol. 12 no. 2 (2004)
    • (2004) IEEE/ACM Trans. Netw. , vol.12 , Issue.2
    • Charikar, M.1    Naor, J.2    Schieber, B.3
  • 24
    • 1642332268 scopus 로고    scopus 로고
    • Alternate path routing for multicast
    • Zappala D. Alternate path routing for multicast. IEEE/ACM Trans. Netw. vol. 12 no. 1 (2004)
    • (2004) IEEE/ACM Trans. Netw. , vol.12 , Issue.1
    • Zappala, D.1
  • 25
    • 20444435159 scopus 로고    scopus 로고
    • Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem
    • Lee Y.-J., and Atiquzzaman M. Least cost heuristic for the delay-constrained capacitated minimum spanning tree problem. Comput. Commun. vol. 28 no. 11 (2005) 1371-1379
    • (2005) Comput. Commun. , vol.28 , Issue.11 , pp. 1371-1379
    • Lee, Y.-J.1    Atiquzzaman, M.2
  • 26
    • 28044470536 scopus 로고    scopus 로고
    • Algorithms for precomputing constrained widest paths and multicast trees
    • Siachalou S., and Georgiadis L. Algorithms for precomputing constrained widest paths and multicast trees. IEEE/ACM Trans. Netw. vol. 13 no. 5 (2005) 1174-1187
    • (2005) IEEE/ACM Trans. Netw. , vol.13 , Issue.5 , pp. 1174-1187
    • Siachalou, S.1    Georgiadis, L.2
  • 27
    • 28044466933 scopus 로고    scopus 로고
    • A scalable approach to the partition of QoS requirements in unicast and multicast
    • Orda A., and Sprintson A. A scalable approach to the partition of QoS requirements in unicast and multicast. IEEE/ACM Trans. Netw. vol. 13 no. 5 (2005) 1146-1159
    • (2005) IEEE/ACM Trans. Netw. , vol.13 , Issue.5 , pp. 1146-1159
    • Orda, A.1    Sprintson, A.2
  • 31
    • 84904240259 scopus 로고    scopus 로고
    • Algorithms of ant system and simulated annealing for the p-median problem
    • Levanova T.V., and Loresh M.A. Algorithms of ant system and simulated annealing for the p-median problem. Discrete Optimization vol. 65 no. 3 (2004) 431-438
    • (2004) Discrete Optimization , vol.65 , Issue.3 , pp. 431-438
    • Levanova, T.V.1    Loresh, M.A.2
  • 32
    • 0000411214 scopus 로고
    • Tabu search: Part I
    • Glover F. Tabu search: Part I. ORSA J. Comput. vol. 1 no. 3 (1989) 190-206
    • (1989) ORSA J. Comput. , vol.1 , Issue.3 , pp. 190-206
    • Glover, F.1
  • 33
    • 0032208708 scopus 로고    scopus 로고
    • A genetic algorithm for the multiple destination routing problems
    • Leung Y., Li G., and Xu Z.B. A genetic algorithm for the multiple destination routing problems. IEEE Trans. Evol. Comput. vol. 2 no. 4 (1998) 150-161
    • (1998) IEEE Trans. Evol. Comput. , vol.2 , Issue.4 , pp. 150-161
    • Leung, Y.1    Li, G.2    Xu, Z.B.3
  • 34
    • 0033116882 scopus 로고    scopus 로고
    • An orthogonal genetic algorithm for multimedia multicast routing
    • Zhang Q., and Leung Y.-W. An orthogonal genetic algorithm for multimedia multicast routing. IEEE Trans. Evol. Comput. vol. 3 no. 1 (1999) 53-62
    • (1999) IEEE Trans. Evol. Comput. , vol.3 , Issue.1 , pp. 53-62
    • Zhang, Q.1    Leung, Y.-W.2
  • 35
    • 0036643062 scopus 로고    scopus 로고
    • QoS-driven multicast tree generation using Tabu search
    • Habib Y., Abdulaziz A.-M., Sadiq M.S., and Muhammad A.T. QoS-driven multicast tree generation using Tabu search. Comput. Commun. vol. 25 no. 11-12 (2002) 1140-1149
    • (2002) Comput. Commun. , vol.25 , Issue.11-12 , pp. 1140-1149
    • Habib, Y.1    Abdulaziz, A.-M.2    Sadiq, M.S.3    Muhammad, A.T.4
  • 36
    • 0033196591 scopus 로고    scopus 로고
    • A Tabu search heuristic for the Steiner tree problem
    • Michel G., Jean-Francois L., and Brunilde S. A Tabu search heuristic for the Steiner tree problem. Networks vol. 34 no. 2 (1999) 162-172
    • (1999) Networks , vol.34 , Issue.2 , pp. 162-172
    • Michel, G.1    Jean-Francois, L.2    Brunilde, S.3
  • 38
    • 0032624896 scopus 로고    scopus 로고
    • An approach to wide area WDM optical network design using genetic algorithm
    • Saha D., and Purkayastha M.D. An approach to wide area WDM optical network design using genetic algorithm. Comput. Commun. vol. 22 no. 2 (1999) 156-172
    • (1999) Comput. Commun. , vol.22 , Issue.2 , pp. 156-172
    • Saha, D.1    Purkayastha, M.D.2


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