• 제목/요약/키워드: inter-domain routing

검색결과 29건 처리시간 0.021초

Assessing Resilience of Inter-Domain Routing System under Regional Failures

  • Liu, Yujing;Peng, Wei;Su, Jinshu;Wang, Zhilin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권4호
    • /
    • pp.1630-1642
    • /
    • 2016
  • Inter-domain routing is the most critical function of the Internet. The routing system is a logical network relying on the physical infrastructure with geographical characteristics. Nature disasters or disruptive accidents such as earthquakes, cable cuts and power outages could cause regional failures which fail down geographically co-located network nodes and links, therefore, affect the resilience of inter-domain routing system. This paper presents a model for regional failures in inter-domain routing system called REFER for the first time. Based on REFER, the resilience of the inter-domain routing system could be evaluated on a finer level of the Internet, considering different routing policies of intra-domain and inter-domain routing systems. Under this model, we perform simulations on an empirical topology of the Internet with geographical characteristics to simulate a regional failure locating at a city with important IXP (Internet eXchange Point). Results indicate that the Internet is robust under a city-level regional failure. The reachability is almost the same after the failure, and the reroutings occur at the edge of the Internet, hardly affecting the core of inter-domain routing system.

Policy Management for BGP Routing Convergence Using Inter-AS Relationship

  • Jeong, Sang-Jin;Youn, Chan-Hyun;Park, Tae-Sang;Jeong, Tae-Soo;Lee, Daniel;Min, Kyoung-Seon
    • Journal of Communications and Networks
    • /
    • 제3권4호
    • /
    • pp.342-350
    • /
    • 2001
  • The Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency, and delayed routing convergence. At the extreme, high levels of routing instability can lead to the loss of internal connectivity in wide-area networks. In this paper, we investigate the variation of domain degree and domain count of the inter-domain network over time by using linear regression model in order to analyze the topology variation of inter-domain network. We Also propose an efficient policy management model to reduce the instability in the inter-domain routing system. The proposed model can be used to identify whether a routing policy is adequate to reduce convergence time that is required to return to a normal state when BGP routing instability happens. Experimental analysis shows that the proposed model can be used to set up routing policy in domains for the purpose of minimizing the effects and the propagation of BGP routing instability.

  • PDF

Hierarchical Inter-Domain based QoS Routing in a Wide Area of Network (대규모 네트워크를 위한 계층적 도메인간 QoS 라우팅)

  • Hong Jong-Joon
    • Journal of the Korea Society of Computer and Information
    • /
    • 제10권3호
    • /
    • pp.209-217
    • /
    • 2005
  • In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources' costs for precomputation schemes in hierarchical routing is proposed. and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme.

  • PDF

New Approach to Inter-domain Multicast Protocols

  • Leal, Raquel Perez;Cachinero, Juan Angel;Martin, Encarna Pastor
    • ETRI Journal
    • /
    • 제33권3호
    • /
    • pp.355-365
    • /
    • 2011
  • IPTV broadcast channels and video content distribution are increasingly saturating network paths. New solutions based on inter-domain multicast protocols could contribute to the enhancement of multimedia content distribution over the Internet. The aim of this paper is to propose new capabilities for an existing inter-domain multicast protocol, the Protocol Independent Multicast-Sparse Mode. We describe the modified protocol and analyze its behavior using newly developed tools based on an open-source software simulator. The resulting protocol does not require topology information, which is advantageous for easier deployment. In addition, the adopted solution avoids inherent problems with inter-domain multicast routing, such as multiple paths and path asymmetries.

An efficient Load Balanced Cost Calculation Scheme for QoS Routing (QoS 라우팅을 위한 부하균등 비용산정 방식)

  • Hong, Jong-Joon;Kim, Seung-Hoon;Lee, Kyoon-Ha
    • The KIPS Transactions:PartC
    • /
    • 제9C권1호
    • /
    • pp.135-140
    • /
    • 2002
  • An efficient QoS routing scheme needs to find a path that satisfies a given QoS requirements while consuming as few resources as Possible. In this paper, we propose two schemes of calculating resources'costs one for on-demand and one for precomputation QoS routing schemes. These schemes are effective in respect to the global network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and Intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multip1e paths between all pairs of ingress and ogress border routers while considering balancing of the expected load. We, therefore, expect that the paths are bettor than any other paths in respect to reserving the network resources on Paths. The routine: scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. cote that our cost calculation schemes for both kinds of traffic could be used in existing QoS routing protocols without and modification in small and large scale of networks.

Hierarchical Inter-domain Load Balanced QoS Routing (계층적 도메인간 부하분산 QoS 라우팅)

  • Hong, Jong-Joon;Kim, Seung-Hoon;Lee, Kyoon-Ha
    • The KIPS Transactions:PartC
    • /
    • 제9C권5호
    • /
    • pp.671-678
    • /
    • 2002
  • In this paper, we propose hierarchical inter-domain load balanced QoS routing in a large scale of network. And a scheme of calculating resources'costs for precomputation schemes in hierarchical routing is proposed, and a scheme for selecting a path among multiple precomputed paths is proposed. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes K multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load then selects paths with the probability of path selection. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And these schemes make possible both global network resources' utilization and also load balancing.

Load Balanced Cost Calculation Scheme for Efficient Precomputation of QoS Routes (QoS경로의 효율적인 선계산을 위한 부하균등 비용산정 방식)

  • 홍종준;김승훈;이균하
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제26권11C호
    • /
    • pp.140-147
    • /
    • 2001
  • In this paper, we propose a scheme of calculating resources\` costs for precomputation in QoS routing schemes. This scheme is effective in respect to the g1oba1 network utilization and the balanced use of network resources. We also propose a QoS routing scheme for transit and intra traffic in a large scale of domain-based network. For a domain in the network, the routing scheme first precomputes multiple paths between all pairs of ingress and egress border routers while considering balancing of the expected load and then selects paths with the probability of path selection. We, therefore, expect that the paths are better than any other paths in respect to reserving the network resources on paths. The routing scheme combines inter and intra domain routings seamlessly and uses the same cost calculation scheme. And for analysis of a load balancing cost calculation proposed a simulation is done.

  • PDF

An Impact of Addressing Schemes on Routing Scalability

  • Ma, Huaiyuan;Helvik, Bjarne E.;Wittner, Otto J.
    • Journal of Communications and Networks
    • /
    • 제13권6호
    • /
    • pp.602-611
    • /
    • 2011
  • The inter-domain routing scalability issue is a major challenge facing the Internet. Recent wide deployments of multihoming and traffic engineering urge for solutions to this issue. So far, tunnel-based proposals and compact routing schemes have been suggested. An implicit assumption in the routing community is that structured address labels are crucial for routing scalability. This paper first systematically examines the properties of identifiers and address labels and their functional differences. It develops a simple Internet routing model and shows that a binary relation T defined on the address label set A determines the cardinality of the compact label set L. Furthermore, it is shown that routing schemes based on flat address labels are not scalable. This implies that routing scalability and routing stability are inherently related and must be considered together when a routing scheme is evaluated. Furthermore, a metric is defined to measure the efficiency of the address label coding. Simulations show that given a 3000-autonomous system (AS) topology, the required length of address labels in compact routing schemes is only 9.12 bits while the required length is 10.64 bits for the Internet protocol (IP) upper bound case. Simulations also show that the ${\alpha}$ values of the compact routing and IP routing schemes are 0.80 and 0.95, respectively, for a 3000-AS topology. This indicates that a compact routing scheme with necessary routing stability is desirable. It is also seen that using provider allocated IP addresses in multihomed stub ASs does not significantly reduce the global routing size of an IP routing system.

Performance Analysis of Web Service Architecture for Inter-AS DiffServ-over-MPLS Traffic Engineering

  • Sundaram Shanmugham;Chae Youngsu;Kim Young-Tak
    • The Journal of Information Systems
    • /
    • 제14권3호
    • /
    • pp.9-16
    • /
    • 2005
  • In this paper, the performance of the WebService architecture for QoS guaranteed connection provisioning in inter-AS domain networks has been measured and analyzed for service publish/inquiry, collection of NMSs ASBR details, source routing by ingress NMS in constraint based routing and connection establishment. From the analysis, it has been found that, the connection between inter-AS domain networks can be established within the usual time limits of 3 seconds by the Web Service architecture. Since no standard solutions have been implemented in Interdomain QoS provisioning, this performance analysis assures Web Service architecture as a promising solution and can be easily implemented in the early stages of MPLS network employment.

  • PDF

Analysis of Inter-Domain Collaborative Routing: Provider Competition for Clients

  • Nicholes, Martin O;Chuah, Chen-Nee;Wu, Shyhtsun Felix;Mukherjee, Biswanath
    • Journal of Communications and Networks
    • /
    • 제13권5호
    • /
    • pp.499-510
    • /
    • 2011
  • Any server offering a routing service in the Internet would naturally be in competition for clients, and clients may need to utilize service from a specific server in order to achieve a desired result. We study the various properties of this competition, such as the fraction of route requests handled by a routing service provider and the fraction of total revenue obtained. As the routing service providers (i.e., servers or routers in this context) compete, they may alter behavior in order to optimize one of the above properties. For example, a service provider may lower the price charged for its service, in order to increase the number of clients served. Our models are based on servers offering a routing service to clients within representative network topologies based on actual Internet sub-graphs. These models provide, a framework for evaluating competition in the Internet. We monitor key aspects of the service, as several variables are introduced into the models. The first variable is the fraction of client requests that will pay more for a better quality route. The remaining requests are normal client requests that are satisfied by the most economical route. The second variable is the fraction of servers who choose to lower service prices in order to maximize the number of client requests served. As this fraction increases, it is more likely that a server will lower the price. Finally, there are some resource constraints applied to the model, to increase the difficulty in providing a routing solution, i.e., to simulate a realistic scenario. We seek to understand the effect on the overall network, as service providers compete. In simple cases, we show that this competition could have a negative impact on the overall efficiency of a service. We show that the routing variety present in the larger models is unable to mask this tendency and the routing service performance is decreased due to competition.