Browse > Article

Bypass-Based Star Aggregation Using Link Attributes for Improving the Information Accuracy  

Kwon, Sora (Department of Computer Science and Engineering, Hanyang University)
Jeon, Changho (Department of Computer Science and Engineering, Hanyang University)
Publication Information
Journal of Communications and Networks / v.17, no.4, 2015 , pp. 428-439 More about this Journal
Abstract
In this study, we present an approach for reducing the information inaccuracy of existing star aggregation based on bypass links when there are multi-constraint QoS parameters in asymmetric networks. In our approach, bypass links with low similarity are selected. Links that are not chosen as bypass links are included in each group depending on the star's link characteristics. Moreover, each link group is aggregated differently according to the similarity of the links that make up the group. The selection of a bypass link by using link similarity reduces the existing time complexity of O($N^3$) to O(N) by virtue of the simplification of the selection process. In addition, the adaptive integration according to the characteristics of the links in each group is designed to reduce the information inaccuracy caused by static aggregation. Simulation results show that the proposed method maintains low information distortion; specifically, it is 3.8 times lower than that of the existing method, even when the number of nodes in a network increases.
Keywords
Adaptive integration; bypass link; link similarity; service boundary line; star aggregation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M. Chamania and A. Jukan, "A survey of inter-domain peering and provisioning solutions for the next generation optical network," IEEE Commun. Survey & Tutorials, vol. 11, no. 1, pp. 33-51, 2009.
2 C. W. Ahn and R. S. Ramakrishna, "A genetic algorithm for shortest path routing problem and the sizing of populations," IEEE Trans. Evol. Comput., vol. 6, no. 6, pp. 566-579, 2002.   DOI
3 S. Uludag et al., "Analysis of topology aggregation techniques for QoS routing," ACM Comput. Surveys, vol. 39, no. 3, pp. 1-31, Aug. 2007.   DOI
4 W. C. Lee, "Spanning tree method for link state aggregation in large communication networks," in Proc. IEEE INFOCOM, Apr. 1995, pp. 297-302.
5 L. Lei, Y. Ji, and L. Guo, "Asymmetric attribute aggregation in hierarchical networks," IEICE Trans. Commun., vol. E90-B, no. 8, pp. 2034-2045, 2007.   DOI
6 J. P. Wang, C. P. Pan, and Q. W. Wu, "A topology aggregation algorithm based on asymmetric multi-domain optical network," in Proc. IEEE SOPO, 2009.
7 Y. Yoo, S. Ahn, and C. Kim, "Link state aggregation using a shufflenet in ATM PNNI networks," in Proc. IEEE GLOBECOM, 2000, pp. 481-486.
8 K. Lui, K. Nahrstedt, and C. Shigang, "Routing with topology aggregation in delay-bandwidth sensitive networks," IEEE/ACM Trans. Netw., vol. 12, no. 1, pp. 17-29, Feb. 2004.   DOI
9 J. Zhang and Y. Han, "New topology aggregation mechanisms for delaybandwidth sensitive networks," in Proc. IEEE ICCS, 2008.
10 S. Kwon and C. Jeon, "Star-based node aggregation for hierarchical QoS routing," KIPS Trans.: Part C, vol. 18-C, no. 5, pp. 361-368, Oct. 2011.
11 Private Network-Network Interface Specification Version 1.0, Mar. 1996.
12 S. Kwon and C. Jeon, "Link state information approximation for hierarchical QoS rouing," in Proc. IEEE ICISA, 2011, pp. 205-210.
13 G. Apostopoulos et al., "QoS routing mechanisms and OSPF extensions," RFC 2676, Internet Engineering Task Force, Aug. 1999.
14 B. M. Waxman, "Routing of multipoint connections," IEEE J. Sel. Areas Commun., vol. 6, pp. 1617-1622, Dec. 1988.   DOI
15 J. Reichardt, Structure in Complex Networks, Springer, 2009.
16 J. Zhang, Y. Han, and L. Wang, "Topology aggregation methods based on fitting staircase," in Proc. IEEE ICCEE, 2008, pp. 344-348.
17 Q. Liu et al., "Hierarchical interdomain routing and light-path provisioning in optical networks," J. Optical Netw., vol. 5, no. 10, pp. 764-774, 2006.   DOI