ACCESS CONTROL FOR PACKET-ORIENTED NETWORKS

• US 20100226249A1
• Filed: 05/19/2010
• Published: 09/09/2010
• Est. Priority Date: 08/14/2002
• Status: Abandoned Application

• Current Assignee: Nokia Siemens Networks GmbH & Company KG (Nokia Corporation)
• Original Assignee: Nokia Siemens Networks GmbH & Company KG (Nokia Corporation)
• Inventors: Menth, Michael
• Application Number:
  US12/783,268
• Publication Number:
  US 20100226249A1
• Time in Patent Office: Days
• US Class Current: 370/230
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/29 using a combination of thresholds
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/805 QOS or priority aware

Abstract

The invention relates to a method for access control to a packet-oriented network. An admissibility check for a group of packets is carried out by means of a threshold value for the traffic volume between the network input node and the network output node for the flow. The transmission of the groups of data packets is not permitted when an authorization of the transmission would lead to traffic volume exceeding the threshold value. A relationship between the threshold values and the traffic volume in partials stretches or links may be formulated by means of the proportional traffic volume over the individual partial stretches. Using the capacities of the links the threshold values for pairs of input and output nodes can be fixed such that no overload occurs on the individual links. Within the above method a flexible reaction to the drop-out of links can be achieved by means of a resetting of the threshold values. Furthermore the inclusion of other conditions is possible, for example relating to the capacity of interfaces to other networks or special demands on transmission of prioritized traffic.

Claims

1. A method for limiting traffic in a packet-oriented network having a plurality of links, the method comprising:

performing an admissibility check for a group of data packets of a flow to be transmitted via the network, wherein

the admissibility check is performed on the basis of a threshold value for the traffic volume between the network ingress node and the network egress node of the flow, and wherein

the transmission of the group of data packets is not allowed if an authorization of the transmission would lead to a traffic volume exceeding the threshold value.

2. The method as claimed in claim 1, wherein for all pairs of network ingress nodes and network egress nodes threshold values are defined for the traffic volume between each node pair

3. The method as claimed in claim 2, wherein the threshold values for the traffic volume between pairs of network ingress nodes and network egress nodes are placed in relation to the traffic volume on the links of the network, and wherein the threshold values for the traffic volume between network ingress nodes and network egress nodes are defined by means of values for maximum traffic volumes on the links of the network.

4. The method as claimed in claim 3 further comprising:

determining the proportional traffic volume over the individual links of the network for the pairs of network ingress nodes and network egress nodes; and

placing in relation the threshold values for the traffic volume between pairs of network ingress nodes and network egress nodes to the traffic volume on links of the network by using the values for the proportional traffic volume via the individual links.

5. The method as claimed in claim 1, wherein two further admissibility checks are performed, wherein one of these admissibility checks is performed using a threshold value for the traffic routed via the network ingress node of the flow, and wherein the other admissibility check is performed using a threshold value for the traffic routed via the network egress node of the flow.

6. The method as claimed in claim 5, further comprising:

establishing a relation between the traffic volumes between pairs of network ingress nodes and network egress nodes and the traffic volume on links of the network; and

determining limits for the traffic volume between the pairs of network ingress nodes and network egress nodes and determining threshold values for the traffic routed via the network ingress nodes and for the traffic routed via the network egress nodes by using values for a maximum traffic volume on the links of the network.

7. The method as claimed in claim 6, wherein

the relation between the traffic volumes between pairs of network ingress nodes and network egress nodes and the traffic volume on links of the network is established with the aid of inequalities, and

an optimization method is performed for the traffic volume on links of the network, wherein

the inequalities being used as auxiliary conditions for the optimization, and wherein

the proportional traffic volume over the individual links of the network being used for formulating the relation between the traffic volumes between pairs of network ingress nodes and network egress nodes and the traffic volume on links of the network.

8. The method as claimed in claim 1, wherein, if a link drops out, the limits or the threshold values for the admissibility check or admissibility checks are reset with the condition that no packets are transmitted via the failed link.

9. The method as claimed in claim 2, wherein, if a link drops out, the limits or the threshold values for the admissibility check or admissibility checks are reset with the condition that no packets are transmitted via the failed link.

10. The method as claimed in claim 3, wherein, if a link drops out, the limits or the threshold values for the admissibility check or admissibility checks are reset with the condition that no packets are transmitted via the failed link.

11. The method as claimed in claim 4, wherein, if a link drops out, the limits or the threshold values for the admissibility check or admissibility checks are reset with the condition that no packets are transmitted via the failed link.

12. The method as claimed in claim 5, wherein, if a link drops out, the limits or the threshold values for the admissibility check or admissibility checks are reset with the condition that no packets are transmitted via the failed link.

13. The method as claimed in claim 1, wherein limits or threshold values dependent on the class of service of the group of packets are used for at least one admissibility check

14. The method as claimed in claim 2, wherein limits or threshold values dependent on the class of service of the group of packets are used for at least one admissibility check.

15. The method as claimed in claim 3, wherein limits or threshold values dependent on the class of service of the group of packets are used for at least one admissibility check.

16. The method as claimed in claim 4, wherein limits or threshold values dependent on the class of service of the group of packets are used for at least one admissibility check.

17. The method as claimed in claim 5, wherein limits or threshold values dependent on the class of service of the group of packets are used for at least one admissibility check.

18. The method as claimed in claim 1, further comprising:

determining limits or threshold values for each of a plurality of possible problem situations, which limits or threshold values cause the traffic volume to remain within an admissible framework even in a problem situation; and

setting the limits or threshold values to the minimum of the values for the problem situations under investigation.

19. The method as claimed in claim 2, further comprising:

determining limits or threshold values for each of a plurality of possible problem situations, which limits or threshold values cause the traffic volume to remain within an admissible framework even in a problem situation; and

setting the limits or threshold values to the minimum of the values for the problem situations under investigation.

20. The method as claimed in claim 7, wherein at least one further relation is established with the aid of an inequality, which relation expresses a traffic limitation on a link of the network or on a link leading away from the network, and the optimization method is performed using a condition regarding said further relation.