Journal of Communications and Networks

  • 제6권1호
  • /
  • Pages.46-59
  • /
  • 2004
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지

Topology Aggregation Schemes for Asymmetric Link State Information

  • Yoo, Young-Hwan (School of Computer Science and Engineering, Seoul National University) ;
  • Ahn, Sang-Hyun (chool of Computer Science, University of Seoul) ;
  • Kim, Chong-Sang (School of Computer Science and Engineering, Seoul National University)
  • 발행 : 2004.03.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

In this paper, we present two algorithms for efficiently aggregating link state information needed for quality-of-service (QoS) routing. In these algorithms, each edge node in a group is mapped onto a node of a shufflenet or a node of a de Bruijn graph. By this mapping, the number of links for which state information is maintained becomes aN (a is an integer, N is the number of edge nodes) which is significantly smaller than N2 in the full-mesh approach. Our algorithms also can support asymmetric link state parameters which are common in practice, while many previous algorithms such as the spanning tree approach can be applied only to networks with symmetric link state parameters. Experimental results show that the performance of our shufflenet algorithm is close to that of the full-mesh approach in terms of the accuracy of bandwidth and delay information, with only a much smaller amount of information. On the other hand, although it is not as good as the shufflenet approach, the de Bruijn algorithm also performs far better than the star approach which is one of the most widely accepted schemes. The de Bruijn algorithm needs smaller computational complexity than most previous algorithms for asymmetric networks, including the shufflenet algorithm.

키워드

참고문헌

  1. The ATM Forum, Private Network-Network Interface Specification Version 1.0 (PNNI 1.0), 1996
  2. W. C. Lee, 'Spanning tree for link state aggregation in large communication networks,' in Proc. IEEE INFOCOM'95, 1995. pp. 297-302
  3. W. C. Lee, 'Topology aggregation for hierarchical routing in ATM networks,' ACM SIGCOMM Compuer Communication Review, vol. 25, no. 2, pp. 82-92, Apr. 1995 https://doi.org/10.1145/210613.210625
  4. L. Guo and I. Matta, 'On state aggregation for scalable QoS routing,' in Proc. IEEEATM'98, 1998, pp. 306-314
  5. A. Iwata et al., 'QOS aggregation algorithms in hierarchical ATM networks,' in Proc. IEEE ICC'98, 1998, pp. 243-248.
  6. W. C. Lee, 'Minimum equivalent subspanner algorithms for topology aggregation in ATM networks,' in Proc. 2nd Int. Conf. ATM'99, 1999, pp. 351-359
  7. T. Korkmaz and M. Krunz, 'Source-oriented topology aggregation with multiple QoS parameters in hierarchical ATM networks,' in Proc. Int. Workshop QoS, 1999, pp. 137-146
  8. I. Iliadis, 'Optimal PNNI complex node representations for restrictive costs and minimal path computation time,' IEEElACM Trans. Networking, vol. 8, no. 4, pp. 493-506, Aug. 2000 https://doi.org/10.1109/90.865077
  9. K. S. Lui and K. Nahrstedt, 'Topology aggregation and routing in bandwidth-delay sensitive networks,' in Proc. IEEE GLOBECOM 2000, 2000, pp. 410-414
  10. A. R. Ragozini et al., 'Analysis of the performance of a hierarchical PNNI networks,' in Proc. 2nd Int. Conf. ATM'99, 1999, pp. 365-374
  11. F. Hao and E. W. Zegura, 'On scalable QoS routing: Performance evaluation of topology aggregation,' in Proc. IEEE INFOCOM 2000, 2000, pp. 147-156
  12. B. Mukherjee, Optical Communication Networks, McGraw-Hill, 1997
  13. Y. Yoo et al., 'Border gateway protocol extensions for quality of service routing,' in Proc.lnt. Conf. Internet Computing, 2001, pp. 464-470
  14. D. Bertsekas and R. Gallager, Data Networks, Prentice-Hall, 1992
  15. B. Awerbuch and Y. Shavitt, 'Topology aggregation for directed Graphs,' IEEElACM Trans. Networking, vol. 9, no.T, pp. 82-90, Feb. 2001 https://doi.org/10.1109/90.909026
  16. M. H. MacDougall, Simulating Computer Systems Techniques and Tools, MIT Press, 1987