文件名称:Analysis-of-the-algorithms-for-congestion
-
所属分类:
- 标签属性:
- 上传时间:2015-03-31
-
文件大小:792.68kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
This paper presents one of the features of DS
(Differentiated Services) architecture, namely the queuing or
congestion management. Packets can be placed into separate
buffer queues, on the basis of the DS value. Several forwarding
policies can be used to favor high priority packets in different
ways. The major reason for queuing is that the router must hold
the packet in its memory while the outgoing interface is busy with
sending another packet. Our main goal is to compare the
performance of the following queuing mechanisms: FIFO (First-
In First-Out), CQ (Custom Queuing), PQ (Priority Queuing),
WFQ (Weighted Fair Queuing), CBWFQ (Class Based Weighted
Fair Queuing) and LLQ (Low Latency Queuing).
(Differentiated Services) architecture, namely the queuing or
congestion management. Packets can be placed into separate
buffer queues, on the basis of the DS value. Several forwarding
policies can be used to favor high priority packets in different
ways. The major reason for queuing is that the router must hold
the packet in its memory while the outgoing interface is busy with
sending another packet. Our main goal is to compare the
performance of the following queuing mechanisms: FIFO (First-
In First-Out), CQ (Custom Queuing), PQ (Priority Queuing),
WFQ (Weighted Fair Queuing), CBWFQ (Class Based Weighted
Fair Queuing) and LLQ (Low Latency Queuing).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Analysis of the algorithms for congestion.pdf
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
