支援QOS路由器的封包排程與服務分流之設計與實作
Other Title
Design and Implementation of Packet Scheduler and Service Classifier for QoS Router
Date Issued
1999
Date
1999
Author(s)
DOI
882219E002008
Abstract
As the Internet continues to grow in
terms of the amount of traffic and the
number of users, there are currently a lot
of interests in providing multimedia
communication services. Many of these
new applications rely on the ability of the
networks to provide QoS guarantees
typically in the form of bounded end-to-end
delay, bandwidth and delay jitter.
In this paper, we propose a new
scheduling algorithm called Maximum
Jitter First (MJF) algorithm. It is a frame-based
weighted-fair queueing algorithm.
Different from WFQ and WF 2 Q, the
algorithm uses delay jitter to describe the
timestamps of the packets and to assign
service order between flows within a
frame. Slots assigned to a flow are spaced
out within the frame so to minimize the
Worse-case Fair Index and to achieve
minimal delay jitter for packets of a flow.
It as well possesses the bounded-delay and
fairness properties. Furthermore, in MJF,
the service order is calculated only upon
call arrival and departure. It therefore has
O(1) computational cost.
In order to allow various classifier
and scheduling policies to be examined
and evaluated, a QoS router is prototyped.
Currently, two scheduling algorithms:
priority queueing and WFQ and a simple
classifier based on “per-flow queueing”
and the “Type of Service” field, have been
implemented. We also conducted a
number of experiments to evaluate the performance of the prototype in QoS
provisioning.
Subjects
QoS
Scheduling
Frame-based Queueing, Delay Jitter
packet scheduler
packet classifier
Publisher
臺北市：國立臺灣大學資訊管理學系暨研究所
Type
other
File(s)![Thumbnail Image]()
Loading...
Name
882219E002008.pdf
Size
101.67 KB
Format
Adobe PDF
Checksum
(MD5):36e8568c791a553259318acf64b603be