Congestion Control in Computer Networks

We initially consider the problem of protecting well-behaved users from congestion caused by ill-behaved users by allocating all users a fair share of the network bandwidth. This motivates the design and analysis of the Fair Queueing resource scheduling discipline. We then study the efficient implementation of the discipline by doing an average case performance evaluation of several data structures for packet buffering. Since a Fair Queueing server maintains logically separate per- conversation queues and approximates a bitwise-round robin server, it partially decouples the service received by incoming traffic streams. This allows us to deterministically model a single conversation in a network of Fair Queueing servers.