The Drift Method for Heavy-Traffic Limits

Size: px
Start display at page:

Download "The Drift Method for Heavy-Traffic Limits"

Transcription

1 The Drift Method for Heavy-Traffic Limits S. T. Maguluri (GaTech), R. Srikant (UIUC) and W. Wang (UIUC) Part III: Based on Wang, Maguluri, Srikant and Ying (2017)

2 Part III: Allocating bandwidth to data transfer flows New things you will see: A different type of state-space collapse A weighted inner product Insensitivity result

3 Data file transfer A data file is transferred along a route consisting of links The file leaves the system after all the bits of the file are delivered Source! Switches Destination Servers

4 Data file transfer A data file is transferred along a route consisting of links The file leaves the system after all the bits of the file are delivered File transfer flows use the bandwidths of links Source! Switches Destination! Servers

5 Data file transfer A data file is transferred along a route consisting of links The file leaves the system after all the bits of the file are delivered File transfer flows use the bandwidths of links Goal: How should we allocate bandwidth to flows to minimize delay? Source! Switches Destination! Servers

6 Queueing model! One queue per route Each link is modeled as a processor!

7 Queueing model! 1 2 1Gbps 1Gbps 3 1Gbps 4 1Gbps One queue per route Each link is modeled as a processor! Gbps 0.5 Gbps 1Gbps 1Gbps 1Gbps 1Gbps

8 Queueing model! One queue per route Each link is modeled as a processor! 5 For each queue, the associated links all allocate the same rate to it, and the rate is equally shared by all the files in the queue Capacity constraint at each link?? Capacity constraint

9 Heavy-traffic regime arrival rates mean file sizes

10 Scaling of data transfer delay

11 Scaling of data transfer delay

12 Yes: under proportionally fair sharing with exponential file size distributions Diffusion approximation: Kang et al. (2009), Shah et al. (2014), Ye and Yao (2012), Ye and Yao (2016)

13 What about general file size distributions? File size distributions may not be exponential in practice Conjectured yes Vlasiou et al. (2014) (phase-type distributions): the diffusion limit is insensitive No interchange of limits

14 Our results

15 Intuition

16 Intuition (phase-type file sizes)

17 Proportionally fair sharing

18 Digression: Single queue in continuous time 1

19 Bound on backlog 1

20 Bound on Backlog ` 1

21 Back to proportionally fair sharing

22 Identifying the subspace for state space collapse: Exponential file sizes

23 Identifying the subspace for state space collapse: Exponential file sizes

24 Identifying the subspace for state space collapse: Exponential file sizes Links

25 Identifying the subspace for state space collapse: Exponential file sizes

26 Identifying the subspace for state space collapse: Exponential file sizes

27 Identifying the subspace for state space collapse: Phase-type file sizes

28 Identifying the subspace for state space collapse: Phase-type file sizes

29 Identifying the subspace for state space collapse: Phase-type file sizes

30 Identifying the subspace for state space collapse: Phase-type file sizes

31 Identifying the subspace for state space collapse: Phase-type file sizes

32 State-space collapse

33 State-space collapse

34 Drift conditions

35 Our drift conditions

36 Our drift conditions

37

38

39

40 function of the parameters of file size distributions

41 Backlog bounds

42 Backlog bounds (1) (2) (3)

43 Backlog bounds (1) (2) (3)! Δ # % & = 0 +!, -. =

44 Extensions Our state-space collapse result in steady state implies interchange-oflimits for the diffusion approximation in Vlasiou et al. (2014) We can also use the drift method to study weighted proportionally fair sharing and obtain asymptotically tight bounds on the weighted sum of queue lengths The stationary distribution of the diffusion limit is unknown (no skew symmetry)

45 Summary In this part, we demonstrated the drift method in the problem of bandwidth sharing, where we show asymptotically tight bounds on the backlog the state-space collapse result is of a multiplicative type the file sizes have phase-type distributions: weighted inner product needs to be constructed

Stochastic Processing Networks: What, Why and How? Ruth J. Williams University of California, San Diego

Stochastic Processing Networks: What, Why and How? Ruth J. Williams University of California, San Diego Stochastic Processing Networks: What, Why and How? Ruth J. Williams University of California, San Diego http://www.math.ucsd.edu/~williams 1 OUTLINE! What is a Stochastic Processing Network?! Applications!

More information

Model suitable for virtual circuit networks

Model suitable for virtual circuit networks . The leinrock Independence Approximation We now formulate a framework for approximation of average delay per packet in telecommunications networks. Consider a network of communication links as shown in

More information

6.033 Spring 2015 Lecture #11: Transport Layer Congestion Control Hari Balakrishnan Scribed by Qian Long

6.033 Spring 2015 Lecture #11: Transport Layer Congestion Control Hari Balakrishnan Scribed by Qian Long 6.033 Spring 2015 Lecture #11: Transport Layer Congestion Control Hari Balakrishnan Scribed by Qian Long Please read Chapter 19 of the 6.02 book for background, especially on acknowledgments (ACKs), timers,

More information

Packet multiple access and the Aloha protocol

Packet multiple access and the Aloha protocol Packet multiple access and the Aloha protocol Massachusetts Institute of Technology Department of Aeronautics and Astronautics Slide 1 Packet Multiple Access PMA SHARED UPLINK TERMINAL TERMINAL APPL TRANS

More information

CS644 Advanced Networks

CS644 Advanced Networks What we know so far CS644 Advanced Networks Lecture 6 Beyond TCP Congestion Control Andreas Terzis TCP Congestion control based on AIMD window adjustment [Jac88] Saved Internet from congestion collapse

More information

Perspectives on Network Calculus No Free Lunch but Still Good Value

Perspectives on Network Calculus No Free Lunch but Still Good Value ACM Sigcomm 2012 Perspectives on Network Calculus No Free Lunch but Still Good Value Florin Ciucu T-Labs / TU Berlin Jens Schmitt TU Kaiserslautern Outline Network Calculus (NC): A Theory for System Performance

More information

Packet Scheduling and QoS

Packet Scheduling and QoS Packet Scheduling and QoS EECS 489 Computer Networks http://www.eecs.umich.edu/~zmao/eecs489 Z. Morley Mao Thursday Oct 14, 2004 Acknowledgement: Some slides taken from Kurose&Ross and Katz&Stoica 1 Packet

More information

You submitted this homework on Sat 22 Mar :51 AM PDT. You got a score of 5.00 out of 5.00.

You submitted this homework on Sat 22 Mar :51 AM PDT. You got a score of 5.00 out of 5.00. Feedback Homework 9 Help You submitted this homework on Sat 22 Mar 2014 5:51 AM PDT. You got a score of 5.00 out of 5.00. Question 1 Lecture 9-1 discussed the quality of service requirements for different

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

Nested QoS: Providing Flexible Performance in Shared IO Environment

Nested QoS: Providing Flexible Performance in Shared IO Environment Nested QoS: Providing Flexible Performance in Shared IO Environment Hui Wang Peter Varman Rice University Houston, TX 1 Outline Introduction System model Analysis Evaluation Conclusions and future work

More information

Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren

Lecture 21: Congestion Control CSE 123: Computer Networks Alex C. Snoeren Lecture 21: Congestion Control" CSE 123: Computer Networks Alex C. Snoeren Lecture 21 Overview" How fast should a sending host transmit data? Not to fast, not to slow, just right Should not be faster than

More information

Optimizing Scheduling Policies and Analyzing Delay in Multi-Hop Wireless Networks P.Pavan kumar Reddy 1, Manohar Gosul 2

Optimizing Scheduling Policies and Analyzing Delay in Multi-Hop Wireless Networks P.Pavan kumar Reddy 1, Manohar Gosul 2 Optimizing Scheduling Policies and Analyzing Delay in Multi-Hop Wireless Networks P.Pavan kumar Reddy 1, Manohar Gosul 2 1 M.Tech in CSE Dept, 2 Associate Professor Abstract: In this paper a multi-hop

More information

OPERATING SYSTEMS. Systems with Multi-programming. CS 3502 Spring Chapter 4

OPERATING SYSTEMS. Systems with Multi-programming. CS 3502 Spring Chapter 4 OPERATING SYSTEMS CS 3502 Spring 2018 Systems with Multi-programming Chapter 4 Multiprogramming - Review An operating system can support several processes in memory. While one process receives service

More information

CS 556 Advanced Computer Networks Spring Solutions to Midterm Test March 10, YOUR NAME: Abraham MATTA

CS 556 Advanced Computer Networks Spring Solutions to Midterm Test March 10, YOUR NAME: Abraham MATTA CS 556 Advanced Computer Networks Spring 2011 Solutions to Midterm Test March 10, 2011 YOUR NAME: Abraham MATTA This test is closed books. You are only allowed to have one sheet of notes (8.5 11 ). Please

More information

COMP/ELEC 429/556 Introduction to Computer Networks

COMP/ELEC 429/556 Introduction to Computer Networks COMP/ELEC 429/556 Introduction to Computer Networks Principles of Congestion Control Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng

More information

Traffic theory for the Internet and the future Internet

Traffic theory for the Internet and the future Internet Traffic theory for the Internet and the future Internet Orange Labs Jim Roberts, Research & Development 29 August 2008, MAS Seminar Internet traffic theory understanding the relationship between demand,

More information

Computer Networks. Routing

Computer Networks. Routing Computer Networks Routing Topics Link State Routing (Continued) Hierarchical Routing Broadcast Routing Sending distinct packets Flooding Multi-destination routing Using spanning tree Reverse path forwarding

More information

Introduction: Two motivating examples for the analytical approach

Introduction: Two motivating examples for the analytical approach Introduction: Two motivating examples for the analytical approach Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. D. Manjunath Outline

More information

Mean Value Analysis and Related Techniques

Mean Value Analysis and Related Techniques Mean Value Analysis and Related Techniques 34-1 Overview 1. Analysis of Open Queueing Networks 2. Mean-Value Analysis 3. Approximate MVA 4. Balanced Job Bounds 34-2 Analysis of Open Queueing Networks Used

More information

arxiv: v1 [cs.ni] 6 Oct 2017

arxiv: v1 [cs.ni] 6 Oct 2017 ENTRALIZE ONGESTION ONTROL AN SHEULING IN A ATAENTER By evavrat Shah and Qiaomin Xie Massachusetts Institute of Technology arxiv:1710.02548v1 [cs.ni] 6 Oct 2017 We consider the problem of designing a packet-level

More information

A Game-Theoretic Framework for Congestion Control in General Topology Networks

A Game-Theoretic Framework for Congestion Control in General Topology Networks A Game-Theoretic Framework for Congestion Control in General Topology SYS793 Presentation! By:! Computer Science Department! University of Virginia 1 Outline 2 1 Problem and Motivation! Congestion Control

More information

P D1.1 RPR OPNET Model User Guide

P D1.1 RPR OPNET Model User Guide P802.17 D1.1 RPR OPNET Model User Guide Revision Nov7 Yan F. Robichaud Mark Joseph Francisco Changcheng Huang Optical Networks Laboratory Carleton University 7 November 2002 Table Of Contents 0 Overview...1

More information

Episode 5. Scheduling and Traffic Management

Episode 5. Scheduling and Traffic Management Episode 5. Scheduling and Traffic Management Part 3 Baochun Li Department of Electrical and Computer Engineering University of Toronto Outline What is scheduling? Why do we need it? Requirements of a scheduling

More information

On the Transition to a Low Latency TCP/IP Internet

On the Transition to a Low Latency TCP/IP Internet On the Transition to a Low Latency TCP/IP Internet Bartek Wydrowski and Moshe Zukerman ARC Special Research Centre for Ultra-Broadband Information Networks, EEE Department, The University of Melbourne,

More information

DDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing

DDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing DDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing Husnu Saner Narman Md. Shohrab Hossain Mohammed Atiquzzaman School of Computer Science University of Oklahoma,

More information

Chapter III: Transport Layer

Chapter III: Transport Layer Chapter III: Transport Layer UG3 Computer Communications & Networks (COMN) Mahesh Marina mahesh@ed.ac.uk Slides thanks to Myungjin Lee and copyright of Kurose and Ross Principles of congestion control

More information

Multiple Access Communications. EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department

Multiple Access Communications. EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department Multiple Access Communications EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department 1 Multiple Access Satellite systems, radio networks (WLAN), ethernet segment

More information

6.888 Lecture 5: Flow Scheduling

6.888 Lecture 5: Flow Scheduling 6.888 Lecture 5: Flow Scheduling Mohammad Alizadeh Spring 2016 1 Datacenter Transport Goal: Complete flows quickly / meet deadlines Short flows (e.g., query, coordina1on) Large flows (e.g., data update,

More information

Chapter III. congestion situation in Highspeed Networks

Chapter III. congestion situation in Highspeed Networks Chapter III Proposed model for improving the congestion situation in Highspeed Networks TCP has been the most used transport protocol for the Internet for over two decades. The scale of the Internet and

More information

15-744: Computer Networking. Overview. Queuing Disciplines. TCP & Routers. L-6 TCP & Routers

15-744: Computer Networking. Overview. Queuing Disciplines. TCP & Routers. L-6 TCP & Routers TCP & Routers 15-744: Computer Networking RED XCP Assigned reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [KHR02] Congestion Control for High Bandwidth-Delay Product Networks L-6

More information

COMP/ELEC 429/556 Introduction to Computer Networks

COMP/ELEC 429/556 Introduction to Computer Networks COMP/ELEC 429/556 Introduction to Computer Networks Weighted Fair Queuing Some slides used with permissions from Edward W. Knightly, T. S. Eugene Ng, Ion Stoica, Hui Zhang T. S. Eugene Ng eugeneng at cs.rice.edu

More information

Delay Stability of Back-Pressure Policies in the presence of Heavy-Tailed Traffic

Delay Stability of Back-Pressure Policies in the presence of Heavy-Tailed Traffic Delay Stability of Back-Pressure Policies in the presence of Heavy-Tailed Traffic Mihalis G. Markakis Department of Economics and Business Universitat Pompeu Fabra Email: mihalis.markakis@upf.edu Eytan

More information

MQC Hierarchical Queuing with 3 Level Scheduler

MQC Hierarchical Queuing with 3 Level Scheduler MQC Hierarchical Queuing with 3 Level Scheduler The MQC Hierarchical Queuing with 3 Level Scheduler feature provides a flexible packet scheduling and queuing system in which you can specify how excess

More information

CS 268: Computer Networking

CS 268: Computer Networking CS 268: Computer Networking L-6 Router Congestion Control TCP & Routers RED XCP Assigned reading [FJ93] Random Early Detection Gateways for Congestion Avoidance [KHR02] Congestion Control for High Bandwidth-Delay

More information

Scheduling. Scheduling. Scheduling. Scheduling Criteria. Priorities. Scheduling

Scheduling. Scheduling. Scheduling. Scheduling Criteria. Priorities. Scheduling scheduling: share CPU among processes scheduling should: be fair all processes must be similarly affected no indefinite postponement aging as a possible solution adjust priorities based on waiting time

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

Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information

Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information Connection-Level Scheduling in Wireless Networks Using Only MAC-Layer Information Javad Ghaderi, Tianxiong Ji and R. Srikant Coordinated Science Laboratory and Department of Electrical and Computer Engineering

More information

System Wide Average interruption of Packet Using forecast policy in Wireless System

System Wide Average interruption of Packet Using forecast policy in Wireless System System Wide Average interruption of Packet Using forecast policy in Wireless System Veerraju Gampala, Department of Computer Science and Engineering, GMR Institute of Technology, Rajam, Andhra Pradesh,

More information

Topology basics. Constraints and measures. Butterfly networks.

Topology basics. Constraints and measures. Butterfly networks. EE48: Advanced Computer Organization Lecture # Interconnection Networks Architecture and Design Stanford University Topology basics. Constraints and measures. Butterfly networks. Lecture #: Monday, 7 April

More information

MUD: Send me your top 1 3 questions on this lecture

MUD: Send me your top 1 3 questions on this lecture Administrivia Review 1 due tomorrow Email your reviews to me Office hours on Thursdays 10 12 MUD: Send me your top 1 3 questions on this lecture Guest lectures next week by Prof. Richard Martin Class slides

More information

This Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network

This Lecture. BUS Computer Facilities Network Management. Switching Network. Simple Switching Network This Lecture BUS0 - Computer Facilities Network Management Switching networks Circuit switching Packet switching gram approach Virtual circuit approach Routing in switching networks Faculty of Information

More information

Lecture 14: Congestion Control"

Lecture 14: Congestion Control Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Amin Vahdat, Dina Katabi Lecture 14 Overview" TCP congestion control review XCP Overview 2 Congestion Control

More information

Promoting the Use of End-to-End Congestion Control in the Internet

Promoting the Use of End-to-End Congestion Control in the Internet Promoting the Use of End-to-End Congestion Control in the Internet Sally Floyd and Kevin Fall IEEE/ACM Transactions on Networking May 1999 ACN: TCP Friendly 1 Outline The problem of Unresponsive Flows

More information

Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks

Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks Queuing Delay and Achievable Throughput in Random Access Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute Troy, NY bisnin@rpi.edu, abouzeid@ecse.rpi.edu

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

This formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go

This formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go Chapter 3 Problem 2 In Figure 3.43 of the text every node transmits R bps, and we assume that both network partitions consist of 1 N nodes. So the total traffic generated by the nodes 2 of each Ethernet

More information

Congestion Control. Tom Anderson

Congestion Control. Tom Anderson Congestion Control Tom Anderson Bandwidth Allocation How do we efficiently share network resources among billions of hosts? Congestion control Sending too fast causes packet loss inside network -> retransmissions

More information

Design and Implementation of Measurement-Based Resource Allocation Schemes Using the Realtime Traffic Flow Measurement Architecture

Design and Implementation of Measurement-Based Resource Allocation Schemes Using the Realtime Traffic Flow Measurement Architecture Design and Implementation of Measurement-Based Resource Allocation Schemes Using the Realtime Traffic Flow Measurement Architecture Robert D. Callaway, Michael Devetsikiotis, and Chao Kan Department of

More information

DiffServ Architecture: Impact of scheduling on QoS

DiffServ Architecture: Impact of scheduling on QoS DiffServ Architecture: Impact of scheduling on QoS Abstract: Scheduling is one of the most important components in providing a differentiated service at the routers. Due to the varying traffic characteristics

More information

Networks Homework # 2

Networks Homework # 2 ISLAMIC UNIVERSITY OF GAZA COMPUTER ENGINEERING DEPARTMENT Networks Homework # 2 INSTRUCTIONS: 1. Show your work (i.e., how you derived your answer or the reason behind your thinking) in addition to your

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

Introduction to Communications Part One: Physical Layer Switching

Introduction to Communications Part One: Physical Layer Switching Introduction to Communications Part One: Physical Layer Switching Kuang Chiu Huang TCM NCKU Spring/2008 Goals of This Lecture Through the lecture and in-class discussion, students are enabled to compare

More information

EP2210 Scheduling. Lecture material:

EP2210 Scheduling. Lecture material: EP2210 Scheduling Lecture material: Bertsekas, Gallager, 6.1.2. MIT OpenCourseWare, 6.829 A. Parekh, R. Gallager, A generalized Processor Sharing Approach to Flow Control - The Single Node Case, IEEE Infocom

More information

Overview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers

Overview. TCP & router queuing Computer Networking. TCP details. Workloads. TCP Performance. TCP Performance. Lecture 10 TCP & Routers Overview 15-441 Computer Networking TCP & router queuing Lecture 10 TCP & Routers TCP details Workloads Lecture 10: 09-30-2002 2 TCP Performance TCP Performance Can TCP saturate a link? Congestion control

More information

Router Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13

Router Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13 Router Design: Table Lookups and Packet Scheduling EECS 122: Lecture 13 Department of Electrical Engineering and Computer Sciences University of California Berkeley Review: Switch Architectures Input Queued

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

A Bottleneck and Target Bandwidth Estimates-Based Congestion Control Algorithm for High BDP Networks

A Bottleneck and Target Bandwidth Estimates-Based Congestion Control Algorithm for High BDP Networks A Bottleneck and Target Bandwidth Estimates-Based Congestion Control Algorithm for High BDP Networks Tuan-Anh Le 1, Choong Seon Hong 2 Department of Computer Engineering, Kyung Hee University 1 Seocheon,

More information

Toward End-to-End Fairness: A Framework for the Allocation of Multiple Prioritized Resources in Switches and Routers

Toward End-to-End Fairness: A Framework for the Allocation of Multiple Prioritized Resources in Switches and Routers Toward End-to-End Fairness: A Framework for the Allocation of Multiple Prioritized Resources in Switches and Routers Yunkai Zhou Microsoft Corporation, Redmond, WA 98052 and Harish Sethu Department of

More information

6.033 Computer System Engineering

6.033 Computer System Engineering MIT OpenCourseWare http://ocw.mit.edu 6.033 Computer System Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 6.033 Lecture 13 Sam

More information

Network Model for Delay-Sensitive Traffic

Network Model for Delay-Sensitive Traffic Traffic Scheduling Network Model for Delay-Sensitive Traffic Source Switch Switch Destination Flow Shaper Policer (optional) Scheduler + optional shaper Policer (optional) Scheduler + optional shaper cfla.

More information

OASIS: Self-tuning Storage for Applications

OASIS: Self-tuning Storage for Applications OASIS: Self-tuning Storage for Applications Kostas Magoutis, Prasenjit Sarkar, Gauri Shah 14 th NASA Goddard- 23 rd IEEE Mass Storage Systems Technologies, College Park, MD, May 17, 2006 Outline Motivation

More information

Data Center Networks and Switching and Queueing and Covert Timing Channels

Data Center Networks and Switching and Queueing and Covert Timing Channels Data Center Networks and Switching and Queueing and Covert Timing Channels Hakim Weatherspoon Associate Professor, Dept of Computer Science CS 5413: High Performance Computing and Networking March 10,

More information

Performance Evaluation of Scheduling Mechanisms for Broadband Networks

Performance Evaluation of Scheduling Mechanisms for Broadband Networks Performance Evaluation of Scheduling Mechanisms for Broadband Networks Gayathri Chandrasekaran Master s Thesis Defense The University of Kansas 07.31.2003 Committee: Dr. David W. Petr (Chair) Dr. Joseph

More information

Lecture 14: Congestion Control"

Lecture 14: Congestion Control Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks George Porter Thanks: Amin Vahdat, Dina Katabi and Alex C. Snoeren Lecture 14 Overview" TCP congestion control review Dukkipati

More information

Episode 5. Scheduling and Traffic Management

Episode 5. Scheduling and Traffic Management Episode 5. Scheduling and Traffic Management Part 2 Baochun Li Department of Electrical and Computer Engineering University of Toronto Keshav Chapter 9.1, 9.2, 9.3, 9.4, 9.5.1, 13.3.4 ECE 1771: Quality

More information

Topologies. Maurizio Palesi. Maurizio Palesi 1

Topologies. Maurizio Palesi. Maurizio Palesi 1 Topologies Maurizio Palesi Maurizio Palesi 1 Network Topology Static arrangement of channels and nodes in an interconnection network The roads over which packets travel Topology chosen based on cost and

More information

Power Laws in ALOHA Systems

Power Laws in ALOHA Systems Power Laws in ALOHA Systems E6083: lecture 7 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA predrag@ee.columbia.edu February 28, 2007 Jelenković (Columbia

More information

Streaming Video and TCP-Friendly Congestion Control

Streaming Video and TCP-Friendly Congestion Control Streaming Video and TCP-Friendly Congestion Control Sugih Jamin Department of EECS University of Michigan jamin@eecs.umich.edu Joint work with: Zhiheng Wang (UofM), Sujata Banerjee (HP Labs) Video Application

More information

Chapter 12. Routing and Routing Protocols 12-1

Chapter 12. Routing and Routing Protocols 12-1 Chapter 12 Routing and Routing Protocols 12-1 Routing in Circuit Switched Network Many connections will need paths through more than one switch Need to find a route Efficiency Resilience Public telephone

More information

Data Link Layer, Part 3 Medium Access Control. Preface

Data Link Layer, Part 3 Medium Access Control. Preface Data Link Layer, Part 3 Medium Access Control These slides are created by Dr. Yih Huang of George Mason University. Students registered in Dr. Huang's courses at GMU can make a single machine-readable

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

LATTICE networks are widely used, for example, in distributed parallel computation [2], distributed

LATTICE networks are widely used, for example, in distributed parallel computation [2], distributed SUBMITTED TO IEEE/ACM TANSACTIONS ON NETWOKING 1 Lattice Networks: Capacity Limits, Optimal outing and Queueing Behavior Guillermo Barrenetxea, Student Member, IEEE, Baltasar Beferull-Lozano, Member, IEEE,

More information

CSE 123A Computer Networks

CSE 123A Computer Networks CSE 123A Computer Networks Winter 2005 Lecture 14 Congestion Control Some images courtesy David Wetherall Animations by Nick McKeown and Guido Appenzeller The bad news and the good news The bad news: new

More information

Compensation Modeling for QoS Support on a Wireless Network

Compensation Modeling for QoS Support on a Wireless Network Compensation Modeling for QoS Support on a Wireless Network Stefan Bucheli Jay R. Moorman John W. Lockwood Sung-Mo Kang Coordinated Science Laboratory University of Illinois at Urbana-Champaign Abstract

More information

Price-Sensitive Application Adaptation in Deadline-Based Networks

Price-Sensitive Application Adaptation in Deadline-Based Networks Price-Sensitive Application Adaptation in Deadline-Based Networks Xiao Huan Liu Department of Computer Science University of Manitoba Winnipeg, MB R3T 2N2, Canada Email: liuxh@cs.umanitoba.ca Yanni Ellen

More information

CS 268: Lecture 7 (Beyond TCP Congestion Control)

CS 268: Lecture 7 (Beyond TCP Congestion Control) Outline CS 68: Lecture 7 (Beyond TCP Congestion Control) TCP-Friendly Rate Control (TFRC) explicit Control Protocol Ion Stoica Computer Science Division Department of Electrical Engineering and Computer

More information

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2015

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2015 Congestion Control In The Internet Part 2: How it is implemented in TCP JY Le Boudec 2015 1 Contents 1. Congestion control in TCP 2. The fairness of TCP 3. The loss throughput formula 4. Explicit Congestion

More information

A Distributed CSMA Algorithm for Maximizing Throughput in Wireless Networks

A Distributed CSMA Algorithm for Maximizing Throughput in Wireless Networks International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 2, Number 2 (2012), pp. 125-132 International Research Publications House http://www. ripublication.com A Distributed

More information

Providing bandwidth guarantees over a best-effort network: call-admission and pricing

Providing bandwidth guarantees over a best-effort network: call-admission and pricing Providing bandwidth guarantees over a best-effort network: call-admission and pricing Costas Courcoubetis Department of Informatics, thens University of Economics and Business, 47 Evelpidon Str & 33 Lefkados

More information

Communication Fundamentals in Computer Networks

Communication Fundamentals in Computer Networks Lecture 5 Communication Fundamentals in Computer Networks M. Adnan Quaium Assistant Professor Department of Electrical and Electronic Engineering Ahsanullah University of Science and Technology Room 4A07

More information

A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ

A Probabilistic Approach for Achieving Fair Bandwidth Allocations in CSFQ A Probabilistic Approach for Achieving Fair Bandwidth Allocations in Peng Wang David L. Mills Department of Electrical & Computer Engineering University of Delaware Newark, DE 976 pwangee@udel.edu; mills@eecis.udel.edu

More information

TCPeer: Rate Control in P2P over IP Networks

TCPeer: Rate Control in P2P over IP Networks TCPeer: Rate Control in P2P over IP Networks Kolja Eger and Ulrich Killat Institute of Communication Networks Hamburg University of Technology (TUHH) 21071 Hamburg, Germany {eger, killat}@tu-harburg.de

More information

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2017

Congestion Control In The Internet Part 2: How it is implemented in TCP. JY Le Boudec 2017 1 Congestion Control In The Internet Part 2: How it is implemented in TCP JY Le Boudec 2017 Contents 6. TCP Reno 7. TCP Cubic 8. ECN and RED 9. Other Cool Stuff 2 6. Congestion Control in the Internet

More information

Performance and Evaluation of Congestion Control and Routing Algorithm for Improving Internet Traffic Control System

Performance and Evaluation of Congestion Control and Routing Algorithm for Improving Internet Traffic Control System IJN International Journal of omputer cience and Network ecurity, VOL. No.6, June 0 7 Performance and valuation of ongestion ontrol and Routing lgorithm for Improving Internet Traffic ontrol ystem.jayachandran,

More information

The effect of server s breakdown on the performance of finite-source retrial queueing systems

The effect of server s breakdown on the performance of finite-source retrial queueing systems 6 th International Conference on Applied Informatics Eger, Hungary, January 27 31, 2004. The effect of server s breakdown on the performance of finite-source retrial queueing systems János Roszik, János

More information

Dynamic Virtual Machine Placement and Migration for Multi-access Edge Computing

Dynamic Virtual Machine Placement and Migration for Multi-access Edge Computing Dynamic Virtual Machine Placement and Migration for Multi-access Edge Computing Wei Wang BUPT Ph.d candidate & UC Davis visiting student Email: weiw@bupt.edu.cn, waywang@ucdavis.edu Group Meeting, Aug.

More information

Node-based Scheduling with Provable Evacuation Time

Node-based Scheduling with Provable Evacuation Time Node-based Scheduling with Provable Evacuation Time Bo Ji and Jie Wu Department of Computer and Information Sciences Temple University, Philadelphia, PA Email:{boji, jiewu}@temple.edu Abstract This paper

More information

Optimal Control of Wireless Networks With Finite Buffers

Optimal Control of Wireless Networks With Finite Buffers 1316 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 20, NO. 4, AUGUST 2012 Optimal Control of Wireless Networks With Finite Buffers Long Bao Le, Member, IEEE, Eytan Modiano, Fellow, IEEE, and Ness B. Shroff,

More information

Chapter 24 Congestion Control and Quality of Service 24.1

Chapter 24 Congestion Control and Quality of Service 24.1 Chapter 24 Congestion Control and Quality of Service 24.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 24-1 DATA TRAFFIC The main focus of congestion control

More information

Hardware Evolution in Data Centers

Hardware Evolution in Data Centers Hardware Evolution in Data Centers 2004 2008 2011 2000 2013 2014 Trend towards customization Increase work done per dollar (CapEx + OpEx) Paolo Costa Rethinking the Network Stack for Rack-scale Computers

More information

Episode 5. Scheduling and Traffic Management

Episode 5. Scheduling and Traffic Management Episode 5. Scheduling and Traffic Management Part 2 Baochun Li Department of Electrical and Computer Engineering University of Toronto Outline What is scheduling? Why do we need it? Requirements of a scheduling

More information

Solution to Question 1: ``Quickies'' (25 points, 15 minutes)

Solution to Question 1: ``Quickies'' (25 points, 15 minutes) Solution to Question : ``Quickies'' (25 points, 5 minutes) What is meant by the term statistical multiplexing? Answer: In statistical multiplexing, data from multiple users (senders) is sent over a link.

More information

TCP/IP Performance ITL

TCP/IP Performance ITL TCP/IP Performance ITL Protocol Overview E-Mail HTTP (WWW) Remote Login File Transfer TCP UDP IP ICMP ARP RARP (Auxiliary Services) Ethernet, X.25, HDLC etc. ATM 4/30/2002 Hans Kruse & Shawn Ostermann,

More information

OASIS: Self-tuning Storage for Applications

OASIS: Self-tuning Storage for Applications OASIS: Self-tuning Storage for Applications Kostas Magoutis IBM T. J. Watson magoutis@us.ibm.com Prasenjit Sarkar IBM Almaden psarkar@almaden.ibm.com Gauri Shah IBM Almaden gauris@us.ibm.com Abstract This

More information

Theoretical Foundations of SBSE. Xin Yao CERCIA, School of Computer Science University of Birmingham

Theoretical Foundations of SBSE. Xin Yao CERCIA, School of Computer Science University of Birmingham Theoretical Foundations of SBSE Xin Yao CERCIA, School of Computer Science University of Birmingham Some Theoretical Foundations of SBSE Xin Yao and Many Others CERCIA, School of Computer Science University

More information

Local and Global Stability of Symmetric Heterogeneously- Delayed Control Systems

Local and Global Stability of Symmetric Heterogeneously- Delayed Control Systems Local and Global Stability of Symmetric Heterogeneously- Delayed Control Systems Yueping Zhang and Dmitri Loguinov Department of Computer Science Texas A&M University College Station, TX 77843 1 Outline

More information

Scaled VIP Algorithms for Joint Dynamic Forwarding and Caching in Named Data Networks

Scaled VIP Algorithms for Joint Dynamic Forwarding and Caching in Named Data Networks 1896 1920 1987 2006 Scaled VIP Algorithms for Joint Dynamic Forwarding and Caching in Named Data Networks Ying Cui Shanghai Jiao Tong University, Shanghai, China Joint work with Fan Lai, Feng Qiu, Wenjie

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

Stability Analysis of a Window-based Flow Control Mechanism for TCP Connections with Different Propagation Delays

Stability Analysis of a Window-based Flow Control Mechanism for TCP Connections with Different Propagation Delays Stability Analysis of a Window-based Flow Control Mechanism for TCP Connections with Different Propagation Delays Keiichi Takagaki Hiroyuki Ohsaki Masayuki Murata Graduate School of Engineering Science,

More information

Stop-and-Go Service Using Hierarchical Round Robin

Stop-and-Go Service Using Hierarchical Round Robin Stop-and-Go Service Using Hierarchical Round Robin S. Keshav AT&T Bell Laboratories 600 Mountain Avenue, Murray Hill, NJ 07974, USA keshav@research.att.com Abstract The Stop-and-Go service discipline allows

More information