Comparison of Different Types of Sources of Traffic Using SFQ Scheduling Discipline
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.
 S. Keshav, An Engineering Approach to Computer Networking, Fifth Ed
2002, pages 209 -263.
 Rodrigo Sierra, Fair Queuing in Data Networks, Internetworking 2002
pages 1- 6.
 Marc Greis Tutorial, http://www.isi.edu/nsnam/ns/tutorial/
 NS2 Web Site www.isi.edu/nsnam/ns
 Eitan Altman and Tania Jimenez, NS Simulator for Beginners,
December 2003, pages 33 - 38.