DOI QR코드

DOI QR Code

Star-Based Node Aggregation for Hierarchical QoS Routing

계층적 QoS 라우팅을 위한 스타 기반의 노드 집단화

  • 권소라 (한양대학교 컴퓨터공학과) ;
  • 전창호 (한양대학교 전자컴퓨터공학과)
  • Received : 2011.06.09
  • Accepted : 2011.08.17
  • Published : 2011.10.31

Abstract

In this study, we present a method for efficiently aggregating networks state information required to determine feasible paths in transport networks that uses the source routing algorithm for hierarchical QoS routing. It is proposed to transform the full mesh topology whose Service Boundary Line serves as its logical link into the star topology. This is an aggregation method that can be used when there are two or more QoS parameters for the link to be aggregated in an asymmetric network, and it improves the information accuracy of the star topology. For this purpose, the Service Boundary Line's 3 attributes, splitting, joining and integrating, are defined in this study, and they are used to present a topology transformation method. The proposed method is similar to space complexity and time complexity of other known techniques. But simulation results showed that aggregated information accuracy and query response accuracy is more highly than that of other known method.

본 논문에서는 계층적 QoS 라우팅을 위해 소스 라우팅 방식을 채택하고 있는 전달망에서 적정 경로를 배정하기 위해 필요로 하는 망의 상태 정보를 효율적으로 집단화하는 방법을 제안한다. 이것은 비대칭망에서 집단화 할 링크의 QoS 파라미터가 두 개 이상일 때 기존 스타 집단화 방법이 갖는 집단화된 정보의 부정확성을 줄이기 위한 방법으로, 서비스경계라인을 논리 링크로 갖는 풀 메쉬 토폴로지를 스타 토폴로지로 변형한다. 이를 위해 본 논문에서는 서비스경계라인의 3가지 속성인 분할, 조인 그리고 통합을 정의하며 이 속성들을 이용한 스타 토폴로지로의 변형과 풀 메쉬로의 복원 방법을 제시한다. 제안 방법은 기존 방법과 유사한 공간 복잡도와 시간 복잡도를 갖지만 집단화된 정보의 정확도와 질의 응답 정확도는 기존 방법보다 높다는 것을 실험을 통해 알 수 있었다.

Keywords

References

  1. Private Network-Network Interface Specification Version 1.0, Mar., 1996.
  2. Architecture for the Automatically Switched Optical Network, ITU-T Rec. G.8080/Y.1304, Nov., 2001.
  3. S.Uludag, K.Lui, Nahrstedt and G.Grewster, "Analysis of topology aggregation techniques for QoS routing," ACM Computing Surveys, Vol.39, No.3, pp.1-31, Aug., 2007. https://doi.org/10.1145/1216370.1216371
  4. Fang Hao, Ellen W. Zegura, "On scalable QoS routing : Performance Evaluation of Topology Aggregation", IEEE Infocom pp.147-156, 2000.
  5. W.C. Lee, "Spanning tree method for link state aggregation in large communication networks," IEEE INFOCOM, pp.297-302, April, 1995.
  6. Sora Kwon, Changho Jeon, "Link state information approximation for hierarchical QoS routing," IEEE ICISA, pp.205-210, April, 2011.
  7. King-Shan Lui, Nahrstedt, K., Shigang Chen, "Routing with topology aggregation in delay-bandwidth sensitive networks", IEEE/ACM Transactions , Vol.3, pp.17-29, Feb., 2004.
  8. Y.Tang , S.Chen, "QoS information approximation for aggregated networks," IEEE ICC, Paris, France, pp.3284-3299, June, 2004.
  9. J.Zhang, Y.Han, L.Wang, "Topology Aggregation Methods Based on Fitting Staircase," ICCEE, pp.344-348, 2008.
  10. A. Iwata, H. Suzuki, R. Izmailov and B.Sengupta, "QoS Aggregation Algorithms in Hierarchical ATM Networks," IEEE ICC, pp.243-248, 1998.
  11. I. Iliadis, "Optimal PNNI Complex Node Representation for Restrictive Costs and Minimal Path Computation time," IEEE/ACM trans, netw.8, August, 2000.
  12. W.C. Lee, "Minimum Equivalent Subspanner Algorithm for Topology Aggregation in ATM Networks," 2nd ICATM, pp.351-359, 1999.
  13. B.M. Waxman, "Routing of Multipoint Connections", IEEE Journal of selected Area in Communications, pp.1617-1622, December, 1988.

Cited by

  1. Spanning Tree Aggregation Using Attribute of Service Boundary Line vol.18C, pp.6, 2011, https://doi.org/10.3745/KIPSTC.2011.18C.6.441