# Patent

## Title
Method for congestion detection in packet transmission networks

## Abstract

A method for measuring degree of packet congestion on a channel of a packet communication network. The method includes: during a training mode, generating an mathematical relationship between the degree of packet congestion on the channel and a plurality of measurable features of the network over a plurality of network conditions; and, during a subsequent normal operating mode, periodically measuring the plurality of measurable features and applying the generated mathematical relationship to such periodically measured plurality of measurable features to determine actual degree of congestion on the channel; and comparing the actual degree of congestion on the channel with a predetermined channel congestion threshold level. The degree of packet congestion on the channel is saturation level. The measurable features include: time delay between transmission starts and terminations of the previously transmitted packet; the fraction of time the channel is busy; and, average number of packet transmission retries.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a continuation of U.S. patent application Ser. No. 12/206,069, filed Sep. 8, 2008, which claims priority from U.S. Provisional Patent Application No. 60/986,379 filed Nov. 8, 2007. The entirety of U.S. patent application Ser. No. 12/206,069 and U.S. Provisional Patent Application No. 60/986,379 are incorporated by reference herein.


TECHNICAL FIELD
This invention relates generally to packet transmission networks and more particularly to methods for detecting congestion on such networks.
BACKGROUND AND SUMMARY
As is known in the art, one type of packet transmission network is a wireless transmission network. As is also known, Wireless Local Area Networks (WLAN) are becoming more and more popular nowadays due to their easy deployment and wide spread of Wi-Fi interface cards. A Wi-Fi Alliance report finds that 1.2 million 802.11 chipsets will be produced in 2006. Parallel to technological development, a flurry of analytical studies appeared in communication literature. Experimental results and theoretical studies show that wireless networks may enter a saturation regime characterized by a highly suboptimal medium utilization. More specifically, standard rate adaptation mechanisms reduce transmission rates when multiple packet loss occurs. Yet if the packet loss is due to collision rather than bad channel (which is the working assumption for the rate adaptation mechanism) then the controller induces a higher probability of collision which snowballs in turn into an even lower throughput. Such a mechanism is used by the Automatic Rate Fallback (ARF) algorithm used in WLAN-II products from Lucent which assumes all packet kiss are due to bad channel.
Here, a method is provided for detecting when saturation occurs in 802.11 wireless networks. The method computes a simple, efficiently computable, formula based on “saturation”, as described below, discriminating features as inputs in order to predict saturation. The formula represents a classification boundary of saturation vs. non-saturation. The system classification boundary of saturation vs. non-saturation evolves from level curves with respect to load, interference or frame error rates, and the more the one of these conditions worsens the more the saturation boundary is approached. The consequences are very important in determining that the system approaches salutation, and also determining the cause of saturation: bad channel conditions or congestion or both.
Consider an 802.11e network formed of an Access Point (AF), and several stations (STA's). We will consider several Access Categories (AC) of the four AC's specified in 802.11e standard.
In the following, several scenarios are presented and comment on each of them if, and when, saturation is reached:
A. Single Connection (i.e. One Way)
Assume there is only one AP and one STA, and except for control frames, the data is transmitted only on the uplink. AP to STA (or, alternatively, only on the downlink, STA to AP). At low load, throughput is proportional to the load. The throughput then increases monotonically with load (load is MAC layer packet arrival rate at sender from its application layer). Starting with some load, the throughput remains constant indicating a plateau. However for the purpose of this project, this behavior is not considered saturation.
One characteristics of saturation (in our interpretation) is having packet collisions. In the one-link case there are no packet collisions (except maybe with interferers, which are not considered in this scenario), and as such, this case is not representative to saturation.
B. Link vs. Network
Consider the following scenario: the BSS (Basic service set) has three stations (STAs): two with high loads, and a third STA with a low load. The two STAs compete for the channel, and in this process create many packet collisions (and retransmissions). The third station, even though its packet transmissions may suffer multiple retransmissions, achieves the desired throughput, albeit with a larger delay. By increasing the first two STA loads the total throughput achieves a maximum value after which it decreases substantially by the cascading effect mentioned above. Then the saturation limit is achieved. The third station link throughput may not be affected. However, consider this case as network saturation.
A conclusion of this case is that saturation is a property of the network and not of individual links. Thus the network can be in saturation or not, and not a particular link.
C. Packet Collisions and Saturation
Consider a typical network scenario: one access point (AP) and several STAs. For moderate loads, when throughput is still a monotonically increasing function of load, packets may suffer collisions with some rate. An increase in the loads will produce an increase in the packet collision rate. Once the peak throughput is achieved, the packet collision rate keeps increasing with the load, however the throughput starts decreasing toward its saturation value.
Thus, the packet collision rate is a proxy for STAs loads and may be a good indicator of the presence of saturation.
All these aspects of the problem suggest the following definition of saturation:

    
    
        A wireless network is in saturation if there is a set of decreases in the packet arrived rules at each station's MAC that produces an increase in the total throughput.
    
    


In accordance with the present invention, a method is provided for measuring degree of packet congestion on a channel of a packet communication network. The method includes: during a training mode, generating an mathematical relationship between the degree of packet congestion on the channel and a plurality of measurable features of the network over a plurality of network conditions; and, during a subsequent normal operating mode, periodically measuring the plurality of measurable features and applying the generated mathematical relationship to such periodically measured plurality of measurable features to determine actual degree of congestion on the channel.
In one embodiment, the degree of packet congestion on the channel is saturation level of the channel.
In one embodiment, saturation level is a function of packet arrival rate at a receiver on the channel and total packet throughput on the channel.
In one embodiment, the function is that if there is a set of decreases in the packet arrival rates at each receiver that produces an increase in the total throughput, die channel is at the saturation level of the channel.
In one embodiment, the measurable features of the network include at least one of: time delay between transmission starts of a station on the channel and terminations of the previously transmitted packer from such station; the fraction of time the channel is busy with transmissions, regardless of the origin of the transmission, or whether packets were correctly transmitted and received; and, average number of packet transmission retries on the channel.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.



DESCRIPTION OF DRAWINGS
FIG. 1 is a flowchart of the method for measuring degree of packet congestion on a channel of a packet communication network according to the invention;
FIGS. 2(a)-2(c) are used to define interference for three cases: The first case FIG. 2(a) is ignored if the interference period is short and falls within a data packet transmission duration; In the other two cases (FIGS. 2(b) and 2(c)), the data packet is either collided or deferred due to the busy channel resulting from the interference;
FIG. 3 is a graph showing the relationship between a plurality of measurable features, here: channel time utilization (TU), medium (i.e. channel) access delay (MAD); and number of packet retries (Rt), for a particular congestion rule for a large number of simulated experiments under the various channel conditions and used to generate a mathematical relationship between the degree of packet congestion on the channel and the plurality of measurable features over a plurality of network conditions;
FIG. 4 is an enlarged region of FIG. 3;
FIG. 5 is a graph showing the relationship between the plurality of measurable features of FIG. 3 for a different congestion rule, and
FIG. 6 is a state machine used to perform a method to control or shape packet traffic.



Like reference symbols in the various drawings indicate like elements.
DETAILED DESCRIPTION
Referring now to FIG. 1, a flowchart of the method for measuring degree of packet congestion on a channel of a packet communication network according to the invention is shown. In Step 100, during a training mode, the method generates a mathematical relationship between the degree of packet congestion on the channel and a plurality of measurable features of the network over a plurality of network conditions. In Step 200, during a subsequent normal operating mode, the method periodically measures the plurality of measurable features and applying the generated mathematical relationship to such periodically measured plurality of measurable features to determine actual degree of congestion on the channel. Next, in Step 300, the method compares the actual degree of congestion on the channel with a predetermined channel congestion threshold level.
Here, the degree of packet congestion on the channel is saturation level of the channel where saturation level is a function of packet arrival rate at a receiver on the channel and total packet throughput on the channel. The function is that if there is a set of decreases in the packet arrival rates at each receiver that produces an increase in the total throughput, the channel is at the saturation level of the channel.
Here, for example, the measurable features of the network include at least one of: time delay between transmission starts of a station on the channel and terminations of the previously transmitted packet from such station; the fraction of time the channel is busy with transmissions, regardless of the origin of the transmission, or whether packets were correctly transmitted and received; and, average number of packet transmission retries on the channel.










Definition of Terms and Symbols









Terms/Symbol
Description
Unit





Time Utilization
The fraction of time that the channel is busy



(TU)


System Loading
Total data loading of the system from
bps


(L)
applications


Goodput (GP)
The ACK'd data transmitted over the channel
bps


Congestion
The network condition with high time



utilization


Queuing Delay
The amount of time that a packet stay in the
ms


(QD)
interface queue


Medium Access
Total transmission time - quening delay
ms


Dealy (MAD)


Wireless FER
The frame error rate due to bad wireless
%


(FER)
channel quality


N
Number of client stations


InfAr
Average arrival time between two interfering
ms



signals


InfDu
Average duration of interfering signals
ms


S
IP packet size = data payload + 40
bytes


AC[n]
802.11e priority access category. From high to



low n = 0, 1, 2, 3.









Below, we consider a number of features essential in detecting saturation. Other features could also be used in our approach; however we consider that this is a sufficient set of features to result in a good saturation detector and illustrate our concept and an instantiation of the concept:
1. Medium Access Delay (MAD)
Different chipsets offer various statistics about the operation of the hardware. In our formulas we will consider instantiations corresponding to the parameters reported by the Atheros AR5212 chipset hardware (manufactured by Atheros Communications. Inc. 5480 Great America Parkway Santa Clara, Calif. 95054) that can be used to calculate channel usage. In other implementations/hardware, similar statistics can be found or computed. These are:

    
    
        TFC register counts the number of cycles the tx_frame signal is Active; AR5212: 9.8.1 (170). AppNote-RxTxProfiling: 9.8.1(1)
    
    


RFC register counts the number of cycles the rx_frame signal is Active; AR5212: 9.8.2 (170). AppNote-RxTxProfiling: 9.8.2(1)
RRC register counts the number of cycles the rx_clear signal is Active; AR5212: 9.8.3 (170). AppNote-RxTxProfiling: 9.8.3(2)
Medium Access Delay (MAD) is defined based on the following times:
t0 denotes the time a packet is placed in the interface queue (CC)
t1 denotes the time when packet is taken from interface queue and the transmission mechanism begins
t2 denotes the time when transmission ends (SendTimeStamp)
Generally we know only t0 and t2, however the following formula can be used to compute, t1:

t1(n)=max(t0(n),t2(n−1))

which reflects the fact that, transmission starts as soon as the transmission of the previous packet ended, provided the current packet arrived.
MAD is defined as the average of t2−t1 over N packets:




  
    M
    ⁢
    
      
    
    ⁢
    A
    ⁢
    
      
    
    ⁢
    D
  
  =
  
    
      1
      N
    
    ⁢
    
      
        ∑
        
          k
          =
          1
        
        N
      
      ⁢
      
        (
        
          
            t
            ⁢
            
              
            
            ⁢
            2
            ⁢
            
              (
              n
              )
            
          
          -
          
            t
            ⁢
            
              
            
            ⁢
            1
            ⁢
            
              (
              n
              )
            
          
        
        )
      
    
  




2. Time Utilization (TU)
Time Utilization (TU) measures the fraction of time the medium is busy with wireless transmissions, regardless of the origin, or whether packets were correctly transmitted/received. Thus, if T1 and T2 denote the starting, respectively the ending time for an observation period (e.g. 5 seconds), and that the RRC clear channel counter is incremented when the medium is idle, then:




  
    T
    ⁢
    
      
    
    ⁢
    U
  
  =
  
    1
    -
    
      
        
          R
          ⁢
          
            
          
          ⁢
          R
          ⁢
          
            
          
          ⁢
          
            C
            ⁡
            
              (
              
                T
                ⁢
                
                  
                
                ⁢
                2
              
              )
            
          
        
        -
        
          R
          ⁢
          
            
          
          ⁢
          R
          ⁢
          
            
          
          ⁢
          
            C
            ⁡
            
              (
              
                T
                ⁢
                
                  
                
                ⁢
                1
              
              )
            
          
        
      
      
        
          T
          ⁢
          
            
          
          ⁢
          2
        
        -
        
          T
          ⁢
          
            
          
          ⁢
          1
        
      
    
  




Alternatively, the time utilization can be computed from die TFC and RFC register counters, which indicate the number of cycles transmission and reception flags are active over time:




  
    T
    ⁢
    
      
    
    ⁢
    U
  
  =
  
    
      
        T
        ⁢
        
          
        
        ⁢
        F
        ⁢
        
          
        
        ⁢
        
          C
          ⁡
          
            (
            
              T
              ⁢
              
                
              
              ⁢
              2
            
            )
          
        
      
      +
      
        R
        ⁢
        
          
        
        ⁢
        F
        ⁢
        
          
        
        ⁢
        
          C
          ⁡
          
            (
            
              T
              ⁢
              
                
              
              ⁢
              2
            
            )
          
        
      
      -
      
        T
        ⁢
        
          
        
        ⁢
        F
        ⁢
        
          
        
        ⁢
        
          C
          ⁡
          
            (
            
              T
              ⁢
              
                
              
              ⁢
              1
            
            )
          
        
      
      -
      
        R
        ⁢
        
          
        
        ⁢
        F
        ⁢
        
          
        
        ⁢
        
          C
          ⁡
          
            (
            
              T
              ⁢
              
                
              
              ⁢
              1
            
            )
          
        
      
    
    
      
        T
        ⁢
        
          
        
        ⁢
        2
      
      -
      
        T
        ⁢
        
          
        
        ⁢
        1
      
    
  




For practical implementations, we have to explore the most accurate alternative. For different chipsets, alternative flags may enable us to compute TU.
3. Average Number of Retries (R)
Average Number of Retries (R) represents the average of DataFailCnt over a number of N packets:




  R
  =
  
    
      1
      N
    
    ⁢
    
      
        ∑
        
          k
          =
          1
        
        N
      
      ⁢
      
        DataFailCnt
        ⁡
        
          (
          k
          )
        
      
    
  




Initial Training Data Generation, Step 100
Here, ns-2 code and perl scripts were written to simulate behavior of the network topologies of interest, or to measure the parameters of interest from real experimentation. We considered one AP and several stations with non-perfect channel conditions and interference.
Simulation Outline
In simulation, we have controlled these factors as follows:
Channel condition is modeled through considering a Frame Error Rate (FER). FER acts as an independent variable and contributes to an increased number of retransmissions.
Interference is modeled as a Poisson arrival process of random duration. Time length for the on-state is an exponentially distributed random variable. When interference overlaps with a packet transmission, that transmission is considered corrupt. Interference contributes to all medium access delay (MAD), number of retries, and channel utilization. The interference is specified with two parameters: the Poisson process arrival rate, and the average on-state duration.
Simulation Results: Balanced Network with Several Levels of Interference, and Frame Error Rates (FER)
Following parameters are varied in simulation to cover various possible conditions:
System loading in numbers of client VoIP/Video streaming stations (N).
Channel quality in terms of FER under various corresponding SNRs.
Interference: external, representing hidden nodes etc. Interference is modeled as a Poisson arrival process with rate IntfAr, and duration exponentially distributed with an average time IntfDu.
Traffic type (i.e. packet size S, access category).
In simulation, interference is defined as in FIG. 2, for three cases. The first case (a) is ignored if the interference period is short and falls within a data packet transmission duration. In other two cases (b) and (c), the data packet is either collided or deferred due to the busy channel resulting from the interference. The effect is controlled by average arrival time IntfAr and duration IntfDu assuming they are independent and exponentially distributed between any two interference periods.
The simulation aims at computing the following measures: Goodput GP, MAD, TU, Rt. For a fixed FER, interference level, and S/traffic type, we derived GP(N), TU(N).
Overall, the results below cover 420 simulations, for various values of the discussed parameters: N, FER, InfAr, InfDu. Below we give a complete description of all these parameters, and some of the quantities tracked in simulation.
The simulation topology used is:

    
    
        Infrastructure mode
        N={1 2 3 4 5 6 7 8 9 10 11 12 13 14 15}
        FER={0 1 5 10 20 50 80}
        InfAr={INF 200 100 50}
        InfDu={1 }
        S={200}
    
    













Layer
Parameters







Application
Two-way VolP traffic at AC[0]



Simulate G.711 codee at 64 Kbps


Transport
IP/UDP/RTP



40 bytes/packet of header



80 Kbps. S = 200 bytes/packet. 20 ms/packet with header



each direction


Link/MAC
802.11e AC[0]: AIFS = 2. CWmin = 8, CWmax = 16.



RetryLimit = 4



802.11e AC[1]: AIFS = 2. CWmin = 16. CWmax = 32.



RetryLimit = 4


Physical
802.11b at 11 Mbps









Considering now how operation points (before or after saturation) are positioned in the joint space TU vs. MAD vs. Rt, it is first noted that simulation obtains undefined values for MAD and Rt when the interference is too bad and no frame starts to transmit within the simulation time. This induces some outliers in the plots, which should be discarded. Their positions, however, are obvious.
The saturation detector is based on the following rule:

    
    
        The Goodput GP maximum corresponds to a Nmax=Nmax(FER, Interference, S). In the feature space (MAD, TU, Rt) data labeled ‘o’ represents all experiments, or “operating points”, before Nmax, and data labeled ‘x’ represent all experiments at or after Nmax+1. Thus, we have maximum number of clients for which a decrease in the load induces an increase in the total throughput, according to the original definition for saturation presented above. When one traces the actual state of the wireless system in the feature space, one can observe the data label (o or x) of (known) neighboring states, and then infer the data label (o or x) of the current state based on proximity to such known states. This is equivalent to classifying the current state as saturated or non-saturated based on proximity.
    
    


FIGS. 2 and 3 show that it is possible to reliably “separate” operating points before (o) and after (x) saturation. This means that one can define and implement a simple, efficiently computable, formula using the features as inputs in order to predict saturation (e.g. the maximum margin Support Vector Machine (SVM) classifier, to be described in connection with Step 200, below, of the data).
More particularly, FIG. 2 shows TU vs. MAD vs. Rt, under congestion rule given (default in next plots) for a large number of simulated experiments under the various conditions given. Note the good “separation” of operating points before and after saturation in FIG. 2. This indicates possibility to build a simple, efficiently computable, formula using the features as inputs in order to predict saturation. The formula represents a description of the boundary between non-saturation and saturation (e.g. the maximum margin SVM classifier of the data).
FIG. 3 shows a Closeup of a region in FIG. 2 TU vs. MAD vs. Rt, under congestion rule (A)—Zoom in FIG. 2, to highlight separation of saturated (x) and non-saturated experimental points (o) in region of high density of experimental data.
FIG. 4 highlights that the operating points are placed on level curves with respect to load, interference or frame error rates. These curves are nicely parameterized with respect to either of these input variables. Furthermore, there is a deterministic, predictable relationship between how close the saturation state is approached, as a function of the position of the operating point relative the boundary of decision regarding saturation. This will allow us to:
Determine that the system approaches saturation
Determine which of noise or congestion or both are main causes of saturation.
More particularly, FIG. 4 shows MAD vs. TU, under congestion rule, in different experimental conditions (Interference, FER). In this plot, each curve (x or o) corresponds to a different FER. The circles/crosses on each curve correspond to experiments with different loads or clients (from L=1 to 15). Note that as FER increases and as L increases, the operation point moves to the right and upwards.
FIG. 5 is a second perspective on MAD vs. TU. One experiment is behind each point (circle or cross) in the plot. All points connected together in one curve correspond to experiments where the number of clients L increases starting from 1. Thus, the first point on the curve, from left to right, is a circle and corresponds to L=1, the second to L=2, and so on (up to maximum L=15 on some curves). For some value of L the circle becomes a cross; this corresponds to an experiment where saturation is reached. Different curves are obtained for various interference levels, as follows: topmost curve, with only three points corresponds to the highest interference level controlled by the frame error rate (FER) of 80%. In the next lower one, the frame error rate is 50%. The following curves are for frame error rates of 20, 10, 5, 2, 1 and zero percent. All points with the same load (number of clients N) constitute a level curve, for various packet error conditions. Note that as FER increases and as N increases, the operation point moves to the right and upwards. That is where all the crosses (corresponding to congested conditions) are concentrated.
Congestion can be predicted based on the position of the operation point in the space of features; as load increases, the operation point moves in the direction of the saturation boundary. Consider for instance a saturation boundary given by the first crosses on the parameterized curves with increasing load. The separation surfaces in these projection subspaces are virtually invariant lines for the various experimental cases (noise and interference).
As indicated, the boundaries can be precisely computed using a classification approach; the training data for the classifier that separates the x and o regions can be created from a large number of simulations. FIGS. 2 and 3 highlight separability of saturated (x) and non-saturated experimental points (o) throughout all experiments.
Generation of Mathematical Relationship
The next step here is to compute a simple, efficiently computable, formula using the features as inputs in order to predict saturation and test the classification power of the formula for various “unseen” cases. Or, as note above, the next step is to generate a mathematical relationship between the degree of packet congestion on the channel and a plurality of measurable features of the network over a plurality of network conditions.
Note that the operating points are positioned on level curves with respect to load, interference or frame error rates, and the more these conditions worsen (i.e. increased FER, or increased load), the smaller the distance between the position of the operating point and the boundary of decision regarding saturation. The consequences are very important in determining that the system approaches saturation, and determining the cause of saturation; bad channel conditions or congestion or both.
Here, from die data, weights W and ρ are generated and presented as matrices, more precisely vertical vectors to be described below in Step 300.
A Second Order Support Vector Machine (SVM) Classifier, Step 200
As noted above, during a subsequent normal operating mode, the method periodically measures the plurality of measurable features and applies the generated mathematical relationship to such periodically measured plurality of measurable features to determine actual degree of congestion on the channel; and comparing the actual degree of congestion on the channel with a predetermined channel congestion threshold level.
Here, for example, a 2nd order Support Vector Machine based Classifier for the database obtained by the simulation described above is used. The database can be enlarged using a variety of experimental data to obtain an accurate classifier in general or under particular conditions.
Comparison Between Actual Degree of Congestion (Degree of Channel Saturation) With Predetermined Channel Congestion Threshold Level, Step 300
The method next compares the actual degree of congestion on the channel with a predetermined channel congestion threshold level.
The saturation detector has the following form:




  
    
  
  ⁢
  
    Saturation
    =
    
      {
      
        
          
            
              
                false
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      s
                      ⁡
                      
                        (
                        
                          
                            T
                            ⁢
                            
                              
                            
                            ⁢
                            U
                          
                          ,
                          
                            M
                            ⁢
                            
                              
                            
                            ⁢
                            A
                            ⁢
                            
                              
                            
                            ⁢
                            D
                          
                          ,
                          
                            R
                            ⁢
                            
                              
                            
                            ⁢
                            T
                          
                        
                        )
                      
                    
                  
                  >
                  ɛ
                
              
            
            
              
                true
              
              
                
                  if
                  ⁢
                  
                    
                  
                  ⁢
                  otherwise
                
              
            
          
          ⁢
          
            

          
          ⁢
          
            

          
          ⁢
          
            s
            ⁡
            
              (
              
                
                  T
                  ⁢
                  
                    
                  
                  ⁢
                  U
                
                ,
                
                  M
                  ⁢
                  
                    
                  
                  ⁢
                  A
                  ⁢
                  
                    
                  
                  ⁢
                  D
                
                ,
                
                  R
                  ⁢
                  
                    
                  
                  ⁢
                  T
                
              
              )
            
          
        
        =
        
           
          
            
              
                [
                
                  
                    
                      
                        T
                        ⁢
                        
                          
                        
                        ⁢
                        U
                      
                    
                    
                      
                        M
                        ⁢
                        
                          
                        
                        ⁢
                        A
                        ⁢
                        
                          
                        
                        ⁢
                        D
                      
                    
                    
                      
                        R
                        ⁢
                        
                          
                        
                        ⁢
                        T
                      
                    
                    
                      
                        T
                        ⁢
                        
                          
                        
                        ⁢
                        
                          U
                          2
                        
                      
                    
                    
                      
                        M
                        ⁢
                        
                          
                        
                        ⁢
                        A
                        ⁢
                        
                          
                        
                        ⁢
                        
                          D
                          2
                        
                      
                    
                    
                      
                        R
                        ⁢
                        
                          
                        
                        ⁢
                        
                          T
                          2
                        
                      
                    
                    
                      
                        
                          
                            
                              T
                              ⁢
                              
                                
                              
                              ⁢
                              
                                U
                                ·
                              
                            
                          
                        
                        
                          
                            
                              M
                              ⁢
                              
                                
                              
                              ⁢
                              A
                              ⁢
                              
                                
                              
                              ⁢
                              D
                            
                          
                        
                      
                    
                    
                      
                        
                          
                            
                              T
                              ⁢
                              
                                
                              
                              ⁢
                              
                                U
                                ·
                              
                            
                          
                        
                        
                          
                            
                              R
                              ⁢
                              
                                
                              
                              ⁢
                              T
                            
                          
                        
                      
                    
                    
                      
                        
                          
                            
                              M
                              ⁢
                              
                                
                              
                              ⁢
                              A
                              ⁢
                              
                                
                              
                              ⁢
                              
                                D
                                ·
                              
                            
                          
                        
                        
                          
                            
                              R
                              ⁢
                              
                                
                              
                              ⁢
                              T
                            
                          
                        
                      
                    
                  
                
                ]
              
              ⁢
              W
            
            -
            ρ
          
        
      
    
  




where:
s is a saturation parameter providing an indication of the degree of packet congestion; and
an instantiation of the coefficients W, ε and ρ is, in this example, given by:

W=|−0.1528,−0.9631,0.4933,−0.2066,−0.9802,1.3510,−1.3835,0.1580,2.5935|  r, ρ=−7.2384, ε=0

In practice, the offset parameter ε can also be experimentally determined. This classifier was here obtained by applying cross-validation on our database of up to 4×15×7=420 examples (in fact there are fewer examples, due to the fact that some experiments have not defined or not-a-number results in the computation of features).
A random subset of approximately 70% was used for training. The following testing results were obtained:
On training database: 99.6% accuracy (241/242 correct classification)
On testing database: 98.97% accuracy (96/97 correct classification)
On entire database: 99.41% accuracy (337/339 correct classification)
Thus, from the above, sufficient relevant computable features for saturation detection have been defined and show feasibility of building a robust classifier based on these features. Under a large set of conditions (FER, interference, there exist invariant separation surfaces in the space of the features of interest, which can be used to robustly detect congestion conditions or proximity to such conditions. The approach presented above gives a heuristic but theoretically informed way of building an effective detector.
The method thus computes a simple, efficiently computable, formula based on the discriminating features as inputs. The formula represents the classification boundary of saturation vs. non-saturation. The saturation boundary is approached under either increasing frame errors or congestion conditions. Furthermore, one can discriminate between the two causes of saturation: bad channel conditions or congestion or both.
A typical instantiation is an implementation of the congestion detection formula in an access point.
It should be understood that the term periodically herein means either at regular or irregular intervals.
Having determined the degree of packet congestion, such degree of congestion being characterized by the saturation parameter, s, a method is used to control or shape packet traffic (herein referred to as a mitigation policy). If the degree of congestion is greater than the determined threshold in Step 400 (FIG. 1), the method adjusts some of the present packet traffic in order to alleviate potential problems (Step 500), here controlling or shaping packet traffic as described in co-pending patent application entitled, “Method and Apparatus to Inspect Wireless Traffic and Mitigate Packet Elimination for Wireless Saturation Avoidance” filed on the same date as this application, and assigned to the same assignee as the present application, identified as attorney docket 2008P12142US01, the entire subject matter thereof being incorporated herein by reference. On the other hand, if in Step 400 it is determined that the degree of congestion is less than the threshold, the process returns to Step 200.
As described in such co-pending patent application, once the degree of congestion is determined, herein above such degree of congestion being characterized by the saturation parameter, s, the mitigation policy represents action to be taken in each state of the WiSAT state machine, shown in FIG. 6;
The method thus computes a simple, efficiently computable, formula based on the discriminating features as inputs. The formula represents the classification boundary of saturation vs. non-saturation. The saturation boundary is approached under either increasing frame errors or congestion conditions. Furthermore, one can discriminate between the two causes of saturation: bad channel conditions or congestion or both.
A First Order Support Vector Machine Classifier, Step 200
Without loss of generality, one can use other classifiers, such as a different order SVM or other linear or nonlinear machine learning algorithms. In practical instantiations, we used a first order SVM classifier due to the low computational requirements, as follows:

s(TU,MAD,RT)=|TU MAD RT|TW−ρ

where parameters W=|4.391995−0.005264−0.233946|, ε=0.5, and ρ=0.288917 were learned from real-world experimental data.
A typical instantiation is an implementation of the congestion detection formula in an access point.
It should be understood that the term periodically herein means either at regular or irregular intervals.
Having determined the degree of packet congestion, such degree of congestion being characterized by the saturation parameter, s, a method is used to control or shape packet traffic (herein referred to as a mitigation policy).
If the degree of congestion is greater than the determined threshold in Step 400 (FIG. 1), the method adjusts some of the present packet traffic in order to alleviate potential problems (Step 500), here controlling or shaping packet traffic described below. On the other hand, if in Step 400 it is determined that the degree of congestion is less than the threshold, the process returns to Step 200.
State Machine for WiSAT (Wireless Saturation)
A more complex saturation detector can be modeled using a finite state machine. In contrast to using instantaneous feature values as before to decide on saturation, the decision and actions to be taken depend also on the previous state, or previous measurements. The state machine is called the WiSAT state machine;
Referring now to FIG. 6, a state of WiSAT machine depends on a number of factors.

    
    
        Classifier and smoothed classifier outputs: s, s respectively; where s is a measure of packet congestion
        Parameters, e.g. αSTATE (smoothing rate for computation of s depending on state s)
    
    


Particular statistics/thresholds/intervals for the classifier and smoothed classifier outputs FIG. 6: WiSAT State Machine with state STATE=0/1/2. Conditions Cij guide the transition from state i to state j.
More precisely, the following components are necessary to define the state machine and the logic of the state machine:
Present state STATE (STATE=0 representing NonSAT, or non saturation; 1 representing PreSAT or pre-saturation, and 2 representing SAT or saturation)
Conditions Cij (i,j=0, 1, 2) define transitions between states of the following format:

Cij=(s(t)oijδij)rij(s(t)õij{tilde over (δ)}ij)

Where:
s(t), s(t) are the WiSAT classifier and smoothed classifier outputs
oij, õij are relational parameters ≦ and > for s,s respectively
δij, {tilde over (δ)}ij are threshold parameters for s,s respectively
rij is one of the logical relational operators AND, OR
Examples (Note that unspecified conditions are defined such that all outgoing transition probabilities from one state add up to 1 and are mutually exclusive. Conditions Cij (i,j=0, 1, 2) are implemented as follows: (with 5 parameters renamed for simplicity of notation {tilde over (δ)}0={tilde over (δ)}01, δ0=δ01, {tilde over (δ)}1={tilde over (δ)}12, {tilde over (δ)}2={tilde over (δ)}21 corresponding to above general names).
Examples of Finite State Machine (FSM) State Transition Rules

C01=s(t)>{tilde over (δ)}0&s(t)δ0 

Go from NonSAT (state 0) to PreSAT (state 1) if the time average of the measurement s is greater than the parameter {tilde over (δ)}0 and the instantaneous value of s is greater than the parameter {tilde over (δ)}0 

C01=s(t)≦ε

Go from NonSAT to SAT if the time average of the measurement of s
is less than or equal to the value of ε

C00=s(t)≦{tilde over (δ)}0&s(t)>ε

Remain in NonSAT if the time average of the measurement of s
is less than or equal to {tilde over (δ)}0 and
the time average of the measurement of s is greater than ε

C12=s(t)≦ε

Go from PreSAT to SAT if the instantaneous value of the parameter s is less than or equal to ε

C10=s(t)≦{tilde over (δ)}1&s(t)>ε

Go from PreSAT to NonSAT if the time average of the measured
parameter s is less than or equal to {tilde over (δ)}1 and
the instantaneous value of s is greater than ε

C11=s(t)>{tilde over (δ)}1 

Remain in PreSAT if the time average of the measured
parameter s is greater than {tilde over (δ)}1 

C22=(s(t)≦ε)&(s(t)≦ε)

Remain in SAT if the instantaneous value of the probability parameters is
less than or equal to ε and
the time average of the measured parameter s is less or equal to ε

C21=s(t)>{tilde over (δ)}2 

Go from SAT to PreSAT if the time average of the measured parameter s is greater than {tilde over (δ)}2 

C20= C21|C22

Go from SAT to NonSAT if the logical complement of the disjunction of the two conditions C21 and C22 holds
Mitigation
Mitigation policy represents action to be taken in each state of the WiSAT state machine.
NonSAT—no action will be taken.
PreSAT—actions that could be taken include queue length change or dropping (voice) packets, or more generally packets of a given access category, according to one of the algorithms below.
SAT—action could be more drastic, a combination of involving admission control and dropping packets of a given access category (i.e. voice).










Algorithm: Act on Drop Rate N
















 
Parameters:



Max and Min Drop Rate N0. NSAT



Critical Threshold {tilde over (γ)}



Output: N







  
    N
    ⁡
    
      (
      t
      )
    
  
  =
  
    {
    
      
        
          
            -
            1
          
        
        
          
            
          
        
        
          
            if
            ⁢
            
              
            
            ⁢
            NonSAT
          
        
      
      
        
          
            
              N
              0
            
            +
            
              
                β
                2
              
              ⁡
              
                (
                
                  
                    
                      s
                      ~
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  -
                  
                    γ
                    ~
                  
                
                )
              
            
          
        
        
          
            
          
        
        
          
            if
            ⁢
            
              
            
            ⁢
            
              PreSAT
              ⁡
              
                (
                
                  
                    β
                    2
                  
                  ⁢
                  
                    
                  
                  ⁢
                  is
                  ⁢
                  
                    
                  
                  ⁢
                  negative
                  ⁢
                  
                    
                      
                    
                    ⁢
                    
                      
                    
                  
                  ⁢
                  slope
                
                )
              
            
          
        
      
      
        
          
            N
            SAT
          
        
        
          if
        
        
          SAT
        
      
    
  







where N = −1 means no packet is dropped: otherwise, for N >= 0, 



it means one packet is dropped out of every N consecutive



packets: NSAT = 2 for example.





Note:


If saturation does occur, then the last action taken while in PrcSAT state could be continuously taken onwards, until a change of state is dictated by the conditions C21/C20.






Other Algorithms. Act on MAC Queue length L
Other algorithm schemes, in addition to scheme 1 above, can be used to achieve similar effects:
Scheme 2. Design virtual queue length, L. Any incoming packet when the virtual queue, is full will be dropped;
Scheme 3. For each client, drop its every (m+1) packet;
Scheme 4. For each client drop the incoming packet if R packets for same client already are in the queue;
For example, scheme 2 proposes to focus on controlling the MAC queue length;













 
Parameters:



Maximum/Minimum MAC Queue Length L0 Lmin



Critical Threshold γ



Output: L







  
    L
    ⁡
    
      (
      t
      )
    
  
  =
  
    {
    
      
        
          
            L
            0
          
        
        
          
            
          
        
        
          
            if
            ⁢
            
              
            
            ⁢
            NonSAT
          
        
      
      
        
          
            
              L
              0
            
            +
            
              
                β
                1
              
              ⁡
              
                (
                
                  
                    
                      s
                      ~
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  -
                  γ
                
                )
              
            
          
        
        
          
            
          
        
        
          
            if
            ⁢
            
              
            
            ⁢
            
              PreSAT
              ⁡
              
                (
                
                  
                    β
                    1
                  
                  ⁢
                  
                    
                  
                  ⁢
                  is
                  ⁢
                  
                    
                  
                  ⁢
                  negative
                  ⁢
                  
                    
                      
                    
                    ⁢
                    
                      
                    
                  
                  ⁢
                  slope
                
                )
              
            
          
        
      
      
        
          
            L
            min
          
        
        
          if
        
        
          SAT
        
      
    
  













3. Compendium of WiSAT Parameters
We recommend a parameterized implementation of WiSAT in order to be able to tune parameters of two types, for implementation of the state machine:
Implementation of States
State memory and management s
State smoothing rates α0, α1, α2 
s(t)
{tilde over (s)}(t)
N(t) and parameters for computing N: N0, NSAT, β2, γ
Implementation of transitions for each state transition (i,j)
oij,õij relational parameters ≦ and > for s(t),s(t) respectively
δij,{tilde over (δ)}ij threshold parameters for s(t),s(t) respectively
rij logical relational operator AND,OR
For example, we have performed simulation of the WiSAT and mitigation policies (however with only with simulated decision of mitigation, without really intervening in the control loop to drop any packets) on the example state machine before, with the following parameters:
WiSAT classifier learned using a linear SVM, with features aggregated over periods of 10 readings of 100 msec, i.e. over windows of 1 sec;
WiSAT classifier is able to take a decision every 100 msec; therefore the window (time step) W for WiSTATS and decision making is 100 msec
WiSAT classifier function: β=β0=α1=α2=0.1;
State transition conditions (logic) Cij (i,j=0, 1, 2) given in the example
Classifier distance (WiSAT function) parameters for the state transitions: {tilde over (δ)}0,δ0,{tilde over (δ)}1,{tilde over (δ)}2,ε given in the example have the following values:
{tilde over (δ)}0=2.1,δ0=2.1,{tilde over (δ)}1=2.0,{tilde over (δ)}2=1.0,ε=0.5
N algorithm parameters N0=45, NSAT=2, β2=43/({tilde over (δ)}1−2.8), γ={tilde over (δ)}1 
A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims.

## Claims

1. A method for measuring a degree of packet congestion on a channel of a packet communication network, comprising:
simulating a degree of packet congestion on a channel of a packet communication network, the packet communication network having a plurality of measurable features;
repeatedly varying each of the plurality of measurable features of the packet communication network and simulating the degree of packet congestion on the channel of the packet communication network a predetermined number of times to determine a mathematical relationship between the degree of packet congestion on the channel and each varied measurable feature of the network;
periodically measuring the plurality of measurable features during a subsequent normal operating mode of the packet communication network; and
applying the mathematical relationship to the periodically measured plurality of measurable features to determine an actual degree of congestion on the channel of the packet communication network.

2. The method of claim 1 wherein the degree of packet congestion on the channel is a saturation level of the channel.

3. The method of claim 2 wherein the saturation level is a function of packet arrival rate at a receiver on the channel and total packet throughput on the channel.

4. The method of claim 3 wherein the function is that if there is a set of decreases in the packet arrival rates at each receiver that produces an increase in the total throughput, the channel is at the saturation level of the channel.

5. The method recited in claim 1 wherein the packet communication network is an 802.11 wireless network.

6. The method recited in claim 1 wherein the actual degree of congestion on the channel is compared to a predetermined threshold.

7. The method recited in claim 6 wherein packet traffic is controlled or shaped to reduce packet congestion if the actual degree of congestion on the channel exceeds the predetermined threshold.

8. The method recited in claim 7 wherein packet traffic is controlled by adjusting present packet traffic to mitigate congestion.

9. The method recited in claim 1 wherein the varied measurable features of the network comprise at least one of:
a system loading in numbers of client VoIP/Video stream stations;
a channel quality in terms of Frame Error Rate under various corresponding signal-to-noise ratios;
a level of interference; and
a traffic type.

10. The method recited in claim 1 further comprising:
determining which of noise, congestion, or both noise and congestion are main causes of packet congestions; and
predicting packet congestion based on a classification approach utilizing a boundary of saturated and unsaturated points throughout all simulations.

11. A method for measuring packet congestion comprising:
an access point simulating a degree of packet congestion on a channel of a packet communication network, the packet communication network having a plurality of measurable features;
the access point repeatedly varying each of the plurality of measurable features of the packet communication network and simulating the degree of packet congestion on the channel of the packet communication network a predetermined number of times to determine a mathematical relationship between the degree of packet congestion on the channel and each varied measurable feature of the network;
the access point periodically measuring the plurality of measurable features during a subsequent normal operating mode of the packet communication network; and
the access point applying the mathematical relationship to the periodically measured plurality of measurable features to determine an actual degree of congestion on the channel of the packet communication network.

12. The method of claim 11 wherein packet traffic is controlled by adjusting present packet traffic to mitigate congestion.

13. The method of claim 11 wherein the method further comprises:
the access point determining which of noise, congestion, or both noise and congestion are main causes of packet congestions; and
the access point predicting packet congestion based on a classification approach utilizing a boundary of saturated and unsaturated points throughout all simulations.

14. A method for measuring packet congestion comprising:
an access point simulating a degree of packet congestion on a channel of a packet communication network, the packet communication network having a plurality of measurable features;
the access point repeatedly varying each of the plurality of measurable features of the packet communication network and simulating the degree of packet congestion on the channel of the packet communication network a predetermined number of times to determine a mathematical relationship between the degree of packet congestion on the channel and each varied measurable feature of the network;
the access point periodically measuring the plurality of measurable features during a subsequent normal operating mode of the packet communication network; and
the access point applying the mathematical relationship to the periodically measured plurality of measurable features to determine an actual degree of congestion on the channel of the packet communication network; and
wherein the degree of packet congestion on the channel is a saturation level of the channel, and the saturation level is a function of packet arrival rate at a receiver on the channel and total packet throughput on the channel.

15. The method of claim 14 wherein the function is such that if there is a set of decreases in the packet arrival rates at each receiver that produces an increase in the total throughput on the channel, the channel is at the saturation level of the channel.