Dennis Ippoliti 12/6/2004 1 MULTI-PATH ROUTING A packet by packet multi-path routing approach.

Slides:



Advertisements
Similar presentations
COGNITIVE PACKET NETWORKS
Advertisements

Internet Measurement Conference 2003 Source-Level IP Packet Bursts: Causes and Effects Hao Jiang Constantinos Dovrolis (hjiang,
7. 7 Chapter 13 Transmission Control Protocol (TCP) Retransmission and Time-Out.
1 School of Computing Science Simon Fraser University CMPT 771/471: Internet Architecture & Protocols TCP-Friendly Transport Protocols.
Cisco S3 C5 Routing Protocols. Network Design Characteristics Reliable – provides mechanisms for error detection and correction Connectivity – incorporate.
Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
By Arjuna Sathiaseelan Tomasz Radzik Department of Computer Science King’s College London EPDN: Explicit Packet Drop Notification and its uses.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
© 2007 Cisco Systems, Inc. All rights reserved.ICND2 v1.0—3-1 Medium-Sized Routed Network Construction Reviewing Routing Operations.
Improving TCP Performance over MANETs by Exploiting Cross-Layer Information Awareness Xin Yu NYU Presented by: David Choffnes.
Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005.
6/3/ Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross-Layer Information Awareness CS495 – Spring 2005 Northwestern University.
XORs in the air: Practical Wireless Network Coding Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft SIGCOMM ‘06 Presented.
Leveraging Multiple Network Interfaces for Improved TCP Throughput Sridhar Machiraju, Prof. Randy Katz.
1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for.
Data Communications Packet Switching.
Teknik Routing Pertemuan 20 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
Leveraging Multiple Network Interfaces for Improved TCP Throughput Sridhar Machiraju SAHARA Retreat, June 10-12, 2002.
1 Internet Networking Spring 2006 Tutorial 10 The Eifel Detection Algorithm for TCP RFC 3522.
ACN: Congestion Control1 Congestion Control and Resource Allocation.
Routing.
Reliable Transport Layers in Wireless Networks Mark Perillo Electrical and Computer Engineering.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
1 K. Salah Module 6.1: TCP Flow and Congestion Control Connection establishment & Termination Flow Control Congestion Control QoS.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
EECC694 - Shaaban #1 lec #7 Spring The OSI Reference Model Network Layer.
Multipath Routing CS 522 F2003 Beaux Sharifi. Agenda Description of Multipath Routing Necessity of Multipath Routing 3 Major Components Necessary for.
Path selection Packet scheduling and multipath Sebastian Siikavirta and Antti aalto.
Introduction 1 Lecture 14 Transport Layer (Congestion Control) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer Science.
CIS 725 Wireless networks. Low bandwidth High error rates.
Designing a DHT for low latency and high throughput Robert Vollmann P2P Information Systems.
ROUTING BASICS. Why are Routers Necessary? One of the key components of the technical infrastructure of the network One of the key components of the technical.
1 Robust Transport Protocol for Dynamic High-Speed Networks: enhancing XCP approach Dino M. Lopez Pacheco INRIA RESO/LIP, ENS of Lyon, France Congduc Pham.
COMT 4291 Communications Protocols and TCP/IP COMT 429.
Introduction to Networks CS587x Lecture 1 Department of Computer Science Iowa State University.
Switching breaks up large collision domains into smaller ones Collision domain is a network segment with two or more devices sharing the same Introduction.
Transport over Wireless Networks Myungchul Kim
1 Network Layer Lecture 13 Imran Ahmed University of Management & Technology.
Transmission Control Protocol TCP Part 2 University of Glamorgan Networked & Distributed Systems.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
Michael Schapira Yale and UC Berkeley Joint work with P. Brighten Godfrey, Aviv Zohar and Scott Shenker.
Distance Vector Routing Protocols Dynamic Routing.
1 Computer Communication & Networks Lecture 21 Network Layer: Delivery, Forwarding, Routing Waleed.
An internet is a combination of networks connected by routers. When a datagram goes from a source to a destination, it will probably pass through many.
Teknik Routing Pertemuan 10 Matakuliah: H0524/Jaringan Komputer Tahun: 2009.
Review of key networking techniques: –Reliable communication over unreliable channels –Error detection and correction –Medium access control –routing –Congestion.
4: Network Layer4b-1 OSPF (Open Shortest Path First) r “open”: publicly available r Uses Link State algorithm m LS packet dissemination m Topology map.
TCP Congestion Control 컴퓨터공학과 인공지능 연구실 서 영우. TCP congestion control2 Contents 1. Introduction 2. Slow-start 3. Congestion avoidance 4. Fast retransmit.
IP Configuration API. Network Interface Configuration NAIfconfigIsDeviceUp() NAIfconfigDeviceFromInterface() NAIfconfigBringDeviceUp() NAIfconfigSetIpAddress()
Optimization Problems in Wireless Coding Networks Alex Sprintson Computer Engineering Group Department of Electrical and Computer Engineering.
1/12 WiSE: A Novel Efficient Transport Protocol for Wireless Networks Roberta Fracchia Joint work with C. Casetti, C. Chiasserini, M. Meo.
TeXCP: Protecting Providers’ Networks from Unexpected Failures & Traffic Spikes Dina Katabi MIT - CSAIL nms.csail.mit.edu/~dina.
1 Transport Layer: Basics Outline Intro to transport UDP Congestion control basics.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
A Transport Layer Approach for Improving End-to-End Performance and Robustness Using Redundant Paths Min Zhang, Junwen Lai, Arvind Krishnamurthy, Larry.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Internet Traffic Engineering Motivation: –The Fish problem, congested links. –Two properties of IP routing Destination based Local optimization TE: optimizing.
Multipath Congestion Control Wenpeng Zhou Instructor Andrei Gurtov.
11 CS716 Advanced Computer Networks By Dr. Amir Qayyum.
MMPTCP: A Multipath Transport Protocol for Data Centres 1 Morteza Kheirkhah University of Edinburgh, UK Ian Wakeman and George Parisis University of Sussex,
Prof. Alfred J Bird, Ph.D., NBCT Office – Science 3rd floor – S Office Hours – Monday and Thursday.
Prof. Alfred J Bird, Ph.D., NBCT Office – McCormick 3rd floor 607 Office Hours – Monday 3:00 to 4:00 and.
Confluent vs. Splittable Flows
Computer Networks Routing Algorithms.
By, Nirnimesh Ghose, Master of Science,
ExOR:Opportunistic Multi-Hop Routing For Wireless Networks
A packet by packet multi-path routing approach
Review of Internet Protocols Transport Layer
Presentation transcript:

Dennis Ippoliti 12/6/ MULTI-PATH ROUTING A packet by packet multi-path routing approach

2 Dennis Ippoliti 12/6/2004 OVERVIEW Multi-path routing (Benefits / Problems) Multi-Path routing protocol Multi-Path routing Transport Protocol Per-hop Packet Distribution Simulation results

3 Dennis Ippoliti 12/6/2004 Multi Path Routing In a well connected network multiple paths exist Typically, one path at a time is chosen and all traffic is sent over that path With Multi-Path routing, traffic is diffused over several paths at the same time

4 Dennis Ippoliti 12/6/2004 Benefits of Multi-Path routing Enables Load balancing implementations Simplifies algorithms if single flows can take multiple paths Increases throughput Decreases delay Takes advantage of considerable redundancy 90% of all US Sprintlink POP pairs are connected by 4 or more paths Increases Robustness to Eavesdropping Attackers must sniff multiple links when traffic is diffused

5 Dennis Ippoliti 12/6/2004 Challenges in Multi-Path routing Route Identification Identifying available routes Route Selection Round Robin, Weighted Selection, Other Metrics (Throughput / Delay / Drop rate) Different subsets of routes will maximize/minimize different metrics Leads to persistent packet re-sequencing When multiple routes are used, the probability that packets are received out of sequence is high

6 Dennis Ippoliti 12/6/2004 Multi-Path Routing Algorithms In a network G = (N, L) with N nodes and L links, MP Algorithms identify S(I,j) such that S(I,j) = the set of successor nodes to rout traffic from node I to node j. Multi-path routing algorithms identify S(I,j) and rank order according to some minimum or maximum desired metric or combination of metrics

7 Dennis Ippoliti 12/6/2004 Multi-Path Routing Algorithms Multi-Path Distance Vector (MPDV) Multi-Path Link State (MPLS) Enhanced Interior Gateway Routing Protocol

8 Dennis Ippoliti 12/6/2004 Multi-Path Transport Protocol Multi-Path environment causes persistent packet reordering

9 Dennis Ippoliti 12/6/2004 Multi-Path Transport Protocols TCP is not effective in this environment TCP uses windowing for error and congestion control When packets are received out of order, DUPACKS are generated DUPACKS typically decrease window size by 50% DUPACKS cause sender to enter Fast Retransmit Persistent DUPACKS reduce throughput while increasing traffic load

10 Dennis Ippoliti 12/6/2004 Multi Path Transport Protocols Eifel Algorithm Uses time-stamp option to differentiate between transmissions and re-transmissions Restores TCP congestion window to value prior to retransmit when packet received DSACK Uses DSACK option to communicate from receiver to sender Dynamically manipulate dupthresh value TCP Persistent Reordering Ignores DUPACKS. Uses timers to identify packet loss

11 Dennis Ippoliti 12/6/2004 Route Selection Round Robin and pure load balancing not effective Do not take network conditions into consideration Minimum Delay Routing As delay increases, the proportion of traffic distributed to that rout decreases

12 Dennis Ippoliti 12/6/2004 Route Selection Minimum Delay Routing with dynamic service differentiation In multi path routing, a greedy node can starve other nodes on the network A B CD A B CD

13 Dennis Ippoliti 12/6/2004 Route Selection I experimented with Minimum Delay Routing with dynamic service differentiation Traffic that is on a primary route is given priority over traffic on a secondary route A B CD A B CD

14 Dennis Ippoliti 12/6/2004 Simulation Method Developed Network Simulator software similar to the Click Router Platform C++ objects represent Nodes and Links Static Multi-Paths RR, Load Balancing, and Minimum Delay Routing as Route Selection methods TCP-PR as transport protocol

15 Dennis Ippoliti 12/6/2004 Results TCP-PR 200% through-put over standard TCP Round Robin, Load balancing, and Minimum delay route selection performed the same when link cost equal Only Minimum Delay performed well when link cost was unequal Dynamic service differentiation prevents starvation in the presence of greedy flows

Dennis Ippoliti 12/6/ TCP-PR QUESTIONS?