Unit-4 Lecture 9 Network Layer 1. Congestion Prevention Polices. To avoid congestion by using the appropriate polices at different levels. Layers DL Layer.

Slides:



Advertisements
Similar presentations
Network layer -- May Network layer Computer Networks.
Advertisements

TELE202 Lecture 8 Congestion control 1 Lecturer Dr Z. Huang Overview ¥Last Lecture »X.25 »Source: chapter 10 ¥This Lecture »Congestion control »Source:
Chi-Cheng Lin, Winona State University CS 313 Introduction to Computer Networking & Telecommunication Chapter 5 Network Layer.
Congestion Control Algorithms
The Network Layer Functions: Congestion Control
Review: Routing algorithms Distance Vector algorithm. –What information is maintained in each router? –How to distribute the global network information?
Congestion Control Tanenbaum 5.3 Tanenbaum 6.5. Congestion Control Network Layer – Congestion control point to point Transport Layer – Congestion control.
Congestion Control Algorithms
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.
IS333, Ch. 26: TCP Victor Norman Calvin College 1.
Congestion Control Created by M Bateman, A Ruddle & C Allison As part of the TCP View project.
CS 408 Computer Networks Congestion Control (from Chapter 05)
UNIT-IV Computer Network Network Layer. Network Layer Prepared by - ROHIT KOSHTA In the seven-layer OSI model of computer networking, the network layer.
NETWORK LAYER. CONGESTION CONTROL In congestion control we try to avoid traffic congestion. Traffic Descriptor Traffic descriptors are qualitative values.
School of Information Technologies TCP Congestion Control NETS3303/3603 Week 9.
EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
Congestion Control Tanenbaum 5.3, /12/2015Congestion Control (A Loss Based Technique: TCP)2 What? Why? Congestion occurs when –there is no reservation.
EEC-484/584 Computer Networks Lecture 12 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
CSEE W4140 Networking Laboratory Lecture 7: TCP flow control and congestion control Jong Yul Kim
EEC-484/584 Computer Networks Lecture 14 Wenbing Zhao (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer.
CSEE W4140 Networking Laboratory Lecture 7: TCP congestion control Jong Yul Kim
TCP/IP Lecture Extra. TCP/IP Developed by DARPA (Defense Advanced Research Projects) TCP is a connection-oriented transport protocol that sends data as.
CMPE 257 Spring CMPE 257: Wireless and Mobile Networking Spring 2005 E2E Protocols (point-to-point)
L13: Sharing in network systems Dina Katabi Spring Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 14 Introduction to Networks and the Internet.
Data Transfer Case Study: TCP  Go-back N ARQ  32-bit sequence # indicates byte number in stream  transfers a byte stream, not fixed size user blocks.
1 Lecture 14 High-speed TCP connections Wraparound Keeping the pipeline full Estimating RTT Fairness of TCP congestion control Internet resource allocation.
TCP Trunking: Design, Implementation and Performance H.T. Kung and S. Y. Wang.
1 Congestion Control Computer Networks. 2 Where are we?
Department of Computer Science Southern Illinois University Edwardsville Fall, 2013 Dr. Hiroshi Fujinoki Frame Relay Congestion.
Chapter 24 Transport Control Protocol (TCP) Layer 4 protocol Responsible for reliable end-to-end transmission Provides illusion of reliable network to.
What is TCP? Connection-oriented reliable transfer Stream paradigm
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
TCP: Transmission Control Protocol Part II : Protocol Mechanisms Computer Network System Sirak Kaewjamnong Semester 1st, 2004.
CS640: Introduction to Computer Networks Aditya Akella Lecture 15 TCP – III Reliability and Implementation Issues.
Transport Layer3-1 Chapter 3 outline r 3.1 Transport-layer services r 3.2 Multiplexing and demultiplexing r 3.3 Connectionless transport: UDP r 3.4 Principles.
1 Lecture, November 27, 2002 TCP Other Internet Protocols; Internet Traffic Scalability of Virtual Circuit Networks QoS.
Unit III Bandwidth Utilization: Multiplexing and Spectrum Spreading In practical life the bandwidth available of links is limited. The proper utilization.
Lecture Network layer -- May Congestion control Algorithms.
The Internet Book. Chapter 16 3 A Packet Switching System Can Be Overrun Packet switching allows multiple computers to communicate without delay. –Requires.
TCP Congestion Control 컴퓨터공학과 인공지능 연구실 서 영우. TCP congestion control2 Contents 1. Introduction 2. Slow-start 3. Congestion avoidance 4. Fast retransmit.
Data Transfer Case Study: TCP  Go-back N ARQ  32-bit sequence # indicates byte number in stream  transfers a byte stream, not fixed size user blocks.
 First: Data Link Layer  1. Retransmission Policy: It deals with how fast a sender times out and what it transmit upon timeout. A jumpy sender that times.
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Congestion Control 0.
1 Lecture 15 Internet resource allocation and QoS Resource Reservation Protocol Integrated Services Differentiated Services.
Transmission Control Protocol (TCP) TCP Flow Control and Congestion Control CS 60008: Internet Architecture and Protocols Department of CSE, IIT Kharagpur.
Chapter 10 Congestion Control in Data Networks and Internets 1 Chapter 10 Congestion Control in Data Networks and Internets.
Transport Layer3-1 Chapter 3 Transport Layer Computer Networking: A Top Down Approach Featuring the Internet, 4th edition. Jim Kurose, Keith Ross Chapter.
1 Flow & Congestion Control Some slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina Katabi.
Protocols and layering Network protocols and software Layered protocol suites The OSI 7 layer model Common network design issues and solutions.
Topics discussed in this section:
The Transport Layer (TCP)
COMP 431 Internet Services & Protocols
Congestion Control Evaluation in Dynamic Network
William Stallings Data and Computer Communications
Congestion Control (from Chapter 05)
PRESENTATION COMPUTER NETWORKS
CS640: Introduction to Computer Networks
Congestion Control (from Chapter 05)
Figure Areas in an autonomous system
Congestion Control (from Chapter 05)
CS4470 Computer Networking Protocols
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control (from Chapter 05)
Congestion Control.
Presentation transcript:

Unit-4 Lecture 9 Network Layer 1

Congestion Prevention Polices. To avoid congestion by using the appropriate polices at different levels. Layers DL Layer TCP Layer 1.Retransmission 2.Acknowledgement 3.Flow Control 4.Out of order caching N/W Layer 1.VC Vs Datagram 2.Packet Queuing 3.Packet Discarding 4.Routing Algorithm 5.Packet Lifetime Management 1.Retransmission 2.Acknowledgement 3.Flow Control 4.Out of order caching 5.Time out Determination. 2

First: Data Link Layer 1 Retransmission Policy: It deals with how fast a sender times out and what it transmit upon timeout. A jumpy sender that times out quickly and retransmits all outstanding packets using go-back N will put heavier load on the system than the sender uses selective repeat. 2. Out-of-Order Caching Policy: If the receivers routinely discard all out-of-order packets, these packets will have to be transmitted again later, creating extra load. Congestion Prevention Policies- continued 3 CSE SIRTE CS-604(CN) Lecture Notes of Unit -4

3 Acknowledgement Policy: If each packet is acknowledged immediately, the acknowledgement packets generate extra load. However, if acknowledgments are saved up to piggyback onto reserve traffic, extra timeouts and retransmissions may result. 4 Flow Control Policy: A tight control scheme reduces the data rate and thus helps fight congestion. Congestion Prevention Policies- continued 4

Second The Network Layer 1. Virtual Circuit versus Datagram. 2. Packet Queuing and Service Policy: Router may have one queue per input line, one queue per output line, or both. It also relates to the order packets are processed. 3. Packet Discard Policy: It tells which packet is dropped when there is no place. Congestion Prevention Policies- continued 5

4. Routing Policy: Good routing algorithm spreads the traffic over all the lines. 5. Packet Lifetime Management: It deals with how long a packet may live before being discarded. If it is too long, lost packets waste the network’s bandwidth. If it is too short, packets may be discarded before reaching their destination. Congestion Prevention Policies- continued 6

Third: The Transport Layer 1. Retransmission Policy 2. Out-of-Order Caching Policy 3. Acknowledgement Policy 4. Flow Control Policy 5. Timeout Determination: - Determining the timeout interval is harder because the transit time across the network is less predictable than the transit over a write between two routers - If it is too short, extra packets will be sent unnecessary. - If it is too long, congestion will be reduced, but the response time will suffer whenever packet is lost. Congestion Prevention Policies- continued 7

First: Data Link Layer 1. Retransmission Policy: It deals with how fast a sender times out and what it transmit upon timeout. A jumpy sender that times out quickly and retransmits all outstanding packets using go-back N will put heavier load on the system than the sender uses selective repeat. 2. Out-of-Order Caching Policy: If the receivers routinely discard all out-of-order packets, these packets will have to be transmitted again later, creating extra load. Congestion Prevention Policies- continued 8

3. Acknowledgement Policy: If each packet is acknowledged immediately, the acknowledgement packets generate extra load. However, if acknowledgments are saved up to piggyback onto reserve traffic, extra timeouts and retransmissions may result. 4. Flow Control Policy: A tight control scheme reduces the data rate and thus helps fight congestion. Congestion Prevention Policies- continued 9

Second: The Network Layer 1. Virtual Circuit versus Datagram. 2. Packet Queuing and Service Policy: Router may have one queue per input line, one queue per output line, or both. It also relates to the order packets are processed. 3. Packet Discard Policy: It tells which packet is dropped when there is no place. Congestion Prevention Policies- continued 10

4. Routing Policy: Good routing algorithm spreads the traffic over all the lines. 5. Packet Lifetime Management: It deals with how long a packet may live before being discarded. If it is too long, lost packets waste the network’s bandwidth. If it is too short, packets may be discarded before reaching their destination. Congestion Prevention Policies- continued 11

Third: The Transport Layer 1. Retransmission Policy. 2. Put-of-Order Caching Policy. 3. Acknowledgement Policy. 4. Flow Control Policy. 5. Timeout Determination: - Determining the timeout interval is harder because the transit time across the network is less predictable than the transit over a write between two routers - If it is too short, extra packets will be sent unnecessary. - If it is too long, congestion will be reduced, but the response time will suffer whenever packet is lost. Congestion Prevention Policies- continued 12