Managing the Communication between different Node Randomly

Authors(2) :-Rajdev Tiwari, Prerna Trivedi

Due to the exponentially increase popularity of the services provided over the public use, problem with current mechanisms for control and management of the internet and other networks built on the internet protocol do not provide sufficient support for the efficient control management of traffic. Increasing demands of services from terminal users. Developers to offer more and more sophisticated traffic engineering methods for network control and to provide congestion free network. Distributed peer-to-peer and overlay network, including several that the authors wish to build, often require that a random graph be constructed, and that some form of random node selection take place over that graph. A main component of both of these requirements is the random walk, which can be used to select random nodes when building a graph, and can be used to select random nodes over the created graph. While there are numerous studies that look at specific aspects of random walks, the literature ultimately did not provide a comprehensive and satisfactory approach that would work with results over a range of applications. Using survey, this paper compares a number of techniques some novel and some variations on known approaches for building random techniques and doing random node selection over those techniques. These criteria include simplicity of operation, support for node heterogeneity, quality of random selection, scalability, efficiency and robustness. We show that all these criteria can be met, and that while no approach is superior against all criteria, our main approach broadly stands out as the best approach. Various method have been used to solve the problem and from the data packets point of view to reach to the destination avoiding to travel to the congested path or the path which had been failed due to network congestion but if we apply Dijkstra's Algorithm for load Balancing then we will be getting appropriate path that to at a minimum cost.

Authors and Affiliations

Rajdev Tiwari
Department of Computer Science and Engineering, Noida Institute of Engineering & Technology, Uttar Pradesh, India
Prerna Trivedi
Department of Computer Science and Engineering, Noida Institute of Engineering & Technology, Uttar Pradesh, India

Random Geometric Node, Calculations, Sampling Using Random Walk, Structured Graph, Unstructure Graph

  1. Kompella, K., Rekhter, Y., Berger, L., Link Bundling in MPLS Tra_c Engineering (TE) IETF Request for Comments: 4201, 2005.
  2. Vasseur, JP., Leroux, JL., Yasukawa, S., Previdi, S., Psenak, P., Mabbey, P.Routing Extensions for Discovery of Multiprotocol (MPLS) Label Switch Router(LSR) Traffic Engineering (TE) Mesh Membership IETF Request for Comments:4972, 2007
  3. Andersson, L., Asati, R., Multiprotocol Label Switching (MPLS) Label Stack Entry: "EXP" Field Renamed to "Tra_c Class" Field. IETF Request for Comments:5462, 2009.
  4. Bhatia, M., Jakma, P., Advertising Equal Cost Multipath routes in BGP, draft-bhatia-ecmp-routes-in-bgp-02.txt IETF Internet Draft, 2006.
  5. Lin, W., Liu, B., Tang, Y., Tra_c Distribution over Equal-Cost-Multi-Pathsusing LRU-based Caching with Counting Scheme IEEE AINA, 2006.
  6. Martin, R., Menth, M., Hemmkeppler, M., Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing. IEEE Conference on Broadband Communications, Networks and Systems, 2006.
  7. Kandula, S., Katabi, D., Sinha, S., Berger, A., Dynamic Load Balancing With-out Packet Reordering ACM SIGCOMM Computer Communication Review 54 Volume 37, Number 2, 2007.
  8. Balon, S., Skivee, F., Leduc, G., How Well do Tra_c Engineering Objective Functions Meet TE Requirements? IFIP Networking, LNCS 3976, pp. 75{86, 2006.
  9. Lada A. Adamic, Rajan M. Lukose, Bernardo Huberman, and Amit R. Puniyani Search in Power-Law Networks, Phys. Rev. E, 64 46135 (2011)
  10. Dejan Kostic, Adolfo Rodriguez, Jeannie Albrecht, and Amin Vahdat, Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh, In Proc. ACM SOSP 2013
  11. Russ Cox, Frank Dabek, Frans Kaashoek, Jinyang Li, and Robert Morris Practical, Distributed Network Coordinates HotNets 2013
  12. Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Laurent Massoulie, SCAMP: peer-to-peer lightweight membership service for large-scale group communication, In Proc. 3rd Intnl. Wshop Networked Group Communication (NGC’01), pages 44–55. LNCS 2233, Springer, 2010
  13. Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Laurent Massouli: Peer-to-Peer Membership Management for Gossip-Based Protocols. IEEE Trans. Computers 52(2):139-149 (2013)
  14. 14Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Searchand replication in unstructured peer-to-peer networks In ICS’02, New York, USA, June 2012
  15. 15Christos Gkantsidis, Milena Mihail, and Amin Saberi, Random Walks in Peer-to-Peer Networks, to appear in IEEE Infocom 2014
  16. 16Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott Shenker, Making Gnutella-like P2P Systems Scalable, In Proc. ACM SIGCOMM 2003, Karlsruhe, Germany, Aug 2013.
  17. C. Law and K.-Y. Siu, Distributed construction of random expander networks, In Proc. IEEE Infocom 2013
  18. Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal, Building low-diameter p2p networks, In STOC 2011, Crete, Greece, 2011
  19. I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong, Freenet: A distributed anonymous information storage and retrieval system, In Proc. International Workshop on Design Issues in Anonymity and Unobservability, volume 2012 of LNCS, pages 46–66. Springer-Verlag, 2012
  20. Ziv Bar-Yossef, Alexander Berg, Steve Chien, Jittat Fakcharoenphol, and Dror Weitz, Approximating Aggregate Queries about Web Pages via Random Walks, In Proc.VLDB 2014.

Publication Details

Published in : Volume 1 | Issue 6 | November-December 2015
Date of Publication : 2015-12-25
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 286-290
Manuscript Number : IJSRSET151637
Publisher : Technoscience Academy

Print ISSN : 2395-1990, Online ISSN : 2394-4099

Cite This Article :

Rajdev Tiwari, Prerna Trivedi, " Managing the Communication between different Node Randomly, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 1, Issue 6, pp.286-290, November-December-2015.
Journal URL :

Article Preview

Follow Us

Contact Us