메뉴 건너뛰기




Volumn 64, Issue 12, 2004, Pages 1399-1413

An efficient algorithm for constructing delay bounded minimum cost multicast trees

Author keywords

Bounded delays; Constrained minimization; Dijkstra's algorithm; Discrete delays; Low cost multicasting; Multicast trees

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; MULTIMEDIA SYSTEMS; NETWORK PROTOCOLS; QUALITY OF SERVICE; WIDE AREA NETWORKS;

EID: 9644302667     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jpdc.2004.08.007     Document Type: Article
Times cited : (9)

References (24)
  • 2
    • 0035184115 scopus 로고    scopus 로고
    • Delay-constrained, low-cost multicast routing in multimedia networks
    • (Special Issue, "Routing in Computer and Communication Systems")
    • T. Alrabiah, T. Znati, Delay-constrained, low-cost multicast routing in multimedia networks, (Special Issue, "Routing in Computer and Communication Systems"), J. Parallel Distrib. Comput. 61 (9) (2001) 1307-1336.
    • (2001) J. Parallel Distrib. Comput. , vol.61 , Issue.9 , pp. 1307-1336
    • Alrabiah, T.1    Znati, T.2
  • 3
    • 85013570276 scopus 로고
    • Core-based trees (CBT) an architecture for scalable inter-domain multicast routing
    • T. Ballardie, P. Francis, J. Crowcroft, Core-based trees (CBT) an architecture for scalable inter-domain multicast routing, Comput. Comm. Rev. 23 (4) (1993) 85-95.
    • (1993) Comput. Comm. Rev. , vol.23 , Issue.4 , pp. 85-95
    • Ballardie, T.1    Francis, P.2    Crowcroft, J.3
  • 4
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E.W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1 (1959) 269-271.
    • (1959) Numer. Math. , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 5
    • 0033880792 scopus 로고    scopus 로고
    • Deployment issues for the ip multicast service and architecture
    • C. Diot, B.N. Levine, B. Lyles, H. Kassem, D. Balensiefen, Deployment issues for the ip multicast service and architecture, IEEE Network 14 (1) (2000) 78, 88.
    • (2000) IEEE Network , vol.14 , Issue.1 , pp. 78
    • Diot, C.1    Levine, B.N.2    Lyles, B.3    Kassem, H.4    Balensiefen, D.5
  • 6
    • 0027303605 scopus 로고
    • How bad is naive multicast routing
    • San Francisco, CA
    • M. Doar, I. Leslie, How bad is naive multicast routing, in: Proceedings of IEEE INFOCOM, San Francisco, CA, 1993, pp. 82-93.
    • (1993) Proceedings of IEEE INFOCOM , pp. 82-93
    • Doar, M.1    Leslie, I.2
  • 7
    • 84987014337 scopus 로고
    • Reduction test for the steiner problem in graphs
    • C.W. Duin, A. Volgenant, Reduction test for the steiner problem in graphs, Networks 19 (1989) 549-567.
    • (1989) Networks , vol.19 , pp. 549-567
    • Duin, C.W.1    Volgenant, A.2
  • 9
    • 0036476311 scopus 로고    scopus 로고
    • On multicast flow control for heterogeneous receivers
    • R. Gau, Z. Haas, B. Krishnamachari, On multicast flow control for heterogeneous receivers, IEEE/ACM Trans. Networking 10 (1) (2002) 86-101.
    • (2002) IEEE/ACM Trans. Networking , vol.10 , Issue.1 , pp. 86-101
    • Gau, R.1    Haas, Z.2    Krishnamachari, B.3
  • 11
    • 34249756853 scopus 로고
    • Balancing minimum spanning trees and shortest-path trees
    • S. Khuller, B. Raghavachari, N. Young, Balancing minimum spanning trees and shortest-path trees, Algorithmica 15 (14) (1995) 305-321.
    • (1995) Algorithmica , vol.15 , Issue.14 , pp. 305-321
    • Khuller, S.1    Raghavachari, B.2    Young, N.3
  • 13
    • 34250246836 scopus 로고
    • A fast algorithm for steiner trees
    • L. Kou, G. Markowsky, L. Berman, A fast algorithm for steiner trees, Acta Inform. 15 (1981) 141-145.
    • (1981) Acta Inform. , vol.15 , pp. 141-145
    • Kou, L.1    Markowsky, G.2    Berman, L.3
  • 14
    • 0036476132 scopus 로고    scopus 로고
    • The impact of point-to-multipoint traffic-concentration on multirate networks design
    • R. Meddeb, A. Girard, C. Rosenberg, The impact of point-to-multipoint traffic-concentration on multirate networks design, IEEE/ACM Trans. Networking 10 (1) (2002) 54-66.
    • (2002) IEEE/ACM Trans. Networking , vol.10 , Issue.1 , pp. 54-66
    • Meddeb, R.1    Girard, A.2    Rosenberg, C.3
  • 15
    • 0028485172 scopus 로고
    • Multicast routing extensions for OSPF
    • J. Moy, Multicast routing extensions for OSPF, Comm. ACM 37 (8) (1994) 61-66.
    • (1994) Comm. ACM , vol.37 , Issue.8 , pp. 61-66
    • Moy, J.1
  • 16
    • 0032139255 scopus 로고    scopus 로고
    • An iterative algorithm for delay-constrained minimum-cost multicasting
    • M. Parsa, Q. Zhu, J. Garcia-Luna-Aceves, An iterative algorithm for delay-constrained minimum-cost multicasting, IEEE/ACM Trans. Networking 6 (4) (1998) 461-474.
    • (1998) IEEE/ACM Trans. Networking , vol.6 , Issue.4 , pp. 461-474
    • Parsa, M.1    Zhu, Q.2    Garcia-Luna-Aceves, J.3
  • 17
    • 0003843663 scopus 로고    scopus 로고
    • Distance vector multicast routing protocol
    • T. Pusateri, Distance vector multicast routing protocol, Internet Draft.
    • Internet Draft.
    • Pusateri, T.1
  • 18
    • 0032292943 scopus 로고    scopus 로고
    • Algorithms for delay-constrained low-cost multicast tree construction
    • S. Raghavan, G. Manimaran, C.S.R. Murthy, Algorithms for delay-constrained low-cost multicast tree construction, Comput. Comm. 21 (18) (1998) 1693-1706.
    • (1998) Comput. Comm. , vol.21 , Issue.18 , pp. 1693-1706
    • Raghavan, S.1    Manimaran, G.2    Murthy, C.S.R.3
  • 19
    • 0031124754 scopus 로고    scopus 로고
    • Evaluation of multicast routing algorithms for real-time communication on high-speed networks
    • H. Salama, D. Reeves, Y Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, IEEE J. Selected Areas Comm. 15 (3) (1997) 332-334.
    • (1997) IEEE J. Selected Areas Comm. , vol.15 , Issue.3 , pp. 332-334
    • Salama, H.1    Reeves, D.2    Viniotis, Y.3
  • 21
    • 0002601806 scopus 로고    scopus 로고
    • An efficient delay-constrained multicast routing algorithm
    • Q. Sun, H. Langendoerfer, An efficient delay-constrained multicast routing algorithm, J. High-Speed Networks 7(1) (1998).
    • (1998) J. High-speed Networks , vol.7 , Issue.1
    • Sun, Q.1    Langendoerfer, H.2
  • 22
    • 0033909171 scopus 로고    scopus 로고
    • Multicast routing and its qos extension
    • B. Wang, J. Hou, Multicast routing and its qos extension, IEEE Network 14 (1) (2000) 22, 36.
    • (2000) IEEE Network , vol.14 , Issue.1 , pp. 22
    • Wang, B.1    Hou, J.2
  • 23
    • 0024123493 scopus 로고
    • Routing of multipoint connections
    • B.M. Waxman, Routing of multipoint connections, IEEE J. Selected Areas Comm. 6 (9) (1988) 1611-1622.
    • (1988) IEEE J. Selected Areas Comm. , vol.6 , Issue.9 , pp. 1611-1622
    • Waxman, B.M.1
  • 24
    • 0036476442 scopus 로고    scopus 로고
    • Qos-aware multicast routing for the internet: The design and evaluation of qosmic
    • S. Yan, M. Faloutsos, A. Banerjea, Qos-aware multicast routing for the internet: the design and evaluation of qosmic, IEEE/ACM Trans. Networking 10 (1) (2002) 54-66.
    • (2002) IEEE/ACM Trans. Networking , vol.10 , Issue.1 , pp. 54-66
    • Yan, S.1    Faloutsos, M.2    Banerjea, A.3


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