The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지

Scalable Two Phases QoS Routing Scheme

확장가능한 2단계 QoS 라우팅 방식

  • 김승훈 (단국대학교 전자컴퓨터학부)
  • Published : 2003.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

본 논문에서는 대규모 고속 통신망에서 분산 멀티미디어 응용을 지원하기 위한 확장가능한 2단계의 QoS 라우팅 방식을 제안한다. QoS 라우팅 문제는 다중척도 최단거리 문제로 변형될 수 있으며 이는 NP-complete로 알려져 있다. 계층적 통신망을 위하여 제안된 라우팅 방식은 두 단계로 이루어져 있다. 첫번째 단계는 특정 응용의 요구와 관계없이 모든 수준의 도메인에서 들어오는 경계노드와 나가는 경계노드 쌍간에 도메인을 경유하는 횡단트래픽을 위한 경로의 QoS distance 값을 정기적으로 선계산한다. 두번째 단계는 응용에서의 요구가 왔을때 실행되며, 계층적 완전경로 계산에 필요한 그래프 구축을 위한 분산알고리즘이 실행된다. 이와같이 자원가용성 정보를 공시하지 않고 조회방식을 사용함으로써 정보의 flood로 생성되는 많은 통신 오버헤드를 줄일 수 있다. 제안된 알고리즘에서는 또한 기존의 방식에서 완전히 무시되거나 혹은 부분적으로 고려되었던 통신망의 위상도 고려하여 계층적 완전경로의 불완전성을 보완하였다. 마지막으로 대략적으로 계산된 계층적 완전경로부터 QoS 라우팅 문제를 체계적으로 분할하여 수준1 도메인의 경로로 확장하는 분산 알고리즘을 제안하였다.

Keywords

References

  1. C. Alaettinoglu and A.U. Shankar, 'The Viewserver Hierarchy for Interdomain Routing: Protocols and Evaluation' IEEE JSAC, 13(8), pp.1396-1410, October 1995
  2. Baruch Awerbuch and Yuval Shavitt, 'Topology Aggregation for Directed Graphs,' IEEE/ACM Transactions on Networking, 9(1), pp.82-90, Feb 2001 https://doi.org/10.1109/90.909026
  3. Shigang Chen, Klara Nahrstedt, 'An Overview of Quality-of-Service Routing for the Next Generation HighSpeed Networks: Problems and Solutions,' IEEE Network, pp. 64-79, November/December 1998
  4. Israel Cidon, Raphael Rom, and Yuval Shavitt, 'Bandwidth Reservation for Bursty Traffic in the Presence of Resource Availability Uncertainty,' Computer Communications, 22(10), pp.919-929, June 1999 https://doi.org/10.1016/S0140-3664(99)00059-6
  5. J.C.N. Climaco and E.Q.V. Maitins, 'On the Determination of the Nondominated Paths in a Multiobjective Network Problem,' Methods in Operations Research, 40, pp.255-258, 1981
  6. Fang Hao, Ellen W. Zegura, 'On Scalable QoS Routing: Performance E valuation of Topology Aggregation,' IEEE Infocom 2000, pp. 147-156, 2000
  7. M. Gondran and M. Minoux, Graphs and Algorithms, Wiley-International Series, 1984
  8. R. Guerin and A. Orda, 'QoS Routing in Networks with Inaccurate Informations: Theory and Algorithms,' IEEE/ACM Transactions on Networking, 7(3), pp.350-364, June 1999 https://doi.org/10.1109/90.779203
  9. M.I. Henig, 'The Shortest Path Problem with Two Objective Functions,' European Journal of Operational Research, 25, pp.281-291, 1985 https://doi.org/10.1016/0377-2217(86)90092-5
  10. S. Kim, K. Lim, and C. Kim, 'A Scalable QoS-based Inter-Domain Routing Scheme in a High Speed Wide Area Network,' Computer Communications, 21(4), pp.390-399, 1998 https://doi.org/10.1016/S0140-3664(97)00171-0
  11. 김승훈, "QoS 라우팅 문제분할에 적합한 경로선택 알고리즘,' 기술문서
  12. 김승훈, 김치하, '분산 멀티미디어 응용을 위한 대규모 고속 통신망에서의 QoS-근거 계층적 도메인간 라우팅 방식, 한국통신학회논문지, 24(7B), pp.1239--1251, July 1999
  13. 홍종준, 김승훈, 이균하 'QoS 경로의 효율적인 선계산을 위한 부하균등 비용산정 방식', 한국통신학회논문지, 26(11C), pp.140-147, November 2001
  14. Dean H. Lorenz, Arial Orda, 'QoS Roudng in Networks with Uncertain Parameters', IEEE/ACM Transactions on Networking, 6(6), pp.768-778, December 1998 https://doi.org/10.1109/90.748088
  15. Dean H. Lorenz, Ahal Orda, 'Optimal Partition of QoS Requirements on Unicast Paths and Multicast Trees,' IEEE/ACM Transactions on Networking, 10(1), pp. 102-114, 2002 https://doi.org/10.1109/90.986559
  16. Srihari Nelakuditi, Zhi-Li Zhang, and Rose P. Tsang, 'Adaptive Proportional Routing: A Localized QoS Routing Approach,' IEEE Infocom 2000, pp. 1566-1575, 2000
  17. Arial Orda, 'Routing with End-to-End QoS Guarantees in Broadband Networks', IEEE/ACM Transactions on Networking, 7(3), pp.365-374, June 1999 https://doi.org/10.1109/90.779205
  18. Arial Orda and Alexander Sprintson, 'QoS Routing: The Precomputation Perspective,' IEEE Infocom 2000, pp.128-136, 2002
  19. Arial Orda and Alexander Sprintson, 'AScalable Approach to the Partition of QoS Requirements in Unicast and Multicast,' IEEE Infocom 2002, pp.685-694, 2002
  20. Danny Raz and Yuval Shavitt, 'Optimal Partition of QoS Requirements with Discrete Cost Functions,' IEEE JSAC 2000, 18(12), pp.2593--2602, December 2000
  21. Private Network-Network Interface Specification Version 1.0 (PNNI 1.0), ATM Forum PNNI Subworking Group, af-pmii-0055.000, March 1996
  22. C.C. Skiscim and B.L. Golden, 'Solving k-Shortest and Constrained Shortest Path Problems Efficiently,' Annals of Operations Research, 20, pp.249-282, 1989