Finding an appropriate end-to-end congestion control scheme for each type of flow, such as
real-time or multicast flows, may be difficult. But it becomes even more complex to have …

Fair bandwidth sharing at routers has several advantages, including protection of well-
behaved flows and possible simplification of end-to-end congestion control mechanisms …

Router mechanisms designed to achieve fair bandwidth allocations, like Fair Queueing,
have many desirable properties for congestion control in the Internet. However, such …

The Internet architecture uses congestion avoidance mechanisms implemented in the
transport layer protocol like TCP to provide good service under heavy load. If network nodes …

We investigate the problem of providing a fair bandwidth allocation to each of n flows that
share the outgoing link of a congested router. The buffer at the outgoing link is a simple …

The standard end-to-end flow control implemented by the TCP protocol is ill-suited when it
comes to achieving fair bandwidth allocation among competing TCP flows. Indeed, the lack …

Most of router mechanisms proposed for fair bandwidth sharing lack either (1) simplicity due
to complexity of intricate per flow management of all connections (eg, WFQ, SFQ),(2) …

We introduce an alternative approach to congestion avoidance and control, which has the
potential to increase efficiency and fairness in multiplexed channels. Our approach, bimodal …

We propose a buffer management mechanism, called V-WFQ (virtual weighted fair
queueing), for achieving approximately fair bandwidth allocation with a small amount of …

Over the years several queuing policies have been proposed to ensure fairness between
competing requests at a service point. The fair queuing (FQ) algorithm due to Demers …