Pending Interest Table Sizing in Named Data Networking Luca Muscariello Orange Labs Networks / IRT SystemX G. Carofiglio (Cisco), M. Gallo, D. Perino (Bell.

Slides:



Advertisements
Similar presentations
Ch. 12 Routing in Switched Networks
Advertisements

COPYRIGHT © 2011 ALCATEL-LUCENT. ALL RIGHTS RESERVED. INFORM: a dynamic INterest FORwarding Mechanism for Information Centric Networking Raffaele Chiocchetti,
Traffic Control and the Problem of Congestion within the Internet By Liz Brown and Nadine Sur.
IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
Ch. 12 Routing in Switched Networks Routing in Packet Switched Networks Routing Algorithm Requirements –Correctness –Simplicity –Robustness--the.
Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
A Centralized Scheduling Algorithm based on Multi-path Routing in WiMax Mesh Network Yang Cao, Zhimin Liu and Yi Yang International Conference on Wireless.
Maciej Stasiak, Mariusz Głąbowski Arkadiusz Wiśniewski, Piotr Zwierzykowski Groups models Modeling and Dimensioning of Mobile Networks: from GSM to LTE.
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
Congestion Control Tanenbaum 5.3 Tanenbaum 6.5. Congestion Control Network Layer – Congestion control point to point Transport Layer – Congestion control.
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.
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Cloud Control with Distributed Rate Limiting Raghaven et all Presented by: Brian Card CS Fall Kinicki 1.
Playback-buffer Equalization For Streaming Media Using Stateless Transport Prioritization By Wai-tian Tan, Weidong Cui and John G. Apostolopoulos Presented.
Delay and Throughput in Random Access Wireless Mesh Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department Rensselaer Polytechnic Institute (RPI)
CS 268: Lecture 8 Router Support for Congestion Control Ion Stoica Computer Science Division Department of Electrical Engineering and Computer Sciences.
CS 4700 / CS 5700 Network Fundamentals Lecture 12: Router-Aided Congestion Control (Drop it like it’s hot) Revised 3/18/13.
1 Updates on Backward Congestion Notification Davide Bergamasco Cisco Systems, Inc. IEEE 802 Plenary Meeting San Francisco, USA July.
Simulating Large Networks using Fluid Flow Model Yong Liu Joint work with Francesco LoPresti, Vishal Misra Don Towsley, Yu Gu.
On Modeling Feedback Congestion Control Mechanism of TCP using Fluid Flow Approximation and Queuing Theory  Hisamatu Hiroyuki Department of Infomatics.
Router Architecture : Building high-performance routers Ian Pratt
Small-world Overlay P2P Network
The War Between Mice and Elephants Presented By Eric Wang Liang Guo and Ibrahim Matta Boston University ICNP
Comparing flow-oblivious and flow-aware adaptive routing Sara Oueslati and Jim Roberts France Telecom R&D CISS 2006 Princeton March 2006.
Network Bandwidth Allocation (and Stability) In Three Acts.
Katz, Stoica F04 EECS 122: Introduction to Computer Networks Performance Modeling Computer Science Division Department of Electrical Engineering and Computer.
1 Performance Evaluation of Computer Networks Objectives  Introduction to Queuing Theory  Little’s Theorem  Standard Notation of Queuing Systems  Poisson.
1 Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica,Scott Shenker, and Hui Zhang SIGCOMM’99,
1 Emulating AQM from End Hosts Presenters: Syed Zaidi Ivor Rodrigues.
Little’s Theorem Examples Courtesy of: Dr. Abdul Waheed (previous instructor at COE)
Distributed-Dynamic Capacity Contracting: A congestion pricing framework for Diff-Serv Murat Yuksel and Shivkumar Kalyanaraman Rensselaer Polytechnic Institute,
Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Rigorous fair Queueing requires per flow state: too costly in high speed core routers.
1 A State Feedback Control Approach to Stabilizing Queues for ECN- Enabled TCP Connections Yuan Gao and Jennifer Hou IEEE INFOCOM 2003, San Francisco,
Core Stateless Fair Queueing Stoica, Shanker and Zhang - SIGCOMM 98 Fair Queueing requires per flow state: too costly in high speed core routers Yet, some.
1 Minimization of Network Power Consumption with Redundancy Elimination T. Khoa Phan* Joint work with: Frédéric Giroire*, Joanna Moulierac* and Frédéric.
MATE: MPLS Adaptive Traffic Engineering Anwar Elwalid, et. al. IEEE INFOCOM 2001.
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.
Cost-Performance Tradeoffs in MPLS and IP Routing Selma Yilmaz Ibrahim Matta Boston University.
Adaptive flow control via Interest Aggregation in CCN by Dojun Byun, Byoung-joon, Myeong-Wuk Jang Samsung Electronics, Advanced Institute of Technology.
Network management Reinhard Laroy BIPT European Parliament - 27 February 2012.
1 Exponential distribution: main limitation So far, we have considered Birth and death process and its direct application To single server queues With.
Packet-Pair Dispersion for Bandwidth Probing: Probabilistic and Sample-Path Approaches M. J. Tunnicliffe Faculty of Computing, Information Systems and.
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
Review of the literature : DMND:Collecting Data from Mobiles Using Named Data Takashima Daiki Park Lab, Waseda University, Japan 1/15.
Running large scale experimentation on Content-Centric Networking via the Grid’5000 platform Massimo GALLO (Bell Labs, Alcatel - Lucent) Joint work with:
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
1 IEEE Meeting July 19, 2006 Raj Jain Modeling of BCN V2.0 Jinjing Jiang and Raj Jain Washington University in Saint Louis Saint Louis, MO
Authors: Matteo Varvello, Diego Perino, and Leonardo Linguaglossa Publisher: NOMEN 2013 (The 2nd IEEE International Workshop on Emerging Design Choices.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
Multiplicative Wavelet Traffic Model and pathChirp: Efficient Available Bandwidth Estimation Vinay Ribeiro.
Efficient Cache Structures of IP Routers to Provide Policy-Based Services Graduate School of Engineering Osaka City University
UNIVERSITY OF JYVÄSKYLÄ 2005 Multicast Admission Control in DiffServ Networks Department of Mathematical Information Technology University of Jyväskylä.
Deadline-based Resource Management for Information- Centric Networks Somaya Arianfar, Pasi Sarolahti, Jörg Ott Aalto University, Department of Communications.
1 Time-scale Decomposition and Equivalent Rate Based Marking Yung Yi, Sanjay Shakkottai ECE Dept., UT Austin Supratim Deb.
1 Presented by Sarbagya Buddhacharya. 2 Increasing bandwidth demand in telecommunication networks is satisfied by WDM networks. Dimensioning of WDM networks.
Computer Networking Queueing (A Summary from Appendix A) Dr Sandra I. Woolley.
Content caching and scheduling in wireless networks with elastic and inelastic traffic Group-VI 09CS CS CS30020 Performance Modelling in Computer.
Time-Dependent Dynamics in Networked Sensing and Control Justin R. Hartman Michael S. Branicky Vincenzo Liberatore.
1 An Analytical Model for the Dimensioning of a GPRS/EDGE Network with a Capacity Constraint on a Group of Cells r , r , r Nogueira,
Péter Hága Eötvös Loránd University, Hungary European Conference on Complex Systems 2008 Jerusalem, Israel.
Data Consolidation: A Task Scheduling and Data Migration Technique for Grid Networks Author: P. Kokkinos, K. Christodoulopoulos, A. Kretsis, and E. Varvarigos.
TeXCP: Protecting Providers’ Networks from Unexpected Failures & Traffic Spikes Dina Katabi MIT - CSAIL nms.csail.mit.edu/~dina.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Access Link Capacity Monitoring with TFRC Probe Ling-Jyh Chen, Tony Sun, Dan Xu, M. Y. Sanadidi, Mario Gerla Computer Science Department, University of.
ISP and Egress Path Selection for Multihomed Networks
Congestion Control in Data Networks and Internets
The War Between Mice & Elephants by, Matt Hartling & Sumit Kumbhar
CSE 550 Computer Network Design
Understanding Congestion Control Mohammad Alizadeh Fall 2018
Presentation transcript:

Pending Interest Table Sizing in Named Data Networking Luca Muscariello Orange Labs Networks / IRT SystemX G. Carofiglio (Cisco), M. Gallo, D. Perino (Bell Labs) 2 nd ACM Conference on Information-Centric Networking San Francisco 1st of October

2 motivation  the pending interest table is responsible for maintaining the data path in NDN  it is a key data structure that requires careful dimensioning  when the PIT is full it is not obvious how to manage it  we want to compute the distribution of the PIT size under realistic traffic assumptions  PIT size as a function of the offered traffic load

outline system dynamics mathematical modeling sizing

4 Ingress Egress Data 1 served by local cache face 2 face 3 interest 1 interest 2 dynamics (1/2) CS PIT FIB Data 2 Data 1 Data 2 face 1 (ingress, interest) (prefix, egress)

5 dynamics (2/2) (ingress, interest) Data interests Data time PIT size xx x xxx x x Interest arrival process Interest lifetime

6 traffic model  we want to compute the size of the PIT as a function of the offered traffic  for sizing purposes we want the quantiles  under some general assumptions:  objects are requested following a random process –we chose an object Poisson arrival process with rate  an object has distributed size S with finite average  an object is retrieved by variable rate interest requests –the rate is congestion controlled –the congestion control protocol is receiver driven –is also delay based –cf Carofiglio et al IEEE ICNP 2013

7 two levels model of the interest rate time fluid rate N(t) = 2 N(t) = 1 N(t) = 0 N(t) = 1 N(t) = 2 N(t) = 3

8 two levels model of the interest rate time fluid rate N(t) = 2 N(t) = 1 N(t) = 0 N(t) = 1 N(t) = 2 N(t) = 3

9 single transfer PIT occupancy (line network) Repository Downlink queue Q i Pending Interest Table π i CiCi Request rate X i Data rate X i ~ node i

10 state equations (1/2) Interest rate Data rate Interest rate decrease ratio link input/output rates rate receiver interest rate PIT size

11 state equations (2/2) congestion function Link queue evolution Round trip time

12 network model  the network is a directed graph  data object retrievals sharing the same route r in the network are grouped in classes  be the set of routes flowing through link  in case of link congestion capacity is shared assuming max-min fairness (approximation or fair queueing assumed) with fair rate  the number of data transfers in progress on route is a Markov process  stability is guaranteed by the condition  being  the offered load on link

13 main results (1/2) N flows, single routing class After a transient phase, PIT sizes,, are empty above the bottleneck ( ) And equal to the bottleneck queue length below:  It means that for sizing purposes we need to only focus on the routes that are bottlenecked upstream a given node.

14 main results (2/2) average values maximum PIT size in steady state (variance estimation) based on the analysis of the modulus of the Laplace Transform of the bottleneck queue function:  taking into account the variable number of transfers in progress

15 experimental analysis (the platform)  The platform: –4 AMC boards in a microTCA –NPU with 4GB off chip DRAM –a set of 10GbE –12 cores per NPU –800MHz 64bits MIPS 16kB L1 cache, 2MB L2 cache –an NDN node per card  the forwarder: –PIT optimized open-addressed hash table –hardware timers for PIT timeouts –data collection by a platform controller not to affect forwarding –sample are processed offline –faces over UDP  1422B-92B data/interest packets  traffic generation on client/repo servers

16 comparison model/experiments  line network  single bottlenecked link upstream at 100Mbps (all others at 5Gbps)  relation PIT size/offered load is correctly measured by the model  experiments are run form 100Mbps to 1Gbps

17 PIT sizing  PIT sizing is made by using the 95% percentile assuming a Gaussian approximation  M routes with the same offered load bottlenecked upstream

18 conclusions  the model catches the essential properties of realistic traffic assumptions –congestion controlled sources with delay based congestion control –the knowledge of traffic that is bottleneck upstream is important to compute this size –fluid models turn out to be tractable to obtain simple closed formulas  the PIT stores information about congestion level downstream/upstream  under congestion controlled traffic the PIT size does not constitute a barrier for high speed implementations  for non controlled (poorly controlled) traffic the PIT size requires active (local) management

Thank you