Review: Statistical Multiplexing

Slides:

Advertisements

Similar presentations

EE384Y: Packet Switch Architectures

Advertisements

Introducing optical switching into the network

1 Understanding Buffer Size Requirements in a Router Thanks to Nick McKeown and John Lockwood for numerous slides.

Introduction 1 Lecture 13 Transport Layer (Transmission Control Protocol) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer.

Simulation-based Comparison of Tahoe, Reno, and SACK TCP Kevin Fall & Sally Floyd Presented: Heather Heiman September 10, 2002.

Sizing Router Buffers Guido Appenzeller Isaac Keslassy Nick McKeown Stanford University.

EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.

Designing Networks with Little or No Buffers or Can Gulliver Survive in Lilliput? Yashar Ganjali High Performance Networking Group Stanford University.

High Performance All-Optical Networks with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University

High Performance Networking with Little or No Buffers Yashar Ganjali High Performance Networking Group Stanford University

High Performance Networking with Little or No Buffers Yashar Ganjali on behalf of Prof. Nick McKeown High Performance Networking Group Stanford University.

Sizing Router Buffers (Summary)

1 689 Lecture 2 Review of Last Lecture Networking basics TCP/UDP review.

ACN: TCP Sliding Windows1 TCP Sliding Windows, with Flow Control, and Congestion Control Based on Peterson and Davie Textbook.

1 TCP Transport Control Protocol Reliable In-order delivery Flow control Responds to congestion “Nice” Protocol.

Reducing the Buffer Size in Backbone Routers Yashar Ganjali High Performance Networking Group Stanford University February 23, 2005

1 Link Layer & Network Layer Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.

L13: Sharing in network systems Dina Katabi Spring Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans.

UCB TCP Jean Walrand U.C. Berkeley

Routers with Small Buffers Yashar Ganjali High Performance Networking Group Stanford University

Courtesy: Nick McKeown, Stanford 1 TCP Congestion Control Tahir Azim.

CS144 An Introduction to Computer Networks

Network Technologies essentials Week 8: TCP congestion control Compilation made by Tim Moors, UNSW Australia Original slides by David Wetherall, University.

Congestion models for bursty TCP traffic Damon Wischik + Mark Handley University College London DARPA grant W911NF

How Emerging Optical Technologies will affect the Future Internet NSF Meeting, 5 Dec, 2005 Nick McKeown Stanford University

Sizing Router Buffers How much packet buffers does a router need? C Router Source Destination 2T The current “Rule of Thumb” A router needs a buffer size:

Networked & Distributed Systems TCP/IP Transport Layer Protocols UDP and TCP University of Glamorgan.

1 Transport Layer Lecture 10 Imran Ahmed University of Management & Technology.

TCP behavior of a Busy Internet Server: Analysis and Improvements Y2K Oct.10 Joo Young Hwang Computer Engineering Research Laboratory KAIST. EECS.

1 TCP - Part II Relates to Lab 5. This is an extended module that covers TCP data transport, and flow control, congestion control, and error control in.

TCP: Transmission Control Protocol Part II : Protocol Mechanisms Computer Network System Sirak Kaewjamnong Semester 1st, 2004.

VO2-MAGAZINE.jpg Michael Jenkins Presents:

Winter 2008CS244a Handout 71 CS244a: An Introduction to Computer Networks Handout 7: Congestion Control Nick McKeown Professor of Electrical Engineering.

1 Computer Networks Congestion Avoidance. 2 Recall TCP Sliding Window Operation.

Winter 2003CS244a Handout 71 CS492B Project #2 TCP Tutorial # Jin Hyun Ju.

6.033 Lecture 12 – TCP details & Intro to Internet Routing Samuel Madden Key ideas: slow start reordering buffer path vector routing Hands-on 3 due tomorrow;

Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.

亚洲的位置和范围吉林省白城市洮北区教师进修学校郑春艳. Q 宠宝贝神奇之旅 —— 亚洲 Q 宠快递你在网上拍的一套物理实验器材到了。 Q 宠宝贝打电话给你：你好，我是快递员，有你的邮件，你的收货地址上面写的是学校地址，现在学校放假了，能把你家的具体位置告诉我吗？请向快递员描述自己家的详细位置！

1 Flow & Congestion Control Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.

Buffers: How we fell in love with them, and why we need a divorce Hot Interconnects, Stanford 2004 Nick McKeown High Performance Networking Group Stanford.

Networks with Very Small Buffers Yashar Ganjali, Guido Appenzeller, High Performance Networking Group Prof. Ashish Goel, Prof. Tim Roughgarden, Prof. Nick.

Window Control Adjust transmission rate by changing Window Size

Sachin Katti, CS244 Slides courtesy: Nick McKeown

Understanding Buffer Size Requirements in a Router

Receiver Assistant Congestion Control in High Speed and Lossy Networks

Transport Protocols over Circuits/VCs

continued on next slide

TCP - Part II Relates to Lab 5. This is an extended module that covers TCP flow control, congestion control, and error control in TCP.

CSE 4340/5349 Mobile Systems Engineering

Lecture 19 – TCP Performance

continued on next slide

continued on next slide

Implementing a Network Protocol using Sockets: A Modular Approach

TCP Sliding Windows, Flow Control, and Congestion Control

Selective repeat Protocol

TCP Throughput Modeling

Distributed Systems CS

АВЛИГАТАЙ ТЭМЦЭХ ҮНДЭСНИЙ ХӨТӨЛБӨР /танилцуулга/

Window Management in TCP

Routers with Very Small Buffers

TCP Sliding Windows, Flow Control, and Congestion Control

TCP: Transmission Control Protocol Part II : Protocol Mechanisms

continued on next slide

continued on next slide

TCP Sliding Windows, Flow Control, and Congestion Control

Distributed Systems CS

Presentation transcript:

Review: Statistical Multiplexing Observations The bigger the buffer, the lower the packet loss. If the buffer never goes empty, the outgoing line is busy 100% of the time. 975165 Slide from Nick McKeown, based on animations from http://yuba.stanford.edu/~appenz/animations.html 10/11/2018 Tim Moors

Review: TCP Congestion Control Rule for adjusting W If an ACK is received: W ← W+1/W If a packet is lost: W ← W/2 Only W packets may be outstanding 9751XE Slide from Nick McKeown, based on animations from http://yuba.stanford.edu/~appenz/animations.html 10/11/2018 Tim Moors