메뉴 건너뛰기




Volumn 7, Issue 2, 1998, Pages 113-139

Multicast routing with resource reservation

Author keywords

Integrated services Internet; Multicast; Quality of Service; Steiner heuristics

Indexed keywords


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

References (23)
  • 7
    • 0025430666 scopus 로고
    • Multicast routing in datagram Internetworks and extended LANs
    • May
    • S.E. Deering and D.P. Cheriton, Multicast routing in datagram Internetworks and extended LANs, ACM Trans. Computer Systems, May, 1990, 85-110.
    • (1990) ACM Trans. Computer Systems , pp. 85-110
    • Deering, S.E.1    Cheriton, D.P.2
  • 10
    • 0018051340 scopus 로고
    • Reverse path forwarding of broadcast packets
    • December
    • Y.K. Dalal and R.M. Metcalfe, Reverse path forwarding of broadcast packets, Commun. ACM, December, 1978, 1040-1048.
    • (1978) Commun. ACM , pp. 1040-1048
    • Dalal, Y.K.1    Metcalfe, R.M.2
  • 11
    • 85013570276 scopus 로고
    • Core based trees: An architecture for scalable interdomain multicast
    • A. Ballardie, J. Crowcroft and P. Francis, Core based trees: an architecture for scalable interdomain multicast, in: Proc. ACM SIGCOMM, 1993, pp. 85-95.
    • (1993) Proc. ACM SIGCOMM , pp. 85-95
    • Ballardie, A.1    Crowcroft, J.2    Francis, P.3
  • 13
    • 0024123493 scopus 로고
    • Routing of multipoint connections
    • B. Waxman, Routing of multipoint connections, IEEE JSAC 6(9) (1988), 1617-1622.
    • (1988) IEEE JSAC , vol.6 , Issue.9 , pp. 1617-1622
    • Waxman, B.1
  • 14
    • 34250246836 scopus 로고
    • A fast algorithm for Steiner trees
    • L. Kou, G. Markowski and L. Berman, A fast algorithm for Steiner trees, Acta Informatica 15 (1981), 141-145.
    • (1981) Acta Informatica , vol.15 , pp. 141-145
    • Kou, L.1    Markowski, G.2    Berman, L.3
  • 15
    • 0003147681 scopus 로고
    • The computation of nearly minimal Steiner tree in graphs
    • V.J. Rayward-Smith, The computation of nearly minimal Steiner tree in graphs, Intnl J. Math. Edu. Sci. Tech. 14(1) (1983), 15-23.
    • (1983) Intnl J. Math. Edu. Sci. Tech. , vol.14 , Issue.1 , pp. 15-23
    • Rayward-Smith, V.J.1
  • 16
    • 0020717353 scopus 로고
    • Routing to multiple destinations in computer networks
    • March
    • B.K. Kadaba and J.M. Jaffe, Routing to multiple destinations in computer networks, IEEE Trans. Commun., March, 1983, 343-351.
    • (1983) IEEE Trans. Commun. , pp. 343-351
    • Kadaba, B.K.1    Jaffe, J.M.2
  • 17
    • 0346865049 scopus 로고
    • Path finding algorithms for broadband multicast
    • Elsevier Science Publishers B.V. (North-Holland)
    • X. Jiang, Path finding algorithms for broadband multicast, in: High Speed Networking, III, Elsevier Science Publishers B.V. (North-Holland), 1991.
    • (1991) High Speed Networking, III
    • Jiang, X.1
  • 18
    • 0025888438 scopus 로고
    • On multicast path finding algorithms
    • C.-H. Chou, On multicast path finding algorithms, in: Proc. IEEE INFOCOM '91, 1991, pp. 1274-1283.
    • (1991) Proc. IEEE INFOCOM '91 , pp. 1274-1283
    • Chou, C.-H.1
  • 21
    • 0029736257 scopus 로고
    • Multicast tree generation in networks with asymmetric links
    • S. Ramanathan, Multicast tree generation in networks with asymmetric links, in: Proc. IEEE INFOCOM '95, 1995.
    • (1995) Proc. IEEE INFOCOM '95
    • Ramanathan, S.1
  • 22
    • 0347495606 scopus 로고
    • Competitive multicast routing
    • B. Awerbuch and Y. Azar, Competitive multicast routing, Wireless Networks 1 (1995), 107-114.
    • (1995) Wireless Networks , vol.1 , pp. 107-114
    • Awerbuch, B.1    Azar, Y.2


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