대한전자공학회논문지TC (Journal of the Institute of Electronics Engineers of Korea TC)

대한전자공학회 (The Institute of Electronics and Information Engineers)
권호 표지

지연시간을 고려한 최소비용의 동적 멀티캐스트 라우팅 알고리즘

A Distributed Low-cost Dynamic Multicast Routing Algorithm with Delay Constraints

  • 신민우 (동신대학교 컴퓨터응용학과) ;
  • 임형석 (전남대학교 전산학과)
  • 발행 : 2002.04.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

화상회의와 같은 실시간 멀티미디어 응용들은 종단간 엄격한 지연시간 준수를 요구하며 많은 네트워크 자원을 소비한다. 이러한 응용들의 효율적 관리를 위해 멀티캐스트 프로토콜은 주어진 종단간 지연시간을 만족하면서 멀티캐스트 트리의 비용을 최소화하는 라우팅 알고리즘을 필요로 한다. 하지만 그런 트리를 찾는 문제는 계산비용이 매우 높다고 알려져 있다. 그러므로 본 논문에서는 주어진 종단간 지연시간을 만족하는 멀티캐스트 트리를 찾는 계산비용을 감소하면서 트리의 평균 비용을 최소화하는 휴리스틱 분산형 멀티캐스트 라우팅 알고리즘을 제시한다. 또한 시뮬레이션을 통해 제시한 알고리즘이 기존 알고리즘에 비해 트리의 평균 비용 측면에서 우수함을 보인다.

Many real-time multimedia applications, such as video conferencing have stringent end-to-end delay constraints and consume large amount of network resources. In order to support these applications efficiently, multicast routing algorithms computing least cost multicast trees that satisfy a given end-to-end delay constraint are needed. However, finding such a tree is known to be computationally expensive. Therefore, we propose a heuristic distributed multicast routing algorithm that reduces a “finding multicast tree”that satisfies a given end-to-end delay constraint and minimizes the average resulting tree cost. Also, simulation results show that the proposed algorithm has much better average cost performance than other existing algorithms.

키워드

참고문헌

  1. Kompella, V. P.,et al., Multicast Routing for Multimedia Communication, IEEE/ACM Transactions on Networking, 1(3), pp. 286-292, 1993 https://doi.org/10.1109/90.234851
  2. Zhu, Q., et al., A Source-Based Algorithm for Near-Optimum Delay Constrained Multicasting, IEEE INFOCOM'95, pp. 377-385, 1995 https://doi.org/10.1109/INFCOM.1995.515898
  3. Wi, S. and Choi, Y., A Delay Constrained Distributed Multicast Routing Algorithm, 12th International Conference on Computer Communication, ICCC'95, pp. 833-838
  4. S. Deering, Multicast routing in Datagram Internetworks and Extended LANs, ACM Transactions on Computer Systems, Vol. 8, No. 2, pp. 85-110, May, 1990 https://doi.org/10.1145/78952.78953
  5. D. Waitzman, C. Partridge and S. Deering, Distance Vector Multicast Routing Protocol, RFC1075, Nov., 1988
  6. S. Deering, Host Extensions for IP Multicasting, RFC1112, May. 1992
  7. D.Estrin, Y.Rekhter, and S.Hotz, A unified Approach to Inter-Domain Routing, RFC1322, May. 1992
  8. A. Ballardie, P. Tsuchiya and J. Crowcroft, Core Based Trees(CBT)-Scalable Multicast Routing, Internet Draft, Apr., 1993
  9. A. Ballardie, P. Francis, and J. Crowcroft, Core Bases Trees(CBT)-An Architecture for Scalable Inter-Domain Multicast Routing, ACM SIGCOMM'93, Apr., 1993 https://doi.org/10.1145/166237.166246
  10. Biersack, E. and Nonnenmacher J., WAVE: A New Multicast Routing Algorithm for Static and Dynamic Multicast Groups, proceedings of 5th Workshop on Network and Operating System Support for Digital Audio and Video, 1995
  11. Q.Sun and H.Langendorfer., A New Distributed Routing Algorithm for Supporting Delay Sensitive Application, International Report, Institute of Operating Systems and Computer Networks, TU Braunschweig, Germany, March 1997
  12. Q. Sun and H. Langendorfer., A Distributed Delay-Constrained Dynamic Multicast Routing Algorithm, European Workshop on Interactive Distributed Multimedia Systems and Telecommunicaion Services (IDMS'97), 1997
  13. Salama, H.F., et al. Evaluation of Multicast Routing Algorithms for Real Time Communication on High-Speed Networks, High Performance Networking VI, IFIP 6th International Conference on High Performance Networking, pp. 27-42, 1995
  14. Waxman, B.M, Routing of Multipoint Connections, IEEE Journal on Selected Areas in Communications, 6(9), pp.1617-1622, 1988 https://doi.org/10.1109/49.12889