Solving the Congestion Problem using ICN Principles Ioannis Psaras EPSRC Fellow University College London

Slides:



Advertisements
Similar presentations
The Transmission Control Protocol (TCP) carries most Internet traffic, so performance of the Internet depends to a great extent on how well TCP works.
Advertisements

Congestion Control and Fairness Models Nick Feamster CS 4251 Computer Networking II Spring 2008.
Advanced satellite infrastructures in future global Grid computing: network solutions to compensate delivery delay Blasco Bonito, Alberto Gotta and Raffaello.
TCP--Revisited. Background How to effectively share the network? – Goal: Fairness and vague notion of equality Ideal: If N connections, each should get.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Introduction 2 1: Introduction.
Cs/ee 143 Communication Networks Chapter 6 Internetworking Text: Walrand & Parekh, 2010 Steven Low CMS, EE, Caltech.
Chabot College Chapter 2 Review Questions Semester IIIELEC Semester III ELEC
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
Congestion Control Algorithms
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
Principles of Congestion Control Chapter 3.6 Computer Networking: A top-down approach.
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.
Traffic Shaping Why traffic shaping? Isochronous shaping
Resource Pooling A system exhibits complete resource pooling if it behaves as if there was a single pooled resource. The Internet has many mechanisms for.
Congestion Control An Overview -Jyothi Guntaka. Congestion  What is congestion ?  The aggregate demand for network resources exceeds the available capacity.
Congestion control principles Presentation by: Farhad Rad (Advanced computer Networks Lesson in
Congestion Dr. Abdulaziz Almulhem. Almulhem©20012 Congestion It occurs when network resources are becoming scarce High demand Over utilized Offered load.
Jang, Donghyun 2011/4/4 1/21.
1 Congestion Control. Transport Layer3-2 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for.
December 20, 2004MPLS: TE and Restoration1 MPLS: Traffic Engineering and Restoration Routing Zartash Afzal Uzmi Computer Science and Engineering Lahore.
William Stallings Data and Computer Communications 7th Edition
High-performance bulk data transfers with TCP Matei Ripeanu University of Chicago.
Multi-path Routing -Sridevi Bellary. Introduction Multipath routing is an alternative to single shortest path routing to distribute and alleviate congestion.
1 Web Proxies Dr. Rocky K. C. Chang 6 November 2005.
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Data Communication and Networks
Switching Techniques Student: Blidaru Catalina Elena.
Data Transfer Case Study: TCP  Go-back N ARQ  32-bit sequence # indicates byte number in stream  transfers a byte stream, not fixed size user blocks.
3: Transport Layer3b-1 Principles of Congestion Control Congestion: r informally: “too many sources sending too much data too fast for network to handle”
Transport Layer 4 2: Transport Layer 4.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
Network management Reinhard Laroy BIPT European Parliament - 27 February 2012.
These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (
1 Chapter 16 Protocols and Protocol Layering. 2 Protocol  Agreement about communication  Specifies  Format of messages (syntax)  Meaning of messages.
CONGESTION CONTROL and RESOURCE ALLOCATION. Definition Resource Allocation : Process by which network elements try to meet the competing demands that.
ECEN “Internet Protocols and Modeling” Course Materials: Papers, Reference Texts: Bertsekas/Gallager, Stuber, Stallings, etc Grading (Tentative):
1 Lecture 14 High-speed TCP connections Wraparound Keeping the pipeline full Estimating RTT Fairness of TCP congestion control Internet resource allocation.
Congestion control for Multipath TCP (MPTCP) Damon Wischik Costin Raiciu Adam Greenhalgh Mark Handley THE ROYAL SOCIETY.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
COP 5611 Operating Systems Spring 2010 Dan C. Marinescu Office: HEC 439 B Office hours: M-Wd 2:00-3:00 PM.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
Transport Layer3-1 TCP throughput r What’s the average throughout of TCP as a function of window size and RTT? m Ignore slow start r Let W be the window.
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
Thoughts on the Evolution of TCP in the Internet (version 2) Sally Floyd ICIR Wednesday Lunch March 17,
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
Revisiting Resource Pooling The Case for In-Network Resource Sharing Ioannis Psaras, Lorenzo Saino, George Pavlou University College London [i.psaras,
LECTURE 12 NET301 11/19/2015Lect NETWORK PERFORMANCE measures of service quality of a telecommunications product as seen by the customer Can.
79 Sidevõrgud IRT 4060/ IRT 0020 vooruloeng 8 / 3. nov 2004 Vooülekanne Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
Data Communication Networks Lec 13 and 14. Network Core- Packet Switching.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Bandwidth estimation: metrics, measurement techniques, and tools Presenter: Yuhang Wang.
Data and Computer Communications Chapter 7 Circuit Switching and Packet Switching.
Approaches towards congestion control
Vocabulary Prototype: A preliminary sketch of an idea or model for something new. It’s the original drawing from which something real might be built or.
Packet Switching Datagram Approach Virtual Circuit Approach
I-CAN Workshop, AUEB, Athens, 2-5 June 2015
TCP Congestion Control
Vocabulary Prototype: A preliminary sketch of an idea or model for something new. It’s the original drawing from which something real might be built or.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
FAST TCP : From Theory to Experiments
Data Communication Networks
PRESENTATION COMPUTER NETWORKS
Switching Techniques.
Revisiting Resource Pooling The Case for In-Network Resource Sharing
EE 122: Lecture 22 (Overlay Networks)
Transport Layer: Congestion Control
Presentation transcript:

Solving the Congestion Problem using ICN Principles Ioannis Psaras EPSRC Fellow University College London ICNRG Meeting, Prague, July 2015

In-Network Resource Pooling In-net caching from a different angle ACM HotNets 2014 I. Psaras, L. Saino, G. Pavlou “Revisiting Resource Pooling: The case for In-Network Resource Sharing”

The Resource Pooling Principle “Pooling of customer demands, along with pooling of the resources used to fill those demands” “networked resources behave as a pooled resource” Internet (among others): a network of resources –From bandwidth, computation and storage resources, to information/content and service resources –Packet switching enables pooling of link capacities and routers processing power –Buffers enable pooling of link capacity at adjacent time periods –MPLS TE and ECMP enable pooling of multiple paths

Pooled resources Links Switching devices Buffers Paths Sub-paths Packet caches Packet switching ECMP, MPLS TE, MPTCP Our proposal

The Resource Pooling Principle We claim that: Pooling can be thought of as a tool to manage uncertainty. Uncertainty in the Internet (among others): 1.Senders overloading the network with traffic 2.Excessive demand for bandwidth over some particular link/area Target: Maintain stability and guarantee fairness

Current State of Affairs The Long Long Discussion on TCP TCP deals with uncertainty using the “one-out one-in” principle TCP effectively deals with uncertainty by (proactively) suppressing demand! TCP is moving traffic as fast as the path’s slowest link End-points have to speculate on the resources available along the e2e path

Vision 1.Push traffic as far in the path and as fast as possible 2.Once in front of the bottleneck, store traffic temporarily in custodian nodes/routers and deal with congestion locally 3.Exploit all available (sub-)paths making decisions on a hop-by-hop manner.

Caches and resource pooling The presence of ubiquitous packet caches enables more efficient usage of resources by enabling pooling of sub- paths. ABC ABC TiTi T i+1 X X

Eliminating Uncertainty Information-Centric Networking Request and Data paths are symmetric Instead of the “data-ACK” model of TCP, in ICN we have a “request-data” model Receivers (instead of senders) regulate the traffic that is pushed in the network Based on requests forwarded, each forwarding entity knows how much traffic to expect within one RTT. Uncertainty #1 is minimised!

Eliminating Uncertainty In-Network Caching Caching has been used for resource optimisation –Reduce delay, save on bandwidth etc. Overlay Caching: –Put caches in “strategic” places and redirect (HTTP) requests to those caches In-Network Caching: –Individually named and self-identifiable packets/chunks allow for in- network storage! –Put caches in every router and serve network-layer requests for named chunks from caches on the path We use in-network caching for temporary storage Uncertainty Uncertainty #2 (temporarily) accommodated

Stability & Fairness Global Stability Local Fairness Local Stability Global Fairness

3-Phase Operation Push-data phase – Open-Loop System –Processor-sharing, RCP-like transmission –Open loop system – senders send even more than what they have received requests for Push data as far and as quickly as possible Cache & Detour phase –Every router monitors incoming Requests –When demand is expected to exceed supply, the local router tries to find alternative paths to detour –In the meantime traffic in excess (if any) is cached locally Backpressure phase – Closed-Loop System –If alternative paths do not exist or are equally congested: Pace Requests Send notification upstream to slow down and enter closed-loop transmission

3-Phase Operation A A B B C C E E F F D D Push-data phase – Open-Loop System –Processor-sharing, RCP-like transmission –Open loop system – senders send even more than what they have received requests for Push data as far and as quickly as possible Send at full rate

3-Phase Operation A A B B C C E E F F D D Cache & Detour phase –Every router monitors incoming Requests –When demand is expected to exceed supply, the local router tries to find alternative paths to detour –In the meantime traffic in excess (if any) is cached locally

3-Phase Operation A A B B C C E E F F D D Backpressure phase – Closed-Loop System –If alternative paths do not exist or are equally congested: Pace Requests Send notification upstream to slow down and enter closed-loop transmission

Data on detour availability

Some (very initial) Results

Summary, Open Issues and Things We Don’t (Yet) Know Information-Centric Networks: –Requires investment and effort –Worth doing, but need to get the full set of advantages There is an opportunity to deal with congestion control at the network layer Open Issues: –How do you know detour paths are not congested –How will this co-exist with traditional TCP flows? –Out of order delivery –Flows swapping between original and detour paths

Questions? Thanks! Ioannis Psaras