Similarity and Dissimilarity on Packet Loss between Different Nodes within Same Link at Particular Interval of Time while at Specific Time

Authors

  • Veer Bhadra Pratap Singh  Department of Computer Science and Engineering / Information Technology, Noida Institute of Engineering and Technology, Uttar Pradesh, India
  • Parul Sirohi  Department of Computer Science and Engineering / Information Technology, Noida Institute of Engineering and Technology, Uttar Pradesh, India

Keywords:

Transmission Control Protocol , Front End Server, Back End Layer , Maintaining Security Between Front End And Back-End Servers , Comparative Approach , Source Code

Abstract

Measurement and estimation of packet loss characteristics are challenging due to the relatively rare occurrence and typically short duration of packet loss episodes.

While active probe tools are commonly used to measure packet loss on end-to end paths, there has been little analysis of the accuracy of these tools or their impact on the network. The objective of our study is to understand how to measure packet loss episodes accurately within same link within particular interval of time.

We begin by testing the capability of standard end-to-end measurements of loss in a controlled laboratory environment using network simulator 2.35. Our tests show that loss characteristics reported from different nodes within same link at different interval of time can be quite accurate over different nodes within same link at specific interval of time.

Motivated by these observations, we introduce a new algorithm for packet loss measurement that is designed to overcome the deficiencies in standard tools.

References

  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. 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. Christos Gkantsidis, Milena Mihail, and Amin Saberi, Random Walks in Peer-to-Peer Networks, to appear in IEEE Infocom 2014
  16. Yatin 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. 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. 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.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2016-08-30

Issue

Volume 2, Issue 4, July-August-2016

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Veer Bhadra Pratap Singh, Parul Sirohi "Similarity and Dissimilarity on Packet Loss between Different Nodes within Same Link at Particular Interval of Time while at Specific Time " International Journal of Scientific Research in Science, Engineering and Technology (IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 2, Issue 4, pp.629-634, July-August-2016.