Confluent vs. Splittable Flows

Slides:



Advertisements
Similar presentations
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Advertisements

1 Traffic Engineering (TE). 2 Network Congestion Causes of congestion –Lack of network resources –Uneven distribution of traffic caused by current dynamic.
Improving Datacenter Performance and Robustness with Multipath TCP Costin Raiciu, Sebastien Barre, Christopher Pluntke, Adam Greenhalgh, Damon Wischik,
UNIT-IV Computer Network Network Layer. Network Layer Prepared by - ROHIT KOSHTA In the seven-layer OSI model of computer networking, the network layer.
Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005.
Routing.
Dennis Ippoliti 12/6/ MULTI-PATH ROUTING A packet by packet multi-path routing approach.
1 Algorithms for Bandwidth Efficient Multicast Routing in Multi-channel Multi-radio Wireless Mesh Networks Hoang Lan Nguyen and Uyen Trang Nguyen Presenter:
1 Pertemuan 20 Teknik Routing Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Group 3 Sandeep Chinni Arif Khan Venkat Rajiv. Delay Tolerant Networks Path from source to destination is not present at any single point in time. Combining.
Multipath Routing in Wireless Mesh Networks Mobile Adhoc and Sensor Systems (MASS), 2006 IEEE International Conference on Author: Nagesh S. Nandiraju,
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Symbiotic Routing in Future Data Centers Hussam Abu-Libdeh Paolo Costa Antony Rowstron Greg O’Shea Austin Donnelly MICROSOFT RESEARCH Presented By Deng.
Dzmitry Kliazovich University of Luxembourg, Luxembourg
1 Traffic Engineering By Kavitha Ganapa. 2 Introduction Traffic engineering is concerned with the issue of performance evaluation and optimization of.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
Assignment 1  Chapter 1:  Question 11  Question 13  Question 14  Question 33  Question 34  Chapter 2:  Question 6  Question 39  Chapter 3: 
Fall, 2001CS 6401 Switching and Routing Outline Routing overview Store-and-Forward switches Virtual circuits vs. Datagram switching.
1 Computer Networks Chapter 5. Network layer The network layer is concerned with getting packets from the source all the way to the destination. Getting.
Puzzle You have 2 glass marbles Building with 100 floors
Network Layer COMPUTER NETWORKS Networking Standards (Network LAYER)
Routing Metrics for Wireless Mesh Networks
Chapter 7: Transport Layer
Impact of Interference on Multi-hop Wireless Network Performance
2018/4/23 Dynamic Load-balanced Path Optimization in SDN-based Data Center Networks Author: Yuan-Liang Lan , Kuochen Wang and Yi-Huai Hsu Presenter: Yi-Hsien.
Routing Metrics for Wireless Mesh Networks
Architecture and Algorithms for an IEEE 802
Data Center Network Architectures
Topics discussed in this section:
Distributed Systems CS
Congestion Control, Quality of Service, and Internetworking
ECE 544: Traffic engineering (supplement)
UNIT-V Transport Layer protocols for Ad Hoc Wireless Networks
Improving Datacenter Performance and Robustness with Multipath TCP
What Are Routers? Routers are an intermediate system at the network layer that is used to connect networks together based on a common network layer protocol.
Isabella Cerutti, Andrea Fumagalli, Sonal Sheth
Improving Datacenter Performance and Robustness with Multipath TCP
Congestion Control and Resource Allocation
Distributed Control Plane
Ad-hoc Transport Layer Protocol (ATCP)
TCP over Wireless Networks
Routing.
An Equal-Opportunity-Loss MPLS-Based Network Design Model
Routing in Wireless Ad Hoc Networks by Analogy to Electrostatic Theory
Lecture XVII: Distributed Systems Algorithms Inspired by Biology
Congestion Control, Internet transport protocols: udp
Routing Metrics for Wireless Mesh Networks
A New Multipath Routing Protocol for Ad Hoc Wireless Networks
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
Provision of Multimedia Services in based Networks
TCP in Mobile Ad-hoc Networks
NTHU CS5421 Cloud Computing
Distributed Channel Assignment in Multi-Radio Mesh Networks
Kevin Lee & Adam Piechowicz 10/10/2009
TCP in Wireless Ad-hoc Networks
PRESENTATION COMPUTER NETWORKS
The Impact of Multihop Wireless Channel on TCP Performance
EE 122: Lecture 7 Ion Stoica September 18, 2001.
Network Architecture for Cyberspace
Distributed Systems CS
EE 122: Lecture 22 (Overlay Networks)
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. I propose ‘extent of resource pooling’
Congestion Control and Resource Allocation
Routing.
Achieving Resilient Routing in the Internet
Single path routing in most of the servers
Distributed Systems CS
Presentation transcript:

Confluent vs. Splittable Flows Niranjan Mysore, Radhika Woo, Dong Hyuk

Problem Definition and Motivation Todays Internet – Confluent Flow Model - routing protocols are responsible for constructing paths to the destination Static Routing – Manually configure next hop. Dynamic Routing – Optimal path - metrics : Hop Count Bandwidth of link Communication cost So although multiple paths may exist – current Internet utilises only the optimal path to the destination Some sophisticated routing protocols support multiple paths to the same destination. Unlike single-path algorithms, these multipath algorithms permit traffic multiplexing over multiple lines. The advantages of multipath algorithms are obvious: They can provide substantially better throughput and reliability. This is generally called load sharing. ECE4605 - Advanced Internetworking

Problem Definition and Motivation Load balancing – Different flows are routed through different paths to the destination – so as to utilize network capacity. If congestion aware load balancing is done, better bandwidth availability for the flows is ensured – by avoiding the congested paths. ECE4605 - Advanced Internetworking

Problem Definition and Motivation Flow Splittability - Each flow takes more than one path to reach the destination. If sequencing and other factors are managed for the flow, and decisions are taken based on bandwidth available along each path, it is possible to make good use of the network capacity. ECE4605 - Advanced Internetworking

Need for Flow Splittability / Load Balancing Fault tolerance Bandwidth aggregation (FS only) Utilizing multiple low bandwidth links in an under provisioned network to the best of its capacity Increasing Internet Capacity utilization, and thus indirectly improving underlying service ECE4605 - Advanced Internetworking

Problem Definition and Motivation We want to compare an approach to Load Balancing to Flow Splittability and try to find which is better ECE4605 - Advanced Internetworking

ECE4605 - Advanced Internetworking Background Reading Enabling the lowest-cost multiservice networks - Marconi White Paper Flow Splitting Approach for Path Provisioning and Path Protection Problems - Rauf Izmailov et al. A Transport Layer Approach for Achieving Aggregate Bandwidths on Multi-homed Mobile Hosts - R. Sivakumar et al pTCP: An End-to-End Transport Layer Protocol for Striped Connections - R. Sivakumar et al On Achieving Weighted Service Differentiation: An End-to-End Perspective -R. Sivakumar et al ECE4605 - Advanced Internetworking

ECE4605 - Advanced Internetworking Work done Custom Simulator – to model graph theoretic problem Chose set of nodes and define bandwidth of links between them Introduce flows into the network between any pairs of nodes In load balancing – find the widest path between source and destination for flow. Subtract the flow bw requirement from the path (to account for flow) In flow splittability – split the flow in the ratio of the bandwidths along all paths to the destination. Subtract the bw along each path by flow requirement ECE4605 - Advanced Internetworking

Simulation on custom simulator Random load generation Random source / destination selection Inter-arrival time between each flow Uniformly distributed between [0, 4] Lifetime Uniformly distributed between [150, 249] Required bandwidth Uniformly distributed between [0, bw] Used admission control ECE4605 - Advanced Internetworking

ECE4605 - Advanced Internetworking Planet Lab An overlay network supported by a consortium of educational and corporate institutions for research Chose from available nodes. Built a client server application which could send and receive TCP flows between source and destination – employing tunneling in intermediate nodes. Use same Load balancing and Flow Splittability policies as before. Measurements are real time – involve real delays (queuing and transmission), drops ECE4605 - Advanced Internetworking

2.93 0.50 3.25 4.75 1.01 3.77 2.87 4.12

Simulation on PlanetLab Simulation architecture Scenario generation Scheduling based on policy Execution by ordering Agent Agent Client Server Tunnel Main controller Agent Client Server Tunnel Agent Client Server Tunnel Agent Client Server Tunnel Measure throughput using Tcpdump and ethereal ECE4605 - Advanced Internetworking

Simulation on custom simulator (cont’d) ECE4605 - Advanced Internetworking

Simulation on custom simulator (cont’d) ECE4605 - Advanced Internetworking

Simulation on PlanetLab (cont’d) Problem with the Internet simulation Need to measure in-flight available bandwidth We cannot know the congestion size of TCP on Planetlab Just used simple policy in the following results LB: alternating link FS: splitting traffic evenly Demo ECE4605 - Advanced Internetworking

Simulation on PlanetLab (cont’d) ECE4605 - Advanced Internetworking

Simulation on PlanetLab (cont’d) LB (UT) ECE4605 - Advanced Internetworking

Simulation on PlanetLab (cont’d) FS1 (UT) ECE4605 - Advanced Internetworking

Simulation on PlanetLab (cont’d) FS2 (UT) ECE4605 - Advanced Internetworking

ECE4605 - Advanced Internetworking Summary FS performed better than LB when we used large loads and admission control – and assumed no underlying rate control LB performed equal or better than FS in certain situations when we used different light load and underlying rate control – with simple policies FS performs better as the number of reflection points increases. ECE4605 - Advanced Internetworking