한국정보과학회논문지:정보통신 (Journal of KIISE:Information Networking)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

IP망에서 트래픽 분할에 의한 다중경로 멀티캐스트 경로설정

Multipath Multicast Routing by Traffic Splitting in IP Networks

  • 박구현 (홍익대학교 정보컴퓨터공학부) ;
  • 신용식 (SK Telecom Network연구원 4G개발팀)
  • 발행 : 2002.02.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 연구는 IP(Internet Protocol) 망에서 복수 트리경로에 의한 멀티캐스팅 방법을 제시한다. 트래픽 양에 대해 아크 비용이 비선형 함수이고 멀티캐스트 트래픽 수요가 대용량일 때, 단일의 트리경로 대신에 트래픽을 분할하여 복수개의 트리경로로 전송하는 것이 멀티캐스트 서비스 품질을 향상시킬 수 있다. 제시하는 멀티캐스팅 방법은 원하는 수준까지 트리경로를 추가하며, 주어진 트리경로 집합에 대해서 트래픽을 분할한다. 트래픽 분할을 위한 수학적 모형과 최적조건을 도출하였으며, 여러 개의 멀티캐스팅 트래픽을 동시에 전송하고자 할 때도 적용 가능하다. 적용 결과는 제안한 복수 트리경로에 의한 IP 멀티캐스팅 방법이 단-대-단 서비스 품질을 보장하는 데도 상당한 효과를 있음을 보인다.

This paper proposes an IP(Internet Protocol) multicast routing method by multiple tree routes. Multiple trees, instead of a single tree, improve the quality of multicast services with nonlinear link cost and huge traffic demand. The proposed method adds tree routes until it satisfies target conditions, and it splits the multicast traffic demand into the chosen tree routes. We develop a mathematical model and optimal conditions for traffic splitting. The method works on the problems with many different simultaneous multicast traffic. Various experiments were carried and the results show that the new multicasting is fairly effective on end-to-end quality of services.

키워드

참고문헌

  1. Huiterna, C., Routing in the Internet, Prentice Hall, 1995
  2. Kosiur, D., IP Multicasting, Wiley, 1998
  3. Kompella, V.P., Pasquale, J.C., Polyzos, G.C., 'Multicast routing for multimedia communication,' IEEE/ACM Transaction on Networking, Vol.1, No.3, 286-292, 1993 https://doi.org/10.1109/90.234851
  4. Leung, Y.-W., Yang, B.-T., Lower bound for multimedia multicast routing, IEE Proc.-Commm., Vol. 145, No. 2, pp. 87-90, 1998 https://doi.org/10.1049/ip-com:19981798
  5. Parsa, M., Zhu, Q., Garcia-Luna-Aceves, J.J., An iterative algorithm for delay-constrained minimum-cost multicasting, IEEE/ACM Transaction on Networking, Vol.6, No.4, 1998 https://doi.org/10.1109/90.720901
  6. Rouskas, G. N., Baldine, I., Multicast routing with end-to-end delay and delay variation constraints, IEEE INFOCOM '96, 353-360, 1996 https://doi.org/10.1109/49.564133
  7. Waxman, B.M., Routing of multipoint connections, IEEE Journal on Selected Areas in Communications, 6, pp.1617-1622, 1988 https://doi.org/10.1109/49.12889
  8. Ammar, M.K., Cheung, S.Y., Scoglio, C.M., Routing multipoint connections using virtual paths in an ATM networks, IEEE INFOCOM '93, 98-105, 1993 https://doi.org/10.1109/INFCOM.1993.253244
  9. Kim, S.B., An optimal VP-based multicast routing in ATM networks, IEEE INFOCOM '96, 1302-1309, 1996 https://doi.org/10.1109/INFCOM.1996.493077
  10. Park, K., Shin, Y.-S., Iterative bundle-based decomposition for large-scale nonseparable convex optimization, European Journal of Operational Research, 111, 598-616, 1998 https://doi.org/10.1016/S0377-2217(97)00350-0
  11. Erickson, R. E., Monma, C. L., Veinott, A. F., Send-and-split method for minimum-concave-cost network flows, Mathematics of Operational Research, Vol.12, No.4, 1987
  12. Kleinrock, L., Queueing Systems Volume II, Willey, 1976
  13. Schwartz, M., Telecommunication Networks:Protocols, Modeling and Analysis, Addison Wesley, 1988
  14. Ahuja, R.K., Magnanti, T.L., Orlin, J.B., Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, 1993
  15. Bazaraa, M.S., Sherali, H.D., Shetty, C.M., Nonlinear Programming: Theory and Algorithms, Wiley, 1993
  16. Garey, M.R, Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freedman and Company, 1979
  17. Wong, R.T., A dual ascent approach for steiner tree problem on a directed graph, Mathematical Programming, 28, 271-284, 1984 https://doi.org/10.1007/BF02612335
  18. Han, S.P., A globally convergent method for nonlinear programming, Journal of Optimization Theory and Applications, 22, 297-390, 1977 https://doi.org/10.1007/BF00932858
  19. Mangasarian, O.L., Nonlinear Programming Algorithm, Lecture Notes, Department of Computer Science, University of Wisconsin-Madison, 1986
  20. Using the CPLEX Callable Library, ILOG Inc, 1997