Defining Network Capacity draft-cui-ippm-rfc5136bis-00 Xiangsong Cui,

Slides:



Advertisements
Similar presentations
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Advertisements

Traffic and routing. Network Queueing Model Packets are buffered in egress queues waiting for serialization on line Link capacity is C bps Average packet.
Umut Girit  One of the core members of the Internet Protocol Suite, the set of network protocols used for the Internet. With UDP, computer.
OSI MODEL Maninder Kaur
CS 408 Computer Networks Congestion Control (from Chapter 05)
Answers of Exercise 7 1. Explain what are the connection-oriented communication and the connectionless communication. Give some examples for each of the.
Chapter 18. IP: Internet Protocol Addresses
1 Version 3 Module 8 Ethernet Switching. 2 Version 3 Ethernet Switching Ethernet is a shared media –One node can transmit data at a time More nodes increases.
1 Fall 2005 Network Characteristics: Ownership, Service Paradigm, Performance Qutaibah Malluhi CSE Department Qatar University.
MOBILITY SUPPORT IN IPv6
1 Internet Networking Spring 2003 Tutorial 11 Explicit Congestion Notification (RFC 3168) Limited Transmit (RFC 3042)
PART III DATA LINK LAYER. Position of the Data-Link Layer.
Transition Mechanisms for Ipv6 Hosts and Routers RFC2893 By Michael Pfeiffer.
OSI Model 7 Layers 7. Application Layer 6. Presentation Layer
TCP: Software for Reliable Communication. Spring 2002Computer Networks Applications Internet: a Collection of Disparate Networks Different goals: Speed,
Connecting LANs, Backbone Networks, and Virtual LANs
CECS 5460 – Assignment 3 Stacey VanderHeiden Güney.
Chapter 4: Managing LAN Traffic
SAvPS – úvod Genči 2009 (bsaed on Tanenbaum’s slides.
Distance Vector Routing Protocols W.lilakiatsakun.
These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (
Internet Addresses. Universal Identifiers Universal Communication Service - Communication system which allows any host to communicate with any other host.
NETWORKING FUNDAMENTALS. Bandwidth Bandwidth is defined as the amount of information that can flow through a network connection in a given period of time.Bandwidth.
10/8/2015CST Computer Networks1 IP Routing CST 415.
Recitation 8 Wireless Networks. Virtual carrier sensing First exchange control frames before transmitting data – Sender issues “Request to Send” (RTS),
Computer Networks Performance Metrics. Performance Metrics Outline Generic Performance Metrics Network performance Measures Components of Hop and End-to-End.
University of the Western Cape Chapter 12: The Transport Layer.
Module 8: Ethernet Switching
1 Optical Burst Switching (OBS). 2 Optical Internet IP runs over an all-optical WDM layer –OXCs interconnected by fiber links –IP routers attached to.
Cyclic Redundancy Check (CRC).  An error detection mechanism in which a special number is appended to a block of data in order to detect any changes.
Multiplexing FDM & TDM. Multiplexing When two communicating nodes are connected through a media, it generally happens that bandwidth of media is several.
Cisco 3 - Switching Perrine. J Page 16/4/2016 Chapter 4 Switches The performance of shared-medium Ethernet is affected by several factors: data frame broadcast.
1 Dr. Ali Amiri TCOM 5143 Lecture 8 Capacity Assignment in Centralized Networks.
Chapter 13 The Internet.
19.1 Chapter 19 Network Layer: Logical Addressing Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Towards a More Fair and Robust Internet Backbone Year 1 Status Report Rene Cruz, Tara Javidi, Bill Lin Center for Networked Systems University of California,
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Connecting Devices CORPORATE INSTITUTE OF SCIENCE & TECHNOLOGY, BHOPAL Department of Electronics and.
Network Layer by peterl. forwarding table routing protocols path selection RIP, OSPF, BGP IP protocol addressing conventions datagram format packet handling.
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
1 IEX8175 RF Electronics Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
TCP continued. Discussion – TCP Throughput TCP will most likely generate the saw tooth type of traffic. – A rough estimate is that the congestion window.
QoS in Mobile IP by Preethi Tiwari Chaitanya Deshpande.
Computer Network Architecture Lecture 3: Network Connectivity Devices.
Delay in packet switched network. Circuit switching In Circuit switched networks the resources needed along a path (buffers and link transmission rate)
IP1 The Underlying Technologies. What is inside the Internet? Or What are the key underlying technologies that make it work so successfully? –Packet Switching.
LECTURE 12 NET301 11/19/2015Lect NETWORK PERFORMANCE measures of service quality of a telecommunications product as seen by the customer Can.
Day 13 Intro to MANs and WANs. MANs Cover a larger distance than LANs –Typically multiple buildings, office park Usually in the shape of a ring –Typically.
Instructor & Todd Lammle
Introduction to TCP/IP networking
Switching and High-Speed Networks
ISO/OSI Model and Collision Domain
Layered Architectures
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
TCP - Part I Relates to Lab 5. First module on TCP which covers packet format, data transfer, and connection management.
Switching Techniques In large networks there might be multiple paths linking sender and receiver. Information may be switched as it travels through various.
Network Core and QoS.
Network Devices Hub Definition:
Congestion Control (from Chapter 05)
CS4470 Computer Networking Protocols
EE 122: Lecture 7 Ion Stoica September 18, 2001.
 What is Topology  Categories of Topology  Definition, structure, advantage and disadvantage of all of the following topologies: o Mesh o Bus o Ring.
Congestion Control (from Chapter 05)
Network Performance Definitions
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
OSI Reference Model Unit II
Congestion Control (from Chapter 05)
Process-to-Process Delivery: UDP, TCP
OSI Model 7 Layers 7. Application Layer 6. Presentation Layer
Network Core and QoS.
Presentation transcript:

Defining Network Capacity draft-cui-ippm-rfc5136bis-00 Xiangsong Cui,

2Network Capacity Acknowledgements The author would like to acknowledge Phil Chimento and Joseph Ishac for their great contribution on the item of network capacity. The author would also like to acknowledge Mark Allman, Patrik Arlos, Matt Mathis, Al Morton, Stanislav Shalunov, and Matt Zekauskas for their contribution to [RFC5136].

3Network Capacity Component Definition in RFCs Earlier documents, such as RFC2460 and RFC2330, define Node, Link, and Path. RFC5136 defines these terms slightly differently. This difference could impact the definitions of metrics. It might be ambiguous just what is getting measured. We should reference the terminology found in the earlier documents rather than providing our own, slightly different, definitions.

4Network Capacity IP-type-P Link Capacity Issue Nominal Physical Link Capacity, NomCap(L), is the theoretical maximum amount of data that the link L can support. -- RFC5136, section 2.2 The definitions seem clear enough, but how to understand the ”maximum”? An important distinction between usage and capacity is that Used(L,T,I) is not the maximum number, but rather, the actual number of IP bits sent that are correctly received. -- RFC5136, section We define the IP-layer link capacity, C(L,T,I), to be the maximum number of IP-layer bits that can be transmitted from the source S and correctly received by the destination D over the link L during the interval [T, T+I], divided by I. -- RFC5136, section 2.3.2

5Network Capacity IP-type-P Link Capacity Example H1H2 Link1 Node H1 and H2 are connected by link1. Link1 is active. Case 1: H1 receives no IP packets from H2 (the Nominal Physical Link Capacity of link1 is 0% utilized). Is the IP-type-P link capacity of link1 equal to 0? Case 2: H1 correctly receives IP packets (type P) from H2 at rate of K bps (the Nominal Physical Link Capacity of link1 is 100% utilized). Is the IP-type-P link capacity of link1 equal to K? Does the ”IP-layer … maximum … can …” mean that, in physical layer, the nominal physical link capacity of the link is fully utilized? In case 1, link doesn’t transmit packet not means it can not do that. We have no actual link capacity number, but the metric is still there. Is the IP-layer link capacity also a theoretical number?

6Network Capacity IP-type-P Link Capacity Proposal In theory, the IP-type-P link capacity may be calculated by: C(L,T,I) = [Lp /(Lh + Lp + Lt)] * [1 - BER(T, T+I)] * [1 - BDR(T, T+I)] * P(L) - Lp denotes type P packet length (in IP layer), - Lh denotes link layer protocol overhead length, - Lt denotes link layer protocol overtail length, - BER(T, T+I) denotes Block Error or Lost Rate during the interval [T, T+I], - BDR(T, T+I) denotes Block Duplication Rate during the interval [T, T+I], - P(L) denotes Nominal Physical Link Capacity of the given link. In practice, we can define the IP-layer link capacity, C(L,T,I), to be the maximum number of IP-layer bits (i.e. the Nominal Physical Link Capacity of the link is 100% utilized) that can be transmitted from the source S and correctly received by the destination D over the link L during the interval [T, T+I], divided by I.

7Network Capacity IP-type-P Router Capacity and Path Capacity Is it necessary to consider router capacity when we talk about network capacity? Is it appropriate to implicitly include (or hide) router capacity inside link capacity when we talk about path capacity? In the scenario where router is fully utilized (e.g. forwarding capacity) while the link is not fully utilized (e.g., physical link capacity), does the number represent our expected IP-layer LINK CAPACITY? Should we hide router capacity inside link capacity, then what is the relation between router/link/path?

8Network Capacity IP-type-P Router Capacity Proposal Proposal on definition of the IP-type-P router capacity: C(R,T,I), the maximum number of IP-layer bits (in the formation of type P packet) that can be correctly transferred from the ingress interfaces to the egress interfaces during the interval [T, T+I], divided by I. In practice, the IP-type-P router capacity representation is affected by many implementation factors.

9Network Capacity IP-type-P Path Capacity Issue Definition in RFC5136, section 2.3.3, Using our definition for IP-layer link capacity, we can then extend this notion to an entire path, such that the IP-layer path capacity simply becomes that of the link with the smallest capacity along that path. C(P,T,I) = min {1..n} {C(Ln,T,I)} Does this clearly show out the IP-type-P path capacity concept?

R1 10Network Capacity IP-type-P Path Capacity Example 1 Case 1: links and routers are exclusive for the corresponding path H1 Link1 H2 Link3 R2 Link2 The IP-layer capacity of an exclusive path may be calculated by: C(P,T,I) = min {1..n} {C(Ln,T,I), C(Rn,T,I)}

11Network Capacity IP-type-P Path Capacity Example 2 Case 2: links and routers are shared (fully or partly) by paths H3 Link4 H4 R1 H1 Link1 H2 R2 Link2 The information transmitted across the link can be generated by any source, including those sources that may not be directly attached to either side of the link. -- RFC5136, section Link3 Link6 Link2 capacity Bit flow from H3 to H4 Bit flow from H1 to H2

12Network Capacity IP-type-P Path Capacity Example 2 (cont.) Assume all link capacity in case 2 is 1G bps and all router capacity is 2G bps, Capacity of path1, is 1G bps? Capacity of path2, is 1G bps? In idle situation, available capacity of path1 and path2 are both 1G bps? But in fact, we can not get two simultaneous 1G bps path, right? This means, when we say path1 capacity is 1G bps, then the capacity of link2 is occupied by path1, and available link2 capacity for path 2 is zero … The IP-layer capacity of the corresponding path depends on not only the IP- layer capacity of the links and the routers but also the "competitive" traffic of other paths which have overlap segment with the corresponding path. This is to say, the IP-layer capacity of the non-exclusive path is a variable.

13Network Capacity Next Step Are the issues trivial or important? Do we need a new draft or RFC?

14Network Capacity Questions/Comments and Discussion Thank you for your attention!