Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki Frame Relay Congestion.

Slides:



Advertisements
Similar presentations
Quality of Service CCDA Quick Reference.
Advertisements

Nick Feamster CS 4251 Computer Networking II Spring 2008
Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames (denoted as f0, f1, f2, f3, f4). Show the flow of.
Assume that a file is transferred from a node A to a node B. The file has been fragmented in 5 frames. Frame 0 is corrupted, the ACK of frame 1 is corrupted,
Chabot College Chapter 2 Review Questions Semester IIIELEC Semester III ELEC
1 CONGESTION CONTROL. 2 Congestion Control When one part of the subnet (e.g. one or more routers in an area) becomes overloaded, congestion results. Because.
EE 4272Spring, 2003 Chapter 12 Congestion in Data Networks Effect of Congestion Control  Ideal Performance  Practical Performance Congestion Control.
TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
Review: Routing algorithms Distance Vector algorithm. –What information is maintained in each router? –How to distribute the global network information?
William Stallings Data and Computer Communications 7 th Edition Chapter 13 Congestion in Data Networks.
Computer Networks24-1 Chapter 24. Congestion Control and Quality of Service 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
CONGESTION CONTROL T.Najah Al-Subaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System.
Congestion Control Reasons: - too many packets in the network and not enough buffer space S = rate at which packets are generated R = rate at which receivers.
24-1 Chapter 24. Congestion Control and Quality of Service (part 1) 23.1 Data Traffic 23.2 Congestion 23.3 Congestion Control 23.4 Two Examples.
24.1 Chapter 24 Congestion Control and Quality of Service Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
CS 408 Computer Networks Congestion Control (from Chapter 05)
1 Frame Relay u Packet switching system with low overhead u Assumes very reliable high-quality physical network u Developed for use in ISDN networks u.
Chapter 10 Congestion Control in Data Networks1 Congestion Control in Data Networks and Internets COMP5416 Chapter 10.
NETWORK LAYER. CONGESTION CONTROL In congestion control we try to avoid traffic congestion. Traffic Descriptor Traffic descriptors are qualitative values.
Introduction 1 Lecture 14 Transport Layer (Transmission Control Protocol) slides are modified from J. Kurose & K. Ross University of Nevada – Reno Computer.
Semester Copyright USM EEE449 Computer Networks Congestion En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex, UK) Room.
1 Pertemuan 25 High Speed Network Matakuliah: H0174/Jaringan Komputer Tahun: 2006 Versi: 1/0.
Autumn 2000John Kristoff1 Congestion Control Computer Networks.
Error Checking continued. Network Layers in Action Each layer in the OSI Model will add header information that pertains to that specific protocol. On.
Jennifer Rexford Princeton University MW 11:00am-12:20pm Wide-Area Traffic Management COS 597E: Software Defined Networking.
1 © 2003, Cisco Systems, Inc. All rights reserved. CCNA 4 v3.1 Module 5 Frame Relay Cisco Networking Academy.
CS 447 Networks and Data Communication
CS 447 Networks and Data Communication
CS 447 Networks and Data Communication Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki
CS 447 Networks and Data Communication
Chapter 2 (PART 1) Light-Weight Process (Threads) Department of Computer Science Southern Illinois University Edwardsville Summer, 2004 Dr. Hiroshi Fujinoki.
CS 447 Networks and Data Communication Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki
Lecture Week 3 Frame Relay Accessing the WAN. 3.1 Basic Frame Relay Concepts Accessing the WAN.
Updated 12/20011 Frame Relay Nirmala Shenoy Information Technology Department Rochester Institute of Technology.
Transmission Control Protocol
CS 447 Network & Data Communication QoS (Quality of Service) & DiffServ Introduction Department of Computer Science Southern Illinois University Edwardsville.
Bit and Framing Errors for Asynchronous Signal Transmissions Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi.
What is FRAME RELAY ? Frame Relay is a way of sending information over a WAN by dividing data into packets It operates at the Physical and Data Link layers.
Local-Area-Network (LAN) Architecture Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki
CS 447 Networks and Data Communication ARP (Address Resolution Protocol) for the Internet Department of Computer Science Southern Illinois University Edwardsville.
Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki MANET (Mobile Ad-hoc.
Contents Causes and cost of congestion Three examples How to handle congestion End-to-end Network-assisted TCP congestion control ATM ABR congestion control.
Department of Computer Science Southern Illinois University Edwardsville Spring, 2010 Dr. Hiroshi Fujinoki Tunneling & Virtual.
1 Congestion Control Computer Networks. 2 Where are we?
CSC 581 Communication Networks II Chapter 7c: Congestion Control Dr. Cheer-Sun Yang.
Distance-Vector Routing Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki
CS 447 Network & Data Communication QoS Implementation for the Internet IntServ and DiffServ Department of Computer Science Southern Illinois University.
Mr. Mark Welton.  WAN transportation method that formats data into frames and sent over a network controlled by a service provider  Frame Relay is often.
Lecture Network layer -- May Congestion control Algorithms.
Data Communication 1 Frame Relay n X.25 l Provides extensive error checking and flow control l station-to-station checking at the data link layer l Error.
Frame Relay. Why to use Frame Relay? Frame Relay is a virtual-circuit technology that provides low-level (physical and data link layer) service in response.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Unit-4 Lecture 9 Network Layer 1. Congestion Prevention Polices. To avoid congestion by using the appropriate polices at different levels. Layers DL Layer.
Congestion Control in Data Networks and Internets
Topics discussed in this section:
Congestion Control and
Computer Data Communications
Lecture 7: Data Link Layer Protocols (Part2): Frame Relay
CONGESTION CONTROL.
William Stallings Data and Computer Communications
Congestion Control in Data Networks and Internets
Other Methods of Dealing with Congestion
Congestion Control (from Chapter 05)
Figure Areas in an autonomous system
Chapter 11. Frame Relay Background Frame Relay Protocol Architecture
Congestion Control Reasons:
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Presentation transcript:

Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki Frame Relay Congestion Control CS 447 Networks and Data Communication

Frame_Relay3/002 Frame Relay as VC (Virtual Circuit) Since it is VC transmission, a path needs to be set up before transmission starts Network resources will be reserved for each path, network congestion can not happen for frame relay. Possible causes of network congestion in frame relay network  Transmitting hosts could transmit more than declared  Frame relay does allow senders to transmit more than they initially declare CS 447 Networks and Data Communication

Frame_Relay3/003 Example 1 NW application with constant transmission rate Time Transmission Rate Declared Peak Transmission Rate Unutilized link bandwidth (not much) CS 447 Networks and Data Communication

Frame_Relay3/004 Example 2 NW application with bursty transmission rate Time Transmission Rate Declared Peak Transmission Rate Unutilized link bandwidth Declared Peak Transmission Rate Unutilized link bandwidth CS 447 Networks and Data Communication

Frame_Relay3/005 Traffic Load Time 1/3 Link ( a wire) OKCongestion CS 447 Networks and Data Communication

Frame_Relay3/006 Traffic Load Throughput Traffic Load Delay A B C A B No Congestion Moderate Congestion Sever Congestion D C Knee CS 447 Networks and Data Communication

Frame_Relay3/007 Four Congestion Control Techniques  Traffic Policing (Frame Discard Control)  Congestion Avoidance (with Forward Explicit Congestion Notification - FECN)  Congestion Avoidance (with Backward Explicit Congestion Notification - BECN)  Congestion Recovery (with Implicit Congestion Notification) CS 447 Networks and Data Communication

Frame_Relay3/008 Traffic Load Throughput Traffic Load Delay A B C D A B C No Congestion Moderate Congestion Sever Congestion  Traffic Policing  FECN  BECN  Implicit CN CS 447 Networks and Data Communication

Frame_Relay3/009 Traffic Policing Sender R1R2R3 Receiver Traffic Policing Unit Data Transmission Monitor traffic rate from a sender If a sender starts transmitting more frames than declared, a decision should be made if the frames should be dropped or transferred - How much “more” should be transferred - For how long? Major Functions = to monitor traffic rate from each sender Drop frames if a sender transmits too much CS 447 Networks and Data Communication

Frame_Relay3/010 FECN Data Frame Slow-down message R1R2R3 0 1 DE Field DE Field set to 1 at a congested router At a congested router DE field is set to 1 The DE field can not be reset to 0 if once it is set to 1 When the receiver receives a frame with DE filed = 1, the receiver will sends “ slow down ” message to the sender Procedures DE = Discard Eligible A router in congestion CS 447 Networks and Data Communication

Frame_Relay3/011 BECN R1R2R3 0 0 Data Frame A congested router set DE field to 1 in an ACK message DE field can not be set to 0 again if it is once set to 1 The receiver starts slow-down when an ACK with DE filed = 1. Procedures 1 Slow-down message 1 DE Field set to 1 at a congested router A router in congestion CS 447 Networks and Data Communication

Frame_Relay3/012 Implicit CN ACK R1R2R3 Implicit Congestion Detection is Implicit Flow Control The sender detects a router congestion by detecting missing ACK from the receiver Blind time will be long, but the sender must have slowed-down since either FECD and BECD must have happened before Implicit CN On detecting missing ACK, the sender stops transmission No messaging overhead during heavy congestion Data Frame A router in congestion CS 447 Networks and Data Communication

Frame_Relay3/013 Different Motivations in the Four Congestion Control Techniques  Traffic Policing  FECN Congestion Avoidance  BECN Congestion Avoidance  Congestion Recovery To prevent network congestion (before it happens) To let the end host (receiver) make a decision for what should be done To avoid serious network congestion A congested router takes an immediate action to avoid serious network congestion With minimum extra messaging overhead To clear network traffic for recovery CS 447 Networks and Data Communication