Egoistic superimpose Network Formation and Preservation
Journal Title: International Journal of Advanced Research in Computer Engineering & Technology(IJARCET) - Year 2012, Vol 1, Issue 6
Abstract
t—A introductory issue essential many superimpose network applications ranging from routing to peer-to-peer file distribution is that of the network configuration, i.e., flop new arrivals into an presented overlie, and re-wiring to survive with varying network environments. Earlier effort has measured the crisis from two perspectives: devising levelheaded heuristics for the crate of supportive peers, and performing game theoretic analysis for the crate of egotistic peers. As a solution, we amalgamate the above mentioned thrusts by important and studying the Selfish Neighbor Selection (SNS) game and its purpose to superimpose routing. At the spirit of SNS stands the constraint that peers are permissible up to a convinced number of neighbors. This makes SNS considerably unusual from obtainable network structure games that force no boundaries on peer degrees. Having surrounded degrees has imperative realistic penalty as it permits the formation of superimpose structures that entail O(n) in its place of O(n2 ) link monitoring transparency. We demonstrate that a node’s finest reaction cabling policy amounts to solving a k-means dilemma on asymmetric distance. Finest reaction wirings have extensive realistic value as they allow egotistic nodes to collect sizeable presentation profit when linking to overlays of non-selfish nodes. A extra difficult upshot is that smooth non-selfish nodes can profit from the survival of a few egotistic nodes while the final, by way of their local optimizations, generate a extremely optimized spine, winning which even easy heuristic wirings defer high-quality recital. To take advantage of on the above properties we intend, erect and position, EGOIST, and SNS-inspired model superimpose routing system. We demonstrate that EGOIST outperforms obtainable heuristic superimpose on a diversity of performance metrics, with setback, accessible bandwidth, and node consumption, whilst it residue spirited with an finest, but unscalable full-mesh superimpose.
Authors and Affiliations
D. J. Anusha , B. Purushotham , D. J. Prathyusha
Keywords
Related Articles
- EP ID EP151758
- DOI -
- Views 56
- Downloads 0
Integrating Assembly Lines based on Lean Line Design Concept
In today‟s competitive business scenario manufacturing industries are under the pressure to reduce cost and cycle time. It is a lean manufacturing concept with a systematic approach to identify and eliminate wast...
Throughput Maximization for Optical Burst Switching Networks
Optical burst switching is a one-way reservation technique that provides connectionless transmission services. In OBS Data Traffic Discarded at immediate nodes is retransmitted by the sources. In this project work an...
Design of Wireless Monitor System Based On S3C2440 and GPRS
This Paper introduces a new type Wireless Monitoring System, which applied in Industrial Field. In the Proposed system, the main hardware includes the S3C2440 Microcontroller based on ARM9 core, and the software adop...
Survey on Kannada Digits Recognition Using OCR Technique
Day by day technology is going very fast, digital recognitions are playing wide role and providing more scope to perform research in OCR techniques. Recognition of Kannada handwritten numeral is complicated compare...
Branch and Bound Technique To Two Stage Flow Shop Scheduling Problem In Which Setup Time is Separated From Processing Time And Both Are Associated With Probabilities
This paper presents an algorithm with the help of branch and bound approach for a flow shop scheduling problems consisting of n jobs to be processed on 2 machines in which setup time is separated from processing t...