• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.1
• /
• pp.81-97
• /
• 2012

The objective of this paper is to investigate the 'state of the art' of the interdomain routing protocol BGP. First, BGP is critically reviewed focusing on the BGP policy and decision making process. And then the problems which still remain as open questions are investigated in the areas of 1) protocol stability, 2) traffic engineering and 3) quality of service. The recent research trend to answer the open questions is discussed.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.427-429
• /
• 2003

최근 IPv6 망에 멀티호밍을 제공하기 위한 연구 방향 중의 하나는 지리적 정보를 이용하는 것이다. 대표적인 메커니즘인 Geo for Now[1]은 지리적 위치 정보를 기반으로 주소를 할당하고 멀티호밍 제공 시 DFZ내의 글로벌 라우팅 테이블 엔트리가 급격히 증가되는 문제점을 해결하기 위한 방안을 제공한다. 그러나 [1]은 멀티호밍을 위하여 반드시 새로운 주소가 할당되어야 하며 멀티호밍 서비스를 요구하는 사이트가 증가되는 경우 확장성 문제를 야기한다. 본 논문에서는 지리적 위치 정보를 기반으로 IPv4 형식의 멀티호밍 기법을 그대로 적용하는 동시에 확장성 문제를 해결하기 위한 메커니즘을 제안한다. 제안된 메커니즘의 경우 지리적 위치 정보 및 확장된 BGP 속성의 사용으로 멀티호밍으로 인해 야기되는 상세한 경로 정보의 확산을 제한한다. 이로써 확장성의 문제를 발생시키지 않으면서도 IPv4 형식의 멀티호밍 기법을 사용함으로써 IPv4 멀티호밍에서 제공하던 기능들을 유사한 수준으로 제공할 수 있다.

• Journal of Internet Computing and Services
• /
• v.11 no.4
• /
• pp.41-49
• /
• 2010

Faloustsos et al.[1,2] showed successfully that the power-laws describe the heavy-tailed distributions of the AS level Internet topology properties such as node degree. This result allows us to represent the characteristics of AS-level Internet topology using some power-law exponents with elegant and simple. In this paper, we obtained the power-law exponents of the domestic AS-level Internet topology properties - the node degree, the number of pairs within hops, and eigenvalues of the graph - based on the valley-free BGP routing policy. We used the real data sets from UCLA IRL laboratory, and showed that these power-laws fit the real data pretty well resulting in correlation coefficient of 90.7%, 96.5%, and 97%, respectively. In particular, rounding the effective diameter to three, approximately 91% of the pairs of nodes are within this distance; that is, we might conclude our topology is pretty well organized.

• Journal of Internet Computing and Services
• /
• v.10 no.5
• /
• pp.1-12
• /
• 2009

A routing policy based on BGP community routing permits to select a specific route for particular network by making use of user-defined routing policies. Especially, community based routing policy is recently getting a great concern to enhance overall performance in the global research networks which are generally inter-connected large number of different characterized networks. In this paper, we analyze the community routing which has been applied in existing global research networks in the network performance point of view, and catch hold of problems caused by the routing performance in a new global research network. Then, we suggest an effective community routing policy model along with an interconnection architecture of research networks, in order to make correct some wrong routings and resolve an asymmetric routing problem, for a new global research network. Our work is expected to be utilized as an enabling base technology to improve the network performance of future global research networks as well as commercial networks.