Effective Resource Allocation in flexible Overlay Routing

Abstract

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-overIP (VoIP) applications where a small number of overlay nodes can significantly reduce the maximal peer-to-peer delay.

Authors and Affiliations

Pendyala Manish Kumar| PG Scholar, Pydah College of Engineering, Kakinada, AP, India, E-mail: manish.btech.546@gmail.com, K. Lakshmi Priya| Assistant Professor, Pydah College of Engineering, Kakinada, AP, India

Keywords

Related Articles

We propose a novel answer for cross-site cold-start item suggestion, which intends to we show a nonspecific information genealogy structure GDP(Generic Data Protection) for information stream over different elements...

A Distributed Opportunistic Routing Policy With Congestion Diversity

Every packet transmission can be caught by an irregular subset of recipient nodes among which the following hand-off is chosen deftly. The primary test in the outline of least deferral steering strategies is adjustin...

Carbon Nanotube based approach on FETs using Ternary Comparator

A Carbon Nanotube Field Effect Transistor (CNFET) is referred to as a FET that utilizes a single Carbon Nanotube or an array of carbon nanotubes as the channel material instead of bulk silicon in the traditional MOSF...

An Advanced Control Strategy For Solar PV and Battery Storage Integration System

In this venture, another design of a three-level unbiased point-clasped (NPC) inverter that can coordinate solar photovoltaic (PV) with battery storage in a framework associated framework is proposed. The quality of t...

UPQC Implements The 3-Phase Shunt And Series Active Power Filter To Compensate Current And Voltage Harmonics

This paper presents the three phase shunt and series active power filter in order to reduce the current and voltage harmonics. To implement Unified Power Quality Conditioner (UPQC) control algorithm two control strat...

Download PDF file
  • EP ID EP16701
  • DOI -
  • Views 305
  • Downloads 8

How To Cite

Pendyala Manish Kumar, K. Lakshmi Priya (2015). Effective Resource Allocation in flexible Overlay Routing. International Journal of Science Engineering and Advance Technology, 3(12), 1366-1369. https://europub.co.uk/articles/-A-16701