Cost-Effective Allocation Of Nested Routing Relay Node Resources

By implementing an overlay routing system, the ability to adjust various routing features (such as latency or TCP throughput) is available, without requiring any changes to the underlying standards. However, laying the groundwork for overlays involves setting up the overlay infrastructure. Here we have an optimization challenge that arises: The smallest set of overlay nodes to find is one that is sufficient to provide the necessary routing features. To prove that in a thorough manner, we analyze this optimization issue here. This paper shows that it is hard to approximate and so provides a nontrivial approximation approach. The details of the plan are examined in the context of numerous actual scenarios to measure the benefit that may be realized. Here, we examine a wide range of BGP-enabled routers to see how few required less than 100 BGP-enabled servers to implement BGP routing policy across the shortest pathways to all autonomous systems (ASs), hence lowering the average path length of routed pathways by 40%. The study is able to prove the scheme's many uses, the first of which is for TCP performance improvement, with results that achieve nearly optimal placement of overlay nodes. Also, when using Voice-over-IP (VoIP) applications, where a small number of overlay nodes can have a significant impact on maximum peer-to-peer delay, the study shows that the scheme's many functions are useful

To demonstrate overlay routing using BPG routing, TCP improvement, and VOIP applications

If we are just concerned in getting better routing properties among a single source node and a single destination, then the dilemma is not intricate, and judgment the optimal number of nodes becomes in significant because the probable contender for super impose assignment is diminutive, and in general any obligation would be superior. Nevertheless, when we regard as one-to-many or many-to-many circumstances, then a single overlay node could concern the lane possessions of many paths, and thus decide the best locations turn out to be much less insignificant. We thoroughly learn this optimization problem. We demonstrate that it is NP-hard and get a nontrivial approximation algorithm for it, where the approximation relation depends on exact properties of the difficulty at hand. We look at the sensible feature of the system by assess the increase one can get over some genuine scenarios

Effective Resource Allocation in flexible Overlay Routing

Overlay routing is the very attractive scheme that allows the improving certain properties of the routing without the need to change the standards of the current underlying routing. However, deploying overlay routing requires the placement and maintenance of overlay infrastructure. This gives rise to the following optimization problem: Find a minimal set of overlay nodes such that the required routing properties are satisfied. In this paper, we rigorously study this optimization problem. We show that it is NP- of the problem at hand. We examine the practical aspects of the scheme by evaluating the gain one can get over several hard and derive a nontrivial approximation algorithm for it, where the approximation ratio depends on specific properties real scenarios. The first one is BGP routing, and we show, using up-to-date data reflecting the current BGP routing policy in the Internet, that a relative small number of less than 100 relay servers is sufficient to enable routing over shortest paths from a single source to all autonomous systems (ASs), reducing the average path length of inflated paths by 40%. We also demonstrate that the scheme is very useful for TCP performance improvement (results in an almost optimal placement of overlay nodes) and for Voice-over-IP (VoIP) applications where a small number of overlay nodes can significantly reduce the maximal peer-to-peer delay.

Multi-region routing

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de ComputadoresThis thesis proposes a new inter-domain routing protocol. The Internet's inter-domain routing protocol Border Gateway Protocol (BGP) provides a reachability solution for all domains; however it is also used for purposes outside of routing. In terms of routing BGP su ers from serious problems, such as slow routing convergence and limited scalability. The proposed architecture takes into consideration the current Internet business model and structure. It bene ts from a massively multi-homed Internet to perform multipath routing. The main foundation of this thesis was based on the Dynamic Topological Information Architecture (DTIA). We propose a division of the Internet in regions to contain the network scale where DTIA's routing algorithm is applied. An inter-region routing solution was devised to connect regions; formal proofs were made in order to demonstrate the routing convergence of the protocol. An implementation of the proposed solution was made in the network simulator 2 (ns-2). Results showed that the proposed architecture achieves faster convergence than BGP. Moreover, this thesis' solution improves the algorithm's scalability at the inter-region level, compared to the single region case

The “Global-ISP ” Paradigm

We present a new paradigm, called “Global ISP ” (G-ISP). Its goal is to solve, or at least alleviate, problems of inter-domain routing, such as slow convergence, and lack of QoS and multicast support. One of the most important properties of the proposed paradigm is that it can be gradually deployed on the Internet. A G-ISP can be viewed as an additional ISP that provides transit services to its customers over an overlay network. Because a G-ISP differs from a “regular ” ISP, some extension to the standard BGP protocol is required. This extension and its effects on the BGP protocol are described in this paper. Algorithms for building a G-ISP overlay network and their applications are also presented.