In the last couple of years, many researchers have been working on the design of future
computer networks. Some of these research activities set the goal to apply more efficient,
transparent and well managed techniques, since nowadays the existing network elements are
operated via many different network protocols, complex algorithms and not transparent,
but difficultly managed systems.
One of the directions of these researches aims is to decouple the network resource man-
agement from other functionalities of the network and to develop a simple, easy-to-manage
network architecture. In this thesis, I present the results of my development work in this
field of research. My task was to implement and test a new and uniquely designed schedul-
ing algorithm, which will be a part of the above mentioned network architecture.
In the thesis, I also present the scheduling algorithms used in current networks. I also
describe the operation of the new algorithm I implemented. The new algorithm is able to
treat packets in separate queues, for separate users and with custom treatments within the
queues. Furthermore, I present the functioning of the scheduler in detail which has been
implemented in the Linux kernel.
I also completed the validation testing of the scheduler which is illustrated with examples
in the thesis. My additional task was to implement the scheduling mechanism with a robust
and smoothly running construction of tc (Traffic Control) rules. The resulting code had to
match the functionality of the above mentioned kernel module’s functionality. In addition,
I made the kernel module successfully operational in real physical environment as well.
Finally, I summarize the current status of features, furthermore the integration of the
scheduler into the new network resource management system which was mentioned above.