A Transport Protocol for Content-Centric Networking with Explicit Congestion Control Feixiong Zhang, Yanyong Zhang (Rutgers Univ.), Alex Reznik (InterDigital),

Slides:



Advertisements
Similar presentations
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
Advertisements

01. Apr INF-3190: Congestion Control Congestion Control Foreleser: Carsten Griwodz
1 © 2013 Cisco and/or its affiliates. All rights reserved. An Improved Hop-by-hop Interest Shaper for Congestion Control in Named Data Networking Yaogong.
1 Transport Protocols & TCP CSE 3213 Fall April 2015.
Computer Networks Transport Layer. Topics F Introduction (6.1)  F Connection Issues ( ) F TCP (6.4)
Prentice HallHigh Performance TCP/IP Networking, Hassan-Jain Chapter 2 TCP/IP Fundamentals.
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 6 Transport Layer.
Transport Layer – TCP (Part2) Dr. Sanjay P. Ahuja, Ph.D. Fidelity National Financial Distinguished Professor of CIS School of Computing, UNF.
CISCO NETWORKING ACADEMY PROGRAM (CNAP)
Chapter 7: Transport Layer
Doc.: IEEE /0604r1 Submission May 2014 Slide 1 Modeling and Evaluating Variable Bit rate Video Steaming for ax Date: Authors:
CS 408 Computer Networks Congestion Control (from Chapter 05)
Suphakit Awiphan, Takeshi Muto, Yu Wang, Zhou Su, Jiro Katto
Using FEC for Rate Adaptation of Multimedia Streams Marcin Nagy Supervised by: Jörg Ott Instructed by: Varun Singh Conducted at Comnet, School of Electrical.
XCP: Congestion Control for High Bandwidth-Delay Product Network Dina Katabi, Mark Handley and Charlie Rohrs Presented by Ao-Jan Su.
Shivkumar Kalyanaraman Rensselaer Polytechnic Institute 1 ECSE-4690: Experimental Networking Informal Quiz: TCP Shiv Kalyanaraman:
XORs in the air: Practical Wireless Network Coding Sachin Katti, Hariharan Rahul, Wenjun Hu, Dina Katabi, Muriel Medard, Jon Crowcroft SIGCOMM ‘06 Presented.
Transport Layer 3-1 Fast Retransmit r time-out period often relatively long: m long delay before resending lost packet r detect lost segments via duplicate.
Congestion Dr. Abdulaziz Almulhem. Almulhem©20012 Congestion It occurs when network resources are becoming scarce High demand Over utilized Offered load.
1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.
Traffic Sensitive Active Queue Management - Mark Claypool, Robert Kinicki, Abhishek Kumar Dept. of Computer Science Worcester Polytechnic Institute Presenter.
CSEE W4140 Networking Laboratory Lecture 7: TCP congestion control Jong Yul Kim
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Department of Electronic Engineering City University of Hong Kong EE3900 Computer Networks Transport Protocols Slide 1 Transport Protocols.
Reliable Transport Layers in Wireless Networks Mark Perillo Electrical and Computer Engineering.
1 CCNA 2 v3.1 Module Intermediate TCP/IP CCNA 2 Module 10.
Jennifer Rexford Fall 2014 (TTh 3:00-4:20 in CS 105) COS 561: Advanced Computer Networks TCP.
WXES2106 Network Technology Semester /2005 Chapter 8 Intermediate TCP CCNA2: Module 10.
Junxian Huang 1 Feng Qian 2 Yihua Guo 1 Yuanyuan Zhou 1 Qiang Xu 1 Z. Morley Mao 1 Subhabrata Sen 2 Oliver Spatscheck 2 1 University of Michigan 2 AT&T.
Lect3..ppt - 09/12/04 CIS 4100 Systems Performance and Evaluation Lecture 3 by Zornitza Genova Prodanoff.
Ad Hoc Networking via Named Data Michael Meisel, Vasileios Pappas, and Lixia Zhang UCLA, IBM Research MobiArch’10, September 24, Shinhaeng.
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.
1 Semester 2 Module 10 Intermediate TCP/IP Yuda college of business James Chen
Qian Zhang Department of Computer Science HKUST Advanced Topics in Next- Generation Wireless Networks Transport Protocols in Ad hoc Networks.
© 2008 Cisco Systems, Inc. All rights reserved.Cisco ConfidentialPresentation_ID 1 Chapter 7: Transport Layer Introduction to Networking.
Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED Kaixin Xu, Mario Gerla UCLA Computer Science Department
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
SMUCSE 4344 transport layer. SMUCSE 4344 transport layer end-to-end protocols –transport code runs only on endpoint hosts encapsulates network communications.
Ch 1. Computer Networks and the Internet Myungchul Kim
1 Congestion Control Computer Networks. 2 Where are we?
9.7 Other Congestion Related Issues Outline Queuing Discipline Avoiding Congestion.
Packet switching network Data is divided into packets. Transfer of information as payload in data packets Packets undergo random delays & possible loss.
TCP with Variance Control for Multihop IEEE Wireless Networks Jiwei Chen, Mario Gerla, Yeng-zhong Lee.
1 ECE453 - Introduction to Computer Networks Lecture 1: Introduction.
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
CONGESTION CONTROL.
TCP OVER ADHOC NETWORK. TCP Basics TCP (Transmission Control Protocol) was designed to provide reliable end-to-end delivery of data over unreliable networks.
Lecture Network layer -- May Congestion control Algorithms.
Random Early Detection (RED) Router notifies source before congestion happens - just drop the packet (TCP will timeout and adjust its window) - could make.
1 Advanced Transport Protocol Design Nguyen Multimedia Communications Laboratory March 23, 2005.
CS/EE 145A Reliable Transmission over Unreliable Channel II Netlab.caltech.edu/course.
Spring Computer Networks1 Congestion Control Sections 6.1 – 6.4 Outline Preliminaries Queuing Discipline Reacting to Congestion Avoiding Congestion.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
IP1 The Underlying Technologies. What is inside the Internet? Or What are the key underlying technologies that make it work so successfully? –Packet Switching.
Peer-to-Peer Networks 13 Internet – The Underlay Network
Fall 2004FSU CIS 5930 Internet Protocols1 Second phase of the project Please check some networking textbooks for details on TCP and OSPF.
1 Protocols and Protocol Layering. 2 Protocol Agreement about communication Specifies –Format of messages –Meaning of messages –Rules for exchange –Procedures.
McGraw-Hill Chapter 23 Process-to-Process Delivery: UDP, TCP Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
An End-to-End Service Architecture r Provide assured service, premium service, and best effort service (RFC 2638) Assured service: provide reliable service.
TCP/IP1 Address Resolution Protocol Internet uses IP address to recognize a computer. But IP address needs to be translated to physical address (NIC).
Accelerating Peer-to-Peer Networks for Video Streaming
Corelite Architecture: Achieving Rated Weight Fairness
Chapter 3 outline 3.1 transport-layer services
Chapter 6 Congestion Avoidance
SCTP v/s TCP – A Comparison of Transport Protocols for Web Traffic
TCP-LP Distributed Algorithm for Low-Priority Data Transfer
Lecture 19 – TCP Performance
Congestion Control (from Chapter 05)
TCP Congestion Control
Congestion Control (from Chapter 05)
Presentation transcript:

A Transport Protocol for Content-Centric Networking with Explicit Congestion Control Feixiong Zhang, Yanyong Zhang (Rutgers Univ.), Alex Reznik (InterDigital), Hang Liu (The Catholic University of America), Chen Qian (Univ. of Kentucky) and Chenren Xu (Rutgers Univ.)

Content Statistics In North America, video and audio streaming make up more than half of mobile data traffic, led by YouTube, Pandora and Netflix YouTube  100 hours of video are uploaded every minute  Over 6 billion hours of video are watched each month Netflix  Over 50 millions of Netflix streaming subscribers Pandora  1.36 billion listener hours and 72.7 million listeners in Sep 2013 Observation:  More and more Internet usage is about content distribution/retrieval.  We care about content and is oblivious to location.

Content-centric networking Content-centric networking (CCN): facilitate content distribution/retrieval from network architecture perspective Features:  Content name based routing  Receiver-driven hop-by-hop transport  Multi-source/multi-path transfer receiver Content server Content cache Interest(foo.s1) Interest(foo.s2) Interest(foo.s3) Data(foo.s1) Data(foo.s2) Data(foo.s3)

Transport control in CCN How to deal with the new challenges in transport control for content delivery in CCN?

Existing methods sender-centric, end-to-end (e.g. traditional TCP): doesn’t fit content delivery well RTT-based congestion detection (e.g. ICP, ICTP): doesn’t work well under multi-source/multi-path quota-based traffic shaping (e.g. HR-ICP): can’t adopt to dynamic workloads

CHoPCoP design CHoPCoP: chunk-switch hop pull control protocol Receiver-driven hop-by-hop transport Explicit congestion signaling by random early marking (REM) Fair share Interest shaping (FISP) AIMD-based receiver interest control (RIC)

Receiver-driven hop-by-hop transport Receiver-driven:  The receiver paces content retrieval and delivery  Interest-Data transmission  No explicit “end” concept  Connectionless communication: no three-way handshake hop-by-hop transfer: Each router performs  Forwarding packets  Packet processing  Resource management

Explicit congestion signaling With multiple sources/ multiple paths, the following metrics are unsuitable  RTT value  Packet arrival sequence Random early marking (REM): intermediate router  estimates congestion level based upon the size of the outgoing data queue,  marks data packet according to the mark probability function. Mark probability function for REM

Fair share Interest shaping FISP conducts flow-based interest control based on  each flow’s queue requirement  delay Interest accordingly at certain probability Delay all incoming Interest if overly-congested Release all delayed Interests when total queue requirement falls below a threshold Delay probability function

Receiver Interest control AIMD-based receiver Interest window control Detects congestion when marked packets are received  Decreases the window size accordingly Interest timer and retransmission for reliability

CHoPCoP Implementation  Complete protocol stack is implemented as a user-level daemon using Click modular router.  Detailed evaluation at ORBIT testbed.

The Effectiveness of REM C is cooperative and slows down Interest issuing when marked packets are observed For CHoPCoP, receiver side Interest window is much smoother the receiving data rate is much higher no timeout is observed at the receiver

The Effectiveness of FISP Router’s outgoing data queue is 1500KB  with FISP, the router’s outgoing data queue can be kept at ~1050KB.  Without FISP, router queue overflows and the router keeps congested Interest rate: 140 per second Interest rate: 160 per second Interest rate: 200 per second C is non-cooperative, issuing requests at constant rate

A Multi-Source, Single-Flow Scenario Poor performance of ICP and HR-ICP: single RTT estimator can not predict network congestion in multi-source environment.

Fairness Two receivers request different files  D starts at time 0  E starts at time 20s

FISP vs. Quota-based Interest Shaping D: CIR of 20 E: Interest rate varies from 40 to 180, with a 20 Interests per second increase in each run

A larger network topology Two sources (A and B) Two receivers (F and G) Link EF: bottleneck between A/B and F Link CD: bottleneck between A/B and G

Conclusion REM: provides congestion detection timely and correctly in a multi-source/multi-path setting FISP: ensures fair sharing of network resources among different flows RIC: guarantees full bandwidth utilization while reacts to REM signal to avoid saturating the network

19 Questions & Answers