An Algorithmic Framework In Order To Deal With Efficient Resource Allocation In Overlay Routing

Abstract

Overlay routing has been projected in latest years as an effectual way to attain convinced routing properties devoid of leaving into the extended and monotonous procedure of consistency and worldwide exploitation of a novel routing protocol. Overlay routing was used to progress TCP presentation over the Internet where the major proposal is to break the end-to-end criticism loop into minor loops. This requires that nodes competent of performing TCP Piping would be there all along the direct at comparatively diminutive detachments. We contemplate on this indicate and swot up the smallest amount of communications nodes that require to be additional in order to preserve a detailed possessions in the overlay routing. Inspite of the precise insinuation in mind we describe a universal optimization difficulty called the Overlay Routing resource allocation (ORRA) trouble and swot up its intricacy. It revolves out that the predicament is NP-hard and we present a nontrivial estimate algorithm for it.

Authors and Affiliations

A. Lakshman Rao. G. Satya Suneetha. K. Sandeep Kumar

Keywords

Related Articles

To Evaluate The Effectiveness Of The Query Quality Prediction Model Computed Using Sr Algorithm

We analyze the account of hard queries and suggest a novel framework to decide the degree of weakness for a keyword query over a database, manner in mind both the structure and the satisfied of the database and the q...

Secured Bluetooth Authentication Using Artificial Neural Networks

Authentication in wireless networking is a mechanism to proof identities and avoid masking. The use of wireless devices and technology has made rapid growth in the market. In all such devices, user authentication is...

An Approach To Control Congestion And Improve Performance Of TCP Vegas In Ad Hoc Network

Computers and the Internet play a essential role in people’s life. Internet users and network application increases day by day and hence large amount of network is important but bandwidth is limited. As network requi...

Performance Analysis of Two Methods for Dimension Reduction in Face Recognition

Face recognition has been a fast growing, challenging and interesting area in real time applications. This work aims to compare the two renowned techniques of feature dimension reduction on the basis of the classific...

ROUTING THROUGH CROSS LAYER APPROACH FOR WIRELESS MAC LAYER NETWORKS

Wireless mesh networks (WMNs) are dynamically self-organized and self-configured, with the nodes in the network automatically establishing an ad hoc network and maintaining the mesh connectivity. WMNs are comprised o...

Download PDF file
  • EP ID EP28258
  • DOI -
  • Views 281
  • Downloads 3

How To Cite

A. Lakshman Rao. G. Satya Suneetha. K. Sandeep Kumar (2015). An Algorithmic Framework In Order To Deal With Efficient Resource Allocation In Overlay Routing. International Journal of Research in Computer and Communication Technology, 4(9), -. https://europub.co.uk/articles/-A-28258