Passive Inference of Path Correlation Lili Wang, James N. Griffioen, Kenneth L. Calvert, Sherlia Shi Laboratory for Advanced Networking University of Kentucky.

Slides:



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

Traffic Control and the Problem of Congestion within the Internet By Liz Brown and Nadine Sur.
Impact of Interference on Multi-hop Wireless Network Performance Kamal Jain, Jitu Padhye, Venkat Padmanabhan and Lili Qiu Microsoft Research Redmond.
Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.
Restless bandits and congestion control Mark Handley, Costin Raiciu, Damon Wischik UCL.
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
CS640: Introduction to Computer Networks Mozafar Bag-Mohammadi Lecture 3 TCP Congestion Control.
Answers of Exercise 7 1. Explain what are the connection-oriented communication and the connectionless communication. Give some examples for each of the.
Path Optimization in Computer Networks Roman Ciloci.
1 Estimating Shared Congestion Among Internet Paths Weidong Cui, Sridhar Machiraju Randy H. Katz, Ion Stoica Electrical Engineering and Computer Science.
Distributed Algorithms for Secure Multipath Routing
1 Dynamics of End-host controlled Routing Mukund Seshadri Prof. Randy Katz Sahara Retreat Jan 2004.
PROMISE A Peer-to-Peer Media Streaming System Using CollectCast CPSC Presentation by Patrick Wong.
Source-Adaptive Multilayered Multicast Algorithms for Real- Time Video Distribution Brett J. Vickers, Celio Albuquerque, and Tatsuya Suda IEEE/ACM Transactions.
1 Cooperative Communications in Networks: Random coding for wireless multicast Brooke Shrader and Anthony Ephremides University of Maryland October, 2008.
1 A General Introduction to Tomography & Link Delay Inference with EM Algorithm Presented by Joe, Wenjie Jiang 21/02/2004.
High speed TCP’s. Why high-speed TCP? Suppose that the bottleneck bandwidth is 10Gbps and RTT = 200ms. Bandwidth delay product is packets (1500.
Monitoring Persistently Congested Internet Links Leiwen (Karl) Deng Aleksandar Kuzmanovic Northwestern University
Denial of Service Resilience in Ad Hoc Networks Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly Designed by Yao Zhao.
Multi-path Routing -Sridevi Bellary. Introduction Multipath routing is an alternative to single shortest path routing to distribute and alleviate congestion.
Available bandwidth measurement as simple as running wget D. Antoniades, M. Athanatos, A. Papadogiannakis, P. Markatos Institute of Computer Science (ICS),
1 TCP-LP: A Distributed Algorithm for Low Priority Data Transfer Aleksandar Kuzmanovic, Edward W. Knightly Department of Electrical and Computer Engineering.
Mobility Increases Capacity In Ad-Hoc Wireless Networks Lecture 17 October 28, 2004 EENG 460a / CPSC 436 / ENAS 960 Networked Embedded Systems & Sensor.
1 End-to-End Detection of Shared Bottlenecks Sridhar Machiraju and Weidong Cui Sahara Winter Retreat 2003.
Data Communication and Networks
Reliable Transport Layers in Wireless Networks Mark Perillo Electrical and Computer Engineering.
Ningning HuCarnegie Mellon University1 A Measurement Study of Internet Bottlenecks Ningning Hu (CMU) Joint work with Li Erran Li (Bell Lab) Zhuoqing Morley.
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.
Multicast Congestion Control in the Internet: Fairness and Scalability
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
A Multi-Path Routing Service for Immersive Environments Sherlia Shi, Lili Wang, Kenneth L. Calvert, and James Griffioen Laboratory for Advanced Networking.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED Kaixin Xu, Mario Gerla UCLA Computer Science Department
Power Save Mechanisms for Multi-Hop Wireless Networks Matthew J. Miller and Nitin H. Vaidya University of Illinois at Urbana-Champaign BROADNETS October.
Bandwidth Estimation TexPoint fonts used in EMF.
Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.
Message-Passing for Wireless Scheduling: an Experimental Study Paolo Giaccone (Politecnico di Torino) Devavrat Shah (MIT) ICCCN 2010 – Zurich August 2.
Link Scheduling & Queuing COS 461: Computer Networks
Network Survivability Against Region Failure Signal Processing, Communications and Computing (ICSPCC), 2011 IEEE International Conference on Ran Li, Xiaoliang.
Packet Dispersion in IEEE Wireless Networks Mingzhe Li, Mark Claypool and Bob Kinicki WPI Computer Science Department Worcester, MA 01609
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Interconnect simulation. Different levels for Evaluating an architecture Numerical models – Mathematic formulations to obtain performance characteristics.
Maximizing the lifetime of WSN using VBS Yaxiong Zhao and Jie Wu Computer and Information Sciences Temple University.
N. Hu (CMU)L. Li (Bell labs) Z. M. Mao. (U. Michigan) P. Steenkiste (CMU) J. Wang (AT&T) Infocom 2005 Presented By Mohammad Malli PhD student seminar Planete.
1 Capacity Dimensioning Based on Traffic Measurement in the Internet Kazumine Osaka University Shingo Ata (Osaka City Univ.)
CS223 Advanced Data Structures and Algorithms 1 Maximum Flow Neil Tang 3/30/2010.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
1 Analysis of a window-based flow control mechanism based on TCP Vegas in heterogeneous network environment Hiroyuki Ohsaki Cybermedia Center, Osaka University,
November 4, 2003Applied Research Laboratory, Washington University in St. Louis APOC 2003 Wuhan, China Cost Efficient Routing in Ad Hoc Mobile Wireless.
A Bandwidth Scheduling Algorithm Based on Minimum Interference Traffic in Mesh Mode Xu-Yajing, Li-ZhiTao, Zhong-XiuFang and Xu-HuiMin International Conference.
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
1 Advanced Transport Protocol Design Nguyen Multimedia Communications Laboratory March 23, 2005.
SERENA: SchEduling RoutEr Nodes Activity in wireless ad hoc and sensor networks Pascale Minet and Saoucene Mahfoudh INRIA, Rocquencourt Le Chesnay.
A Transport Layer Approach for Improving End-to-End Performance and Robustness Using Redundant Paths Min Zhang, Junwen Lai, Arvind Krishnamurthy, Larry.
The Impact of False Sharing on Shared Congestion Management Srinivasa Aditya Akella Joint work with Srini Seshan and Hari Balakrishnan 28 Feb, 2001.
An Analysis of AIMD Algorithm with Decreasing Increases Yunhong Gu, Xinwei Hong, and Robert L. Grossman National Center for Data Mining.
Load Balancing of Multipath Source Routing in Ad Hoc Networks Lianfang Zhang, Zenghua Zhao, Yantai Shu, and Lei Wang Department of Computer Science Tianjin.
Aditya Akella The Impact of False Sharing on Shared Congestion Management Aditya Akella with Srinivasan Seshan and Hari Balakrishnan.
Impact of Interference on Multi-hop Wireless Network Performance
By, Nirnimesh Ghose, Master of Science,
Monitoring Persistently Congested Internet Links
Providing QoS through Active Domain Management
AMP: A Better Multipath TCP for Data Center Networks
Research Opportunities in IP Wide Area Storage
COMP/ELEC 429/556 Fall 2017 Homework #2
CSE 550 Computer Network Design
Maximum Flow Neil Tang 4/8/2008
Single path routing in most of the servers
Presentation transcript:

Passive Inference of Path Correlation Lili Wang, James N. Griffioen, Kenneth L. Calvert, Sherlia Shi Laboratory for Advanced Networking University of Kentucky CPSC538A course presentation Presented by : Lin Zhong

Introduction  Investigate approaches based on passive measurement of TCP throughput to determine the level of shared congestion. - does not send any probe traffic, passively gathers information, and learn. -intended for use with long-lived, high- bandwidth applications.

Related Work Multipath routing techniques (RON) Multiple paths from multiple replicated sources to increase (MDC, Erasure codes) Integrate congestion control across multiple concurrent flows. (Modify TCP, maintain network congestion and schedule data transmission.) Detect shared congestion (packet-pair, active probe)

Capacity Conservation (ALG1) 1.reduces the rate of one of the flows by a known amount for a fixed time period (i.e., we turn the flow off) and then later returns the flow to its normal rate (i.e., we turn the flow back on). 2.looks for proportional changes in the bandwidth of the other flow(s). 3.If a change is consistent with other flow’s modulation, we assume the flows share a bottleneck; otherwise we assume they take independent paths.

Emulab Experiement

Limitation of Alg1 when the background traffic changes frequently, when the total number of flows sharing the bottleneck is large. there are also many situations where the level of background traffic is constantly changing.

Correlated Variation (ALG2) Basic idea: random background traffic will cause random changes to the foreground flows. Correlation coefficent :

Computing the Correlation Lazy-evaluation approach -Nodes exchange their available bandwidth number -Candidate paths through the overlay are selected -Only measure the links which we concern their correlation -Record the path correlation information for future path selection.

Conclusion Proposed two techniques to detect path correlation - Observe the throughput change of one flow when other flow starts or finishing sending. (background traffic is fairly constantly) -Apply statistic technique to infer path correlation (background traffic is changing randomly) Assume busy sources