메뉴 건너뛰기




Volumn 26, Issue 10, 2003, Pages 1105-1128

Distributed multicast tree generation with dynamic group membership

Author keywords

Distributed Steiner algorithms; Dynamic multicast groups; Mobile networks; Multicast protocols

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; NETWORK PROTOCOLS; TREES (MATHEMATICS);

EID: 0037572349     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0140-3664(02)00239-6     Document Type: Article
Times cited : (4)

References (23)
  • 2
    • 0037892339 scopus 로고    scopus 로고
    • Core Based Trees (CBT Version 2) Multicast Routing Protocol Specification, September
    • A. Ballardie, Core Based Trees (CBT version 2) Multicast Routing Protocol Specification, RFC 2189, September 1997.
    • (1997) RFC , vol.2189
    • Ballardie, A.1
  • 3
    • 0038229763 scopus 로고    scopus 로고
    • Core Based Trees (CBT) Multicast Routing Architecture, September
    • A. Ballardie, Core Based Trees (CBT) Multicast Routing Architecture, RFC 2201, September 1997.
    • (1997) RFC , vol.2201
    • Ballardie, A.1
  • 5
    • 0031116865 scopus 로고    scopus 로고
    • ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm
    • Bauer F., Varma A. ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm. IEEE Journal on Selected Areas in Communications. 15:(3):1997;382-397.
    • (1997) IEEE Journal on Selected Areas in Communications , vol.15 , Issue.3 , pp. 382-397
    • Bauer, F.1    Varma, A.2
  • 6
    • 0030128291 scopus 로고    scopus 로고
    • Distributed algorithms for multicast path setup in data networks
    • Bauer F., Varma A. Distributed algorithms for multicast path setup in data networks. IEEE/ACM Transactions on Networking. 4:(2):1996;181-191.
    • (1996) IEEE/ACM Transactions on Networking , vol.4 , Issue.2 , pp. 181-191
    • Bauer, F.1    Varma, A.2
  • 9
    • 0027303605 scopus 로고
    • How bad is naïve multicast routing?
    • March, San Francisco, CA
    • Doar M., Leslie I. How bad is naïve multicast routing? IEEE INFOCOM. March:1993;82-89. San Francisco, CA.
    • (1993) IEEE INFOCOM , pp. 82-89
    • Doar, M.1    Leslie, I.2
  • 11
    • 0030655304 scopus 로고    scopus 로고
    • Delay constrained distributed multicast routing algorithm
    • Im Y., Lee Y., Wi S., Choi Y. Delay constrained distributed multicast routing algorithm. Computer Communications. 20:(1):1997;60-66.
    • (1997) Computer Communications , vol.20 , Issue.1 , pp. 60-66
    • Im, Y.1    Lee, Y.2    Wi, S.3    Choi, Y.4
  • 12
    • 0037554424 scopus 로고    scopus 로고
    • A dynamic multicast tree for loosely coupled conference
    • Poster Paper, November
    • S.G. Kim, Y.-M. Choi, S.T. Kim, Y.S. Kim, A dynamic multicast tree for loosely coupled conference, International Multimedia Conference, Poster Paper, November 1999, Available online at http://www.kom.e-technik.tu-darmstadt.de/acmmm99/ep/kimsanggil/.
    • (1999) International Multimedia Conference
    • Kim, S.G.1    Choi, Y.-M.2    Kim, S.T.3    Kim, Y.S.4
  • 13
    • 0032675676 scopus 로고    scopus 로고
    • A comparison of the internet multicast routing protocols
    • Lin J., Chang R.-S. A comparison of the internet multicast routing protocols. Computer Communications. 22:(2):1999;144-155.
    • (1999) Computer Communications , vol.22 , Issue.2 , pp. 144-155
    • Lin, J.1    Chang, R.-S.2
  • 15
    • 0032594122 scopus 로고    scopus 로고
    • A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees
    • Raghavan S., Manimaran G., Siva Ram Murthy C. A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. IEEE/ACM Transactions on Networking. 7:(4):1999;514-529.
    • (1999) IEEE/ACM Transactions on Networking , vol.7 , Issue.4 , pp. 514-529
    • Raghavan, S.1    Manimaran, G.2    Siva Ram Murthy, C.3
  • 16
    • 0031272664 scopus 로고    scopus 로고
    • A dynamic application-oriented multicast routing for virtual-path based ATM networks
    • Ryu B.H., Murata M., Miyahara H. A dynamic application-oriented multicast routing for virtual-path based ATM networks. IEICE Transactions on Communications. E80-B:(11):1997;1654-1663.
    • (1997) IEICE Transactions on Communications , vol.E80-B , Issue.11 , pp. 1654-1663
    • Ryu, B.H.1    Murata, M.2    Miyahara, H.3
  • 18
    • 0033904768 scopus 로고    scopus 로고
    • Improved fault recovery in core based trees
    • Schwiebert L., Chintalapati R. Improved fault recovery in core based trees. Computer Communications. 23:(9):2000;816-824.
    • (2000) Computer Communications , vol.23 , Issue.9 , pp. 816-824
    • Schwiebert, L.1    Chintalapati, R.2
  • 21
    • 0003311671 scopus 로고
    • Distance vector multicast routing protocol
    • November
    • D. Waitzman, C. Partridge, S. Deering, Distance Vector Multicast Routing Protocol, RFC 1075, November 1988.
    • (1988) RFC , vol.1075
    • Waitzman, D.1    Partridge, C.2    Deering, S.3
  • 23
    • 84987034438 scopus 로고
    • Steiner problem in networks: A survey
    • Winter P. Steiner problem in networks: a survey. Networks. 17:(2):1987;129-167.
    • (1987) Networks , vol.17 , Issue.2 , pp. 129-167
    • Winter, P.1


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