Stein Gjessing Simula Research Laboratory
|
|
|
- Myles Garrett
- 6 years ago
- Views:
Transcription
1 Rate Control in RPR Lessons Learned from Java Simulations Stein Gjessing Simula Research Laboratory
2 Contents Granularity of rate control Fine grained vs bursty 1. Simple version 2. Multiple (N) VOQs / choke points version when N+1 is the number of stations
3 Bursty rate control Gandalf today: OK to send if (myusage < allowusage) myusage is increased when packet sent Result, e.g.: 100 microsec intervals:
4 Fine grained rate control My new Java code: Send at all packets at allowusage / maxrate rate Result:
5 Experiment new upstream flow from time 60 to time 120 ms All the time (0 to 180 ms) When the flow from 2 starts, it will congest station 4. Station 4 sends upstream congestion notification to station 2.
6 Simulation results Sequence of packets passing station bytes packets Number of packets received per unit time (100 microsec) at stations 6 and 8 from time 60 to time 120 ms All the time
7 Packets passing station 5 bursty rate control : packet from station 2. packet from station 4
8 Packets passing station 5 with fine grained rate control : packet from station 2. packet from station 4
9 number of packets 64 Number of packets received per 100 microsec. Bursty Fine grained station 8 station 8 32 station 6 station time units (á 3 ms) time units (á 3 ms)
10 New experiment - new downstream flow All the time from time 60 to time 120 ms When the flow from 4 starts, station 4 will be congested. Station 4 sends upstream congestion notification to station 2. - Same pattern as before for packets passing by staion 5 (not shown)
11 New downstream flow station 6 station 6 station 8 station 8 Bursty rate control Fine grained rate control Fine grained rate control makes congestion discovery more precise!
12 Choke points and fine grained rate control I have implemented N VOQ s with N possible choke points and fine grained rate control (The full ring is N+1 stations) The allowed rate at each downstream link is allowusage[i] / maxrate (or maxrate[i]) No extra state needed for fine grained rate control (except whatever is needed in order to send smoothly at this rate)
13 VOQ s, Choke Points and fine grained rate control Two different implementations possible: Client notifies MAC on the shortest distance it wants to send a packet, and MAC notifies client when the rate counters have reached 0 for all stations up to the chosen destination station (implementation easier than it sounds because needs to keep track of the link with the minimum rate only) or MAC notifies clients whenever this station is allowed to send a packet to a new destination further downstream. Several notifications may then be sent to the Client with increasing distance to receiver.
14 New experiment Three flows (500 byte packets) 2 to 8 sends all the time 3 to 7 sends from time 60 to 240 ms. 4 to 6 sends from time 120 to 180 ms. Station 2 will experience an increase in number of choke points and their rate However in this example VOQ s are not used (only choke points)
15 from time 60 to time 240 ms New experiment three flows All the time from time 120 to time 180 ms
16 Packet passings station 5 Fine grained rate control does not give bursts. from 2 : from 3 from Gbit/s One time unit is three ns.
17 Packets received 70 Number os packets per 100 ms from 2 to 8 from 3 to 7 from 4 to Time units (á 3 micosec)
18 Conclusion Fine grained rate control is easy to implement Also together with choke points and VOQs Rate is allowedusage[i] / maxrate A packet has to obey the rates of all links it passes Fine grained rate control makes congestion detection more precise Thesis: Fine grained rate control smooths Internet traffic and decreases buffer needs.
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
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
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
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
A Fairness Algorithm for High-speed Networks based on a Resilient Packet Ring Architecture
A Fairness Algorithm for High-speed Networks based on a Resilient Packet Ring Architecture Stein Gjessing and Arne Maus Simula Research Laboratory and Department of Informatics University of Oslo, POB
A Fairness Algorithm for High-speed Networks based on a Resilient Packet Ring Architecture
Submitted to Workshop on Communication Architecture for Clusters CAC 2 A Fairness Algorithm for High-speed Networks based on a Resilient Packet Ring Architecture Stein Gjessing Simula Research Laboratory
Performance Analysis of Darwin: Transient State
Performance Analysis of Darwin: Transient State Mark Joseph Francisco Changcheng Huang Advanced Optical Networks Laboratory Carleton University May 6, 2002 May 6, 2002 802-17-01, mjf_darprf_02 Changcheng
Big Buffer of Switch
Big Buffer of Switch Content 1 2 3 Why Do We Need Big Buffer Arch of Switch Buffer How to Test Buffer 1 Why Do We Need Big Buffer When audience watch movies on the Internet, they are faced with the fact
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
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
Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking
Wireless Challenges 15-441: Computer Networking Lecture 25: Wireless Networking Force us to rethink many assumptions Need to share airwaves rather than wire Don t know what hosts are involved Host may
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
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
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
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
Secondary Address Support
Secondary Address Support Peter Jones July 21, 2003 7/21/2003 3:19 PM pj_sec_addr_02.ppt 1 Secondary Addresses Allows for more efficient support of protocols like RFC 2338 Virtual Router Redundancy Protocol.
High-resolution Measurement of Data Center Microbursts
High-resolution Measurement of Data Center Microbursts Qiao Zhang (University of Washington) Vincent Liu (University of Pennsylvania) Hongyi Zeng (Facebook) Arvind Krishnamurthy (University of Washington)
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
Advanced Computer Networks. Flow Control
Advanced Computer Networks 263 3501 00 Flow Control Patrick Stuedi Spring Semester 2017 1 Oriana Riva, Department of Computer Science ETH Zürich Last week TCP in Datacenters Avoid incast problem - Reduce
Frame Relay Network Performance
Lab 4 Frame Relay Network Performance Overview Frame Relay is a connection-oriented, unreliable technology based on virtual circuits. A virtual circuit must be set up between a source and destination before
Outline EEC-682/782 Computer Networks I. Midterm 1 Statistics. Midterm 1 Statistics. High 99, Low 34, Average 66
Outline EEC-682/782 Computer Networks I Lecture 12 Wenbing Zhao w.zhao1@csuohio.edu http://academic.csuohio.edu/zhao_w/teaching/eec682.htm (Lecture nodes are based on materials supplied by Dr. Louise Moser
CRC. Implementation. Error control. Software schemes. Packet errors. Types of packet errors
CRC Implementation Error control An Engineering Approach to Computer Networking Detects all single bit errors almost all 2-bit errors any odd number of errors all bursts up to M, where generator length
Improvement of Resilient Packet Ring Fairness February 2005 Revised August 2005
Improvement of Resilient Packet Ring Fairness February 5 Revised August 5 Fredrik Davik Simula Research Laboratory University of Oslo Ericsson Research Norway Email: bjornfd@simula.no Stein Gjessing Simula
AODV-PA: AODV with Path Accumulation
-PA: with Path Accumulation Sumit Gwalani Elizabeth M. Belding-Royer Department of Computer Science University of California, Santa Barbara fsumitg, ebeldingg@cs.ucsb.edu Charles E. Perkins Communications
Advanced Computer Networks. Flow Control
Advanced Computer Networks 263 3501 00 Flow Control Patrick Stuedi, Qin Yin, Timothy Roscoe Spring Semester 2015 Oriana Riva, Department of Computer Science ETH Zürich 1 Today Flow Control Store-and-forward,
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
High Performance Fair Bandwidth Allocation for Resilient Packet Rings
In Proceedings of the 5th ITC Specialist Seminar on Traffic Engineering and Traffic Management High Performance Fair Bandwidth Allocation for Resilient Packet Rings V. Gambiroza, Y. Liu, P. Yuan, and E.
Configuring sflow. Information About sflow. sflow Agent. This chapter contains the following sections:
This chapter contains the following sections: Information About sflow, page 1 Licensing Requirements, page 2 Prerequisites, page 2 Guidelines and Limitations for sflow, page 2 Default Settings for sflow,
Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.
Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management
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
Chapter 6 Congestion Avoidance. Networking CS 3470, Section 1
Chapter 6 Congestion Avoidance Networking CS 3470, Section 1 Congestion Avoidance TCP s strategy control congestion once it happens repeatedly increase load in an effort to find the point at which congestion
Congestion Avoidance
COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Congestion Avoidance Jasleen Kaur Fall 2016 1 Avoiding Congestion: Strategies TCP s strategy: congestion control Ø Control congestion once it occurs Repeatedly
Arvind Krishnamurthy Fall 2003
Ad-hoc Routing Arvind Krishnamurthy Fall 2003 Ad Hoc Routing Create multi-hop connectivity among set of wireless, possibly moving, nodes Mobile, wireless hosts act as forwarding nodes as well as end systems
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
Resilient Packet Rings with Heterogeneous Links
Resilient Packet Rings with Heterogeneous Links Mete Yilmaz Edge Routing Business Unit Cisco CA 95134, USA myilmaz@cisco.com Nirwan Ansari Department of Electrical and Computer Engineering New Jersey Institute
Lecture: Interconnection Networks. Topics: TM wrap-up, routing, deadlock, flow control, virtual channels
Lecture: Interconnection Networks Topics: TM wrap-up, routing, deadlock, flow control, virtual channels 1 TM wrap-up Eager versioning: create a log of old values Handling problematic situations with a
Network Working Group Request for Comments: August 2000
Network Working Group Request for Comments: 2892 Category: Informational D. Tsiang G. Suwala Cisco Systems August 2000 The Cisco SRP MAC Layer Protocol Status of this Memo This memo provides information
TCP Congestion Control
TCP Congestion Control What is Congestion The number of packets transmitted on the network is greater than the capacity of the network Causes router buffers (finite size) to fill up packets start getting
TCP Congestion Control
What is Congestion TCP Congestion Control The number of packets transmitted on the network is greater than the capacity of the network Causes router buffers (finite size) to fill up packets start getting
Improvement of Resilient Packet Ring Fairness
Improvement of Resilient Packet Ring Fairness Fredrik Davik Simula Research Laboratory University of Oslo Ericsson Research Norway Email: bjornfd@simula.no Amund Kvalbein Simula Research Laboratory Email:
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
Chapter 7 CONCLUSION
97 Chapter 7 CONCLUSION 7.1. Introduction A Mobile Ad-hoc Network (MANET) could be considered as network of mobile nodes which communicate with each other without any fixed infrastructure. The nodes in
Configuring Advanced Radio Settings on the WAP371
Article ID: 5069 Configuring Advanced Radio Settings on the WAP371 Objective Radio settings are used to configure the wireless radio antenna and its properties on the wireless access point (WAP) device
Lecture Outline. Bag of Tricks
Lecture Outline TELE302 Network Design Lecture 3 - Quality of Service Design 1 Jeremiah Deng Information Science / Telecommunications Programme University of Otago July 15, 2013 2 Jeremiah Deng (Information
Switching and Routing projects description
Switching and Routing 2012-2013 projects description Outline Introduction to OpenFlow A case study The projects Additional information What s OpenFlow An open standard, which defines: An abstraction of
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
CS 5114 Network Programming Languages Data Plane. Nate Foster Cornell University Spring 2013
CS 5114 Network Programming Languages Data Plane http://www.flickr.com/photos/rofi/2097239111/ Nate Foster Cornell University Spring 2013 Based on lecture notes by Jennifer Rexford and Michael Freedman
Congestion Notification in Pre-defined Network Domains
Congestion Notification in Pre-defined Network Domains Mehmet Toy, Ph.D February, 2014 Problem Statement Ethernet is the dominant technology for access networks and becoming an alternative technology for
Congestion. Can t sustain input rate > output rate Issues: - Avoid congestion - Control congestion - Prioritize who gets limited resources
Congestion Source 1 Source 2 10-Mbps Ethernet 100-Mbps FDDI Router 1.5-Mbps T1 link Destination Can t sustain input rate > output rate Issues: - Avoid congestion - Control congestion - Prioritize who gets
Ethernet Switch ZyNOS 4.0
RMON Ethernet Switch ZyNOS 4.0 Support Notes Version 4.00 July 2011 Overview Remote Monitoring (RMON) is a standard monitoring specification that enables various network monitors and console systems to
Chapter 6 Connecting Device
Computer Networks Al-Mustansiryah University Elec. Eng. Department College of Engineering Fourth Year Class Chapter 6 Connecting Device 6.1 Functions of network devices Separating (connecting) networks
Analyzing the Receiver Window Modification Scheme of TCP Queues
Analyzing the Receiver Window Modification Scheme of TCP Queues Visvasuresh Victor Govindaswamy University of Texas at Arlington Texas, USA victor@uta.edu Gergely Záruba University of Texas at Arlington
(Refer Slide Time: 2:20)
Data Communications Prof. A. Pal Department of Computer Science & Engineering Indian Institute of Technology, Kharagpur Lecture -23 X.25 and Frame Relay Hello and welcome to today s lecture on X.25 and
3. Evaluation of Selected Tree and Mesh based Routing Protocols
33 3. Evaluation of Selected Tree and Mesh based Routing Protocols 3.1 Introduction Construction of best possible multicast trees and maintaining the group connections in sequence is challenging even in
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
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
Implementation of a leaky bucket module for simulations in NS-3
Implementation of a leaky bucket module for simulations in NS-3 P. Baltzis 2, C. Bouras 1,2, K. Stamos 1,2,3, G. Zaoudis 1,2 1 Computer Technology Institute and Press Diophantus Patra, Greece 2 Computer
IEEE Resilient Packet Ring Tutorial
ETHERNET TRANSPORT OVER WIDE AREA NETWORKS IEEE 802.17 Resilient Packet Ring Tutorial Fredrik Davik, Simula Research Laboratory and Ericsson Research Mete Yilmaz, Cisco Systems Stein Gjessing, Simula Research
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
TCP Window Estimation for Burst Assembly in OBS Networks
TCP Window Estimation for Burst Assembly in OBS Networks Maurizio Casoni (maurizio.casoni@unimore.it) Department of Information Engineering University of Modena and Reggio Emilia Italy Outline Introduction:
QCN: Quantized Congestion Notification. Rong Pan, Balaji Prabhakar, Ashvin Laxmikantha
QCN: Quantized Congestion Notification Rong Pan, Balaji Prabhakar, Ashvin Laxmikantha Overview Description the QCN scheme Pseudocode available with Rong Pan: ropan@cisco.com Basic simulations Infinitely
Lab Test Report DR100401D. Cisco Nexus 5010 and Arista 7124S
Lab Test Report DR100401D Cisco Nexus 5010 and Arista 7124S 1 April 2010 Miercom www.miercom.com Contents Executive Summary... 3 Overview...4 Key Findings... 5 How We Did It... 7 Figure 1: Traffic Generator...
The benefits Arista s LANZ functionality will provide to network administrators: Real time visibility of congestion hotspots at the microbursts level
Arista LANZ Overview Overview Arista Networks Latency Analyzer (LANZ) represents the next step in the revolution in delivering real-time network performance and congestion monitoring. For the first time,
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
Chapter 12: Multiprocessor Architectures. Lesson 12: Message passing Systems and Comparison of Message Passing and Sharing
Chapter 12: Multiprocessor Architectures Lesson 12: Message passing Systems and Comparison of Message Passing and Sharing Objective Understand the message routing schemes and the difference between shared-memory
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. Broch et al Presented by Brian Card
A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols Broch et al Presented by Brian Card 1 Outline Introduction NS enhancements Protocols: DSDV TORA DRS AODV Evaluation Conclusions
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
SIMULATING CDPD NETWORKS USING OPNET
Michael Jiang Stephen Hardy Ljiljana Trajkovic SIMULATING CDPD NETWORKS USING OPNET TM Communication Networks Laboratory School of Engineering Science Simon Fraser University Road Map Introduction Simulation
More on LANS. LAN Wiring, Interface
More on LANS Chapters 10-11 LAN Wiring, Interface Mostly covered this material already NIC = Network Interface Card Separate processor, buffers incoming/outgoing data CPU might not be able to keep up network
Making TCP more Robust against Packet Reordering
Making TCP more Robust against Packet Reordering Alexander Zimmermann Lennart Schulte TCPM, IETF-9, Honolulu, HI, USA November, 24 TCPM s feedback
Local Addresses and SAS
Local Addresses and SAS Robert Castellano 10/25/04 rc_saslocal_01 Page 1 Local Addresses What kinds of local address considerations needs to be handled by SAS? Whether or not an RPR station is SAS capable
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
Goals. Fundamentals of Network Media. More topics. Topics. Multiple access communication. Multiple access solutions
Fundamentals of Network Media Local Area Networks Ursula Holmström Goals Learn the basic concepts related to LAN technologies, for example use of shared media medium access control topologies Know the
MPLS Multi-Protocol Label Switching
MPLS Multi-Protocol Label Switching Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Computer Networks Design and Management - 1 MPLS: introduction
Performance of DSDV Protocol over Sensor Networks
Performance of DSDV Protocol over Sensor Networks Khushboo Tripathi, Tulika Agarwal and S. D. Dixit Department of Electronics and Communications University of Allahabad, Allahabad-211002, India Khushboo83@live.com
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
Network Interface Architecture and Prototyping for Chip and Cluster Multiprocessors
University of Crete School of Sciences & Engineering Computer Science Department Master Thesis by Michael Papamichael Network Interface Architecture and Prototyping for Chip and Cluster Multiprocessors
Requirement Discussion of Flow-Based Flow Control(FFC)
Requirement Discussion of Flow-Based Flow Control(FFC) Nongda Hu Yolanda Yu hunongda@huawei.com yolanda.yu@huawei.com IEEE 802.1 DCB, Stuttgart, May 2017 www.huawei.com new-dcb-yolanda-ffc-proposal-0517-v01
Congestion in Data Networks. Congestion in Data Networks
Congestion in Data Networks CS420/520 Axel Krings 1 Congestion in Data Networks What is Congestion? Congestion occurs when the number of packets being transmitted through the network approaches the packet
Flow-start: Faster and Less Overshoot with Paced Chirping
Flow-start: Faster and Less Overshoot with Paced Chirping Joakim Misund, Simula and Uni Oslo Bob Briscoe, Independent IRTF ICCRG, Jul 2018 The Slow-Start
IEEE CMSG July 12, 2004
IEEE 802.3 Flow Control Baseline Requirements IEEE 802.3 CMSG July 12, 2004 Siamack Ayandeh Independent Siamack@ieee.org Khaled Amer Amernet, Inc. Amer@amernet.net Ground rules This is not a debate about
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,
Ethernet Overhead Accounting
The feature enables the router to account for downstream Ethernet frame headers when applying shaping to packets. Finding Feature Information, page 1 Restrictions for, page 1 Information About, page 2
Networking Technologies and Applications
Networking Technologies and Applications Rolland Vida BME TMIT September 23, 2016 Aloha Advantages: Different size packets No need for synchronization Simple operation If low upstream traffic, the solution
2 Network Basics. types of communication service. how communication services are implemented. network performance measures. switching.
2 Network Basics types of communication service how communication services are implemented switching multiplexing network performance measures 1 2.1 Types of service in a layered network architecture connection-oriented:
Components of a complete RPR proposal
OAM in RPR Italo Busi, Alcatel Frederic Thepot, Dynarc Constantinos Bassias, Lantern Jason Fan, Luminous Henry Hsiaw, NEC Wai-Chau Hui, Nortel Robin Olsson, Vitesse Components of a complete RPR proposal
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
Multimedia-Systems. Operating Systems. Prof. Dr.-Ing. Ralf Steinmetz Prof. Dr. rer. nat. Max Mühlhäuser Prof. Dr.-Ing. Wolfgang Effelsberg
Multimedia-Systems Operating Systems Prof. Dr.-Ing. Ralf Steinmetz Prof. Dr. rer. nat. Max Mühlhäuser Prof. Dr.-Ing. Wolfgang Effelsberg WE: University of Mannheim, Dept. of Computer Science Praktische
Revision of Previous Lectures
Lecture 15 Overview Last Lecture Local area networking This Lecture Wide area networking 1 Source: chapters 8.1-8.3, 17.1, 18.1, 18.2 Next Lecture Wide area networking 2 Source: Chapter 20 COSC244 Lecture
Distributed Queue Dual Bus
Distributed Queue Dual Bus IEEE 802.3 to 802.5 protocols are only suited for small LANs. They cannot be used for very large but non-wide area networks. IEEE 802.6 DQDB is designed for MANs It can cover
Ring in the new for WDM resilient packet ring
THE NEW HIGH-PERFORMANCE standard IEEE 802.17 for the resilient packet ring (RPR) aims to combine the appealing functionalities from synchronous optical network/synchronous digital hierarchy (SONET/SDH)
RMAP Protocol. SpaceWire Working Group 11 th November 2004
RMAP Protocol SpaceWire Working Group 11 th November 2004 RMAP Protocol Work done at last SpaceWire Working Group meeting Rick Schnurr Dan Gilley Masaharu Nomachi Pierre Fabry Steve Parkes Aim Provide
Delayed reservation decision in optical burst switching networks with optical buffers
Delayed reservation decision in optical burst switching networks with optical buffers G.M. Li *, Victor O.K. Li + *School of Information Engineering SHANDONG University at WEIHAI, China + Department of
Lecture 10: Cache Coherence: Part I. Parallel Computer Architecture and Programming CMU /15-618, Spring 2015
Lecture 10: Cache Coherence: Part I Parallel Computer Architecture and Programming CMU 15-418/15-618, Spring 2015 Tunes Marble House The Knife (Silent Shout) Before starting The Knife, we were working
SYSC 5801 Protection and Restoration
SYSC 5801 Protection and Restoration Introduction Fact: Networks fail. Types of failures: Link failures Node failures Results: packet losses, waste of resources, and higher delay. What IGP does in the
AT&T Collaborate TM. Network Assessment Tool
AT&T Collaborate TM Network Assessment Tool 2016 AT&T Intellectual Property. All rights reserved. AT&T, Globe logo, Mobilizing Your World and DIRECTV are registered trademarks and service marks of AT&T
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,
Mobile Transport Layer Lesson 10 Timeout Freezing, Selective Retransmission, Transaction Oriented TCP and Explicit Notification Methods
Mobile Transport Layer Lesson 10 Timeout Freezing, Selective Retransmission, Transaction Oriented TCP and Explicit Notification Methods 1 Timeout freezing of transmission (TFT) Used in situations where
Multicomputer distributed system LECTURE 8
Multicomputer distributed system LECTURE 8 DR. SAMMAN H. AMEEN 1 Wide area network (WAN); A WAN connects a large number of computers that are spread over large geographic distances. It can span sites in
QoS Services with Dynamic Packet State
QoS Services with Dynamic Packet State Ion Stoica Carnegie Mellon University (joint work with Hui Zhang and Scott Shenker) Today s Internet Service: best-effort datagram delivery Architecture: stateless