Queuing and Congestion Avoidance Overview Trong chương này, chúng tôi giới thiệu các cơ chế xếp hàng mặc định được sử dụng trên giao diện của các tốc độ khác nhau và kiểm tra những lý do cho việc sử dụng cơ chế xếp hàng khác nhau trên các loại khác nhau của nên đặc biệt chú ý đến một thực tế rằng sự lựa chọn các phương pháp xếp hàng khác nhau như hành vi mặc định cho một giao diện dựa trên băng thông. Chương này cũng giới thiệu một số loại cơ bản của xếp hàng,. | Chapter 6 Queuing and Congestion Avoidance Overview Solutions in this chapter Using FIFO Queuing Using Priority Queuing Using Custom Queuing Using Weighted Fair Queuing Using Random Early Detection 217 218 Chapter 6 Queuing and Congestion Avoidance Overview Introduction In this chapter we introduce the default queuing mechanisms used on interfaces of various speeds and examine the reasons for using different queuing mechanisms on different types of should pay particular attention to the fact that the choice of different queuing methods as the default behavior for an interface is based on bandwidth. This chapter also introduces some basic types of queuing such as priority and custom will investigate in detail the benefits and drawbacks of these methods and thereby provide the basis for making a decision as to whether these queuing methods are appropriate for implementation on your network. This chapter also introduces the theory of random discard congestion avoidance. We discuss where this might be used where it may or may not be needed and what the benefits and drawbacks of the random discard method of congestion avoidance discussion will be continued in later chapters as some of these technologies are the foundation of other more advanced methods. Using FIFO Queuing As network traffic reaches an ingress or egress point such as a router interface network devices such as a router must be able to adequately process this traffic as it is being received. FIFO first in first out queuing is the most basic approach to ordering traffic for proper communication. Like a line at a carnival ride a FIFO queue places all packets in a single line as they enter the interface. Packets are processed by the router in the same order they enter the interface. No priority is assigned to any packet. This approach is often referred to using the leaky bucket analogy. Packets are placed in the bucket from the top and leak out of the bucket from a .
