Fair Allocation of Link Capacity through Feedback of Bottleneck Information

In this paper we propose a bandwidth-allocation policy that is fairer and more bandwidth efficient than existing policies. The improvements are achieved through feedback of information regarding the largest bottleneck link of the downstream receivers of each flow. According to this information, the router nodes can avoid allocating more bandwidth to a flow than will be of use to at least one of its receivers. The proposed bandwidth-allocation policy, called bottleneck-feedback and receiver dependent (BFRD), is simulated with promising results