Detecting the Long-Range Dependence in the Internet Traffic with Packet Trains Péter Hága, Gábor Vattay Department Of Physics of Complex Systems Eötvös.

Slides:



Advertisements
Similar presentations
Martin Suchara, Ryan Witt, Bartek Wydrowski California Institute of Technology Pasadena, U.S.A. TCP MaxNet Implementation and Experiments on the WAN in.
Advertisements

Mobile Ad-hoc Network Simulator: mobile AntNet R. Hekmat * (CACTUS TermiNet - TU Delft/EWI/NAS) and Radovan Milosevic (MSc student) Mobile Ad-hoc networks.
TCP Probe: A TCP with Built-in Path Capacity Estimation Anders Persson, Cesar Marcondes, Ling-Jyh Chen, Li Lao, M. Y. Sanadidi, Mario Gerla Computer Science.
Available Bandwidth Estimation Manish Jain Networking and Telecom Group CoC, Georgia Tech.
pathChirp Efficient Available Bandwidth Estimation
Min-Plus Linear Systems Theory and Bandwidth Estimation Min-Plus Linear Systems Theory and Bandwidth Estimation TexPoint fonts used in EMF. Read the TexPoint.
A Measurement Study of Available Bandwidth Estimation Tools MIT - CSAIL with Jacob Strauss & Frans Kaashoek Dina Katabi.
Pathload A measurement tool for end-to-end available bandwidth Manish Jain, Univ-Delaware Constantinos Dovrolis, Univ-Delaware Sigcomm 02.
AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Computer Science Department,
What do packet dispersion techniques measure? Internet Systems and Technologies - Monitoring.
Path Optimization in Computer Networks Roman Ciloci.
PhD Student: Ana Novak Supervisors: Prof Peter Taylor & Dr Darryl Veitch Active Probing Using Packet-Pair Probing to Estimate Packet Size and Packet Arrival.
PhD Student: Ana Novak Supervisors: Prof Peter Taylor & Dr Darryl Veitch Melbourne University Active Probing Using Packet-Pair Probing to Estimate Packet.
On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory  Hisamatu Hiroyuki Department of Infomatics.
ETOMIC measurements in EVERGROW Gábor Vattay Eötvös University/Collegium Budapest.
Bandwidth Measurement of Pakistan’s Internet Topology.
Bridging Router Performance and Queuing Theory Dina Papagiannaki, Intel Research Cambridge with Nicolas Hohn, Darryl Veitch and.
Controlling High- Bandwidth Flows at the Congested Router Ratul Mahajan, Sally Floyd, David Wetherall AT&T Center for Internet Research at ICSI (ACIRI)
Bridging Router Performance and Queuing Theory N. Hohn*, D. Veitch*, K. Papagiannaki, C. Diot *: University of Melbourne.
WBest: a Bandwidth Estimation Tool for IEEE Wireless Networks Presented by Feng Li Mingzhe Li, Mark Claypool, and.
Self-Similarity in Network Traffic Kevin Henkener 5/29/2002.
Network Tomography through End- End Multicast Measurements D. Towsley U. Massachusetts collaborators: R. Caceres, N. Duffield, F. Lo Presti (AT&T) T. Bu,
Measuring the Spatial Structure of Traffic Congestion in the Internet Gábor Vattay Center for Communication Networks Data Analysis, Collegium Budapest.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
A Detailed Path-latency Model for Router Geolocation Sándor Laki *, Péter Mátray, Péter Hága, István Csabai and Gábor Vattay Department of Physics of Complex.
FTDCS 2003 Network Tomography based Unresponsive Flow Detection and Control Authors Ahsan Habib, Bharat Bhragava Presenter Mohamed.
AdHoc Probe: Path Capacity Probing in Wireless Ad Hoc Networks Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Computer Science Department,
Presentation Date : 7 Sep Evaluation and Characterization of Available Bandwidth Probing Techniques Ningning Hu, Department of Computer Science,
Computer Science 1 Characterizing Link Properties Using “Loss-pairs” Jun Liu (joint work with Prof. Mark Crovella)
The Effects of Systemic Packets Loss on Aggregate TCP Flows Thomas J. Hacker May 8, 2002 Internet 2 Member Meeting.
A Machine Learning-based Approach for Estimating Available Bandwidth Ling-Jyh Chen 1, Cheng-Fu Chou 2 and Bo-Chun Wang 2 1 Academia Sinica 2 National Taiwan.
References for M/G/1 Input Process
TCP Enhancement for Random Loss Jiang Wu Computer Science Lakehead University.
Bandwidth Estimation TexPoint fonts used in EMF.
Packet-Pair Dispersion for Bandwidth Probing: Probabilistic and Sample-Path Approaches M. J. Tunnicliffe Faculty of Computing, Information Systems and.
Etomic: a pan-European testbed Péter Hága Collegium Budapest Institute for Advanced Study.
Estimating Bandwidth of Mobile Users Sept 2003 Rohit Kapoor CSD, UCLA.
A Queuing Theory Approach to Network Path Parameter Estimation Péter Hága Krisztián Diriczi Gábor Vattay István Csabai Attila Pásztor Darryl Veitch.
0 K. Salah 2. Review of Probability and Statistics Refs: Law & Kelton, Chapter 4.
Development of a New Efficient and Accurate Available Bandwidth Estimation Method Péter Hága Attila Pásztor István Csabai Darryl Veitch Viktória Hunyadi.
Hung X. Nguyen and Matthew Roughan The University of Adelaide, Australia SAIL: Statistically Accurate Internet Loss Measurements.
11 Experimental and Analytical Evaluation of Available Bandwidth Estimation Tools Cesar D. Guerrero and Miguel A. Labrador Department of Computer Science.
Interacting Network Elements: Chaos and Congestion Propagation Gábor Vattay Department of Physics of Complex Systems Eötvös University, Budapest, Hungary.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
Interaction of Overlay Networks: Properties and Implications Joe W.J. Jiang Dah-Ming Chiu John C.S. Lui The Chinese University of Hong Kong.
Packet Dispersion in IEEE Wireless Networks Mingzhe Li, Mark Claypool and Bob Kinicki WPI Computer Science Department Worcester, MA 01609
Neural Network Based Available Bandwidth Estimation in the ETOMIC Infrastructure Péter Hága, Sándor Laki, Ferenc Tóth, István Csabai, József Stéger, Gábor.
Evaluating the Potential of Bandwidth Estimators Xiliang Liu, Kaliappa Ravindran, and Dmitri Loguinov.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Self-generated Self-similar Traffic Péter Hága Péter Pollner Gábor Simon István Csabai Gábor Vattay.
PathChirp Spatio-Temporal Available Bandwidth Estimation Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University.
1. Introduction REU 2006-Packet Loss Distributions of TCP using Web100 Zoriel M. Salado, Mentors: Dr. Miguel A. Labrador and Cesar D. Guerrero 2. Methodology.
A Bandwidth Estimation Method for IP Version 6 Networks Marshall Crocker Department of Electrical and Computer Engineering Mississippi State University.
Network Computing Laboratory 1 Vivaldi: A Decentralized Network Coordinate System Authors: Frank Dabek, Russ Cox, Frans Kaashoek, Robert Morris MIT Published.
Advance Computer Networks Lecture#09 & 10 Instructor: Engr. Muhammad Mateen Yaqoob.
INM 2008 Orlando, Florida A Hidden Markov Model Approach to Available Bandwidth Estimation and Monitoring Cesar D. Guerrero Miguel A. Labrador Department.
Risk Analysis Workshop April 14, 2004 HT, LRD and MF in teletraffic1 Heavy tails, long memory and multifractals in teletraffic modelling István Maricza.
1 Queuing Delay and Queuing Analysis. RECALL: Delays in Packet Switched (e.g. IP) Networks End-to-end delay (simplified) = End-to-end delay (simplified)
Péter Hága Eötvös Loránd University, Hungary European Conference on Complex Systems 2008 Jerusalem, Israel.
Development of a QoE Model Himadeepa Karlapudi 03/07/03.
1 CS 268: Lecture 14 Internet Measurements Scott Shenker and Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
A Detailed Path-latency Model for Router Geolocation* Internetes hosztok mérés alapú geolokalizációja Sándor Laki, Péter Mátray, Péter Hága, István Csabai.
Precision Measurements with the EVERGROW Traffic Observatory Péter Hága István Csabai.
PathChirp Efficient Available Bandwidth Estimation Vinay Ribeiro Rice University Rolf Riedi Rich Baraniuk.
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
Bandwidth estimation: metrics, measurement techniques, and tools Presenter: Yuhang Wang.
Pong: Diagnosing Spatio-Temporal Internet Congestion Properties
CHAPTER 15 SUMMARY Chapter Specifics
pathChirp Efficient Available Bandwidth Estimation
pathChirp Efficient Available Bandwidth Estimation
Presentation transcript:

Detecting the Long-Range Dependence in the Internet Traffic with Packet Trains Péter Hága, Gábor Vattay Department Of Physics of Complex Systems Eötvös University

ECCS Oxford, UK - 25/09/2006 active probing in communication networks packet pair and packet train methods dispersion curves for pairs and trains the dispersion curve for different background traffic arrival processes relative stretch, phase transition! power laws in the average stretch relation between the power laws and the cross traffic arrival process Motivation & Overview modeling communication networks like the Internet importance of the background traffic arrival process difficulties in determining different statistical properties

ECCS Oxford, UK - 25/09/2006 Active probing methods SenderReceiver Sender Monitor: Receiver Monitor: Goal : estimate network parameters (available bandwidth, physical bandwidth, cross traffic statistical properties, etc.) with end-to-end methods background traffic

ECCS Oxford, UK - 25/09/2006 Packet pair methods ’’ output spacing, receiver node background traffic stochastic process (Poisson, Pareto, generally unknown ) probe pairs fixed inter packet delay  input spacing, sender node

ECCS Oxford, UK - 25/09/2006  ’  p/C+  the curve is based on self induced congestion, since the probe pair congests the bottleneck link with a certain  inter pair spacing fluid model – correct asymptotic behavior, deviation in the transition range Dispersion curve for packet pairs  ’    p/(C-C c ) time  input spacing, sender node ’’ output spacing, receiver node

ECCS Oxford, UK - 25/09/2006 Packet pairs with different arrival processes background traffic scenarios: Poisson arrival process Pareto arrival processes to model long-range dependent background traffic

ECCS Oxford, UK - 25/09/2006 Packet trains ’n’n nn background traffic stochastic process (Poisson, Pareto generally unknown) probe stream fixed inter packet delay input spacing, sender node output spacing, receiver node

ECCS Oxford, UK - 25/09/2006 Dispersion curve for packet trains

ECCS Oxford, UK - 25/09/2006 Relative stretch phase transition and finite size effect? Relative stretch ( order parameter ):

ECCS Oxford, UK - 25/09/2006 Phase transitions the phases are separated by a critical point in this critical point the convergence of the observed curve to some limit follows a power law function uncongested phase congested phase

ECCS Oxford, UK - 25/09/2006 Average stretch The average of the deviation of the observed  ’ and the  fluid values at  where , for Poisson process ,for Pareto process (  infinite variance) Based on the central limit theorem it can be shown that:

ECCS Oxford, UK - 25/09/2006 Average stretch at  c Average stretch  as a function of the packet train length if  c => power law behavior 

ECCS Oxford, UK - 25/09/ Pareto  Pareto  Pareto  Pareto  Poisson fitted exponent calculated exponent for Poisson process:  for Pareto process:  Average stretch: The arrival process of the unknown traffic can be determined! Exponents for different arrival process

ECCS Oxford, UK - 25/09/2006 Summary & Future work experiments in the real test laboratory to validate the method, the vision: experiments in the etomic infrastructure to investigate the spatial-temporal behavior of the network traffic new approach in the analysis of packet train experiments using packet trains to infer internal properties of the network this approach is working well in simulations to determine the arrival process of the background traffic

ECCS Oxford, UK - 25/09/2006 Etomic Infrastructure etomic stations routers

ECCS Oxford, UK - 25/09/2006 This work was partially supported by the National Science Foundation (OTKA T37903), the National Office for Research and Technology (NKFP 02/032/2004 and NAP 2005/ KCKHA005) and the EU IST FET Complexity EVERGROW Integrated Project. Thank you for your attention! IST Future and Emerging Technologies

ECCS Oxford, UK - 25/09/2006 Relation of the average stretch and the packet train length at different  values  c =>not a power law relation  c => non trivial power law behavior -0.5<a<0  c =>   Average stretch at different  values