Performance Analysis of Darwin: Transient State
|
|
|
- Warren Holland
- 5 years ago
- Views:
Transcription
1 Performance Analysis of Darwin: Transient State Mark Joseph Francisco Changcheng Huang Advanced Optical Networks Laboratory Carleton University May 6, 2002 May 6, , mjf_darprf_02 Changcheng Huang 1
2 Agenda Objectives Darwin Scenarios and Simulation Settings Transient Simulation Results Conclusions May 6, , mjf_darprf_02 Changcheng Huang 2
3 Objectives Examine the performance of Darwin Mixed topology with Mono-queue nodes and Dual-queue architecture Hub Scenario Even load sourcing, equal weight Step traffic increase Capture Transient Response of Mono-queue (1TB) as the congested station Dual-queue (2TB) as the congested station May 6, , mjf_darprf_02 Changcheng Huang 3
4 Scenario T2TB-HL: Congestion detected by 2TB station Darwin_00_1TB is the Hub Stations 01 to 15 send traffic counter clockwise on inner ring At t=0s, ring is 50% loaded with High Priority At t=0.05s, ring is 100% loaded with Low Priority May 6, , mjf_darprf_02 Changcheng Huang 4
5 Scenario T2TB-LH: Congestion detected by 2TB station Darwin_00_1TB is the Hub Stations 01 to 15 send traffic counter clockwise on inner ring At t=0s, ring is 100% loaded with Low Priority At t=0.05s, ring is 50% loaded with High Priority May 6, , mjf_darprf_02 Changcheng Huang 5
6 Scenario T1TB-HL : Congestion detected by 1TB station Darwin_01_2TB is the Hub Stations 02 to 00 send traffic counter clockwise on inner ring At 0s, ring is 50% loaded with High Priority At 0.05s, ring is 100% loaded with Low Priority May 6, , mjf_darprf_02 Changcheng Huang 6
7 Scenario T1TB-LH: Congestion detected by 1TB station Darwin_01_2TB is the Hub Stations 02 to 00 send traffic counter clockwise on inner ring At 0s, ring is 100% loaded with Low Priority At 0.05s, ring is 50% loaded with High Priority May 6, , mjf_darprf_02 Changcheng Huang 7
8 Scenario Summary Scenarios Congested station t= 0s t= 0.05s Traffic profile Traffic add T2TB-HL 2TB 50% high 100% low T2TB-LH 2TB 100% Low 50% high T1TB-HL 1TB 50% high 100% low T1TB-LH 1TB 100% Low 50% high MTU time = 1.2 us; Burst size ~ 15 us; RTT time 2 ms May 6, , mjf_darprf_02 Changcheng Huang 8
9 Traffic Settings Low Priority and High Priority traffic is generated with Poisson Distribution Packet size is tri-modal (60% 64B, 20% 512B, 20% 1518B) MTU time = 1.2 us Mean packet size is 444.4B RTT ~ 2ms May 6, , mjf_darprf_02 Changcheng Huang 9
10 Simulation Parameters Simulation Settings: 1TB Nodes Ring Access Delay Threshold: 1ms Tsample: 200us Token Size: 1,000 bits Leaky Bucket Size: 150,000 bits Burst time ~ 15 us Simulation Settings: 2TB Nodes Decay Interval: 100us Low Transit Buffer Size: 4MB Low threshold 900MB High threshold 3.75MB Low Transmit Buffer Size: 1MB Leaky Bucket Size: 80,000 bits Burst time ~ 8 us Trigger Threshold for advertisement: 450KB Common Settings Target Utilization: 95% Link Delay: 70us (15km) Link Rate: Gbps (OC-192) May 6, , mjf_darprf_02 Changcheng Huang 10
11 Scenario T2TB-HL Transient throughput Class A1, B 80 ms transient Class C May 6, , mjf_darprf_02 Changcheng Huang 11
12 Scenario T2TB-HL Ring Access Delay at congested station Class B, C Max 6000 us Class A1 Max 90 us May 6, , mjf_darprf_02 Changcheng Huang 12
13 Scenario T2TB-LH Transient Throughput Class A1, B 80 ms transient Class C May 6, , mjf_darprf_02 Changcheng Huang 13
14 Scenario T2TB-LH Ring Access Delay at congested station Class B,C Max us Class A1 Max 650 us May 6, , mjf_darprf_02 Changcheng Huang 14
15 Scenario T1TB-HL Transient Throughput Class A1, B 70 ms transient Class C May 6, , mjf_darprf_02 Changcheng Huang 15
16 Scenario T1TB-HL Ring Access Delay at congested station Class C Max ~6000 us Class B Max 3000 us May 6, , mjf_darprf_02 Changcheng Huang 16
17 Scenario T1TB-LH Transient Throughput Class A1, B 80 ms transient Class C May 6, , mjf_darprf_02 Changcheng Huang 17
18 Scenario T1TB-LH Ring Access Delay at the congested station Class C Max 20,000 us Class B Max 200 us May 6, , mjf_darprf_02 Changcheng Huang 18
19 Conclusions Mono-queue and dual-queue based on Darwin model interwork Simulation result for High (reclaimable) and low priority traffic Transient state results: Converges to steady states very fast (NxRTT) Achieves expected bounded MAC access delay and jitter 1TB High reclaimable/low < 2RTT 2TB High <RTT; low >RTT May 6, , mjf_darprf_02 Changcheng Huang 19
20 Backup Slides May 6, , mjf_darprf_02 Changcheng Huang 20
21 Ring Access Delay vs. Bucket Size May 6, , mjf_darprf_02 Changcheng Huang 21
22 Ring Access Delay vs. Bucket Size May 6, , mjf_darprf_02 Changcheng Huang 22
23 Ring Access Delay vs. Bucket Size May 6, , mjf_darprf_02 Changcheng Huang 23
24 Ring Access Delay vs. Bucket Size May 6, , mjf_darprf_02 Changcheng Huang 24
25 Ring Access Delay vs. Bucket Size 8-Node Senario May 6, , mjf_darprf_02 Changcheng Huang 25
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
Single and Dual Transit Buffer Interactions
Single and Dual Transit Buffer Interactions Necdet Uzun and Carey Kloss Goals Standard shall allow single and dual transit path implementations Same fairness algorithm shall be used for both Nodes should
IEEE RPR Performance (Corner Cases)
IEEE 802.17 (Corner Cases), AmerNet Adisak Mekkittikul, Lantern Interim Meeting Orlando, FL Motivation Need to simulate corner case scenarios and ensure that the proposed standard works under these conditions
SIMULATION OF PACKET DATA NETWORKS USING OPNET
SIMULATION OF PACKET DATA NETWORKS USING OPNET Nazy Alborz, Maryam Keyvani, Milan Nikolic, and Ljiljana Trajkovic * School of Engineering Science Simon Fraser University Vancouver, British Columbia, Canada
Weighted Fairness Algorithm. and 3 Priority Support
Weighted Fairness Algorithm and 3 Priority Support Necdet Uzun, Pinar Yilmaz - Cisco Systems Gunes Aybay Riverstone Networks Gal Mor Corrigent Systems David Cheon - Sun Microsystems Sateesh Kumar Redwave
SIMULATION OF PACKET DATA NETWORKS USING OPNET
Nazy Alborz Maryam Keyvani Milan Nikolic Ljiljana Trajkovic SIMULATION OF PACKET DATA NETWORKS USING OPNET TM Communication Networks Laboratory School of Engineering Science Simon Fraser University Road
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
Data Link Control. Outline. DLC functions
Data Link Control #8 1 Outline functions Framing Error and flow control Performance of Example of a standard protocol- >H Open loop flow control 2 Data Link Layer Functions Data Link layer provides a error
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
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
From Routing to Traffic Engineering
1 From Routing to Traffic Engineering Robert Soulé Advanced Networking Fall 2016 2 In the beginning B Goal: pair-wise connectivity (get packets from A to B) Approach: configure static rules in routers
Chapter 24 Congestion Control and Quality of Service Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
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
CS244a: An Introduction to Computer Networks
Do not write in this box MCQ 13: /10 14: /10 15: /0 16: /0 17: /10 18: /10 19: /0 0: /10 Total: Name: Student ID #: Campus/SITN-Local/SITN-Remote? CS44a Winter 004 Professor McKeown CS44a: An Introduction
Quality of Service (QoS)
Quality of Service (QoS) The Internet was originally designed for best-effort service without guarantee of predictable performance. Best-effort service is often sufficient for a traffic that is not sensitive
Wireless Access. Practice 15 November 14, 2018
Practice 15 November 14, 2018 Wireless Access Graduate course in Telecommunications School of Engineering University of Rome La Sapienza Rome, Italy 2018-2019 Token ring queueing time analysis with OMNeT++
An Empirical Study of Delay Jitter Management Policies
An Empirical Study of Delay Jitter Management Policies D. Stone and K. Jeffay Computer Science Department University of North Carolina, Chapel Hill ACM Multimedia Systems Volume 2, Number 6 January 1995
Tutorial 8 : Congestion Control
Lund University ETSN01 Advanced Telecommunication Tutorial 8 : Congestion Control Author: Antonio Franco Emma Fitzgerald Tutor: Farnaz Moradi December 18, 2015 Contents I Before you start 3 II Exercises
IMPLEMENTATION OF CONGESTION CONTROL MECHANISMS USING OPNET
Nazy Alborz IMPLEMENTATION OF CONGESTION CONTROL MECHANISMS USING OPNET TM Communication Networks Laboratory School of Engineering Science Simon Fraser University Road map Introduction to congestion control
Housekeeping. Fall /5 CptS/EE 555 1
Housekeeping Lab access HW turn-in Jin? Class preparation for next time: look at the section on CRCs 2.4.3. Be prepared to explain how/why the shift register implements the CRC Skip Token Rings section
Unit 2 Packet Switching Networks - II
Unit 2 Packet Switching Networks - II Dijkstra Algorithm: Finding shortest path Algorithm for finding shortest paths N: set of nodes for which shortest path already found Initialization: (Start with source
1. The Internet 2. Principles 3. Ethernet 4. WiFi 5. Routing 6. Internetworking 7. Transport 8. Models 9. WiMAX & LTE 10. QoS 11. Physical Layer 12.
Lecture Slides 1. The Internet 2. Principles 3. Ethernet 4. WiFi 5. Routing 6. Internetworking 7. Transport 8. Models 9. WiMAX & LTE 10. QoS 11. Physical Layer 12. Additional Topics 1.1. Basic Operations
Merits of Open Loop. Siamack Ayandeh Onex Communications Corp. a subsidiary of. TranSwitch Corp.
One TM Merits of Open Loop Siamack Ayandeh sayandeh@onexco.com Onex Communications Corp a subsidiary of TranSwitch Corp. Outline Allows for dynamic partitioning between the High and Low priority traffic
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
Lecture 5: Performance Analysis I
CS 6323 : Modeling and Inference Lecture 5: Performance Analysis I Prof. Gregory Provan Department of Computer Science University College Cork Slides: Based on M. Yin (Performability Analysis) Overview
CS244a: An Introduction to Computer Networks
Name: Student ID #: Campus/SITN-Local/SITN-Remote? MC MC Long 18 19 TOTAL /20 /20 CS244a: An Introduction to Computer Networks Final Exam: Thursday February 16th, 2000 You are allowed 2 hours to complete
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
of-service Support on the Internet
Quality-of of-service Support on the Internet Dept. of Computer Science, University of Rochester 2008-11-24 CSC 257/457 - Fall 2008 1 Quality of Service Support Some Internet applications (i.e. multimedia)
Kommunikationssysteme [KS]
![Kommunikationssysteme [KS]](/thumbs/93/112470834.jpg "Kommunikationssysteme [KS]")
Kommunikationssysteme [KS] Dr.-Ing. Falko Dressler Computer Networks and Communication Systems Department of Computer Sciences University of Erlangen-Nürnberg http://www7.informatik.uni-erlangen.de/~dressler/
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
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
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
Stein Gjessing Simula Research Laboratory
Rate Control in RPR Lessons Learned from Java Simulations Stein Gjessing Simula Research Laboratory Contents Granularity of rate control Fine grained vs bursty 1. Simple version 2. Multiple (N) VOQs /
Module objectives. Integrated services. Support for real-time applications. Real-time flows and the current Internet protocols
Integrated services Reading: S. Keshav, An Engineering Approach to Computer Networking, chapters 6, 9 and 4 Module objectives Learn and understand about: Support for real-time applications: network-layer
Resource allocation in networks. Resource Allocation in Networks. Resource allocation
Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers
Router s Queue Management
Router s Queue Management Manages sharing of (i) buffer space (ii) bandwidth Q1: Which packet to drop when queue is full? Q2: Which packet to send next? FIFO + Drop Tail Keep a single queue Answer to Q1:
A solution for Synchronization Problem of Interconnected Metro Access and Metro Core Ring Networks
A solution for Synchronization Problem of Interconnected Access and Core Ring Networks Tülin ATMACA, Van T. NGUYEN, Dung T. NGUYEN, Glenda GONZALEZ Lab. CNRS/Samovar Institut Telecom/Telecom SudParis Evry
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
Kent State University
CS 4/54201 Computer Communication Network Kent State University Dept. of Computer Science www.mcs.kent.edu/~javed/class-net06f/ 1 A Course on Networking and Computer Communication LECT-11, S-2 Congestion
EP2200 Performance analysis of Communication networks. Topic 3 Congestion and rate control
EP00 Performance analysis of Communication networks Toic 3 Congestion and rate control Congestion, rate and error control Lecture material: Bertsekas, Gallager, Data networks, 6.- I. Kay, Stochastic modeling,
Outline Computer Networking. TCP slow start. TCP modeling. TCP details AIMD. Congestion Avoidance. Lecture 18 TCP Performance Peter Steenkiste
Outline 15-441 Computer Networking Lecture 18 TCP Performance Peter Steenkiste Fall 2010 www.cs.cmu.edu/~prs/15-441-f10 TCP congestion avoidance TCP slow start TCP modeling TCP details 2 AIMD Distributed,
Adaptive RED: An Algorithm for Increasing the Robustness of RED s Active Queue Management or How I learned to stop worrying and love RED
Adaptive RED: An Algorithm for Increasing the Robustness of RED s Active Queue Management or How I learned to stop worrying and love RED! Presented by:! Frank Posluszny! Vishal Phirke 2/9/02 1 "Introduction
The IEEE Media Access Protocol for High-Speed Metropolitan-Area Resilient Packet Rings
The IEEE 8.7 Media Access Protocol for High-Speed Metropolitan-Area Resilient Packet Rings V. Gambiroza, P. Yuan, and E. Knightly Abstract The Resilient Packet Ring (RPR) IEEE 8.7 standard is under development
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
COMP476 Networked Computer Systems. Polling. Sharing the Wire. LAN Technologies. COMP476 Networked Computer Systems 1
Media Access Control Sub Layer COMP476 Networked Computer Systems Sharing Common Media There are several ways to share common media. Some methods are: Frequency division multiplexing Time division multiplexing
Local Area Networks (LANs) SMU CSE 5344 /
Local Area Networks (LANs) SMU CSE 5344 / 7344 1 LAN/MAN Technology Factors Topology Transmission Medium Medium Access Control Techniques SMU CSE 5344 / 7344 2 Topologies Topology: the shape of a communication
Throughput & Latency Control in Ethernet Backplane Interconnects. Manoj Wadekar Gary McAlpine. Intel
Throughput & Latency Control in Ethernet Backplane Interconnects Manoj Wadekar Gary McAlpine Intel Date 3/16/04 Agenda Discuss Backplane challenges to Ethernet Simulation environment and definitions Preliminary
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
CS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 4pm
CS144: Intro to Computer Networks Homework 1 Scan and submit your solution online. Due Friday January 30, 2015 @ 4pm Your Name: SUNet ID: @stanford.edu Check if you would like exam routed back via SCPD:
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
The Controlled Delay (CoDel) AQM Approach to fighting bufferbloat
The Controlled Delay (CoDel) AQM Approach to fighting bufferbloat BITAG TWG Boulder, CO February 27, 2013 Kathleen Nichols Van Jacobson Background The persistently full buffer problem, now called bufferbloat,
Example questions for the Final Exam, part A
ETSF10, ETSF05 Ht 2010 Example questions for the Final Exam, part A 1. In AdHoc routing there are two main strategies, reactive and proactive routing. Describe in a small number of words the concept of
Adaptive Data Burst Assembly in OBS Networks
Adaptive Data Burst Assembly in OBS Networks Mohamed A.Dawood 1, Mohamed Mahmoud 1, Moustafa H.Aly 1,2 1 Arab Academy for Science, Technology and Maritime Transport, Alexandria, Egypt 2 OSA Member muhamed.dawood@aast.edu,
(a) Client server model (b) MAN (c) Interfaces and services. [4+6+6] FirstRanker
![(a) Client server model (b) MAN (c) Interfaces and services. [4+6+6] FirstRanker](/thumbs/96/127263915.jpg "(a) Client server model (b) MAN (c) Interfaces and services. [4+6+6] FirstRanker")
Code No: N0421/R07 Set No. 1 IV B.Tech I Semester Supplementary Examinations, March 2013 COMPUTER NETWORKS ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
Improving the Robustness of TCP to Non-Congestion Events
Improving the Robustness of TCP to Non-Congestion Events Presented by : Sally Floyd floyd@acm.org For the Authors: Sumitha Bhandarkar A. L. Narasimha Reddy {sumitha,reddy}@ee.tamu.edu Problem Statement
Data Center TCP(DCTCP)
Data Center TCP(DCTCP) Mohammad Alizadeh * +, Albert Greenberg *, David A. Maltz *, Jitendra Padhye *, Parveen Patel *, Balaji Prabhakar +, Sudipta Sengupta *, Murari Sridharan * * + Microsoft Research
Lecture 17 Multimedia Transport Subsystem (Part 3)
CS 414 Multimedia Systems Design Lecture 17 Multimedia Transport Subsystem (Part 3) Klara Nahrstedt Spring 2010 Administrative MP2: deadline Monday, March 1, demos 5-7pm (sign up in class on Monday) HW1:
INGRESS RATE CONTROL IN RESILIENT PACKET RINGS
ABSTRACT THOMBARE, ASAVARI ANIL. Ingress Rate Control in Resilient Packet Rings. (Under the direction of Dr. Ioannis Viniotis.) Resilient Packet Ring (RPR) Protocol is becoming popular in Metro Networks
TELE Switching Systems and Architecture. Assignment Week 10 Lecture Summary - Traffic Management (including scheduling)
TELE9751 - Switching Systems and Architecture Assignment Week 10 Lecture Summary - Traffic Management (including scheduling) Student Name and zid: Akshada Umesh Lalaye - z5140576 Lecturer: Dr. Tim Moors
EXPERIENCES EVALUATING DCTCP. Lawrence Brakmo, Boris Burkov, Greg Leclercq and Murat Mugan Facebook
EXPERIENCES EVALUATING DCTCP Lawrence Brakmo, Boris Burkov, Greg Leclercq and Murat Mugan Facebook INTRODUCTION Standard TCP congestion control, which only reacts to packet losses has many problems Can
CSE 473 Introduction to Computer Networks. Exam 2. Your name here: 11/7/2012
CSE 473 Introduction to Computer Networks Jon Turner Exam 2 Your name here: 11/7/2012 1. (10 points). The diagram at right shows a DHT with 16 nodes. Each node is labeled with the first value in its range
ADVANCED COMPUTER NETWORKS
ADVANCED COMPUTER NETWORKS Congestion Control and Avoidance 1 Lecture-6 Instructor : Mazhar Hussain CONGESTION CONTROL When one part of the subnet (e.g. one or more routers in an area) becomes overloaded,
CSE/EE 461 Section 2
CSE/EE 461 Section 2 Latency in a store-and-forward network 4ms, 10MB/s B How long does it take to send a 2kB packet from to B? 2ms, 10MB/s C 2ms, 10MB/s B What if it has to pass through a node C? Plan
XCo: Explicit Coordination for Preventing Congestion in Data Center Ethernet
XCo: Explicit Coordination for Preventing Congestion in Data Center Ethernet Vijay Shankar Rajanna, Smit Shah, Anand Jahagirdar and Kartik Gopalan Computer Science, State University of New York at Binghamton
ETSF10 Internet Protocols Transport Layer Protocols
ETSF10 Internet Protocols Transport Layer Protocols 2012, Part 2, Lecture 2.2 Kaan Bür, Jens Andersson Transport Layer Protocols Special Topic: Quality of Service (QoS) [ed.4 ch.24.1+5-6] [ed.5 ch.30.1-2]
Traffic Access Control. Hamid R. Rabiee Mostafa Salehi, Fatemeh Dabiran, Hoda Ayatollahi Spring 2011
Traffic Access Control Hamid R. Rabiee Mostafa Salehi, Fatemeh Dabiran, Hoda Ayatollahi Spring 2011 Outlines Traffic Access Control Definition Traffic Shaping Traffic Policing The Leaky Bucket The Token
Stateless Resource Sharing AND ATS
Stateless Resource Sharing AND ATS Putting together the Best of breads IEEE P802.1Qcr, 2016-09-14, York, UK Szilveszter Nádas, Balázs Varga (A), János Farkas Introduction SRS Overview and Presentation
UNIT IV TRANSPORT LAYER
Transport Layer UNIT IV TRANSPORT LAYER Congestion Control and Quality of Service Ref: Data Communication & Networking, 4 th edition, Forouzan IV-1 DATA TRAFFIC The main focus of congestion control and
Queuing. Congestion Control and Resource Allocation. Resource Allocation Evaluation Criteria. Resource allocation Drop disciplines Queuing disciplines
Resource allocation Drop disciplines Queuing disciplines Queuing 1 Congestion Control and Resource Allocation Handle congestion if and when it happens TCP Congestion Control Allocate resources to avoid
Advanced Computer Networks
Advanced Computer Networks QoS in IP networks Prof. Andrzej Duda duda@imag.fr Contents QoS principles Traffic shaping leaky bucket token bucket Scheduling FIFO Fair queueing RED IntServ DiffServ http://duda.imag.fr
Communication Problems. Flow Control
Communication Problems Flow, loss, congestion, policing Messages get lost due to several factors, including collisions, lack of buffer space, lack of computing power, etc To allow the flow of data at a
H3C S9500E Routing Switch Series RPR Interface Card Datasheet
H3C S9500E Routing Switch Series RPR Interface Card Datasheet Copyright 2012 Hangzhou H3C Technologies Co., Ltd. All rights reserved. No part of this manual may be reproduced or transmitted in any form
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
Metro technologies GE, SRP, RPR and more abbreviations. Lars Hanson, Stefan Lindeberg,
Metro technologies GE, SRP, RPR and more abbreviations Lars Hanson, lha@cisco.com Stefan Lindeberg, stefan@lindeberg.net Agenda Introduction Gigabit Ethernet Cisco Spatial Reuse Protocol, SRP Building
Code No: RR Set No. 1
Code No: RR320503 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2007 COMPUTER NETWORKS ( Common to Computer Science & Engineering, Information Technology, Electronics & Control Engineering,
Data Communication Prof. A. Pal Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture # 29 High Speed LANs
Data Communication Prof. A. Pal Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture # 29 High Speed LANs Hello and welcome to today s lecture on high speed
Advanced Lab in Computer Communications Meeting 6 QoS. Instructor: Tom Mahler
Advanced Lab in Computer Communications Meeting 6 QoS Instructor: Tom Mahler Motivation Internet provides only single class of best-effort service. Some applications can be elastic. Tolerate delays and
Configuring QoS CHAPTER
CHAPTER 34 This chapter describes how to use different methods to configure quality of service (QoS) on the Catalyst 3750 Metro switch. With QoS, you can provide preferential treatment to certain types
Frame Relay. Frame Relay: characteristics
Frame Relay Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Network management and QoS provisioning - 1 Frame Relay: characteristics Packet switching
QUALITY of SERVICE. Introduction
QUALITY of SERVICE Introduction There are applications (and customers) that demand stronger performance guarantees from the network than the best that could be done under the circumstances. Multimedia
Chapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP
Chapter 23 Process-to-Process Delivery: UDP, TCP, and SCTP 23.1 Copyright The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 23-1 PROCESS-TO-PROCESS DELIVERY The transport
Lecture 4 Wide Area Networks - Congestion in Data Networks
DATA AND COMPUTER COMMUNICATIONS Lecture 4 Wide Area Networks - Congestion in Data Networks Mei Yang Based on Lecture slides by William Stallings 1 WHAT IS CONGESTION? congestion occurs when the number
QUESTION BANK EVEN SEMESTER
Fatima Michael College of Engineering and Technology DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING QUESTION BANK EVEN SEMESTER SUB CODE & NAME: EC2352 COMPUTER NETWORKS YEAR / SEM: III / VI Staff
ETSF05/ETSF10 Internet Protocols. Performance & QoS Congestion Control
ETSF05/ETSF10 Internet Protocols Performance & QoS Congestion Control Quality of Service (QoS) Maintaining a functioning network Meeting applications demands User s demands = QoE (Quality of Experience)
CSE/EE 461 Wireless and Contention-Free Protocols
CSE/EE 461 Wireless and Contention-Free Protocols Last Time The multi-access problem Medium Access Control (MAC) sublayer Random access protocols: Aloha CSMA variants Classic Ethernet (CSMA/CD) Application
"Filling up an old bath with holes in it, indeed. Who would be such a fool?" "A sum it is, girl," my father said. "A sum. A problem for the mind.
We were doing very well, up to the kind of sum when a bath is filling at the rate of so many gallons and two holes are letting the water out, and please to say how long it will take to fill the bath, when
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
QUESTION BANK UNIT-I
DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK Subject Code: CS1302 Subject Name: Computer Networks Year/ Sem: III / V UNIT-I 1. What is multicast? What is the difference between unicast and multicast?
Cloud Control with Distributed Rate Limiting. Raghaven et all Presented by: Brian Card CS Fall Kinicki
Cloud Control with Distributed Rate Limiting Raghaven et all Presented by: Brian Card CS 577 - Fall 2014 - Kinicki 1 Outline Motivation Distributed Rate Limiting Global Token Bucket Global Random Drop
CS244a: An Introduction to Computer Networks
Grade: MC: 7: 8: 9: 10: 11: 12: 13: 14: Total: CS244a: An Introduction to Computer Networks Final Exam: Wednesday You are allowed 2 hours to complete this exam. (i) This exam is closed book and closed
Comparative Study of Routing Protocols Convergence using OPNET Chapter Three: Simulation & Configuration
3.1 Optimized Network Engineering Tools:- Optimized Network Engineering Tools () Modeler is the industry s leading simulator specialized for network research and development. It allows users to design
Improving Accuracy in End-to-end Packet Loss Measurement
Improving Accuracy in End-to-end Packet Loss Measurement Paper by Joel Sommers, Paul Barford, Nick Duffield, and Amos Ron Presented by Christoph Jechlitschek Motivation Understanding the impact of packet
Congestion Control Open Loop
Congestion Control Open Loop Muhammad Jaseemuddin Dept. of Electrical & Computer Engineering Ryerson University Toronto, Canada References 1. A. Leon-Garcia and I. Widjaja, Communication Networks: Fundamental
Configuring Quality of Service
CHAPTER 21 This chapter applies only to the ML-Series (ML100T-2, ML100X-8, and ML1000-2) cards. This chapter describes the quality of service (QoS) features built into your ML-Series card and how to map
SRP Commands on the Cisco IOS XR Software
This module provides command line interface (CLI) commands for configuring Spatial Reuse Protocol (SRP) on supported Cisco Dynamic Packet Transport (DPT) interfaces. SRP is a MAC-layer protocol developed
Chapter 1 Introduction
Emerging multimedia, high-speed data, and imaging applications are generating a demand for public networks to be able to multiplex and switch simultaneously a wide spectrum of data rates. These networks
CS244a: An Introduction to Computer Networks
Do not write in this box MCQ 9: /10 10: /10 11: /20 12: /20 13: /20 14: /20 Total: Name: Student ID #: CS244a Winter 2003 Professor McKeown Campus/SITN-Local/SITN-Remote? CS244a: An Introduction to Computer
Master Course Computer Networks IN2097
Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Chair for Network Architectures and Services Prof. Carle Department for Computer Science TU München Master
Data Link Control Protocols
Protocols : Introduction to Data Communications Sirindhorn International Institute of Technology Thammasat University Prepared by Steven Gordon on 23 May 2012 Y12S1L07, Steve/Courses/2012/s1/its323/lectures/datalink.tex,
A Fairness Algorithm for. Dynamic Spatial Reuse Avoiding HOL Blocking
A Fairness Algorithm for version 0.1 Dynamic Spatial Reuse Avoiding HOL Blocking Stein Gjessing Simula Research Lab. / U. Oslo Oslo, NORWAY steing@ifi.uio.no www.ifi.uio.no/~steing Non-HOL Blocking Fairness
Chapter -6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION
Chapter -6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION Chapter 6 IMPROVED CONGESTION CONTROL MECHANISM FOR REAL TIME DATA TRANSMISSION 6.1 Introduction Supporting Quality of Service