1 / 32

Figure 22.24 Areas in an autonomous system

Figure 22.24 Areas in an autonomous system. Figure 22.30 Initial routing tables in path vector routing. 24-1 DATA TRAFFIC.

benny
Download Presentation

Figure 22.24 Areas in an autonomous system

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Figure 22.24 Areas in an autonomous system

  2. Figure 22.30 Initial routing tables in path vector routing

  3. 24-1 DATA TRAFFIC The main focus of congestion control and quality of service is data traffic. In congestion control we try to avoid traffic congestion. In quality of service, we try to create an appropriate environment for the traffic. So, before talking about congestion control and quality of service, we discuss the data traffic itself.

  4. Figure 24.2 Three traffic profiles

  5. 24-2 CONGESTION Congestion in a network may occur if the load on the network—the number of packets sent to the network—is greater than the capacity of the network—the number of packets a network can handle. Congestion control refers to the mechanisms and techniques to control the congestion and keep the load below the capacity.

  6. Figure 24.3 Queues in a router

  7. Figure Delay and throughput as functions of load

  8. 24-3 CONGESTION CONTROL Congestion control refers to techniques and mechanisms that can either prevent congestion, before it happens, or remove congestion, after it has happened. In general, we can divide congestion control mechanisms into two broad categories: open-loop congestion control (prevention)and closed-loop congestion control (removal). Topics discussed in this section: Open-Loop Congestion ControlClosed-Loop Congestion Control

  9. Figure 24.5 Congestion control categories

  10. Retransmission Policy • When to retransmit • Lost Frame • Lost Ack • Damaged Frame After Timer expiration timer value too small– more retransmissions timer value too large– delay in response to lost segment.

  11. Window policy • What will be maximum size of window- in case of sliding window protocol Either you implement - Go-Back N ARQ - Selective Repeat ARQ

  12. Acknowledgement Policy • Selective Ack • Cumlative Ack

  13. Discarding policy • In case of congestion • Which packet to discard • Low priority • Newer Packet • Discard the packet which is NOT nearest to destination • When to discard • Make sure , you are NOT discarding those packets which are just about to enter the destination’s network.

  14. Admission Policy • If there are insufficient resources to handle the transmission, then do not accept any more packets from sender.

  15. Solutions to Open Loop Congestion

  16. Figure 24.6 Backpressure method for alleviating congestion

  17. Figure 24.7 Choke packet

  18. Congestion leads to – discard of segments transmission delay increase Implicit- by symptom source will aware about congestion in network Explicit signal- network alerts sender to slow down the rate of transmission by sending control data Backward signaling- warning source (opposite direction to congestion) and take appropriate congestion avoidance measures Forward signaling- warning source (same direction to congestion) and take appropriate congestion avoidance measures

  19. Quality of service (QoS) • To provide good quality of service is to build a network with enough capacity for whatever traffic will be thrown at it. The name for this solution is overprovisioning. • Quality of service mechanisms let a networkwith less capacity meet application requirements just as well at a lower cost.

  20. 24-6 TECHNIQUES TO IMPROVE QoS In Section 24.5 we tried to define QoS in terms of its characteristics. In this section, we discuss some techniques that can be used to improve the quality of service. We briefly discuss four common methods: scheduling, traffic shaping, admission control, and resource reservation. Topics discussed in this section: SchedulingTraffic ShapingResource Reservation Admission Control

  21. Traffic Shaping • Traffic shaping is a technique for regulating the average rate and burstiness of a flow of data that enters the network. • The goal is to allow applications to transmit a wide variety of traffic that suits their needs, including some bursts.

  22. Traffic Policing • Traffic shaping reduces congestion and thus helps the network live up to its promise. • There is also the issue of how the provider can tell if the customer is following the agreement and what to do if the customer is not. • Packets in excess of the agreed pattern might be dropped by the network, or they might be marked as having lower priority. • Monitoring a traffic flow is called traffic policing.

  23. Scheduling : FIFO queue

  24. Scheduling : Priority queuing

  25. Scheduling : Weighted fair queuing

  26. Traffic Shaping : Leaky bucket

  27. Traffic Shaping : Leaky bucket implementation

  28. Note A leaky bucket algorithm shapes bursty traffic into fixed-rate traffic by averaging the data rate. It may drop the packets if the bucket is full.

  29. Note The token bucket allows bursty traffic at a regulated maximum rate.

  30. Figure 24.21 Token bucket

More Related