메뉴 건너뛰기




Volumn 65, Issue 4, 2012, Pages 875-894

Solve the tree setup problem and minimize control overhead for high-density members in delay-bounded distributed multicast networks

Author keywords

Dangling nodes; Delay bounded multicast routing; Distributed multicast; Minimum Steiner tree; The tree setup break problem

Indexed keywords

DANGLING NODES; MULTICAST ROUTING; MULTICASTS; STEINER TREES; THE TREE SETUP-BREAK PROBLEM;

EID: 84864626227     PISSN: 09296212     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11277-011-0317-4     Document Type: Article
Times cited : (1)

References (22)
  • 1
    • 0030128291 scopus 로고    scopus 로고
    • Distributed algorithms for multicast path setup in data networks
    • PII S1063669296027227
    • Bauer, F., & Varma, A. (1996). Distributed algorithms for multicast path setup in data networks. IEEE/ACM Transactions on Networking, 4, 181-191. (Pubitemid 126784914)
    • (1996) IEEE/ACM Transactions on Networking , vol.4 , Issue.2 , pp. 181-191
    • Bauer, F.1    Varma, A.2
  • 6
    • 29844438754 scopus 로고    scopus 로고
    • Comments and an improvement on "A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks"
    • DOI 10.1109/TNET.2005.860091
    • Huang, T.-L., & Lee, D.-T. (2005). Comments and an improvement on a distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transactions on Networking, 13, 1410-1411. (Pubitemid 43034146)
    • (2005) IEEE/ACM Transactions on Networking , vol.13 , Issue.6 , pp. 1410-1411
    • Huang, T.-L.1    Lee, D.T.2
  • 7
    • 0002991522 scopus 로고    scopus 로고
    • A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks
    • PII S106366929809579X
    • Jia, X. (1998). A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks. IEEE/ACM Transactions on Networking, 6, 828-837. (Pubitemid 128745475)
    • (1998) IEEE/ACM Transactions on Networking , vol.6 , Issue.6 , pp. 828-837
    • Jia, X.1
  • 8
    • 39649101946 scopus 로고    scopus 로고
    • Research on multicast routing protocols for mobile Ad-hoc networks
    • Junhai, L., Liu, X., & Danxia, Y. (2008). Research on multicast routing protocols for mobile Ad-hoc networks. Computer Networks, 52, 988-997.
    • (2008) Computer Networks , vol.52 , pp. 988-997
    • Junhai, L.1    Liu, X.2    Danxia, Y.3
  • 11
    • 34250246836 scopus 로고
    • A fast algorithm for steiner trees
    • Kou, L., Markowsky, G., & Berman, L. (1981). A fast algorithm for steiner trees. Acta Informatica, 15, 141-145.
    • (1981) Acta Informatica , vol.15 , pp. 141-145
    • Kou, L.1    Markowsky, G.2    Berman, L.3
  • 12
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • Kruskal, J. B. (1956). On the shortest spanning subtree of a graph and the traveling salesman problem. The American Mathematical Society, 7, 48-50.
    • (1956) The American Mathematical Society , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 13
    • 44549086905 scopus 로고    scopus 로고
    • An efficient mobile multicast mechanism for fast handovers: A study from design and implementation in experimental networks
    • Kwon, D.-H., Kim, W.-J., & Suh, Y.-J. (2008). An efficient mobile multicast mechanism for fast handovers: A study from design and implementation in experimental networks. Computer Communications, 31, 2162-2177.
    • (2008) Computer Communications , vol.31 , pp. 2162-2177
    • Kwon, D.-H.1    Kim, W.-J.2    Suh, Y.-J.3
  • 14
    • 20344399402 scopus 로고    scopus 로고
    • Large-scale cooperative caching and application-level multicast in multimedia content delivery networks
    • DOI 10.1109/MCOM.2005.1453429
    • Ni, J., & Tsang, D. H. K. (2005). Large-scale cooperative caching and application-level multicast in multimedia content delivery networks. IEEE Communication Magazine, 43, 98-105. (Pubitemid 40784472)
    • (2005) IEEE Communications Magazine , vol.43 , Issue.5 , pp. 98-105
    • Ni, J.1    Tsang, D.H.K.2
  • 15
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • Prim, R. (1957). Shortest connection networks and some generalizations. Bell Systems Technical Journal, 36, 1389-1401.
    • (1957) Bell Systems Technical Journal , vol.36 , pp. 1389-1401
    • Prim, R.1
  • 16
    • 37149028731 scopus 로고    scopus 로고
    • A service-centric multicast architecture and routing protocol
    • DOI 10.1109/TPDS.2007.70711
    • Yang, Y., Wang, J., & Yang, M. (2008). A service-centric multicast architecture and routing protocol. IEEE Transactions on Parallel and Distributed Systems, 19, 35-51. (Pubitemid 350253594)
    • (2008) IEEE Transactions on Parallel and Distributed Systems , vol.19 , Issue.1 , pp. 35-51
    • Yang, Y.1    Wang, J.2    Yang, M.3
  • 17
    • 84987034438 scopus 로고
    • Steiner problem in networks: A survey
    • Winter, P. (1987). Steiner problem in networks: A survey. Networks, 17, 129-167.
    • (1987) Networks , vol.17 , pp. 129-167
    • Winter, P.1
  • 18
    • 0007459114 scopus 로고
    • A source-based algorithm for delay-constrained minimum-cost multicasting
    • Boston, USA
    • Zhu, Q., Parsa, M., & Garcia-Luna-Aceves, J. J. (1995). A source-based algorithm for delay-constrained minimum-cost multicasting, IEEE INFOCOM'95, (pp. 377-385). Boston, USA.
    • (1995) IEEE INFOCOM'95 , pp. 377-385
    • Zhu, Q.1    Parsa, M.2    Garcia-Luna-Aceves, J.J.3
  • 22
    • 84864594259 scopus 로고    scopus 로고
    • The GNU Compiler Collection - GCC
    • The GNU Compiler Collection - GCC, Available from. http://gcc.gnu.org/.


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