Presentation is loading. Please wait.

Presentation is loading. Please wait.

Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.

Published byCameron Jenkins Modified over 8 years ago

Similar presentations

Presentation on theme: "Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of."— Presentation transcript:

1 Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of California at Los Angeles

2 Oct. 3, 2004E2EMON 20042 Motivation Knowledge of link capacity is important for network management, pricing, and QoS support. The link capacity of a network connection may vary dramatically due to vertical handoff, dynamic channel allocation, and wireless channel quality. Knowing the link capacity will permit the source to rapidly and appropriately adapt the outbound data transmissions rate.

3 Oct. 3, 2004E2EMON 20043 Access Link Capacity Monitoring Requirements provide correct information work passively without adding excess overhead promptly react to occurrences in network events maintain end-to-end semantics Our approach: TFRC Probe embed CapProbe algorithm within TFRC simple, accurate, passive, timely, and end-to-end extensible to other protocols and applications

4 Oct. 3, 2004E2EMON 20044 Potential Applications Adaptive multimedia streaming Congestion control Overlay network structuring Wireless link monitoring Mobility detection

5 Oct. 3, 2004E2EMON 20045 Estimate minimum link capacity on an Internet path, as seen at the IP level Design Goals End-to-end: assume no help from routers Inexpensive: Minimal additional traffic and processing Fast: converges to capacity fast enough for the application 100 Mbps 50 Mbps 10 Mbps (Link Capacity) The Capacity Estimation Problem

6 Oct. 3, 2004E2EMON 20046 T3T3 T2T2 T3T3 T3T3 T1T1 T3T3 Narrowest Link 20Mbps10Mbps5Mbps10Mbps20Mbps8Mbps Packet Pair Dispersion

7 Oct. 3, 2004E2EMON 20047 Ideal Packet Dispersion No cross-traffic Capacity = (Packet Size) / (Dispersion)

8 Oct. 3, 2004E2EMON 20048 Compression and Expansion First packet queueing → compressed dispersion → Over- estimation Second packet queueing → expanded dispersion → Under- estimation

9 Oct. 3, 2004E2EMON 20049 CapProbe Filter PP samples that do not have minimum queuing time Dispersion of PP sample with minimum delay sum reflects capacity CapProbe combines both dispersion and e2e transit delay information CapProbe is simple, fast, and accurate

10 Oct. 3, 2004E2EMON 200410 TFRC: TCP-Friendly Rate Control TFRC is an equation based unicast multimedia streaming protocol. TFRC mimics the TCP long-term throughput by utilizing the function: The receiver is responsible for calculating the loss event rate p and sending the information back to the sender once per round-trip time. The sender is responsible for adjusting its sending rate T actual to be close to T.

11 Oct. 3, 2004E2EMON 200411 TFRC Probe Embedding CapProbe within TFRC Three design issues: 1. Accurate capacity estimation 2. Fast estimation process 3. Minimal traffic overhead and modification to the original TFRC Two design options: 1. One-way estimation 2. Round-trip estimation

12 Oct. 3, 2004E2EMON 200412 TFRC Probe Accurate Capacity Estimation Embed CapProbe algorithm within TFRC by sending two packets back-to-back every n packets

13 Oct. 3, 2004E2EMON 200413 TFRC Probe Fast Link Capacity Estimation Fast in estimating link capacities from samples CapProbe has been shown to be a fast and accurate technique for link capacity estimation. Fast in getting samples The speed of sampling will increase/decrease when the packet sizes decrease/increase.

14 Oct. 3, 2004E2EMON 200414 TFRC Probe R send is the sending rate of data packets S is the number of samples needed to get a reliable capacity estimation P is the data packet size t is the expected time to get one capacity estimation. n is the number of data packets between samples Packet size adaptation

15 Oct. 3, 2004E2EMON 200415 Simulation The monitoring ability of TFRC Probe is verified using NS-2 simulator The bottleneck link (between node 3 and 4) is shared by all the data flows and configured as an asymmetric link with various capacities in the forward direction and fixed capacity (100Kbps) in the backward direction.

16 Oct. 3, 2004E2EMON 200416 Simulation Cross Traffic Description Type I 4 FTP flows (from node 7 to 10, 8 to 9, 11 to 14, and 12 to 13); 1500 bytes/packet Type II 4 CBR flows (from node 7 to 10, 8 to 9, 11 to 14, and 12 to 13); 500 bytes/packet; 80% load on the bottleneck Type III 16 Pareto flows with alpha = 1.9 (4 flows from node 7 to 10, 4 flows from 8 to 9, 4 flows from 11 to 14, and 4 flows from 12 to 13); 1000 bytes/packet; 80% load on the bottleneck Three type of cross traffic are employed in the simulaiton. The link capacity estimation results are collected after 20 and 50 samples.

17 Oct. 3, 2004E2EMON 200417 Simulation Results TFRC Probe CapProbe TFRC Probe CapProbe TFRC Probe CapProbe TFRC Probe CapProbe no cross traffic 20 samples100 K 500 K100 K1 M100 K5 M100 K 50 samples100 K 500 K100 K1 M100 K5 M100 K cross traffic type I 20 samples100 K 500 K100 K1 M100 K5 M100 K 50 samples100 K 500 K100 K1 M100 K5 M100 K cross traffic type II 20 samples100 K 500 K100 K1 M100 K5 M100 K 50 samples100 K 500 K100 K1 M100 K5 M100 K cross traffic type III 20 samples100 K 500 K100 K1 M100 K5 M100 K 50 samples100 K 500 K100 K1 M100 K5 M100 K bottleneck capacity of the forward direction link 100 Kbps500 Kbps1 Mbps5 Mbps bottleneck capacity of the backward direction link 100 Kbps

18 Oct. 3, 2004E2EMON 200418 Experiments Implementation: based on the original TFRC codes (Linux platform) Experiments: Without packet size adaptation Evaluate the effectiveness of TFRC Probe in wired Internet links (symmetric and asymmetric links) and wireless links (1xRTT and 802.11b) With packet size adaptation Evaluate the feasibility of monitoring wireless link capacity using TFRC Probe.

19 Oct. 3, 2004E2EMON 200419 Experiment Results 1 Run 1Run 2Run 3Run 4Run 5 CapacityTimeCapacityTimeCapacityTimeCapacityTimeCapacityTime Ethernet 100Mbps 20 samples92.185.594.925.594.255.6107.995.594.075.6 50 samples98.175.8104.315.794.255.994.025.794.075.8 100 samples98.176.1104.316.094.256.294.026.194.076.2 DSL DownLink 2Mbps 20 samples1.9827.01.8078.61.7108.81.7826.71.8356.7 50 samples1.98212.71.86512.41.83512.62.14512.61.65210.5 100 samples1.98220.91.86518.91.83518.92.14519.01.65216.9 DSL UpLink 128Kbps 20 samples0.11470.90.12269.50.11572.70.11081.50.11971.4 50 samples0.114145.00.122137.60.115146.00.115147.50.112142.3 100 samples0.115265.60.122258.50.119258.60.115266.00.112257.5 Wired Internet links (no pkt size adaptation)

20 Oct. 3, 2004E2EMON 200420 Experiment Results 2 Run 1Run 2Run 3Run 4Run 5 CapacityTimeCapacityTimeCapacityTimeCapacityTimeCapacityTime 1xRTT 150Kbps 20 samples0.186115.90.18787.10.18668.30.140116.00.18661.6 50 samples0.140156.40.140122.30.187113.20.140188.50.140113.1 100 samples0.140230.00.140182.90.140187.00.140286.80.140212.3 802.11b 1Mbps 20 samples0.6517.00.9117.80.8518.70.9417.70.9217.9 50 samples0.9325.60.9327.80.9128.20.9426.30.9327.8 100 samples0.9139.60.9341.60.9142.60.9241.20.9342.3 802.11b 2Mbps 20 samples1.4816.71.8016.81.8116.91.7717.91.8018.0 50 samples1.4821.81.7421.21.6821.61.0923.91.6923.5 100 samples1.4929.11.4729.61.8029.81.7232.31.7332.5 802.11b 5.5Mbps 20 samples3.7314.83.8615.34.3614.93.8315.14.4514.6 50 samples4.1818.43.8619.73.8019.54.0619.33.8718.6 100 samples4.1823.23.9224.43.8024.04.0624.03.8722.8 802.11b 11Mbps 20 samples8.097.67.607.57.917.57.007.66.267.9 50 samples8.099.07.6010.16.239.67.0010.26.2610.2 100 samples7.8412.77.6011.86.2311.66.6012.06.2611.9 Wireless links (no pkt size adaptation)

21 Oct. 3, 2004E2EMON 200421 Experiment Results 3 802.11b link with varying data rate (with pkt size adaptation)

22 Oct. 3, 2004E2EMON 200422 Conclusion TFRC Probe is simple, accurate, passive, timely, and end-to-end. The evaluation of TFRC Probe is performed by both simulation and testbed experiments. The same concept can be applied to other UDP based application protocols (e.g. RAP, RTP, UDP based FTP and P2P file downloading) and other emerging data transmission protocols (e.g. DCCP). CapProbe website: http://nrl.cs.ucla.edu/CapProbe

23 Oct. 3, 2004E2EMON 200423 Thanks!

Download ppt "Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of."

Similar presentations

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Milano 25/2/20031 Bandwidth Estimation for TCP Sources and its Application Prepared for QoS IP 2003 R. G. Garroppo, S.Giordano, M. Pagano, G. Procissi,

Milano 25/2/20031 Bandwidth Estimation for TCP Sources and its Application Prepared for QoS IP 2003 R. G. Garroppo, S.Giordano, M. Pagano, G. Procissi,
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.

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.
1 School of Computing Science Simon Fraser University CMPT 771/471: Internet Architecture & Protocols TCP-Friendly Transport Protocols.

1 School of Computing Science Simon Fraser University CMPT 771/471: Internet Architecture & Protocols TCP-Friendly Transport Protocols.
APOHN: Subnetwork Layering to Improve TCP Performance over Heterogeneous Paths April 4, 2006 Dzmitry Kliazovich, Fabrizio Granelli, University of Trento,

APOHN: Subnetwork Layering to Improve TCP Performance over Heterogeneous Paths April 4, 2006 Dzmitry Kliazovich, Fabrizio Granelli, University of Trento,
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,

Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
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,

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,
Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005.

Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005.
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.

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.
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.

1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
Quality of Service Issues in Multi-Service Wireless Internet Links George Xylomenos and George C. Polyzos Department of Informatics Athens University of.

Quality of Service Issues in Multi-Service Wireless Internet Links George Xylomenos and George C. Polyzos Department of Informatics Athens University of.
CapProbe: A Simple and Accurate Capacity Estimation Technique Kapoor et al., SIGCOMM ‘04.

CapProbe: A Simple and Accurate Capacity Estimation Technique Kapoor et al., SIGCOMM ‘04.
Adaptive Video Streaming in Vertical Handoff: A Case Study Ling-Jyh Chen, Guang Yang, Tony Sun, M. Y. Sanadidi, Mario Gerla Computer Science Department,

Adaptive Video Streaming in Vertical Handoff: A Case Study Ling-Jyh Chen, Guang Yang, Tony Sun, M. Y. Sanadidi, Mario Gerla Computer Science Department,
Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.

Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.

1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.

Internet Traffic Patterns Learning outcomes –Be aware of how information is transmitted on the Internet –Understand the concept of Internet traffic –Identify.
AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.

AQM for Congestion Control1 A Study of Active Queue Management for Congestion Control Victor Firoiu Marty Borden.
EECS122 – Lecture 5 Department of Electrical Engineering and Computer Sciences University of California Berkeley.

EECS122 – Lecture 5 Department of Electrical Engineering and Computer Sciences University of California Berkeley.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Performance Modeling Computer Science Division Department of Electrical Engineering and Computer.

Katz, Stoica F04 EECS 122: Introduction to Computer Networks Performance Modeling Computer Science Division Department of Electrical Engineering and Computer.
1 Design study for multimedia transport protocol in heterogeneous networks Haitao Wu; Qian Zhang; Wenwu Zhu; Communications, 2003. ICC '03. IEEE International.

1 Design study for multimedia transport protocol in heterogeneous networks Haitao Wu; Qian Zhang; Wenwu Zhu; Communications, ICC '03. IEEE International.

Similar presentations

Ads by Google