US20110264821A1 - Method And Devices For Performing Traffic Control In Telecommunication Networks - Google Patents

Method And Devices For Performing Traffic Control In Telecommunication Networks Download PDF

Info

Publication number
US20110264821A1
US20110264821A1 US13/129,907 US200913129907A US2011264821A1 US 20110264821 A1 US20110264821 A1 US 20110264821A1 US 200913129907 A US200913129907 A US 200913129907A US 2011264821 A1 US2011264821 A1 US 2011264821A1
Authority
US
United States
Prior art keywords
data traffic
threshold
rate
threshold value
method according
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
US13/129,907
Other versions
US8688855B2 (en
Inventor
Josephine Adriaan Werner Van Leekwijck
Koen De Schepper
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nokia Us Holdings Inc
Provenance Asset Group LLC
Original Assignee
Alcatel Lucent SAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to EP08305952 priority Critical
Priority to EP08305952.7A priority patent/EP2200230B1/en
Priority to EP08305952.7 priority
Application filed by Alcatel Lucent SAS filed Critical Alcatel Lucent SAS
Priority to PCT/EP2009/008660 priority patent/WO2010069481A1/en
Assigned to ALCATEL LUCENT reassignment ALCATEL LUCENT ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: VAN LEEKWIJCK, JOSEPHINE ADRIAAN WERNER, DE SCHEPPER, KOEN
Publication of US20110264821A1 publication Critical patent/US20110264821A1/en
Assigned to CREDIT SUISSE AG reassignment CREDIT SUISSE AG SECURITY AGREEMENT Assignors: ALCATEL LUCENT
Application granted granted Critical
Publication of US8688855B2 publication Critical patent/US8688855B2/en
Assigned to ALCATEL LUCENT reassignment ALCATEL LUCENT RELEASE BY SECURED PARTY (SEE DOCUMENT FOR DETAILS). Assignors: CREDIT SUISSE AG
Assigned to PROVENANCE ASSET GROUP LLC reassignment PROVENANCE ASSET GROUP LLC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ALCATEL LUCENT SAS, NOKIA SOLUTIONS AND NETWORKS BV, NOKIA TECHNOLOGIES OY
Assigned to NOKIA USA INC. reassignment NOKIA USA INC. SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: PROVENANCE ASSET GROUP HOLDINGS, LLC, PROVENANCE ASSET GROUP LLC
Assigned to CORTLAND CAPITAL MARKET SERVICES, LLC reassignment CORTLAND CAPITAL MARKET SERVICES, LLC SECURITY INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: PROVENANCE ASSET GROUP HOLDINGS, LLC, PROVENANCE ASSET GROUP, LLC
Assigned to NOKIA US HOLDINGS INC. reassignment NOKIA US HOLDINGS INC. ASSIGNMENT AND ASSUMPTION AGREEMENT Assignors: NOKIA USA INC.
Application status is Active legal-status Critical
Adjusted expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing packet switching networks
    • H04L43/16Arrangements for monitoring or testing packet switching networks using threshold monitoring
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/08Configuration management of network or network elements
    • H04L41/0896Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities, e.g. bandwidth on demand
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing packet switching networks
    • H04L43/08Monitoring based on specific metrics
    • H04L43/0876Network utilization
    • H04L43/0894Packet rate
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/12Congestion avoidance or recovery
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/29Using a combination of thresholds
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic regulation in packet switching networks
    • H04L47/10Flow control or congestion control
    • H04L47/31Tagging of packets, e.g. discard eligibility [DE] bit
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing packet switching networks
    • H04L43/04Processing of captured monitoring data
    • H04L43/045Processing of captured monitoring data for graphical visualization of monitoring data
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing packet switching networks
    • H04L43/06Report generation
    • H04L43/067Report generation for time frame related reporting

Abstract

A method is disclosed for performing traffic control in a network, the network comprising at least one link, the method comprising: —measuring the data traffic rate, the data traffic comprising at least one data flow, at at least one link which carries the data traffic; —defining a first and a second threshold value, the second threshold value being larger than the first threshold value; —determining whether the measured data rate is larger than the first threshold value; and if so, starting congestion signaling of a first type, —determining whether the data rate is larger than the second threshold value; and if so, starting congestion signaling of a second type, wherein at least one of the first and the second threshold values are modified over time, based on data traffic information.

Description

    TECHNICAL FIELD OF THE INVENTION
  • The present invention relates to the field of methods for performing data traffic control for a telecommunication network, the network comprising nodes arranged and connected to each other, comprising at least one link.
  • BACKGROUND OF THE INVENTION
  • The PCN working group of the Internet Engineering Task Force IETF is investigating pre-congestion notification mechanisms to implement traffic control as for instance admission control and flow termination procedures (see for instance the IETF draft draft-ietf-pcn-architecture-08). The packet marking layer of the architecture includes a mechanism by which PCN interior nodes monitor traffic rates on their links and mark packets depending on the type of pre-congestion. An admissible rate (AR) and a supportable rate (SR) need to be defined for each link (L).
  • The AR-pre-congestion mechanism results in the admission control function not allowing new flows, while the SR-pre-congestion mechanism can result additionally in the termination function to terminate some previously admitted flows (see for instance FIG. 1).
  • The filling level of the network, which supports a maximum number of flows, without degrading their QOS, obviously depends on the setting of the specific values of AR and SR for the different links.
  • The values of AR and SR have to be configured for all PCN interior nodes, and are crucial for the overall operation of the network. The exact values of AR and SR have to be defined by the network operator and can possibly be different for different links within the network.
  • There exist a need for improved traffic management methods and associated devices.
  • SUMMARY OF THE INVENTION
  • When terms as “first”, “second”, “third” and the like are used, this does not necessarily mean that a sequential or that a chronological order is to be assumed.
  • The term “comprising”, should be interpreted as such that it does not exclude other elements or steps.
  • For the purpose of the present invention, the following terminology has been used, corresponding to the terminology used in the IETF draft www.ietf.org/internet-drafts/draft-ietf-pcn-architecture-08.txt; unless indicated otherwise:
      • PCN-domain: a PCN-capable domain; a contiguous set of PCN-enabled nodes that can perform DiffServ scheduling [RFC2474]; the complete set of PCN-nodes whose PCN-marking can in principle influence decisions about flow admission and termination for the PCN-domain, including the PCN-egress-nodes, which measure these PCN-marks.
      • PCN-boundary-node: a PCN-node that connects one PCN-domain to a node either in another PCN-domain or in a non PCN-domain.
      • PCN-interior-node: a node in a PCN-domain that is not a PCN-boundary-node.
      • PCN-node: a PCN-boundary-node or a PCN-interior-node
      • PCN-egress-node: a PCN-boundary-node in its role in handling traffic as it leaves a PCN-domain.
      • PCN-ingress-node: a PCN-boundary-node in its role in handling traffic as it enters a PCN-domain.
      • PCN-flow: the unit of PCN-traffic that the PCN-boundary-node admits (or terminates); the unit could be a single microflow (as defined in [RFC2474]) or some identifiable collection of microflows.
      • Ingress-egress-aggregate: The collection of PCN-packets from all PCN-flows that travel in one direction between a specific pair of PCN-boundary-nodes.
      • Threshold-marking: a PCN-marking behavior with the objective that all PCN-traffic is marked if the PCN-traffic exceeds the PCN-threshold-rate.
      • Excess-traffic-marking: a PCN-marking behavior with the objective that the amount of PCN-traffic that is PCN-marked is equal to the amount that exceeds the PCN-excess-rate.
      • Pre-congestion: a condition of a link within a PCN-domain such that the PCN-node performs PCN-marking, in order to provide an “early warning” of potential congestion before there is any significant build-up of PCN-packets in the real queue.
      • PCN-marking: the process of setting the header in a PCN-packet based on defined rules, in reaction to pre-congestion; either threshold-marking or excess-traffic-marking.
      • PCN-feedback-information: information signaled by a PCN-egress-node to a PCN-ingress-node (or a central control node), which is needed for the flow admission and flow termination mechanisms.
      • PCN-admissible-rate (AR): the rate of PCN-traffic on a link up to which PCN admission control should accept new PCN-flows.
      • PCN-supportable-rate (SR): the rate of PCN-traffic on a link down to which PCN flow termination should, if necessary, terminate already admitted PCN-flows.
  • The state of the art, on which the preamble of claim 1 is based, discloses a method for performing traffic control in a network, the network comprising at least one link, comprising
      • a. measuring the data traffic rate, said data traffic comprising at least one data flow, at at least one link, which carries the data traffic;
      • b. defining a first and a second threshold value, said second threshold value being larger than said first threshold value;
      • c. determining whether the measured data rate is larger than a first threshold value; and if so, start congestion signaling of a first type;
      • d. determining whether the data rate is larger than a second threshold value; and if so, start congestion signaling of a second type.
  • If these values are chosen wrongly, different problems may arise, as for instance:
      • if the AR value is set too high, flows may be admitted, which may later on cause the SR value to be crossed (for instance due to the variable bit rate nature of the flows, or change of characteristics of the flow, . . . ), and this may lead to termination of certain flows, which is to be avoided as much as possible as it reduce the service comfort of the users. Flow termination should normally only be performed in exceptional circumstances such as for instance network link or node failures, and a lack of resources on the back-up path;
      • if AR value is set too low, the admission control function will sooner refuse new flows, reducing the number of active flows, and thus the number of served users);
      • if SR value is set too high, there is a risk that the link will undergo real congestion, and packets will be dropped. This leads to a degradation of the quality (for instance Quality of Service (QoS)) of impacted flows (which may be many or potentially even all flows, as the PCN interior nodes are not expected to be aware of individual flows);
      • setting the SR value too low may cause the termination function to take action too soon, terminating some flows, while there may have been really no need to do so.
  • It is an object of the present invention to provide a method, which solves at least one of the above problems.
  • This is achieved by the characterizing features of claim 1.
  • According to a first aspect of the present invention a method for performing traffic control in a network is disclosed, the network comprising at least one link, the method comprising
      • a) measuring the data traffic rate, the data traffic comprising at least one data flow, at at least one link which carries the data traffic;
      • b) defining a first and a second threshold value, the second threshold value being larger than the first threshold value;
      • c) determining whether the measured data rate is larger than the first threshold value; and if so, starting congestion signaling of a first type,
      • d) determining whether the data rate is larger than the second threshold value; and if so, starting congestion signaling of a second type, wherein at least one of the first and the second threshold values are modified over time, based on data traffic information.
  • The signaling can be performed according to a PCN scenario, for instance by marking at least some (or all) data packets of the data traffic which pass through the link, possibly at a, for instance interior, node of the network which is directly connected to this link.
  • Signaling of a first and second type can correspond to congestion marking of a first and second type respectively.
  • The method may further comprise one or more of the following:
      • receiving the marked data packets (of the first type and/or the second type) at the border notes of the network;
      • analyzing the marked packets, in order to analyze the congestion status of the network;
      • communicate (information relating to) the result of the analysis to the border notes of the network;
      • making data traffic decisions impacting the PCN flows, at the ingress border notes.
  • The “data traffic rate” can also be called “data rate of data traffic”. Data traffic information comprises or consists of information about the data traffic.
  • It can be noted that the method can be applied in the context of different types of networks, such as for instance networks of the meshed network or tree network type. The network can comprise at least 2 border nodes and at least one interior node. Moreover, the signaling and corresponding architectures do not necessarily have to correspond to PCN specific signaling and architecture. The PCN domain is thus not the only domain in which methods according to embodiments of the present invention can be applied; it may be applied generally to other measurement based control systems. For the purpose of the present description, PCN has been used as an example of a system, the working of which can be improved with the adaptive threshold method according to embodiments of the present invention.
  • The first and second threshold values can be time dependent. They can for instance be based on data traffic measurement and statistical analyses thereof in order to define predetermined patent for the evolution of the first and/or second threshold value in time (for instance day time/night time, working day/weekend, . . . )
  • In typical embodiments the congestion marking of the second type replaces the congestion marking of the first type as this latter marking would be implicit in the case of the congestion marking of the second type.
  • According to preferred embodiments of the present invention both the first threshold value and the second threshold value can be modified/amended (at least re-determined) over time.
  • According to preferred embodiments the second threshold value is not larger than a predetermined second threshold limit value (or congestion rate (CR)). The congestion rate can be for instance the real limit rate of the link, or for instance 99.99, 99.9, 99, 98, 97, 96, 95, 90, 85, 80, 75, 70, 65, 60, 55, 50, 45, 40, 35, 30, 25% of the real limit rate of the link.
  • According to preferred embodiments the modification of threshold values is further based on a set of constraint rules. An example of such a constraint rule may be that the allowable rate should always be larger than 25% of the congestion rate. Another example of the constraint rule may be the fixing of the timing of the calculation of the adapted threshold values at predetermined periods of time, for instance at regular time intervals or for instance at the occurrence of predetermined events. Another example of a constraint rule may be the allowance/denial of traffic for a specific IP address, or for specific types of flows (for instance emergency calls, business user flows).
  • According to preferred embodiments the data traffic information comprises information relating to the evolution of data traffic rate in time (for a link).
  • According to preferred embodiments the data traffic information comprises information relating to the minimum and/or maximum data traffic rate within a predetermined time interval.
  • According to preferred embodiments the data traffic information comprises information relating to the variability of the data traffic rate within a predetermined time interval.
  • According to preferred embodiments the predetermined time interval can start when the congestion marking (of the first type, or of the second type) is initiated.
  • According to preferred embodiments the predetermined time interval starts when a predetermined threshold value is exceeded, for instance when the first or the second threshold value is exceeded.
  • The predetermined time interval can end when the congestion marking ends(of the first type, or of the second type). The congestion marking may end as soon as the data traffic rate becomes smaller than the respective first or second threshold value.
  • According to preferred embodiments a further “hysteresis” may be introduced by only ending the congestion marking when the data traffic rate goes below a value which is lower than the respective first and second threshold value, for instance below a value of 99, 95, 90, 85, 80, 75, 70% of the respective threshold value.
  • According to preferred embodiments of the present invention the first threshold can be increased if the maximum data traffic rate remains lower than a predetermined first threshold limit value, within a predetermined time interval. The predetermined first threshold limit value can be the second threshold value.
  • According to preferred embodiments of the present invention the first threshold is decreased if the data traffic rate is larger than the predetermined first threshold limit value, within a predetermined time interval. The predetermined first threshold limit value can be the second threshold value.
  • According to preferred embodiments, a method is disclosed wherein the second threshold value is increased if the maximum data traffic rate is smaller than a predetermined second threshold limit value, within a predetermined time interval. The predetermined second threshold limit value can be the congestion rate, which can be for instance the real limit rate of the link.
  • According to further embodiments of the present invention the second threshold value is decreased if the maximum data traffic rate is larger than the predetermined second threshold limit value, within a predetermined time interval.
  • According to embodiments of the present invention the predetermined time interval can also be time dependent (i.e. it can become shorter or longer when time passes), depending on the behavior of the system. For instance when the system tends towards oscillating a lot(decreasing and increasing the levels), the time interval can be made larger or increased, resulting in a longer period before deciding to decrease/increase the respective threshold level.
  • According to preferred embodiments of the present invention the modification/adaptation/evaluation for the first and/or second threshold values over time follows or occurs according to a predetermined pattern. This predetermined pattern may for instance be based on historic data and for instance statistical analysis thereof. According to such embodiments the predetermined pattern can preferably be predetermined at an analysis centre, which is preferably located outside the network nodes.
  • According to embodiments of the present invention the modification/adaptation/evaluation of the first and/or second threshold values over time can be controlled in a network node (for instance an interior node) of the network itself, which is directly connected with the respective link. These embodiments are preferably associated with scenarios wherein the network node is capable of analyzing its own measurements.
  • According to preferred embodiments the modification over time is controlled by a management unit, which is located at a location different from a (interior) node which is directly connected to the link. The management unit can be collocated with the analysis centre.
  • According to preferred embodiments, the methods according to embodiments of the present invention can be applied to a PCN enabled network, and the first threshold value can correspond to the “Admissible Rate” and the second threshold value can correspond to the “Supportable Rate”.
  • According to a second aspect of the present invention, a network element which is adapted for functioning as a (for instance an interior) node of a network, the network element comprising
      • a) Means for communicating with a management system, to hereby receive initial (first and second) data traffic rate threshold values and optionally a set of constraint rules;
      • b) Means for measuring the data traffic rate at at least one link;
      • c) Means for analyzing the measured traffic rate in view of the (first and second) threshold values and optionally the set of constraint rules;
      • d) Means for modifying the first and second threshold values based on the analysis.
  • Further aspects of the present invention are described by the dependent claims. The features from the dependent claims, features of any of the independent claims and any features of other dependent claims may be combined as considered appropriate to the person of ordinary skill, and not only in the particular combinations as defined by the claims.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • The accompanying drawings are used to illustrate embodiments of the present invention.
  • FIG. 1 illustrates the functioning of the congestion control according to state of the art technology.
  • FIG. 2 illustrates the functioning of the traffic control mechanism according to embodiments of the present invention.
  • FIG. 3 illustrates the functionalities of network elements or nodes which are adapted for functioning according to methods according to embodiments of the present invention.
  • FIG. 4 shows a flow-chart illustrating embodiments of the present invention.
  • FIG. 5 illustrates a possible scenario for the evolution of the AR and SR threshold values in time as a function of the measured data traffic rate, wherein the AR value varies according to a fixed step.
  • FIG. 6 depicts a flow-chart illustrating a further embodiment of the present invention.
  • Reference signs are chosen such that they are the same for similar or equal elements or features in different figures or drawings.
  • DESCRIPTION OF ILLUSTRATIVE EMBODIMENTS
  • The above and other advantageous features and objects of the invention will become more apparent and the invention will be better understood from the following detailed description when read in conjunction with the respective drawings.
  • The description of aspects of the present invention is performed by means of particular embodiments and with reference to certain drawings but the invention is not limited thereto. Depicted figures are only schematic and should not be considered as limiting.
  • In the description of certain embodiments according to the present invention, various features are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of aiding in the understanding of one or more of the various inventive aspects. This is not to be interpreted as if all features of the group are necessarily present to solve a particular problem. Inventive aspects may lie in less than all features of such a group of features present in the description of a particular embodiment.
  • While some embodiments described herein include some but not other features included in other embodiments, combinations of features of different embodiments are meant to be within the scope of the invention, and form different embodiments, as would be understood by the skilled person.
  • Embodiments of the present invention comprise measuring of bandwidth over a specific time window (or period or time interval), and taking data traffic decisions based on comparing the measured value(s) with some thresholds. The output of this decision can be used to control the traffic (for instance admission and termination). The thresholds can be adapted/learned, possibly based on the variability of the traffic, and/or based on the rate of new requests of service users.
  • In embodiments of the present invention a mechanism has been defined in which PCN nodes themselves set and tune the precise values of Admissible rate (AR) and Supportable Rate (SR) in order to achieve optimal operation of the PCN network, preferably within certain boundaries or constraints specified by the network operator (see FIG. 3; a PCN element (or network node) (1) can comprise a PCN adaptation function or means (2), which is adapted for receiving initial AR and SR values and constraint rules (3), and which is further adapted to measure and, if necessary, adjust SR and AR levels (4) for a link (Li) directly connected to the PCN element (or network node)). It allows the PCN mechanism to be used in a variety of circumstances and data traffic mix scenarios, and allows the nodes to set their AR and SR values automatically, in an optimized way (see FIG. 2).
  • For instance, when the traffic has a predominantly constant bit rate, the AR and SR values can both be set to relatively higher values, with low risk of real congestion.
  • When the traffic is though highly variable in bit rate, more conservative (i.e. relatively lower) AR and SR settings may be recommendable. In time, the constitution (e.g. flows) of the mix of data traffic on the network may vary, and the AR and SR settings may need to be adjusted accordingly.
  • According to embodiments of the present invention, PCN-capable network elements with adaptable or modifiable PCN levels can comprise a PCN-adaptation function which can (preferable per link, preferable for each link):
      • receive information from a management system. This can be for instance initial SR and AR values, and optionally constraints which can drive the adaptation/modification process;
      • measure the traffic levels and assess the situation in function of the constraints and initial SR and AR values;
      • adapt/modify the SR and/or AR values according to the traffic characteristics and within the constraints imposed by the network operator.
  • According to a first example, for tuning the SR value, the following algorithm could be used:
      • Define the congestion rate (CR) as the level that never should be exceeded. Initially one could start with a (default) SR rate SR-0 (specified as absolute value or for instance a percentage of the link capacity);
      • Whenever the PCN line rate exceeds the SR, perform normal SR marking (according to the IETF draft draft-ietf-pcn-architecture-08), but in addition monitor if the CR value is being reached;
      • If CR is not reached during the SR-pre-congestion period, and for a predetermined amount of time, increase the SR value (for instance with a fixed amount increase step, or with a percentage of the previous value, . . . ).
      • If the CR value was reached, decrease the SR value (e.g. by a fixed amount decrease step, or with a percentage of the previous value . . . ).
      • It can be noted that further mechanisms can be foreseen which are adapted to take care of situations where CR is exceeded due to exceptional circumstances such as network link or node failures. In this case, there would be no real need to adjust the SR, and it would thus be inappropriate to do so, as it relates to a transient phenomenon.
  • According to a second example, for tuning the AR value:
      • Initially start with a (default) AR rate AR-0.
      • Whenever the rate exceeds the AR, perform normal AR marking (according to the IETF draft draft-ietf-pcn-architecture-08), but in addition monitor if the AR-limit (which could reasonably be the SR level, but which can be any value below the SR value) is reached.
      • If AR-limit was not reached during the AR-precongestion period, and for a predetermined amount of time, increase the AR value (e.g. with a fixed amount increase step, or with a percentage of the previous value, . . . ).
      • If the AR-limit was reached, decrease the AR value (e.g. by a fixed amount decrease step, or with a percentage of the previous value, . . . ).
  • In FIG. 4 a flowchart is provided which illustrates a possible algorithm or process that can be used according to embodiments of the present invention, in which the AR value can be adapted by adding or subtracting a fixed step value. The predetermined time interval is here represented by “t_inc”.
  • FIG. 5 illustrates the evolution of the first and second threshold values (AR and SR respectively) in time as a function of the measured data traffic rate, wherein the AR and SR values are adapted (if appropriate) according to a fixed step. The predetermined first threshold limit value has been chosen to correspond to the SR value, but this is not necessary.
  • It can be noted that also the fixed step(s) (these steps can be different or the same for the first and second threshold) can also be replaced by time dependent variable step(s) as a function of for instance the measured data traffic rate and/or the current value of the first and/or second threshold value.
  • According to a third example, illustrated in FIG. 6, the CR value can be defined by a detection means that guarantees protection of network buffers, network bandwidth and/or a delay less than a maximum delay for a packet buffered in a network. The AR and SR values can be compared with a measured rate R1, wherein the rate R1 can for instance be determined by taking the average of the occupied bandwidth over a sliding window with a first window time interval Tw1 (optionally a weighted average with an exponentially decreasing weight). The minimum and maximum values of the rate R1 over a second sliding window time interval Tw2, wherein Tw2 is preferably larger than Tw1, can be defined as Rminimum and Rmaximum. Action 1 can be triggered when the token bucket depth goes below the bucket threshold, action 2 can be triggered when R1 goes above AR, action 3 can be triggered if R1 is not going below AR for a third sliding window time interval Tw3, and action 4 is triggered if R1 goes above SR.
  • Action 1 can comprise reducing both AR and SR. This can be for instance reducing SR proportionally to the size of the bucket under-run and assigning AR=(SR*Rminimum/Rmaximum).
  • Action 2 comprises blocking new flow arrivals.
  • Action 3 can be dependent on the condition:

  • AR/SR>Rminimum/Rmaximum
  • If the result is true, then SR=(AR*Rmaximum/Rminimum).
  • If the result is false, then AR=(SR*Rminimum/Rmaximum).
  • Action 4 can comprise in termination of existing flows.
  • While the principles of the invention have been set out above in connection with specific embodiments, it is to be clearly understood that this description is merely made by way of example and not as a limitation of the scope of protection which is determined by the appended claims.

Claims (15)

1. A method for performing traffic control in a network, the network comprising at least one link, the method comprising
a) measuring the data traffic rate, said data traffic comprising at least one data flow, at at least one link which carries said data traffic;
b) defining a first and a second threshold value, said second threshold value being larger than said first threshold value;
c) determining whether the measured data rate is larger than said first threshold value; and if so, starting congestion signaling of a first type;
d) determining whether the data rate is larger than said second threshold value; and if so, starting congestion signaling of a second type, wherein at least one of said first and said second threshold values are modified over time, based on data traffic information.
2. Method according to claim 1, wherein both the first threshold value and the second threshold value are modified over time.
3. Method according to any of claim 1, wherein the modification of the threshold values is further based on a set of constraint rules.
4. Method according to any of claim 1, wherein said data traffic information comprises information relating to the evolution of data traffic rate in time.
5. A method according to claim 4, wherein said data traffic information comprises information relating to the minimum and/or maximum data traffic rate within a predetermined time interval.
6. Method according to claim 5, wherein said predetermined time interval starts when said predetermined first threshold value is exceeded.
7. Method according to any of the previous claim 5, wherein the first threshold is increased if the maximum data traffic rate remains lower than a predetermined first threshold limit value.
8. Method according to any of the previous claim 5, wherein the first threshold is decreased if the data traffic rate is larger than said predetermined first threshold limit value.
9. Method according to any of the previous claim 5, wherein the second threshold is increased if the maximum data traffic rate is smaller than a predetermined second threshold limit value.
10. Method according to any of the previous claim 5, wherein the second threshold value is decreased if the maximum data traffic rate is larger than said predetermined second threshold limit value.
11. Method according to claim 1, wherein the modification of the first and/or second threshold values over time follows a predetermined pattern.
12. Method according to claim 1, wherein the modification over time is controlled in a node directly connected to said link.
13. Method according to claim 1, wherein the modification over time is controlled by a management unit which is located at a location different from a node directly connected to said link.
14. A method according to claim 1, wherein said first threshold value is the Admissible Rate, and the second threshold value is the Supportable Rate.
15. A network element which is adapted for functioning as a node of a network, said network element comprising
a) means for communicating with a management system, to hereby receive initial (first and second) data traffic rate threshold values and optionally a set of constraint rules;
b) means for measuring the data traffic rate at at least one link;
c) means for analyzing the measured traffic rate in view of said (first and second) threshold values and optionally said set of constraint rules;
d) means for modifying the first and second threshold values based on said analysis.
US13/129,907 2008-12-16 2009-11-30 Method and devices for performing traffic control in telecommunication networks Active 2030-07-20 US8688855B2 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
EP08305952 2008-12-16
EP08305952.7A EP2200230B1 (en) 2008-12-16 2008-12-16 Method and device for performing traffic control in telecommunication networks
EP08305952.7 2008-12-16
PCT/EP2009/008660 WO2010069481A1 (en) 2008-12-16 2009-11-30 Method and devices for performing traffic control in telecommunication networks

Publications (2)

Publication Number Publication Date
US20110264821A1 true US20110264821A1 (en) 2011-10-27
US8688855B2 US8688855B2 (en) 2014-04-01

Family

ID=40352440

Family Applications (1)

Application Number Title Priority Date Filing Date
US13/129,907 Active 2030-07-20 US8688855B2 (en) 2008-12-16 2009-11-30 Method and devices for performing traffic control in telecommunication networks

Country Status (6)

Country Link
US (1) US8688855B2 (en)
EP (1) EP2200230B1 (en)
JP (1) JP5519696B2 (en)
KR (1) KR101538200B1 (en)
CN (1) CN102246473B (en)
WO (1) WO2010069481A1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120215905A1 (en) * 2011-02-22 2012-08-23 Kaseya International Limited Method and apparatus of establishing computer network monitoring criteria
US20140043965A1 (en) * 2011-04-27 2014-02-13 Nec Corporation Network apparatus, communication system, abnormal traffic detection method, and program
US20140068621A1 (en) * 2012-08-30 2014-03-06 Sriram Sitaraman Dynamic storage-aware job scheduling
US20150312169A1 (en) * 2009-12-24 2015-10-29 Delphix Corporation Adaptive Resource Management

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104065586B (en) * 2013-03-19 2017-10-24 阿里巴巴集团控股有限公司 A flow control method and apparatus
EP2879339A1 (en) * 2013-11-27 2015-06-03 Thomson Licensing Method for distributing available bandwidth of a network amongst ongoing traffic sessions run by devices of the network, corresponding device.

Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20030099195A1 (en) * 2001-11-29 2003-05-29 Samsung Electronics Co., Ltd. Method and apparatus for notifying data congestion in a communication system
US20030165150A1 (en) * 2002-01-25 2003-09-04 Roger Zimmermann Multi-threshold smoothing
US20040218617A1 (en) * 2001-05-31 2004-11-04 Mats Sagfors Congestion and delay handling in a packet data network
US20040264377A1 (en) * 2001-11-23 2004-12-30 Kalevi Kilkki Method and system for handling network congestion
US20050039103A1 (en) * 2003-07-31 2005-02-17 Yehuda Azenko Method and apparatus for automatic rate adaptation in a DOCSIS upstream
US20050147033A1 (en) * 2003-10-31 2005-07-07 Yi-Lon Chin Method of controlling data flow for a media player system
US20050163056A1 (en) * 2004-01-23 2005-07-28 Ranta-Aho Karri Method and apparatus for fast data rate ramp up in Node B scheduling of UE uplink
US20080037552A1 (en) * 2006-08-11 2008-02-14 Latitude Broadband, Inc. Methods And Systems For Providing Quality Of Service In Packet-Based Core Transport Networks
US20080075003A1 (en) * 2006-09-21 2008-03-27 Futurewei Technologies, Inc. Method and system for admission and congestion control of network communication traffic
US20080259785A1 (en) * 2002-06-28 2008-10-23 Hong Linh Truong Link Adaptation
US20090296582A1 (en) * 2007-04-13 2009-12-03 Zhiqiang Shi Token-based congestion control method for the internet
US20100054126A1 (en) * 2008-08-26 2010-03-04 Broadcom Corporation Meter-based hierarchical bandwidth sharing
US7983156B1 (en) * 2004-11-12 2011-07-19 Openwave Systems Inc. System and method for controlling network congestion

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1249972A1 (en) * 2001-04-09 2002-10-16 Telefonaktiebolaget Lm Ericsson Method of controlling a queue buffer
JP2004328157A (en) * 2003-04-22 2004-11-18 Ntt Docomo Inc Call reception control apparatus and call reception control method
WO2005064862A1 (en) * 2003-12-23 2005-07-14 Telefonaktiebolaget Lm Ericsson (Publ) Method and device for controlling a queue buffer
JP3735631B2 (en) * 2004-03-18 2006-01-18 株式会社エヌ・ティ・ティ・ドコモ Mail sending and receiving apparatus and a mail transmitting and receiving method
WO2006101168A1 (en) * 2005-03-23 2006-09-28 Nec Corporation Call reception control system and call reception control method
CN100579079C (en) 2007-11-05 2010-01-06 北京航空航天大学 Congestion control method for multi-to-multi reliable multicast
CN101286930B (en) 2008-05-30 2010-12-08 华南理工大学 Self-adapting routing method for congestion of multi-hop wireless self-organizing network

Patent Citations (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20040218617A1 (en) * 2001-05-31 2004-11-04 Mats Sagfors Congestion and delay handling in a packet data network
US20040264377A1 (en) * 2001-11-23 2004-12-30 Kalevi Kilkki Method and system for handling network congestion
US20030099195A1 (en) * 2001-11-29 2003-05-29 Samsung Electronics Co., Ltd. Method and apparatus for notifying data congestion in a communication system
US20030165150A1 (en) * 2002-01-25 2003-09-04 Roger Zimmermann Multi-threshold smoothing
US20080259785A1 (en) * 2002-06-28 2008-10-23 Hong Linh Truong Link Adaptation
US20050039103A1 (en) * 2003-07-31 2005-02-17 Yehuda Azenko Method and apparatus for automatic rate adaptation in a DOCSIS upstream
US20050147033A1 (en) * 2003-10-31 2005-07-07 Yi-Lon Chin Method of controlling data flow for a media player system
US20050163056A1 (en) * 2004-01-23 2005-07-28 Ranta-Aho Karri Method and apparatus for fast data rate ramp up in Node B scheduling of UE uplink
US7983156B1 (en) * 2004-11-12 2011-07-19 Openwave Systems Inc. System and method for controlling network congestion
US20080037552A1 (en) * 2006-08-11 2008-02-14 Latitude Broadband, Inc. Methods And Systems For Providing Quality Of Service In Packet-Based Core Transport Networks
US20080075003A1 (en) * 2006-09-21 2008-03-27 Futurewei Technologies, Inc. Method and system for admission and congestion control of network communication traffic
US20090296582A1 (en) * 2007-04-13 2009-12-03 Zhiqiang Shi Token-based congestion control method for the internet
US20100054126A1 (en) * 2008-08-26 2010-03-04 Broadcom Corporation Meter-based hierarchical bandwidth sharing

Cited By (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150312169A1 (en) * 2009-12-24 2015-10-29 Delphix Corporation Adaptive Resource Management
US10333863B2 (en) * 2009-12-24 2019-06-25 Delphix Corp. Adaptive resource allocation based upon observed historical usage
US20120215905A1 (en) * 2011-02-22 2012-08-23 Kaseya International Limited Method and apparatus of establishing computer network monitoring criteria
US8645530B2 (en) * 2011-02-22 2014-02-04 Kaseya International Limited Method and apparatus of establishing computer network monitoring criteria
US20160218913A1 (en) * 2011-02-22 2016-07-28 Kaseya Limited Method and apparatus of establishing computer network monitoring criteria
US20140136699A1 (en) * 2011-02-22 2014-05-15 Kaseya International Limited Method and apparatus of establishing computer network monitoring criteria
US9306815B2 (en) * 2011-02-22 2016-04-05 Kaseya Limited Method and apparatus of establishing computer network monitoring criteria
US10097405B2 (en) * 2011-02-22 2018-10-09 Kaseya Limited Method and apparatus of establishing computer network monitoring criteria
US9992117B2 (en) 2011-04-27 2018-06-05 Nec Corporation Network apparatus, communication system, abnormal traffic detection method, and program
US9306858B2 (en) * 2011-04-27 2016-04-05 Nec Corporation Network apparatus, communication system, abnormal traffic detection method, and program
US20140043965A1 (en) * 2011-04-27 2014-02-13 Nec Corporation Network apparatus, communication system, abnormal traffic detection method, and program
US20140068621A1 (en) * 2012-08-30 2014-03-06 Sriram Sitaraman Dynamic storage-aware job scheduling

Also Published As

Publication number Publication date
JP5519696B2 (en) 2014-06-11
CN102246473A (en) 2011-11-16
US8688855B2 (en) 2014-04-01
EP2200230A1 (en) 2010-06-23
CN102246473B (en) 2014-07-23
JP2012512586A (en) 2012-05-31
WO2010069481A1 (en) 2010-06-24
KR101538200B1 (en) 2015-07-20
KR20110105811A (en) 2011-09-27
EP2200230B1 (en) 2014-03-12

Similar Documents

Publication Publication Date Title
Jamin et al. A measurement-based admission control algorithm for integrated services packet networks
CN100480711C (en) Auto-IP traffic optimization in mobile telecommunications systems
EP1847081B1 (en) Policing networks
US9654383B2 (en) Route optimization using measured congestion
DE60032669T2 (en) Apparatus and method for bandwidth monitoring
US7260062B2 (en) Flow control in network devices
US7496661B1 (en) Adaptive, application-aware selection of differentiated network services
EP1183822B1 (en) Communication network method and apparatus
US6829649B1 (en) Method an congestion control system to allocate bandwidth of a link to dataflows
US20030152096A1 (en) Intelligent no packet loss networking
JP4032231B2 (en) Data transmission method
US7724660B2 (en) Communication traffic congestion management systems and methods
US7274666B2 (en) Method and system for managing traffic within a data communication network
US7032020B2 (en) System and method for determining segment and link bandwidth capacities
EP2456142A1 (en) Methods and apparatus for detecting and limiting focused server overload in a network
Nandy et al. Intelligent traffic conditioners for assured forwarding based differentiated services networks
Breslau et al. Endpoint admission control: Architectural issues and performance
CN100574263C (en) Method and equipment for controlling the congestion management and scheduling of transmission-link capacity in packet-switched telecommunications
CA2683501C (en) An automatic policy change management scheme for diffserv-enabled mpls networks
JP4034260B2 (en) Method and apparatus for auditing service level agreements by the test packet inserts
KR100542401B1 (en) An Admission Control Method in Differentiated Service Networks
US20080031137A1 (en) Traffic metering in data networks
JP4509804B2 (en) Resource allocation management
Feng et al. Maintaining end-to-end throughput in a differentiated-services Internet
DE602004004831T2 (en) Method and apparatus for scheduling of packets on a network connection with a based on the input rate priority

Legal Events

Date Code Title Description
AS Assignment

Owner name: ALCATEL LUCENT, FRANCE

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VAN LEEKWIJCK, JOSEPHINE ADRIAAN WERNER;DE SCHEPPER, KOEN;SIGNING DATES FROM 20110609 TO 20110616;REEL/FRAME:026567/0013

AS Assignment

Owner name: CREDIT SUISSE AG, NEW YORK

Free format text: SECURITY AGREEMENT;ASSIGNOR:LUCENT, ALCATEL;REEL/FRAME:029821/0001

Effective date: 20130130

Owner name: CREDIT SUISSE AG, NEW YORK

Free format text: SECURITY AGREEMENT;ASSIGNOR:ALCATEL LUCENT;REEL/FRAME:029821/0001

Effective date: 20130130

STCF Information on status: patent grant

Free format text: PATENTED CASE

AS Assignment

Owner name: ALCATEL LUCENT, FRANCE

Free format text: RELEASE BY SECURED PARTY;ASSIGNOR:CREDIT SUISSE AG;REEL/FRAME:033868/0555

Effective date: 20140819

AS Assignment

Owner name: PROVENANCE ASSET GROUP LLC, CONNECTICUT

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:NOKIA TECHNOLOGIES OY;NOKIA SOLUTIONS AND NETWORKS BV;ALCATEL LUCENT SAS;REEL/FRAME:043877/0001

Effective date: 20170912

Owner name: NOKIA USA INC., CALIFORNIA

Free format text: SECURITY INTEREST;ASSIGNORS:PROVENANCE ASSET GROUP HOLDINGS, LLC;PROVENANCE ASSET GROUP LLC;REEL/FRAME:043879/0001

Effective date: 20170913

Owner name: CORTLAND CAPITAL MARKET SERVICES, LLC, ILLINOIS

Free format text: SECURITY INTEREST;ASSIGNORS:PROVENANCE ASSET GROUP HOLDINGS, LLC;PROVENANCE ASSET GROUP, LLC;REEL/FRAME:043967/0001

Effective date: 20170913

MAFP Maintenance fee payment

Free format text: PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1551)

Year of fee payment: 4

AS Assignment

Owner name: NOKIA US HOLDINGS INC., NEW JERSEY

Free format text: ASSIGNMENT AND ASSUMPTION AGREEMENT;ASSIGNOR:NOKIA USA INC.;REEL/FRAME:048370/0682

Effective date: 20181220