Data network controller

• US 20030088529A1
• Filed: 11/01/2002
• Published: 05/08/2003
• Est. Priority Date: 11/02/2001
• Status: Active Grant

• Current Assignee: Internap Holding LLC
• Original Assignee: netVmg, Inc. (Internap Holding LLC)
• Inventors: McCanne, Steven, Johnson, Jeremy, Chaffee, Gordon, Klinker, Eric, Fraleigh, Charles J., McKernan, Daniel S.
• Granted Patent: US 7,668,966 B2
• Time in Patent Office: Days
• US Class Current: 706/3
• CPC Class Codes: H04L 41/0893 Assignment of logical groups to network elements
• CPC Class Codes: H04L 41/0894 Policy-based network configuration management
• CPC Class Codes: H04L 43/00 Arrangements for monitoring or testing data switching networks
• CPC Class Codes: H04L 43/022 by sampling
• CPC Class Codes: H04L 43/028 by filtering
• CPC Class Codes: H04L 43/045 for graphical visualisation of monitoring data
• CPC Class Codes: H04L 43/0829 Packet loss
• CPC Class Codes: H04L 43/0864 Round trip delays
• CPC Class Codes: H04L 43/087 Jitter
• 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
• CPC Class Codes: H04L 43/0894 Packet rate
• CPC Class Codes: H04L 43/10 Active monitoring, e.g. heartbeat, ping or trace-route
• CPC Class Codes: H04L 43/12 Network monitoring probes
• CPC Class Codes: H04L 43/16 Threshold monitoring
• CPC Class Codes: H04L 43/18 Protocol analysers
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/30 Routing of multiclass traffic
• CPC Class Codes: H04L 45/302 Route determination based on requested QoS
• CPC Class Codes: H04L 45/308 Route determination based on user's profile, e.g. premium users
• CPC Class Codes: H04L 45/38 : Flow based routing
• CPC Class Codes: H04L 47/20 : Traffic policing
• CPC Class Codes: H04L 47/2441 : relying on flow classification, e.g. using integrated services [IntServ]
• CPC Class Codes: H04L 49/90 : Buffering arrangements
• CPC Class Codes: H04L 49/9023 : for implementing a jitter-buffer
• CPC Class Codes: H04L 65/1101 : Session protocols
• CPC Class Codes: H04L 65/80 : Responding to QoS
• CPC Class Codes: H04L 69/14 : Multichannel or multilink protocols
• CPC Class Codes: H04L 69/22 : Parsing or analysis of headers

Abstract

The present invention provides for a system and method for data network control. Using a flow control system, embodiments of the present invention can analyze traffic flow volume and performance, incorporate usage, billing, and cost control data to yield an improved data network controller. Efficiency in data routing is improved while costs are decreased by enabling the selection of the optimal performance data route. Cost constraints and costs are minimized for an overall data load. Given a diverse set of cost structures for available transit providers, the overall system cost can be minimized by distributing traffic in a manner that takes advantage of the diverse billing structures and yet maintains acceptable performance levels. Systems and methods in accordance with embodiments of the present invention determine projected flow performance and projected flow volume in relation to the available bandwidth and marginal cost to a destination provider.

Claims

1. A controller for a network comprising:

a control module for analyzing aggregate flow information;

an interface for communicating said aggregate flow information;

a cache for receiving information;

an active calibrator for communicating network data;

an aggregation module for aggregating said aggregate flow information;

a usage module for communicating information to said control module;

a file library for storing resources; and

a repository for housing information.

2. The controller of claim 1 wherein said cache for receiving information communicates with said control module.

3. A controller for a data network comprising:

a control module for analyzing aggregate flow information;

an interface for communicating said aggregate flow information;

a cache for receiving information;

an active calibrator for communicating network data;

an aggregation module for aggregating said aggregate flow information;

a usage module for communicating information to said control module;

a file library for storing resources; and

a repository for housing information.

4. A method for controlling a network comprising:

determining a best performance variable;

determining a lowest cost variable; and

assigning a control value.

5. A method for controlling a network comprising:

evaluating a performance value;

determining a cost;

evaluating an identifier; and

determining a change value.

6. The method of claim 5 further comprising:

determining a lowest latency if said candidate bandwidth is less than said bandwidth allocation;

determining a lowest loss;

determining a greatest available bandwidth based on a cost and a usage variable;

determining a cost tier;

determining a lowest identifier; and

assigning a change value.

7. The method of claim 5 further comprising:

determining a lowest latency if said candidate bandwidth is less than said bandwidth allocation;

determining a lowest loss;

determining a greatest available bandwidth based on a cost variable;

determining a cost tier;

determining a lowest identifier; and

assigning a change value.

8. The method of claim 5 further comprising:

determining a lowest latency if said candidate bandwidth is less than said bandwidth allocation;

determining a lowest loss;

determining a greatest available bandwidth based on a usage variable;

determining a cost tier;

determining a lowest identifier; and

assigning a change value.

9. A method for controlling a network comprising:

comparing a candidate loss to a current loss;

comparing a candidate latency to a current latency;

determining a best latency;

determining a best loss;

evaluating a candidate bandwidth value;

determining a maximum candidate bandwidth value;

determining a cost tier;

determining a lowest identifier; and

assigning a change value.

10. A method for determining bandwidth allocation comprising:

evaluating a usage sample;

evaluating a billing profile;

determining a value; and

distributing bandwidth using said value.

11. A method for controlling a network comprising:

observing a sample;

calculating a control limit;

evaluating said sample using said control limit;

defining a sensitivity;

comparing said sensitivity to said sample; and

updating a value.

12. A method for controlling a network comprising:

evaluating a data stream;

evaluating a billing profile;

determining an allocation value; and

distributing data using said allocation value.

13. An apparatus for controlling a network, the apparatus comprising:

means for evaluating a candidate latency;

means for evaluating a candidate loss;

means for comparing a candidate bandwidth to a bandwidth allocation;

means for determining a loss value;

means for determining a cost;

means for evaluating an identifier; and

means for determining a change value.

14. The apparatus of claim 13 further comprising:

means for determining a lowest latency if said candidate bandwidth is less than said bandwidth allocation;

means for determining a lowest loss;

means for determining a greatest available bandwidth based on a cost and a usage variable;

means for determining a cost tier;

means for determining a lowest identifier; and

means for assigning a change value.

15. An apparatus for controlling a network, the apparatus comprising:

means for comparing a candidate loss to a current loss;

means for comparing a candidate latency to a current latency;

means for determining a best latency;

means for determining a best loss;

means for evaluating a candidate bandwidth values;

means for determining a maximum candidate bandwidth value;

means for determining a cost tier;

means for determining a lowest identifier; and

means for assigning a change value.

16. A computer-readable medium storing instructions for controlling a network, by performing the steps of:

evaluating a candidate latency;

evaluating a candidate loss;

comparing a candidate bandwidth to a bandwidth allocation;

determining a loss value;

determining a cost;

evaluating an identifier; and

determining a change value.

17. The computer-readable medium of claim 16, further comprising the steps of:

determining a lowest latency if said candidate bandwidth is less than said bandwidth allocation;

determining a lowest loss;

determining a greatest available bandwidth based on a cost and a usage variable;

determining a cost tier;

determining a lowest identifier; and

assigning a change value.

18. A computer-readable medium storing instructions for controlling a network, by performing the steps of:

comparing a candidate loss to a current loss;

comparing a candidate latency to a current latency;

determining a best latency;

determining a best loss;

evaluating a candidate bandwidth values;

determining a maximum candidate bandwidth value;

determining a cost tier;

determining a lowest identifier; and

assigning a change value.

19. A computer data signal embodied in a carrier wave comprising:

program code for evaluating a candidate latency;

program code for evaluating a candidate loss;

program code for comparing a candidate bandwidth to a bandwidth allocation;

program code for determining a loss value;

program code for determining cost;

program code for evaluating an identifier; and

program code for determining a change value.

21. A computer data signal embodied in a carrier wave comprising:

program code for comparing a candidate loss to a current loss;

program code for comparing a candidate latency to a current latency;

program code for determining a best latency;

program code for determining a best loss;

program code for evaluating candidate bandwidth values;

program code for determining a maximum candidate bandwidth value;

program code for determining a cost tier;

program code for determining a lowest identifier; and

program code for assigning a change value.

20. The computer data signal embodied in a carrier wave of claim 21 further comprising:

program code for determining a lowest latency if said candidate bandwidth is less than said bandwidth allocation;

program code for determining a lowest loss;

program code for determining a greatest available bandwidth based on a cost and a usage variable;

program code for determining a cost tier;

program code for determining a lowest identifier; and

program code for assigning a change value.