NETWORK BANDWIDTH DETECTION, DISTRIBUTION AND TRAFFIC PRIORITIZATION
First Claim
Patent Images
1. In a node configured to communicate with one or more other nodes over a network, a method for network bandwidth detection, distribution and traffic prioritization, the method comprising:
- a) detecting an available bandwidth for communication between the first node and a second node;
b) determining a distribution for the available bandwidth among the two or more communication channels by distributing a bandwidth quantum BQ for a time quantum T amongst N≧
2 communication channels C1 . . . CN, based on priorities P1 . . . PN correspondingly assigned to channels C1 . . . CN, wherein each channel is assigned a reserved portion of the bandwidth quantum BQ, wherein a size Ri of the reserved portion assigned to a given channel Ci of the N channels C1 . . . CN, is greater than zero and wherein Ri is determined based on the corresponding priority Pi assigned to the given channel Ci;
c) transmitting an amount of ready data, if any, for each channel Ci that is greater than zero and less than or equal to the size Ri of the reserved portion for that channel; and
d) redistributing any unused part of any reserved portion Ri amongst any of the N communication channels C1 . . . CN having un-transmitted ready data.
4 Assignments
0 Petitions
Accused Products
Abstract
Network bandwidth detection and distribution and prioritizing network traffic among two or more distinct channels of communication within a single application in a node configured to communicate with one or more other nodes over a network is disclosed. For a particular time quantum, a bandwidth quantum may be distributed amongst two or more communication channels according to priorities associated with those channels.
-
Citations
34 Claims
-
1. In a node configured to communicate with one or more other nodes over a network, a method for network bandwidth detection, distribution and traffic prioritization, the method comprising:
-
a) detecting an available bandwidth for communication between the first node and a second node; b) determining a distribution for the available bandwidth among the two or more communication channels by distributing a bandwidth quantum BQ for a time quantum T amongst N≧
2 communication channels C1 . . . CN, based on priorities P1 . . . PN correspondingly assigned to channels C1 . . . CN, wherein each channel is assigned a reserved portion of the bandwidth quantum BQ, wherein a size Ri of the reserved portion assigned to a given channel Ci of the N channels C1 . . . CN, is greater than zero and wherein Ri is determined based on the corresponding priority Pi assigned to the given channel Ci;c) transmitting an amount of ready data, if any, for each channel Ci that is greater than zero and less than or equal to the size Ri of the reserved portion for that channel; and d) redistributing any unused part of any reserved portion Ri amongst any of the N communication channels C1 . . . CN having un-transmitted ready data. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20)
-
-
21. A node configured to communicate with one or more other nodes over a network, the node comprising:
-
a processor; and a memory coupled to the processor, the memory having therein a set of instructions executable by the processor, the instructions being configured to implement a method for prioritizing network traffic among two or more distinct channels of communication within a single application, the method comprising; a) detecting an available bandwidth for communication between the first node and a second node; b) determining a distribution for the available bandwidth among the two or more communication channels by distributing a bandwidth quantum BQ for a time quantum T amongst N≧
2 communication channels C1 . . . CN, based on priorities P1 . . . PN correspondingly assigned to channels C1 . . . CN, wherein each channel is assigned a reserved portion of the bandwidth quantum BQ, wherein a size Ri of the reserved portion assigned to a given channel Ci of the N channels C1 . . . CN, is greater than zero and wherein Ri is determined based on the corresponding priority Pi assigned to the given channel Ci;c) transmitting an amount of ready data, if any, for each channel Ci that is greater than zero and less than or equal to the size Ri of the reserved portion for that channel; and d) redistributing any unused part of any reserved portion Ri amongst any of the N communication channels C1 . . . CN having un-transmitted ready data. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33)
-
-
34. A tangible, computer-accessible storage medium comprising program instructions, wherein the program instructions are computer-executable on a node to implement a method for prioritizing network traffic among two or more distinct channels of communication within a single application, the method comprising:
-
a) detecting an available bandwidth for communication between the first node and a second node; b) determining a distribution for the available bandwidth among the two or more communication channels by distributing a bandwidth quantum BQ for a time quantum T amongst N≧
2 communication channels C1 . . . CN, based on priorities P1 . . . PN correspondingly assigned to channels C1 . . . CN, wherein each channel is assigned a reserved portion of the bandwidth quantum BQ, wherein a size Ri of the reserved portion assigned to a given channel Ci of the N channels C1 . . . CN, is greater than zero and wherein Ri is determined based on the corresponding priority Pi assigned to the given channel Ci;c) transmitting an amount of ready data, if any, for each channel Ci that is greater than zero and less than or equal to the size Ri of the reserved portion for that channel; and d) redistributing any unused part of any reserved portion Ri amongst any of the N communication channels C1 . . . CN having un-transmitted ready data.
-
Specification