Models. One Packet. Timing. Illustration. Examples UCB. Models EECS 122. P bits. Motivation Timing Diagrams Metrics Evaluation Techniques

Size: px
Start display at page:

Download "Models. One Packet. Timing. Illustration. Examples UCB. Models EECS 122. P bits. Motivation Timing Diagrams Metrics Evaluation Techniques"

Transcription

1 Motivation iming iagrams Metrics Evaluation echniques Motivation Understanding Network Behavior Improving Protocols Verifying Correctness of Implementation etecting Faults Choosing Provider Feasibility of Applications Monitoring ervice Level Agreements Billing OC OC Motivation iming ending one packet Illustration Examples Queuing Queuing example tore and forward &F:Multiple packets Cut-hrough Fluid View OC iming One Packet = ransmission time seconds = Propagation time = L/speed = L(km)x(time/km) /km = 3.3µs in free space 4 µs in copper 5 µs in fiber OC iming One Packet Illustration Examples ransmitter ignal ransmission Line One bit Each bit takes 1/R seconds to be transmitted he bits take seconds to propagate Receiver << >> P = 1KByte R = 1Gbps 100km, fiber = 500µs = 8µs P = 1KByte R = 100Mbps 1km, fiber = 5µs = 80µs OC iming Illustration OC iming Examples

2 Queuing Q seconds Queuing Example 1-kbit packets; R = 1Mbps Q 1ms Q/R (t) = Q/R + for a packet that arrives at t Q/R = queuing delay (load-dependent) OC iming Queuing 1ms Let n = Q/R + for packet n 1 = 1ms 2 = 1.5ms 3 = 2ms 4 = 1ms OC iming Queuing Example 5 = 1.5ms 6 = 1ms t tore and Forward &F - Multiple 10Mbps 5Mbps 100Mbps 10Mbps 10Mbps 5Mbps 100Mbps 10Mbps OC iming tore and Forward OC iming &F Multiple Cut-hrough R1 = 10Mbps R2 = 10Mbps A Fluid View Rate R A(t); rate a(t) (t); rate d(t) # bits in [0, t] # bits in [0, t] Header tart forwarding as soon as the header is received a(t) d(t) Note: What if R2 > R1? OC iming Cut-hrough OC iming Fluid View

3 Metrics hroughput hroughput elay efinitions Example 1: Connection Example 2: Link Fluctuations Measurements OC Metrics OC Metrics hroughput efinitions Roughly: throughput = bit rate (e.g., 120Kbits/second) More precisely: hroughput of a connection or of a link: total number of bits during some period [t, t + ] divided by Bandwidth* of a link = link rate = bit rate of the transmitter *Note: misnomer, but common usage Utilization of a link = throughput of the link / link rate Bit rate units: 1Kbps = 10 3 bps, 1Mbps = 10 6 bps, 1Gbps = 10 9 bps [For memory: 1Kbytes = 2 10 bytes = 1,024 bytes; 1MBytes = 2 20 bytes] ome rates are expressed in packet per second (pps) relevant when the bottleneck is the header processing Connection Connection: end W bits (window size) Wait for ACKs Repeat Assume that the round-trip time is R seconds hroughput = W/R bps Numerical Example: W = 64KBytes = 512 kbits = 512x1,024 = 524,288 bits R = 200ms hroughput = W/ = 2.6Mbps ource R R K K estination OC Metrics hroughput efinitions OC Metrics hroughput Connection Link 1Mbps link sends 1,000-bit packets Fluctuations Rate varies over time Mbps 1 Rate every µs hroughput over last seconds Rate every 40 ms max 0.5 mean Utilization = 50% min OC Metrics hroughput Link t OC Metrics hroughput Fluctuations t

4 Measurements CP: Keep track of number of bytes received Let R(t) = number of bits in [0, t] hroughput over last seconds = [R(t) R(t )]/ evice has counter with number of bytes received; calculate as above elay efinitions Illustration 1 Illustration 2 Little s Result Measurements: Example 1 Measurements: Example 2 OC Metrics hroughput Measurements OC Metrics elay efinitions elay/latency of bit (packet, file) from A to B he time required for bit (packet, file) to go from A to B Jitter: Variability in delay Round-rip (R) wo-way delay from sender to receiver and back Bandwidth-elay Product Product of bw and delay, indicates storage capacity of network Illustration 1 n Latest bit seen by time t at point 1 at point 2 elay of bit n OC Metrics elay efinitions OC Metrics elay Illustration 1 Illustration Packet arrival times at 1 Packet arrival times at 2 Max delay = 100 ms Min delay = 40 ms Jitter = 60 ms OC Metrics elay Illustration 2 20 ms N Little s Result = area (N) (N - 1) = (1) + + (N) = integral of 1 (1) + + (N) N dt = =. N Average occupancy = (average delay)x(average arrival rate) OC Metrics elay Little s Result

5 Measurements 1 Measurements 2 A Good Epoch A Worse Epoch OC Metrics elay Measurements 1 OC Metrics elay Measurements 2 Evaluation echniques + Analysis + imulations Measurements Analysis Example: M/M/1 Queue λ µ Arrivals are Poisson with rate λ ervice times are exponentially distributed with mean 1/µ Average delay per packet = 1/(µ λ) = (1/µ)/(1 ρ) where ρ = λ/µ = utilization For instance, 1/µ = 1ms and ρ = 80% => Q = 5ms OC Evaluation OC Evaluation Analysis imulation Model of traffic Model of routers, links,. imulation: riven: X(n) = state at time nε X(n+1) = f(x(n), event at time nε) Event riven: Y(n) = state after event n E(n) = n-th event (n) = time when event n occurs [Y(n+1), (n+1)] = g(y(n), (n), E(n)] Key tep: Output analysis (estimates, confidence intervals.) Measurements esign Experiment Representative? Output Analysis OC Evaluation imulation OC Evaluation Measurements

Models. Motivation Timing Diagrams Metrics Evaluation Techniques. TOC Models

Models. Motivation Timing Diagrams Metrics Evaluation Techniques. TOC Models Models Motivation Timing Diagrams Metrics Evaluation Techniques TOC Models Motivation Understanding Network Behavior Improving Protocols Verifying Correctness of Implementation Detecting Faults Choosing

More information

Outline. EE 122: Networks Performance & Modeling. Outline. Motivations. Definitions. Timing Diagrams. Ion Stoica TAs: Junda Liu, DK Moon, David Zats

Outline. EE 122: Networks Performance & Modeling. Outline. Motivations. Definitions. Timing Diagrams. Ion Stoica TAs: Junda Liu, DK Moon, David Zats EE 122: Networks Performance & Modeling Ion Stoica As: Junda Liu, DK Moon, David Zats http://inst.eecs.berkeley.edu/~ee122/fa09 (Materials with thanks to Vern Paxson, Jennifer Rexford, and colleagues at

More information

Performance Modeling

Performance Modeling Performance Modeling EECS 489 Computer Networks http://www.eecs.umich.edu/~zmao/eecs489 Z. Morley Mao Tuesday Sept 14, 2004 Acknowledgement: Some slides taken from Kurose&Ross and Katz&Stoica 1 Administrivia

More information

CPSC 441 Tutorial-1. Department of Computer Science University of Calgary

CPSC 441 Tutorial-1. Department of Computer Science University of Calgary CPSC 441 Tutorial-1 Department of Computer Science University of Calgary Question-1 A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the

More information

L2: Bandwidth and Latency. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806

L2: Bandwidth and Latency. Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806 L2: Bandwidth and Latency Hui Chen, Ph.D. Dept. of Engineering & Computer Science Virginia State University Petersburg, VA 23806 1 Acknowledgements Some pictures used in this presentation were obtained

More information

Lecture 6. TCP services. Internet Transport Layer: introduction to the Transport Control Protocol (TCP) A MUCH more complex transport

Lecture 6. TCP services. Internet Transport Layer: introduction to the Transport Control Protocol (TCP) A MUCH more complex transport Lecture 6. Internet Transport Layer: introduction to the Transport ontrol Protocol (TP) RF 793 (estensioni RF 1122,1323,2018,2581,working group tsvwg) A MUH more complex transport for three main reasons

More information

ETSN01 Exam Solutions

ETSN01 Exam Solutions ETSN01 Exam Solutions March 014 Question 1 (a) See p17 of the cellular systems slides for a diagram and the full procedure. The main points here were that the HLR needs to be queried to determine the location

More information

EE122 MIDTERM EXAM: Scott Shenker, Ion Stoica

EE122 MIDTERM EXAM: Scott Shenker, Ion Stoica EE MITERM EXM: 00-0- Scott Shenker, Ion Stoica Last name Student I First name Login: ee- Please circle the last two letters of your login. a b c d e f g h i j k l m n o p q r s t u v w x y z a b c d e

More information

Midterm Review EECS 122. University of California Berkeley

Midterm Review EECS 122. University of California Berkeley Midterm Review EECS 122 University of California Berkeley Topics Network Architecture Network hierarchy Layering Performance Link Layer Ethernet Wi-Fi 2 Review: Network WAN MAN 3 Review: Network WAN MAN

More information

Transport Layer PREPARED BY AHMED ABDEL-RAOUF

Transport Layer PREPARED BY AHMED ABDEL-RAOUF Transport Layer PREPARED BY AHMED ABDEL-RAOUF TCP Flow Control TCP Flow Control 32 bits source port # dest port # head len sequence number acknowledgement number not used U A P R S F checksum Receive window

More information

Congestion Control in TCP

Congestion Control in TCP Congestion Control in CP Antonio Carzaniga Faculty of Informatics University of Lugano Apr 7, 2008 2005 2007 Antonio Carzaniga 1 Intro to congestion control Outline Input rate vs. output throughput Congestion

More information

Midterm Review. Topics. Review: Network. Review: Network. Layers & Protocols. Review: Network WAN. Midterm Review EECS 122 EECS 122

Midterm Review. Topics. Review: Network. Review: Network. Layers & Protocols. Review: Network WAN. Midterm Review EECS 122 EECS 122 Topics Midterm Review EECS University of California Berkeley Network Architecture Network hierarchy Layering Performance Link Layer Ethernet Wi-Fi Network Layer Addressing Routing EECS Midterm Review Review:

More information

Midterm Review EECS 122. University of California Berkeley

Midterm Review EECS 122. University of California Berkeley Midterm Review EECS University of California Berkeley Topics Network Architecture Network hierarchy Layering Performance Link Layer Ethernet Wi-Fi Network Layer Addressing Routing EECS Midterm Review Review:

More information

Network Management & Monitoring

Network Management & Monitoring Network Management & Monitoring Network Delay These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (http://creativecommons.org/licenses/by-nc/3.0/) End-to-end

More information

Computer Networks. Homework #4: No Grading

Computer Networks. Homework #4: No Grading Computer Networks Homework #4: No Grading Problem #1. Assume you need to write and test a client-server application program on two hosts you have at home. a. What is the range of port numbers you would

More information

Cover sheet for Assignment 3

Cover sheet for Assignment 3 Faculty of Arts and Science University of Toronto CSC 358 - Introduction to Computer Networks, Winter 2018, LEC0101 Cover sheet for Assignment 3 Due Monday March 5, 10:00am. Complete this page and attach

More information

Teletraffic theory (for beginners)

Teletraffic theory (for beginners) Teletraffic theory (for beginners) samuli.aalto@hut.fi teletraf.ppt S-38.8 - The Principles of Telecommunications Technology - Fall 000 Contents Purpose of Teletraffic Theory Network level: switching principles

More information

End-to-End Mechanisms for QoS Support in Wireless Networks

End-to-End Mechanisms for QoS Support in Wireless Networks End-to-End Mechanisms for QoS Support in Wireless Networks R VS Torsten Braun joint work with Matthias Scheidegger, Marco Studer, Ruy de Oliveira Computer Networks and Distributed Systems Institute of

More information

An Efficient Scheduling Scheme for High Speed IEEE WLANs

An Efficient Scheduling Scheme for High Speed IEEE WLANs An Efficient Scheduling Scheme for High Speed IEEE 802.11 WLANs Juki Wirawan Tantra, Chuan Heng Foh, and Bu Sung Lee Centre of Muldia and Network Technology School of Computer Engineering Nanyang Technological

More information

cs/ee 143 Fall

cs/ee 143 Fall cs/ee 143 Fall 2018 13 4 Internetworking 4.1 W&P, P6.1 (a) 2 points. How many IP addresses need to be leased from an ISP to support a DHCP server (with L ports) that uses NAT to service N clients at the

More information

Announcements. Network Performance: Queuing. Goals of Today s Lecture. Window Scaling. Window Scaling, con t. Window Scaling, con t

Announcements. Network Performance: Queuing. Goals of Today s Lecture. Window Scaling. Window Scaling, con t. Window Scaling, con t Announcements Network Performance: Queuing Additional reading for today s lecture: Peterson & Davie 3.4 EE 122: Intro to Communication Networks Fall 2006 (MW 4-5:30 in Donner 155) Vern Paxson As: Dilip

More information

Congestion Control in TCP

Congestion Control in TCP Congestion Control in TCP Antonio Carzaniga Faculty of Informatics University of Lugano May 6, 2005 Outline Intro to congestion control Input rate vs. output throughput Congestion window Congestion avoidance

More information

2.993: Principles of Internet Computing Quiz 1. Network

2.993: Principles of Internet Computing Quiz 1. Network 2.993: Principles of Internet Computing Quiz 1 2 3:30 pm, March 18 Spring 1999 Host A Host B Network 1. TCP Flow Control Hosts A, at MIT, and B, at Stanford are communicating to each other via links connected

More information

ETSF10 Internet Protocols Transport Layer Protocols

ETSF10 Internet Protocols Transport Layer Protocols ETSF10 Internet Protocols Transport Layer Protocols 2012, Part 2, Lecture 2.1 Kaan Bür, Jens Andersson Transport Layer Protocols Process-to-process delivery [ed.4 ch.23.1] [ed.5 ch.24.1] Transmission Control

More information

CS 421: COMPUTER NETWORKS FALL FINAL January 5, minutes. Name: Student No: TOT

CS 421: COMPUTER NETWORKS FALL FINAL January 5, minutes. Name: Student No: TOT S 421: OMPUTR NTWORKS ALL 2006 INAL January 5, 2007 150 minutes Name: Student No: Q1 Q2 Q3 TOT 1) a) (6 pts) iven the following parameters for a datagram packet switching network: N: number of hops between

More information

Topics. TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput

Topics. TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput Topics TCP sliding window protocol TCP PUSH flag TCP slow start Bulk data throughput 2 Introduction In this chapter we will discuss TCP s form of flow control called a sliding window protocol It allows

More information

CPE 548 Exam #1 (50 pts) February 17, 2016

CPE 548 Exam #1 (50 pts) February 17, 2016 Name Class: 548 All answers must have supporting work. Any answer without support will receive no credit 1) (4 pts) Answer the following short answer questions. a) Explain the stop and wait ARQ (automatic

More information

Appendix B. Standards-Track TCP Evaluation

Appendix B. Standards-Track TCP Evaluation 215 Appendix B Standards-Track TCP Evaluation In this appendix, I present the results of a study of standards-track TCP error recovery and queue management mechanisms. I consider standards-track TCP error

More information

Hybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks

Hybrid Control and Switched Systems. Lecture #17 Hybrid Systems Modeling of Communication Networks Hybrid Control and Switched Systems Lecture #17 Hybrid Systems Modeling of Communication Networks João P. Hespanha University of California at Santa Barbara Motivation Why model network traffic? to validate

More information

Network Management & Monitoring Network Delay

Network Management & Monitoring Network Delay Network Management & Monitoring Network Delay These materials are licensed under the Creative Commons Attribution-Noncommercial 3.0 Unported license (http://creativecommons.org/licenses/by-nc/3.0/) End-to-end

More information

Handles all kinds of traffic on a single network with one class

Handles all kinds of traffic on a single network with one class Handles all kinds of traffic on a single network with one class No priorities, no reservations required Quality? Throw bandwidth at the problem, hope for the best 1000x increase in bandwidth over 2 decades

More information

Communication and Networks. Problems

Communication and Networks. Problems Electrical and Information Technology Communication and Networks Problems Link Layer 2016 Problems 1. Consider a network applying a slotted Aloha access system. The assumption for this is that all nodes

More information

College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435

College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435 College of Computer and Information Sciences Department of Computer Engineering CEN444 Computer Networks Midterm 2 Exam Second Semester 1434/1435 Student Name ID Time Allowed: 2.0 Hours. Closed Book, Closed

More information

Homework 1. Question 1 - Layering. CSCI 1680 Computer Networks Fonseca

Homework 1. Question 1 - Layering. CSCI 1680 Computer Networks Fonseca CSCI 1680 Computer Networks Fonseca Homework 1 Due: 27 September 2012, 4pm Question 1 - Layering a. Why are networked systems layered? What are the advantages of layering? Are there any disadvantages?

More information

BAMA Simulator. (Bandwidth Measurement Algorithms)

BAMA Simulator. (Bandwidth Measurement Algorithms) BAMA Simulator (Bandwidth Measurement Algorithms) By A.K.Aggarwal Jun Wei University of Windsor School of Computer Science Technical Report # 04-003 University of Windsor Windsor, Ontario Canada 2003 Abstract

More information

CS Transport. Outline. Window Flow Control. Window Flow Control

CS Transport. Outline. Window Flow Control. Window Flow Control CS 54 Outline indow Flow Control (Very brief) Review of TCP TCP throughput modeling TCP variants/enhancements Transport Dr. Chan Mun Choon School of Computing, National University of Singapore Oct 6, 005

More information

Overview. Performance metrics - Section 1.5 Direct link networks Hardware building blocks - Section 2.1 Encoding - Section 2.2 Framing - Section 2.

Overview. Performance metrics - Section 1.5 Direct link networks Hardware building blocks - Section 2.1 Encoding - Section 2.2 Framing - Section 2. Overview Performance metrics - Section 1.5 Direct link networks Hardware building blocks - Section 2.1 Encoding - Section 2.2 Framing - Section 2.3 Performance Metrics Bandwidth Amount of data that can

More information

ECEN Final Exam Fall Instructor: Srinivas Shakkottai

ECEN Final Exam Fall Instructor: Srinivas Shakkottai ECEN 424 - Final Exam Fall 2013 Instructor: Srinivas Shakkottai NAME: Problem maximum points your points Problem 1 10 Problem 2 10 Problem 3 20 Problem 4 20 Problem 5 20 Problem 6 20 total 100 1 2 Midterm

More information

Computer Networking. Introduction. Quintin jean-noël Grenoble university

Computer Networking. Introduction. Quintin jean-noël Grenoble university Computer Networking Introduction Quintin jean-noël Jean-noel.quintin@imag.fr Grenoble university Based on the presentation of Duda http://duda.imag.fr 1 Course organization Introduction Network and architecture

More information

ECE 653: Computer Networks Mid Term Exam all

ECE 653: Computer Networks Mid Term Exam all ECE 6: Computer Networks Mid Term Exam 16 November 004. Answer all questions. Always be sure to answer each question concisely but precisely! All questions have points each. 1. What are the different layers

More information

r=0.1 r=0.5 r=1 Figure 2.3: Throughput of ABP vs. PER

r=0.1 r=0.5 r=1 Figure 2.3: Throughput of ABP vs. PER Problem 19 1 0.9 r=0.1 r=0.5 r=1 0.8 Throughput 0.7 0.6 0.5 0.4 0.3 0.2 10 3 10 2 10 1 10 0 PER Figure 2.3: Throughput of ABP vs. PER Figure above shows the throughput of SRP as it varies with the packet

More information

EPON Scheduling Protocol Requirements

EPON Scheduling Protocol Requirements EPON Scheduling Protocol Requirements A system-level perspective Glen Kramer (kramer@cs.ucdavis.edu) Ryan Hirth (RHirth@terawave.com) Ed Boyd (ed.boyd@teknovus.com) Onn Haran (onn.haran@passave.com) Kent

More information

Congestion control in TCP

Congestion control in TCP Congestion control in TCP If the transport entities on many machines send too many packets into the network too quickly, the network will become congested, with performance degraded as packets are delayed

More information

Q23-5 In a network, the size of the receive window is 1 packet. Which of the follow-ing protocols is being used by the network?

Q23-5 In a network, the size of the receive window is 1 packet. Which of the follow-ing protocols is being used by the network? CS368: Exercise 5 Q23-5 In a network, the size of the receive window is 1 packet. Which of the follow-ing protocols is being used by the network? a) Stop_and_Wait b) Go-Back-N c) Selective-Repeat Q23-6.

More information

Computer Networks Principles

Computer Networks Principles Computer Networks Principles Introduction Prof. Andrzej Duda duda@imag.fr http://duda.imag.fr 1 Contents Introduction protocols and layered architecture encapsulation interconnection structures performance

More information

CS519: Computer Networks

CS519: Computer Networks Lets start at the beginning : Computer Networks Lecture 1: Jan 26, 2004 Intro to Computer Networking What is a for? To allow two or more endpoints to communicate What is a? Nodes connected by links Lets

More information

CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007

CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 CS 344/444 Computer Network Fundamentals Final Exam Solutions Spring 2007 Question 344 Points 444 Points Score 1 10 10 2 10 10 3 20 20 4 20 10 5 20 20 6 20 10 7-20 Total: 100 100 Instructions: 1. Question

More information

3. Examples. Contents. Classical model for telephone traffic (1) Classical model for telephone traffic (2)

3. Examples. Contents. Classical model for telephone traffic (1) Classical model for telephone traffic (2) Contents Model for telephone traffic Packet level model for data traffic Flow level model for elastic data traffic Flow level model for streaming data traffic lect03.ppt S-38.45 - Introduction to Teletraffic

More information

Lecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren

Lecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren Lecture 22: Buffering & Scheduling CSE 123: Computer Networks Alex C. Snoeren Lecture 23 Overview Buffer Management FIFO RED Traffic Policing/Scheduling 2 Key Router Challenges Buffer management: which

More information

Communication Networks

Communication Networks Communication Networks Spring 2018 Laurent Vanbever nsg.ee.ethz.ch ETH Zürich (D-ITET) April 30 2018 Materials inspired from Scott Shenker & Jennifer Rexford Last week on Communication Networks We started

More information

Why Your Application only Uses 10Mbps Even the Link is 1Gbps?

Why Your Application only Uses 10Mbps Even the Link is 1Gbps? Why Your Application only Uses 10Mbps Even the Link is 1Gbps? Contents Introduction Background Information Overview of the Issue Bandwidth-Delay Product Verify Solution How to Tell Round Trip Time (RTT)

More information

Investigating the Use of Synchronized Clocks in TCP Congestion Control

Investigating the Use of Synchronized Clocks in TCP Congestion Control Investigating the Use of Synchronized Clocks in TCP Congestion Control Michele Weigle (UNC-CH) November 16-17, 2001 Univ. of Maryland Symposium The Problem TCP Reno congestion control reacts only to packet

More information

Congestion Avoidance

Congestion Avoidance Congestion Avoidance Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks References K. K. Ramakrishnan, Raj Jain, A Binary Feedback Scheme for Congestion

More information

On Network Dimensioning Approach for the Internet

On Network Dimensioning Approach for the Internet On Dimensioning Approach for the Internet Masayuki Murata ed Environment Division Cybermedia Center, (also, Graduate School of Engineering Science, ) e-mail: murata@ics.es.osaka-u.ac.jp http://www-ana.ics.es.osaka-u.ac.jp/

More information

ATL : An Adaptive Transport Layer Protocol Suite for Next Generation Wireless Internet

ATL : An Adaptive Transport Layer Protocol Suite for Next Generation Wireless Internet ATL : An Adaptive Transport Layer Protocol Suite for Next Generation Wireless Internet O. B. Akan and F. Akyildiz IEEE Trans. On Selected Areas in Communications, vol. 22, no. 5, 2004 First paper deals

More information

MODELING OF SMART GRID TRAFFICS USING NON- PREEMPTIVE PRIORITY QUEUES

MODELING OF SMART GRID TRAFFICS USING NON- PREEMPTIVE PRIORITY QUEUES MODELING OF SMART GRID TRAFFICS USING NON- PREEMPTIVE PRIORITY QUEUES Contents Smart Grid Model and Components. Future Smart grid components. Classification of Smart Grid Traffic. Brief explanation of

More information

Lecture 9 Congestion Control: Part II. EECS 122 University of California Berkeley

Lecture 9 Congestion Control: Part II. EECS 122 University of California Berkeley Lecture 9 Congestion Control: Part II EECS 122 University of California Berkeley TOC: Congestion Control 2 Quick Review of TCP s CC Cheating TCP ECN Noisy Links Virtual Queues RED How Big are Router Buffers?

More information

A Generalization of a TCP Model: Multiple Source-Destination Case. with Arbitrary LAN as the Access Network

A Generalization of a TCP Model: Multiple Source-Destination Case. with Arbitrary LAN as the Access Network A Generalization of a TCP Model: Multiple Source-Destination Case with Arbitrary LAN as the Access Network Oleg Gusak and Tu rul Dayar Department of Computer Engineering and Information Science Bilkent

More information

Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. Congestion Control in Today s Internet

Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks. Congestion Control in Today s Internet Core-Stateless Fair Queueing: Achieving Approximately Fair Bandwidth Allocations in High Speed Networks Ion Stoica CMU Scott Shenker Xerox PARC Hui Zhang CMU Congestion Control in Today s Internet Rely

More information

70 CHAPTER 1 COMPUTER NETWORKS AND THE INTERNET

70 CHAPTER 1 COMPUTER NETWORKS AND THE INTERNET 70 CHAPTER 1 COMPUTER NETWORKS AND THE INTERNET one of these packets arrives to a packet switch, what information in the packet does the switch use to determine the link onto which the packet is forwarded?

More information

Reliable Transport I: Concepts and TCP Protocol

Reliable Transport I: Concepts and TCP Protocol Reliable Transport I: Concepts and TCP Protocol Brad Karp UCL Computer Science CS 3035/GZ01 29 th October 2013 Part I: Transport Concepts Layering context Transport goals Transport mechanisms 2 Context:

More information

100 Mbps. 100 Mbps S1 G1 G2. 5 ms 40 ms. 5 ms

100 Mbps. 100 Mbps S1 G1 G2. 5 ms 40 ms. 5 ms The Influence of the Large Bandwidth-Delay Product on TCP Reno, NewReno, and SACK Haewon Lee Λ, Soo-hyeoung Lee, and Yanghee Choi School of Computer Science and Engineering Seoul National University San

More information

Multiple Access Channels

Multiple Access Channels Multiple Access Channels Some Queuing Theory MAC: Aloha, ethernet Exponential backoff & friends LANs: Local Area Networks Goal: extend benefits of simple connection as far as possible Means: Share medium

More information

ADVANCED TOPICS FOR CONGESTION CONTROL

ADVANCED TOPICS FOR CONGESTION CONTROL ADVANCED TOPICS FOR CONGESTION CONTROL Congestion Control The Internet only functions because TCP s congestion control does an effective job of matching traffic demand to available capacity. TCP s Window

More information

Latency on a Switched Ethernet Network

Latency on a Switched Ethernet Network Page 1 of 6 1 Introduction This document serves to explain the sources of latency on a switched Ethernet network and describe how to calculate cumulative latency as well as provide some real world examples.

More information

Congestion Control in TCP

Congestion Control in TCP Congestion Control in TCP Antonio Carzaniga Faculty of Informatics University of Lugano November 11, 2014 Outline Intro to congestion control Input rate vs. output throughput Congestion window Congestion

More information

CS321: Computer Networks Introduction to Computer Networks and Internet

CS321: Computer Networks Introduction to Computer Networks and Internet CS321: Computer Networks Introduction to Computer Networks and Internet Dr. Manas Khatua Assistant Professor Dept. of CSE IIT Jodhpur E-mail: manaskhatua@iitj.ac.in What is Data Communication? Data communications

More information

8. TCP Congestion Control

8. TCP Congestion Control 8. TCP Congestion Control 1 TCP Congestion Control Slow-start increase Multiplicative decrease Congestion avoidance Measurement of variation Exponential timer backoff 2002 Yanghee Choi 2 Congestion Control

More information

Congestion Control for High Bandwidth-delay Product Networks

Congestion Control for High Bandwidth-delay Product Networks Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Presented by Chi-Yao Hong Adapted from slides by Dina Katabi CS598pbg Sep. 10, 2009 Trends in the Future

More information

CS 421: COMPUTER NETWORKS SPRING FINAL May 21, minutes

CS 421: COMPUTER NETWORKS SPRING FINAL May 21, minutes CS 421: COMPUTER NETWORKS SPRING 2015 FINAL May 21, 2015 150 minutes Name: Student No: Show all your work very clearly. Partial credits will only be given if you carefully state your answer with a reasonable

More information

Chapter 3 MEDIA ACCESS CONTROL

Chapter 3 MEDIA ACCESS CONTROL Chapter 3 MEDIA ACCESS CONTROL Distributed Computing Group Mobile Computing Winter 2005 / 2006 Overview Motivation SDMA, FDMA, TDMA Aloha Adaptive Aloha Backoff protocols Reservation schemes Polling Distributed

More information

II. Principles of Computer Communications Network and Transport Layer

II. Principles of Computer Communications Network and Transport Layer II. Principles of Computer Communications Network and Transport Layer A. Internet Protocol (IP) IPv4 Header An IP datagram consists of a header part and a text part. The header has a 20-byte fixed part

More information

Chapter I: Introduction

Chapter I: Introduction Chapter I: Introduction UG3 Computer Communications & Networks (COMN) Myungjin Lee myungjin.lee@ed.ac.uk Slides copyright of Kurose and Ross The work core mesh of interconnected routers packet-switching:

More information

ENSC 835 project TCP performance over satellite links. Kenny, Qing Shao Grace, Hui Zhang

ENSC 835 project TCP performance over satellite links. Kenny, Qing Shao Grace, Hui Zhang ENSC 835 project TCP performance over satellite links Kenny, Qing Shao Qshao@cs.sfu.ca Grace, Hui Zhang Hzhange@cs.sfu.ca Road map Introduction to satellite communications Simulation implementation Window

More information

Integrated t Services Digital it Network (ISDN) Digital Subscriber Line (DSL) Cable modems Hybrid Fiber Coax (HFC)

Integrated t Services Digital it Network (ISDN) Digital Subscriber Line (DSL) Cable modems Hybrid Fiber Coax (HFC) Digital Local Loop Technologies Integrated t Services Digital it Network (ISDN) Handles voice and data Relatively l high h cost for low bandwidth (Skip) Digital Subscriber Line (DSL) Cable modems Hybrid

More information

Internetwork. recursive definition point-to-point and multi-access: internetwork. composition of one or more internetworks

Internetwork. recursive definition point-to-point and multi-access: internetwork. composition of one or more internetworks Internetwork A B E C D recursive definition point-to-point and multi-access: internetwork composition of one or more internetworks Additional complications to deal with: addressing necessary LAN addresses

More information

Network core and metrics

Network core and metrics Network core and metrics latency propaga-on transmit queue Computer Networking: A Top Down Approach 6 th edition Jim Kurose, Keith Ross Addison-Wesley Some materials copyright 1996-2012 J.F Kurose and

More information

Announcements. TAs office hours: Mohamed Grissa: Mohamed Alkalbani:

Announcements. TAs office hours: Mohamed Grissa: Mohamed Alkalbani: Announcements TAs office hours: Mohamed Grissa: grissam@oregonstate.edu Tuesday: 4-5 Friday: 11-12 Mohamed Alkalbani: alkalbmo@oregonstate.edu Wednesday: 11-12 Thursday: 11-12 Lecture slides: Will be posted

More information

Generic Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture

Generic Architecture. EECS 122: Introduction to Computer Networks Switch and Router Architectures. Shared Memory (1 st Generation) Today s Lecture Generic Architecture EECS : Introduction to Computer Networks Switch and Router Architectures Computer Science Division Department of Electrical Engineering and Computer Sciences University of California,

More information

estadium Project Lab 2: Iperf Command

estadium Project Lab 2: Iperf Command estadium Project Lab 2: Iperf Command Objectives Being familiar with the command iperf. In this Lab, we will set up two computers (PC1 and PC2) as an ad-hoc network and use the command iperf to measure

More information

Congestion Control for High Bandwidth-delay Product Networks. Dina Katabi, Mark Handley, Charlie Rohrs

Congestion Control for High Bandwidth-delay Product Networks. Dina Katabi, Mark Handley, Charlie Rohrs Congestion Control for High Bandwidth-delay Product Networks Dina Katabi, Mark Handley, Charlie Rohrs Outline Introduction What s wrong with TCP? Idea of Efficiency vs. Fairness XCP, what is it? Is it

More information

Transmission Control Protocol. ITS 413 Internet Technologies and Applications

Transmission Control Protocol. ITS 413 Internet Technologies and Applications Transmission Control Protocol ITS 413 Internet Technologies and Applications Contents Overview of TCP (Review) TCP and Congestion Control The Causes of Congestion Approaches to Congestion Control TCP Congestion

More information

Problem-1: Solution-1:

Problem-1: Solution-1: Problem-1: olution-1: Tollbooths are 75 km apart, and the cars propagate at 100km/hr. A tollbooth services a car at a rate of one car every 12 seconds. a) There are ten cars. It takes seconds, or 2 minutes,

More information

CS 218- QoS Routing + CAC Fall 2003

CS 218- QoS Routing + CAC Fall 2003 CS 218- QoS Routing + CAC Fall 2003 M. Gerla et al: Resource Allocation and Admission Control Styles in QoS DiffServ Networks, QoS-IP 2001, Rome, Italy. A. Dubrovsky, M. Gerla, S. S. Lee, and D. Cavendish,Internet

More information

One More Bit Is Enough

One More Bit Is Enough One More Bit Is Enough Yong Xia, RPI Lakshmi Subramanian, UCB Ion Stoica, UCB Shiv Kalyanaraman, RPI SIGCOMM 05, Philadelphia, PA 08 / 23 / 2005 Motivation #1: TCP doesn t work well in high b/w or delay

More information

A Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks. Motivation

A Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks. Motivation A Hybrid Systems Modeling Framework for Fast and Accurate Simulation of Data Communication Networks Stephan Bohacek João P. Hespanha Junsoo Lee Katia Obraczka University of Delaware University of Calif.

More information

The Network Layer and Routers

The Network Layer and Routers The Network Layer and Routers Daniel Zappala CS 460 Computer Networking Brigham Young University 2/18 Network Layer deliver packets from sending host to receiving host must be on every host, router in

More information

CSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012

CSE 473 Introduction to Computer Networks. Final Exam. Your name here: 12/17/2012 CSE 473 Introduction to Computer Networks Jon Turner Final Exam Your name here: 12/17/2012 1. (8 points). The figure below shows a network path connecting a server to a client. 200 km 2000 km 2 km X Y

More information

Top-Down Network Design

Top-Down Network Design Top-Down Network Design Chapter Two Analyzing Technical Goals and Tradeoffs Copyright 2010 Cisco Press & Priscilla Oppenheimer 1 Technical Goals Scalability Availability Performance Security Manageability

More information

Computer Networks. Homework #3: Due 11 November 2015 (Wednesday) Just before Midterm#2!

Computer Networks. Homework #3: Due 11 November 2015 (Wednesday) Just before Midterm#2! Computer Networks Homework #3: Due 11 November 2015 (Wednesday) Just before Midterm#2! Problem #1. Assume you need to write and test a client-server application program on two hosts you have at home. a.

More information

Issues related to TCP performance in heterogeneous networks

Issues related to TCP performance in heterogeneous networks Issues related to TCP performance in heterogeneous networks Chadi BARAKAT INRIA Sophia Antipolis, France PLANETE group EPFL Summer Research Institute July 16, 2002 Heterogeneity of networks The Internet

More information

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS

CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS 28 CHAPTER 3 EFFECTIVE ADMISSION CONTROL MECHANISM IN WIRELESS MESH NETWORKS Introduction Measurement-based scheme, that constantly monitors the network, will incorporate the current network state in the

More information

LS Example 5 3 C 5 A 1 D

LS Example 5 3 C 5 A 1 D Lecture 10 LS Example 5 2 B 3 C 5 1 A 1 D 2 3 1 1 E 2 F G Itrn M B Path C Path D Path E Path F Path G Path 1 {A} 2 A-B 5 A-C 1 A-D Inf. Inf. 1 A-G 2 {A,D} 2 A-B 4 A-D-C 1 A-D 2 A-D-E Inf. 1 A-G 3 {A,D,G}

More information

Report on Transport Protocols over Mismatched-rate Layer-1 Circuits with 802.3x Flow Control

Report on Transport Protocols over Mismatched-rate Layer-1 Circuits with 802.3x Flow Control Report on Transport Protocols over Mismatched-rate Layer-1 Circuits with 82.3x Flow Control Helali Bhuiyan, Mark McGinley, Tao Li, Malathi Veeraraghavan University of Virginia Email: {helali, mem5qf, taoli,

More information

Reliable Transport I: Concepts and TCP Protocol

Reliable Transport I: Concepts and TCP Protocol Reliable Transport I: Concepts and TCP Protocol Stefano Vissicchio UCL Computer Science COMP0023 Today Transport Concepts Layering context Transport goals Transport mechanisms and design choices TCP Protocol

More information

Computer Networks. ENGG st Semester, 2010 Hayden Kwok-Hay So

Computer Networks. ENGG st Semester, 2010 Hayden Kwok-Hay So Computer Networks ENGG1015 1 st Semester, 2010 Hayden Kwok-Hay So Where are we in the semester? High Level Applications Systems Digital Logic Image & Video Processing Computer & Embedded Systems Computer

More information

A model for Endpoint Admission Control Based on Packet Loss

A model for Endpoint Admission Control Based on Packet Loss A model for Endpoint Admission Control Based on Packet Loss Ignacio Más and Gunnar Karlsson ACCESS Linneaus Center School of Electrical Engineering KTH, Royal Institute of Technology 44 Stockholm, Sweden

More information

ECE 610: Homework 4 Problems are taken from Kurose and Ross.

ECE 610: Homework 4 Problems are taken from Kurose and Ross. ECE 610: Homework 4 Problems are taken from Kurose and Ross. Problem 1: Host A and B are communicating over a TCP connection, and Host B has already received from A all bytes up through byte 248. Suppose

More information

EECS 3214: Computer Network Protocols and Applications. Final Examination. Department of Computer Science and Engineering

EECS 3214: Computer Network Protocols and Applications. Final Examination. Department of Computer Science and Engineering Department of Computer Science and Engineering EECS 3214: Computer Network Protocols and Applications Final Examination Instructor: N. Vlajic Date: April 9, 2016 Instructions: Examination time: 180 min.

More information

EL Wireless and Mobile Networking Spring 2002 Mid-Term Exam Solution - March 6, 2002

EL Wireless and Mobile Networking Spring 2002 Mid-Term Exam Solution - March 6, 2002 Instructions: EL 604 - Wireless and Mobile Networking Spring 2002 Mid-Term Exam Solution - March 6, 2002 Be sure to write your name on your submission. This is an open book test. Use your class notes,

More information