NETWORK MULTI-SOURCE INBOUND QUALITY OF SERVICE METHODS AND SYSTEMS

• US 20180302286A1
• Filed: 11/13/2017
• Published: 10/18/2018
• Est. Priority Date: 02/11/2017
• Status: Active Grant

• Current Assignee: Nicira Incorporated (Broadcom, Inc.)
• Original Assignee: Ajit Ramachandra Mayya, Parag Pritam Thakore, Stephen Craig Connors, Steven Michael Woo, Sunil Mukundan
• Inventors: MAYYA, AJIT RAMACHANDRA, THAKORE, PARAG PRITAM, CONNORS, STEPHEN CRAIG, WOO, STEVEN MICHAEL, MUKUNDAN, SUNIL, SRIHARI, MUKAMALA SWAMINATHAN
• Granted Patent: US 10,574,528 B2
• Time in Patent Office: Days
• CPC Class Codes: H04L 41/0896 Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities flow or congestion control using dynamic resource allocation, e.g. in-call renegotiation, H04L47/76
• CPC Class Codes: H04L 43/0876 Network utilisation, e.g. volume of load or congestion level
• CPC Class Codes: H04L 43/0882 Utilisation of link capacity

Abstract

A computerized method useful for implementing a Multi-Source Inbound QoS (Quality of Service) process in a computer network includes the step of calculating a current usage rate of a provider entity. The provider entity is classified by a network traffic priority; implementing a fair sharing policy among a set of provider entities. The method includes the step of adjusting any excess bandwidth among a set of provider entities. The method includes the step of implementing link sharing at a provider-entity level.

Claims

1. A computerized method useful for implementing a Multi-Source Inbound QoS (Quality of Service) process in a computer network comprising:

calculating a current usage rate of a provider entity, wherein the provider entity is classified by a network traffic priority;

implementing a fair sharing policy among a set of provider entities;

adjusting any excess bandwidth among a set of provider entities;

implementing link sharing at a provider-entity level; and

with an endpoint in the computer network, calculating a usage score for a high-priority traffic, a normal-priority traffic and a low priority-priority traffic that is transmitted to a receiving entity.

2. The computerized method of claim 1, wherein the usage score comprises a total requirement for the provider entity to send computer network traffic to the receiving entity without dropping any data packets.

3. The computerized method of claim 2, wherein the usage score is communicated to the receiving entity.

6. The computerized method of claim 1, wherein the step of adjusting any excess bandwidth among the set of provider entities further comprises:

iterating through each peer and assigning any leftover bandwidth to a first peer which still requires more bandwidth.

7. The computerized method of claim 1, wherein the step of implementing link sharing at a provider-entity level further comprises:

sharing the allocated bandwidth by configuring a link scheduler at the provider entity such that path selection policies are honored.

4. The computerized method of herein the receiving entity stores the usage score in a bandwidth accumulator.

5. The computerized method of claim 4, wherein the receiving entity uses the sum of a set of received usage scores from a set of peer entities that are stored in the bandwidth accumulator to determine a set of bandwidth needs of each peer on a per priority basis, and to distribute bandwidth fairly between all peers.

8. A computer system useful for useful for implementing a Multi-Source Inbound QoS (Quality of Service) process in a computer network comprising:

at least one processor configured to execute instructions;

a memory containing instructions when executed on the processor causes the at least one processor to perform operations that;

calculates a current usage rate of a provider entity, wherein the provider entity is classified by a network traffic priority;

implements a fair sharing policy among a set of provider entities;

adjusts any excess bandwidth among a set of provider entities;

implements link sharing at provider-entity level;

with an endpoint in the computer network, calculates a usage score for a high-priority traffic, a normal-priority traffic and a low priority-priority traffic that is transmitted to a receiving entity.

9. The computerized system of claim 8, wherein the usage score comprises a total requirement for the provider entity to send computer network traffic to the receiving entity without dropping any data packets.

10. The computerized system of claim 9, wherein the usage score is communicated to the receiving entity.

11. The computerized system of claim 10, wherein the receiving entity stores the usage score in a bandwidth accumulator.

12. The computerized system of claim 11, wherein the receiving entity uses the sum of a set of received usage scores from a set of peer entities that are stored in the bandwidth accumulator to determine a set of bandwidth needs of each peer on a per priority basis, and to distribute bandwidth fairly between all peers.

13. The computerized system of claim 12, wherein the memory containing instructions when executed on the processor, causes the at least one processor to perform operations that:

iterates through each peer and assigning any leftover bandwidth to first peer which still requires more bandwidth.

14. The computerized system of claim 13, wherein the memory containing instructions when executed on the processor, causes the at least one processor to perform operations that:

shares the allocated bandwidth by configuring a link scheduler at the provider entity such that path selection policies are honored.