Adaptively changing weights for fair scheduling in broadcast environments

Abstract

Adaptively changing weights for fair scheduling in broadcast environments is disclosed. In one embodiment, a computer-implemented method for allocating bandwidth among a plurality of flows, such as nodes, sharing an output link, such as a network, is disclosed. The method includes adaptively determining a weight for each flow, based on a predetermined criteria, and allocating a portion of bandwidth to each flow proportionally to the weight for the flow. In one embodiment, the predetermined criteria takes into account an input rate of data packets for each flow, while in another embodiment, the predetermined criteria takes into account an queue size for each flow.

Description

FIELD OF THE INVENTION This invention relates generally to broadcast environments such as wired and wireless networks, multi-hop networks, etc., and more particularly to adaptively changing weights for fair scheduling for data transmission within such environments. BACKGROUND OF THE INVENTION Broadcast environments include environments in which information is transmitted from discrete originating points over a common medium, and include environments such as networking environments, which have become increasingly common. Networking means that two or more computers or computerized devices, referred to generically as nodes, are communicatively coupled together, so that they can exchange data, typically in the form of packets of data. Networking includes wired local-area-networks (LAN's), in which nodes are connected physically over relatively short distances, wireless LAN's, in which nodes communicate wirelessly over relatively short distances, and multi-hop networks, in which nodes ...

AI Technical Summary

Benefits of technology

The invention is about a computer-implemented method for allocating bandwidth among multiple flows sharing an output link in broadcast environments. The method uses adaptive weights for each flow based on predetermined criteria such as input rate or queue size to determine the amount of bandwidth to allocate to each flow. The bandwidth is proportional to the weight for each flow. This approach ensures fairness and efficient use of bandwidth among the flows. The invention can be applied in computer networks and can be utilized in existing protocols and algorithms for fair scheduling.

Problems solved by technology

An issue in broadcast environments, such as the ones described above, is determining which node gets to communicate at a given time.

While such randomization techniques improve the probability that, over a long period of time, every node gets an opportunity to use the channel, they generally result in poor performance when nodes have to transmit time-constrained data, such as voice and video.

Fixed-weight schemes do not provide for these situations.

Images