• Corpus ID: 29296254

EFFICIENT LIMITED SCALE-FREE OVERLAY TOPOLOGIES FOR PEER-TO-PEER NETWORK ARCHITECTURE

@inproceedings{Anantharaj2017EFFICIENTLS,
  title={EFFICIENT LIMITED SCALE-FREE OVERLAY TOPOLOGIES FOR PEER-TO-PEER NETWORK ARCHITECTURE},
  author={B. Anantharaj and N. Balaji and G. Sambasivam and M. S. Saleem Basha and T. Vengattaraman},
  year={2017}
}
Different networking applications are provided in Overlay network topologies for abstraction over underlying network architecture. Characteristics of underlying network architecture plays an important role of apps functioning. Scalefree (power-law) overlay network topologies whose structure that will show a greater functioning to the networks. Generally in small portion of nodes the major key problem is High connectivity (i.e., load). Due to technical restrictions the nodes in these networks… 

References

SHOWING 1-10 OF 15 REFERENCES
On growth of limited scale-free overlay network topologies
TLDR
An algorithm aiming to achieve perfect scale-free overlay network topologies with low communication overhead and without global information usage during its construction phase is proposed and its superiority over the existing solutions is evaluated.
Limited Scale-Free Overlay Topologies for Unstructured Peer-to-Peer Networks
  • H. Guclu, M. Yuksel
  • Computer Science
    IEEE Transactions on Parallel and Distributed Systems
  • 2009
TLDR
This work investigates the construction of scale-free topologies with hard cutoffs and the effect of these hard cutoff on the search efficiency and observes that the efficiency of normalized flooding and random walk search algorithms increases as the hard cutoff decreases.
Self-Organizing Scale Free Topology for Peer-to-Peer Networks
TLDR
An algorithm of two parameters to construct a Scale free topology for P2P networks in a self organizing manner is proposed and the emergence of scale free topologies from the algorithm is verified in both analytical and numerical ways.
LLR: A Construction Scheme of a Low-Diameter, Location-Aware, and Resilient P2P Network
TLDR
Through several simulation experiments, it is found that LLR could construct an overlay network that had the higher reachability than BA and the higher correlation between physical and logical distances.
Hybrid search schemes for unstructured peer-to-peer networks
TLDR
A general search scheme is introduced, of which flooding and random walks are special instances, and a small number of supernodes in an otherwise regular topology can offer sharp savings in the performance of search, both in the case of search by flooding and search by random walk, when it is combined with 1-step replication.
Dynamic Capacity Allocation in OTN Networks
TLDR
An overview of the application of VCAT/LCAS techniques in the context of OTN is presented and a detailed analysis of the time delays associated with different operations is provided and its application to some reference networks is undertaken.
Cross Layer Design for Power Control and Link Availability in Mobile Adhoc Networks
TLDR
A cross layer design for the dynamic power control protocol and link prediction that provides a combined solution for power conservation as well as link availability and improves throughput and packet delivery ratio by spatial reuse, prior prediction of link breaks and initiating the route repair.
On power-law relationships of the Internet topology
TLDR
These power-laws hold for three snapshots of the Internet, between November 1997 and December 1998, despite a 45% growth of its size during that period, and can be used to generate and select realistic topologies for simulation purposes.
On Growing Perfect Power‐law Graphs
We outline here two new algorithms for growing perfect power‐law graphs of increasing size for the given set of parameters of the desired graph, such as the average and maximum node degrees as well
Scale-free networks are ultrasmall.
TLDR
It is shown, using analytical arguments, that scale-free networks with 2<lambda<3 have a much smaller diameter, behaving as d approximately ln(ln(N), which is the lowest possible diameter.
...
...