Communication scheduling of network nodes using fair access and weighting techniques
First Claim
1. A method to schedule network communications in a network having nodes connected by links comprising:
- sending a bandwidth value of a first node for each link connected to the first node to neighbors of the first node, the bandwidth value associated with a number of packets in one or more outbound queues of the first node;
receiving bandwidth values from the neighbors of the first node;
determining a node weight value of the first node based on a ratio of the bandwidth value of the first node to the bandwidth values from the neighbors of the first node;
sending the node weight value of the first node to the neighbors of the first node;
receiving node weight values from the neighbors of the first node;
determining access values for each node based on a fair access technique; and
determining a network scheduling for one or more of the first node and the neighbors of the first node based on the access values biased according to the node weight value of the first node and the node weight values from the neighbors of the first node.
3 Assignments
0 Petitions
Accused Products
Abstract
In one aspect, a method to schedule network communications in a network having nodes connected by links includes sending a bandwidth value of a first node for each link connected to the first node to neighbors of the first node, receiving bandwidth values from the neighbors of the first node; and determining node weight values of the first node and the neighbors of the first node based on the bandwidth values received from the neighbors of the first node and the bandwidth value of the first node. The method also includes sending the node weight values of the first node to the neighbors of the first node, receiving the node weight values from the neighbors of the first node, determining access values for each node based on a fair access technique and determining network scheduling based on the access values and the node weight values.
-
Citations
22 Claims
-
1. A method to schedule network communications in a network having nodes connected by links comprising:
-
sending a bandwidth value of a first node for each link connected to the first node to neighbors of the first node, the bandwidth value associated with a number of packets in one or more outbound queues of the first node; receiving bandwidth values from the neighbors of the first node; determining a node weight value of the first node based on a ratio of the bandwidth value of the first node to the bandwidth values from the neighbors of the first node; sending the node weight value of the first node to the neighbors of the first node; receiving node weight values from the neighbors of the first node; determining access values for each node based on a fair access technique; and determining a network scheduling for one or more of the first node and the neighbors of the first node based on the access values biased according to the node weight value of the first node and the node weight values from the neighbors of the first node. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. An apparatus to schedule communications in a network having nodes connected by links, comprising circuitry to:
-
send a bandwidth value of a first node for each link connected to the first node to neighbors of the first node, the bandwidth value associated with a number of packets in one or more outbound queues of the first node; receive bandwidth values from the neighbors of the first node; determine a node weight value of the first node based on a ratio of the bandwidth value of the first node to the bandwidth values from the neighbors of the first node; send the node weight value of the first node to the neighbors of the first node; receive node weight values from the neighbors of the first node; determine access values for each node based on a fair access technique; and determine a network scheduling for one or more of the first node and the neighbors of the first node based on the access values biased according to the node weight value of the first node and the node weight values from the neighbors of the first node. - View Dependent Claims (9, 10, 11, 12, 13, 14, 15)
-
-
16. An article comprising a non-transitory machine-readable medium that stores executable instructions to schedule communications in a network having nodes connected by links, the instructions causing a machine to:
-
send a bandwidth value of a first node for each link connected to the first node to neighbors of the first node, the bandwidth value associated with a number of packets in one or more outbound queues of the first node; receive bandwidth values from the neighbors of the first node; determine a node weight value of the first node based on a ratio of the bandwidth value of the first node to the bandwidth values from the neighbors of the first node; send the node weight value of the first node to the neighbors of the first node; receive node weight values from the neighbors of the first node; determine access values for each node based on a fair access technique; and determine a network scheduling for one or more of the first node and the neighbors of the first node based on the access values and biased according to the node weight value of the first node and the node weight values from the neighbors of the first node. - View Dependent Claims (17, 18, 19, 20, 21, 22)
-
Specification