메뉴 건너뛰기




Volumn 10, Issue 2, 1999, Pages 183-189

Optimal routing for dynamic multipoint connection

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0043096508     PISSN: 1124318X     EISSN: None     Source Type: Journal    
DOI: 10.1002/ett.4460100208     Document Type: Article
Times cited : (6)

References (17)
  • 1
    • 0028532335 scopus 로고
    • Multicast routing based on predicted traffic statistics
    • October
    • Paul C. Huang, and Y. Tanaka. Multicast Routing Based on Predicted Traffic Statistics, In IEICE Trans. Communication, Vol. E77-B, No. 10, October 1994.
    • (1994) IEICE Trans. Communication , vol.E77-B , Issue.10
    • Huang, P.C.1    Tanaka, Y.2
  • 2
    • 85054013033 scopus 로고
    • Reliability and scaling issues in mulitcast communication
    • Oct.
    • B. Rajagopalan. Reliability and scaling issues in mulitcast communication. In Proc. ACM SIGCOMM, Baltimore. pages 55-89, Oct. 1992.
    • (1992) Proc. ACM SIGCOMM, Baltimore , pp. 55-89
    • Rajagopalan, B.1
  • 3
    • 0002184861 scopus 로고
    • Minimizing packet copies in multicast routing by exploiting geographic spread
    • July
    • James Kadirire. Minimizing Packet Copies in Multicast Routing by Exploiting Geographic Spread. ACM SIGCOMM CCR, Vol. 24, No. 3, July 1994.
    • (1994) ACM SIGCOMM CCR , vol.24 , Issue.3
    • Kadirire, J.1
  • 4
    • 0020717353 scopus 로고
    • Routing to multiple destination in computer network
    • K. Bharath-Kumar and J.M. Jaffe. Routing to Multiple Destination in Computer Network. IEEE Transactions on communications, Vol. COM-31, No. 3, pages 343-353, 1983.
    • (1983) IEEE Transactions on Communications , vol.COM-31 , Issue.3 , pp. 343-353
    • Bharath-Kumar, K.1    Jaffe, J.M.2
  • 5
    • 84863090748 scopus 로고
    • Steiner tree problems
    • Jan.
    • F.K. Hwang and D.S. Richards. Steiner Tree Problems. Networks, Vol. 22, No. 1, pages 55-89. Jan. 1992.
    • (1992) Networks , vol.22 , Issue.1 , pp. 55-89
    • Hwang, F.K.1    Richards, D.S.2
  • 6
    • 0007459114 scopus 로고
    • A source-based algorithm for delay-constrained minimum-cost mulitcasting
    • April
    • Q. Zhu, M. Parsa and J.J. Garcia-Luna-Aceves. A source-based algorithm for delay-constrained minimum-cost mulitcasting. In Proc. IEEE INFOCOM, Boston, MA. pages 377-385, April 1995.
    • (1995) Proc. IEEE INFOCOM, Boston, MA , pp. 377-385
    • Zhu, Q.1    Parsa, M.2    Garcia-Luna-Aceves, J.J.3
  • 7
  • 10
    • 34250246836 scopus 로고
    • A fast algorithm for steiner trees
    • L. Kou, G. Markowsky, and L. Berman. A Fast Algorithm for Steiner Trees. Acta Informatica. Vol. 15, No. 11, 1981.
    • (1981) Acta Informatica , vol.15 , Issue.11
    • Kou, L.1    Markowsky, G.2    Berman, L.3
  • 15
    • 0031124754 scopus 로고    scopus 로고
    • Evaluation of multicast roouting algorithms for real-time communicastion on high-speed network
    • April
    • Hussein F. Salama, Douglas S. Reeves and Y. Viniotis. Evaluation of Multicast Roouting Algorithms for Real-Time Communicastion on High-Speed Network. IEEE Journal on Selected Areas In Communications, Vol. 15, No. 3, pages 332-345, April 1997.
    • (1997) IEEE Journal on Selected Areas in Communications , vol.15 , Issue.3 , pp. 332-345
    • Salama, H.F.1    Reeves, D.S.2    Viniotis, Y.3
  • 17


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