Estimating Bandwidth of Mobile Users Sept 2003 Rohit Kapoor CSD, UCLA.

Slides:



Advertisements
Similar presentations
Nanyang Technological University Zou ZiXuan
Advertisements

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
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Bandwidth Estimation Workshop 2003 Evaluating pathrate and pathload with realistic cross-traffic Ravi Prasad Manish Jain Constantinos Dovrolis (ravi, jain,
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.
Comparison and Analysis of FIFO, PQ, and WFQ Disciplines on multimedia
End-to-End Available Bandwidth: Measurement Methodology, Dynamics, and Relation with TCP Throughput Manish Jain Constantinos Dovrolis SIGCOMM 2002 Presented.
End-to-end Asymmetric Link Capacity Estimation Ling-Jyh Chen, Tony Sun, Guang Yang, M.Y. Sanadidi, Mario Gerla Dept. of Computer Science, University of.
CapProbe: A Simple and Accurate Capacity Estimation Technique Kapoor et al., SIGCOMM ‘04.
Introduction Future wireless systems will be characterized by their heterogeneity - availability of multiple access systems in the same physical space.
End-to-End Analysis of Distributed Video-on-Demand Systems Padmavathi Mundur, Robert Simon, and Arun K. Sood IEEE Transactions on Multimedia, February.
1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug 1993), pp
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
Estimating Available Bandwidth with pathload and abget Professor Nelson Fonseca
WBest: a Bandwidth Estimation Tool for IEEE Wireless Networks Presented by Feng Li Mingzhe Li, Mark Claypool, and.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
1 Active Probing for Available Bandwidth Estimation Sridhar Machiraju UC Berkeley OASIS Retreat, Jan 2005 Joint work with D.Veitch, F.Baccelli, A.Nucci,
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,
Bandwidth Measurements Jeng Lung WebTP Meeting 10/25/99.
Inline Path Characteristic Estimation to Improve TCP Performance in High Bandwidth-Delay Networks HIDEyuki Shimonishi Takayuki Hama Tutomu Murase Cesar.
CapProbe: An Efficient and Accurate Capacity Estimation Technique Rohit Kapoor**, Ling-Jyh Chen*, Li Lao*, M.Y. Sanadidi*, Mario Gerla* ** Qualcomm Corp.
Network Measurement Bandwidth Analysis. Why measure bandwidth? Network congestion has increased tremendously. Network congestion has increased tremendously.
Discriminating Congestion Losses from Wireless Losses using Inter- Arrival Times at the Receiver By Saad Biaz,Nitin H.Vaidya Texas A&M University IEEE.
Bandwidth Estimation: Metrics Mesurement Techniques and Tools By Ravi Prasad, Constantinos Dovrolis, Margaret Murray and Kc Claffy IEEE Network, Nov/Dec.
1 Performance Evaluation of Ring- based Peer-to-Peer Virtual Private Network (RING-P2P-VPN) Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.
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.
Alok Shriram and Jasleen Kaur Presented by Moonyoung Chung Empirical Evaluation of Techniques for Measuring Available Bandwidth.
Estimating Link Capacity in High Speed Networks Ling-Jyh Chen 1, Tony Sun 2, Li Lao 2, Guang Yang 2, M.Y. Sanadidi 2, Mario Gerla 2 1 Institute of Information.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
ACN: RED paper1 Random Early Detection Gateways for Congestion Avoidance Sally Floyd and Van Jacobson, IEEE Transactions on Networking, Vol.1, No. 4, (Aug.
1 On Class-based Isolation of UDP, Short-lived and Long-lived TCP Flows by Selma Yilmaz Ibrahim Matta Computer Science Department Boston University.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Comparison of Public End-to-End Bandwidth Estimation tools on High-Speed Links Alok Shriram, Margaret Murray, Young Hyun, Nevil Brownlee, Andre Broido,
Comparison of Public End-to-End Bandwidth Estimation tools on High- Speed Links Alok Shriram, Margaret Murray, Young Hyun, Nevil Brownlee, Andre Broido,
11 Experimental and Analytical Evaluation of Available Bandwidth Estimation Tools Cesar D. Guerrero and Miguel A. Labrador Department of Computer Science.
Packet Dispersion in IEEE Wireless Networks Mingzhe Li, Mark Claypool and Bob Kinicki WPI Computer Science Department Worcester, MA 01609
CS551: End-to-End Packet Dynamics Paxon’99 Christos Papadopoulos (
1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO
Requirements for Simulation and Modeling Tools Sally Floyd NSF Workshop August 2005.
SRI International 1 A Simulation Comparison of TBRPF, OLSR, and AODV Richard Ogier SRI International July 2002.
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.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Bandwidth Estimation Workshop 2003 Evaluating pathrate and pathload with realistic cross-traffic Ravi Prasad Manish Jain Constantinos Dovrolis (ravi, jain,
SenProbe: Path Capacity Estimation in Wireless Sensor Networks Tony Sun, Ling-Jyh Chen, Guang Yang M. Y. Sanadidi, Mario Gerla.
1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)
PathChirp Spatio-Temporal Available Bandwidth Estimation Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University.
A Bandwidth Estimation Method for IP Version 6 Networks Marshall Crocker Department of Electrical and Computer Engineering Mississippi State University.
Spatio-Temporal Available Bandwidth Estimation Vinay Ribeiro Rolf Riedi, Richard Baraniuk Rice University.
1 Analysis of a window-based flow control mechanism based on TCP Vegas in heterogeneous network environment Hiroyuki Ohsaki Cybermedia Center, Osaka University,
Analysis of RED Goal: impact of RED on loss and delay of bursty (TCP) and less bursty or smooth (UDP) traffic RED eliminates loss bias against bursty traffic.
정하경 MMLAB Fundamentals of Internet Measurement: a Tutorial Nevil Brownlee, Chris Lossley, “Fundamentals of Internet Measurement: a Tutorial,” CMG journal.
TCP Westwood: Efficient Transport for High-speed wired/wireless Networks 2008.
Path Capacity Estimation in Time-Slotted Wireless Networks
End-to-end Bandwidth Estimation in the Wide Internet Daniele Croce PhD dissertation, April 16, 2010.
Development of a QoE Model Himadeepa Karlapudi 03/07/03.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
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.
PATH DIVERSITY WITH FORWARD ERROR CORRECTION SYSTEM FOR PACKET SWITCHED NETWORKS Thinh Nguyen and Avideh Zakhor IEEE INFOCOM 2003.
Rohit Kapoor, Ling-Jyh Chen, M. Y. Sanadidi, Mario Gerla
Amogh Dhamdhere, Hao Jiang and Constantinos Dovrolis
CapProbe Ling-Jyh Chen, M. Y. Sanadidi, Mario Gerla
Tony Sun, Guang Yang, Ling-Jyh Chen, M. Y. Sanadidi, Mario Gerla
pathChirp Efficient Available Bandwidth Estimation
pathChirp Efficient Available Bandwidth Estimation
Presentation transcript:

Estimating Bandwidth of Mobile Users Sept 2003 Rohit Kapoor CSD, UCLA

Estimating Bandwidth of Mobile Users Mobile, Wireless User –Different possible wireless interfaces Bluetooth, , 1xRTT, GPRS etc Different bandwidths Last hop bandwidth can change with handoff Determine bandwidth of mobile user –Useful to application servers: Video, TCP –Useful to ISPs

Capacity Estimation Fundamental Problem: Estimate bottleneck capacity in an Internet path –Physical capacity different from available bandwidth Estimation should work end-to-end –Assume no help from routers

Packet Dispersion Previous work mostly based on packet dispersion Packet Dispersion (pairs or trains)

Previous Work Packet Pairs –Select highest mode of capacity distribution derived from PP samples (Crovella) Assumes that distribution will give capacity in correspondence to highest mode –Lai’s potential bandwidth filtering –Both of these techniques assume unimodal distribution Paxson showed distribution can be multimodal Packet tailgating Pathchar –Calculates capacity for every link

Previous Work Dovrolis’ Work –Explained under/over estimation of capacity –Methodology First send packet pairs If multimodal, send packet trains Still no satisfactory solution!!! –Most techniques too complicated, time/bw-consuming, inaccurate and prone to choice of parameters –Never tested on wireless

Problems due to Cross-Traffic Cross-traffic (CT) serviced between PP packets –Smaller CT packet size => More likely This leads to under-estimation of Capacity Narrow Link Cross Traffic T T’ > T

Problems (cont) Compression of the packet pair –Larger CT packet size => More likely Over-estimation of Capacity Post Narrow (20Mbps) Narrow Link (10Mbps) Packet Queued Packet Not Queued T T T’ < T

Fundamental Queuing Observation Observation –When PP dispersion over-estimates capacity First packet of PP must queue after a bottleneck link First packet of PP must experience Cross Traffic (CT) induced queuing delay –When PP dispersion under-estimates capacity Packets from cross-traffic are serviced between the two PP packets Second packet of PP must experience CT induced queuing delay

Fundamental Observation Observation (also proved) –When PP dispersion over-estimates capacity First packet of PP must queue after a bottleneck link –When PP dispersion under-estimates capacity Packets of cross-traffic are serviced between the two PP packets Second packet of PP must experience CT induced queuing delay –Both expansion and compression of dispersion involve queuing

Observation (cont) Expansion or Compression –Sum of delays of PP packets > Minimum sum of delays When Minimum sum of delays? –Both packets do not suffer CT induced queuing If we can get one sample with no CT induced queuing –Dispersion is not distorted, gives “right” capacity –Sample can easily be identified since the sum of delays is the minimum

Our Methodology: CapProbe PP really has two pieces of information –Dispersion of packets –Delay of packets Combines both pieces of information –Calculate delay sum for each packet pair sample –Dispersion at minimum delay sum reflects capacity Capacity

Requirements Sufficient but not necessary requirement –At least one PP sample where both packets experience no CT induced queuing delay. How realistic is this requirement? –Internet is reactive (mostly TCP): high chance of some probe packets not being queued –To validate, we performed extensive experiments Simulations and measurements Only cases where such samples are not obtained is when cross-traffic is UDP and very intensive (>75%)

CapProbe Strength of CapProbe –Only one sample not affected by queuing is needed Simplicity of CapProbe –Only 2 values (minimum delay sum and dispersion) need storage –One simple comparison operation per sample –Even simplest of earlier schemes (highest mode) requires much more storage and processing

Experiments Simulations, Internet, Internet2 (Abilene), Wireless Cross-traffic options: TCP (responsive), CBR (non- responsive), LRD (Pareto) Wireless technologies tested: Bluetooth, IEEE , 1xRTT Persistent, non-persistent cross-traffic (a) (b)

Simulations 6-hop path: capacities {10, 7.5, 5.5, 4, 6, 8} Mbps PP pkt size = 200 bytes, CT pkt size = 1000 bytes Persistent TCP Cross-Traffic Over-Estimation Cross Traffic Rate Bandwidth Estimate Frequency Cross Traffic Rate Minimum Delay Sums

Simulations PP pkt size = 500 bytes, CT pkt size = 500 bytes Non-Persistent TCP Cross-Traffic Minimum Delay Sums Under-Estimation Bandwidth Estimate Frequency

Simulations Non-Persistent UDP CBR Cross-Traffic Only case where CapProbe does not work –UDP (non-responsive), extremely intensive –No correct samples are obtained Minimum Delay Sums Bandwidth Estimate Frequency

Internet Measurements Each experiment –500 PP at 0.5s intervals 100 experiments for each {Internet path, nature of CT, narrow link capacity} OS also induces inaccuracy Laptop3 Dummy Net Laptop1 PING Source/ Destination Internet Laptop2 Cross-Traffic

Wireless Measurements Experiments for b, Bluetooth, 1xRTT Clean, noisy channels –Bad channel  retransmission  larger dispersions  lower estimated capacity b Access Point Laptop1 PING Source/ Destination Internet Laptop2 Cross-Traffic b Connectivity Results for Bluetooth-interfered b, TCP cross-traffic : IP throughput of b is around 6Mbps

Probability of Obtaining Sample Assuming PP samples arrive in a Poisson manner Product of probabilities –No queue in front of first packet: p(0) = 1 – λ/μ –No CT packets enter between the two packets (worst case) Only dependent on arrival process Analyzed with Poisson Cross-Traffic –p = p(0) * e - λL/μ = (1 – λ/μ) * e - λL/μ Link No Cross Traffic Packets First Packet No Queue Second Packet

Sample Frequency Average number of Samples required to obtain the no-queuing sample – Analytical –Poisson cross traffic is a bad case –Bursty Internet traffic has more “windows”

Sample Frequency Simulations: mix of TCP, UDP, Pareto cross traffic Results for number of samples required Internet –In most experiments, first 20 samples contained the minimum delay sample

Conclusion CapProbe –Simple capacity estimation method –Works accurately across a wide range of scenarios –Only cases where it does not estimate accurately Non-responsive intensive CT This is a failure of the packet dispersion paradigm Useful application –Use a passive version of CapProbe with “modern” TCP versions, such as Westwood