Tracing the Packet Loss between Different Nodes within Same Link at Particular Interval of Time
Keywords:
Advantage of longer Connection, Architecture Of packet Loss, Calculation Communication within Same Link, Metrics for pattern Of LossAbstract
Realistic and accurate packet loss measurement of production traffic has been challenging, since the frequently-used active monitoring approaches using probe packets cannot capture the packet loss experienced by the traffic of individual user applications. In this paper, we present a new approach for the accurate measurement of the packet loss rate faced by nodes at same link at particular instant of time. In contrast to previous work, our method is able to pinpoint the packet loss rate experienced by the individual traffic flows of concurrently running applications. Due to the exponential back-off scheme, one of these connections could gain an unfair advantage in channel access. If both the connections generate heavy loads, then the connection that began first will dominate the channel. If one of the connections is heavily loaded, while the other is lightly loaded, the heavily loaded connection dominates the channel.
References
Hades active delay evaluation systemhttp://www-win.rrze.uni-erlangende/ippm/hades.html.en. Andrew Adamns, Jamshid Mahdavi, Matthew Mathis, and Vern PaxsonCreating a scalable architecture for internet measurementIn Proceedings of INET, 1998. BAdamson The MGEN Toolset http://pf.itd.nrl.navy.mil/mgen. Peter Benko and Andreas VeresA Passive Method for Estimating End-to-End TCP Packet LossIn Proceedings of IEEE Globecom, pages 2609–2613, 2002. SBradner and JMcQuaidBenchmarking Methodology for Network Interconnect Devices RFC 2544 (Informational), March 1999 http://www.ietf.org/rfc/rfc2544.txt. SHemmingerNetwork Emulation with NetEmIn Proceedings of Linux Conf Au, 2005. THolleczeckStatistical analysis of IP performance metric in international research and educational networks (diploma thesis), 2008. SOhta and TMiyazakiPassive packet loss monitoring that employs the hash-based identification techniqueIn Ninth IFIP/IEEE International Symposium on Integrated Network Management (IM), 2005. APapadogiannakis, AKapravelos, M Polychronakis, EPMarkatos, and ACiuffolettiPassive end-to-end packet loss estimation for grid traffic monitoringIn Proceedings of the CoreGRID Integration Workshop, pages 79–93, 2006. Stefan SavageSting: A TCP-based network measurement toolIn USENIX Symposium on Internet Technologies and Systems (USITS), 1999. Joel Sommers, Paul Barford, Nick Duffield, and Amos RonImproving accuracy in end-toend packet loss measurementIn Proceedings of the ACM SIGCOMM ’05, pages 157–168. SUbik, VSmotlacha, STrocha, SLeinen, VJeliazkov, AFriedl, and GKramerReport on passive monitoring pilot, September 2008Deliverable MS.3.7.5 GN2 Project. Sven Ubik, Ale?s Friedl, and Stanislav HotmarQuantification of traffic burstiness with mapi middlewareSeptember 2008. QLv, PCao, ECohen, KLi, and SShenkerSearchand replication in unstructured peer-to-peer networks In ICS’02, New York, USA, June 2012 Christos Gkantsidis, Milena Mihail, and Amin Saberi, Random Walks in Peer-to-Peer Networks, to appear in IEEE Infocom 2014 Yatin Chawathe, Sylvia Ratnasamy, Lee Breslau, Nick Lanham, and Scott Shenker, Making Gnutella-like P2P Systems Scalable, In ProcACM SIGCOMM 2003, Karlsruhe, Germany, Aug 2013. CLaw and K.-YSiu, Distributed construction of random expander networks, In ProcIEEE Infocom 2013 Gopal Pandurangan, Prabhakar Raghavan, and Eli Upfal, Building low-diameter p2p networks, In STOC 2011, Crete, Greece, 2011
Downloads
Published
Issue
Section
License
Copyright (c) IJSRSET
This work is licensed under a Creative Commons Attribution 4.0 International License.