US 7,680,036 B2 · Network resource provisioning method for bandwidth guarantee per flow

Abstract

Provided is a network resource provisioning method for bandwidth guarantee per flow in a differentiated service Internet in which bandwidth needed for each flow is individually requested. The method includes setting an optimum path between a source node and a destination node based on a request for traffic for a specific period of time; performing static provisioning in which bandwidth is allocated to the optimum path according to a service class thereof; determining whether all of the bandwidth allocated to the optimum path by performing static provisioning are used up, and accepting connection admission according to the determination result; and when connection admission is not accepted, performing dynamic provisioning in which additional bandwidth is allocated to the optimum path based on a request for traffic from a new incoming flow. Accordingly, it is possible to efficiently provide a quality-guaranteed service by accepting a request for bandwidth per flow.

Claims10

Dependent claims

A non-transitory computer readable media storing computer readable codes for provisioning network resources in a differentiated service Internet in which necessary bandwidth is requested in units of flows for bandwidth guarantee per flow, comprising:

(a) setting an optimum path between a source node and a destination node based on a request for traffic for a specific period of time;
(b) performing static provisioning in which bandwidth is allocated to each service class of the optimum path;
(c) determining whether connection admission is to be performed by determining whether all of the statically provisioned bandwidth allocated to the optimum path is being used;
and
(d) if it is determined in (c) that connection admission is not to be performed, performing dynamic provisioning in which additional bandwidth is allocated to the optimum path based on a request for traffic by a newly incoming flow, wherein the setting the optimum path comprises computing a value which satisfies:
the amount of traffic input to and output from each of nodes, except the source node and the destination node, is the same;
the total bandwidth requested by all paths that include the same link is not greater than an overall link capacity;
a case where one of the flows is divided into sub flows and a plurality of paths are used is excluded;
and
overall link utilization in the differentiated service Internet is maximized.

7 more elements

(a) setting an optimum path between a source node and a destination node based on a request for traffic for a specific period of time;
(b) performing static provisioning in which bandwidth is allocated to each service class of the optimum path;
(c) determining whether connection admission is to be performed by determining whether all of the statically provisioned bandwidth allocated to the optimum path is being used;
and
(d) if it is determined in (c) that connection admission is not to be performed, performing dynamic provisioning in which additional bandwidth is allocated to the optimum path based on a request for traffic by a newly incoming flow, wherein (c) comprises:
(c1) receiving a new flow which requests a bandwidth c through the source node;
(c2) selecting a path using the destination node and the service classes;
(c3) comparing extra bandwidth available to the selected path with the requested bandwidth c, and determining whether the extra bandwidth is sufficient to accept connection of the new flow;
and
(c4) if it is determined in (c3) that the connection of the new flow is acceptable, updating the extra bandwidth of the selected path to be equal to the extra bandwidth—the requested bandwidth c, and accepting the connection of the new flow.

7 more elements

Dependencies are inferred from the claim text.

Network resource provisioning method for bandwidth guarantee per flow

Life of this patent

Network resource provisioning method for bandwidth guarantee per flow

Life of this patent

Abstract

Claims10