Abstract: In this paper, SFQ (Start Time Fair Queuing)
algorithm is analyzed when this is applied in computer networks to
know what kind of behavior the traffic in the net has when different
data sources are managed by the scheduler. Using the NS2 software
the computer networks were simulated to be able to get the graphs
showing the performance of the scheduler. Different traffic sources
were introduced in the scripts, trying to establish the real scenario.
Finally the results were that depending on the data source, the traffic
can be affected in different levels, when Constant Bite Rate is
applied, the scheduler ensures a constant level of data sent and
received, but the truth is that in the real life it is impossible to ensure
a level that resists the changes in work load.
Abstract: Packet switched data network like Internet, which has
traditionally supported throughput sensitive applications such as email
and file transfer, is increasingly supporting delay-sensitive
multimedia applications such as interactive video. These delaysensitive
applications would often rather sacrifice some throughput
for better delay. Unfortunately, the current packet switched network
does not offer choices, but instead provides monolithic best-effort
service to all applications. This paper evaluates Class Based Queuing
(CBQ), Coordinated Earliest Deadline First (CEDF), Weighted
Switch Deficit Round Robin (WSDRR) and RED-Boston scheduling
schemes that is sensitive to delay bound expectations for variety of
real time applications and an enhancement of WSDRR is proposed.
Abstract: In this research, we propose a weighted class based
queuing (WCBQ) mechanism to provide class differentiation and to
reduce the load for the IMS (IP Multimedia Subsystem) presence
server (PS). The tasks of admission controller for the PS are
demonstrated. Analysis and simulation models are developed to
quantify the performance of WCBQ scheme. An optimized dropping
time frame has been developed based on which some of the preexisting
messages are dropped from the PS-buffer. Cost functions are
developed and simulation comparison has been performed with FCFS
(First Come First Served) scheme. The results show that the PS
benefits significantly from the proposed queuing and dropping
algorithm (WCBQ) during heavy traffic.