Abstract:
A reliable system and method is provided for approximating a required network capacity for inhomogeneous self-similar traffic sources in a multimedia packet network. A diffusion model is first constructed for the multimedia packet network, the diffusion model assuming an input process representing the traffic sources is a sum of a plurality of independent fractional Gaussian noise processes with a plurality of corresponding Hurst parameters. A predetermined Weibull function contained in the diffusion model is then approximated, and the acceptance of a new traffic source is determined based on a predetermined packet loss probability parameter contained in the diffusion model.

Description:
BACKGROUND OF THE INVENTION 
     The present invention relates generally to packet-based networks, and more particularly, to a method and system for managing inhomogeneous self-similar traffic sources. 
     Call Admission Control (CAC) is a preventive method to avoid packet traffic congestion and to deliver required quality of services. In general, in the absence of an efficient CAC mechanism, packet dropping may increase without bounds, causing undesirable speech clipping or even call dropping. Undoubtedly, packet dropping probability is an important criterion in evaluating wireless/cellular packet communications. Packet access requests from ongoing calls are given priority over new call packet access by using a time out mechanism for new calls. New calls waiting more than a given amount of time are denied access to the resource and are cleared from the system. This scheme achieves graceful degradation in packet dropping for existing calls under heavy load conditions, while blocking most new calls. Packet dropping may increase drastically when more users become active. Efficient call admission control algorithms must be used to limit the packet dropping probability for ongoing calls to an adequately selected threshold while offering higher utilization of the scarce radio resource. 
     It is well known that Ethernet local area network (or “LAN”) traffic is statistically self-similar and is characterized by fractal-like behavior. As a result, such traffic exhibits scale-invariance which differs from traditional models of network traffic. It is also well-known that self-similarity degrades the network performance by requiring large queuing buffers, causing delay and packet dropping problems, as well as causing congestion problems. It is further known that the degree of self-similarity for an Ethernet LAN increases with higher loads. As a result, traditional queuing theory proved inadequate to predict performance. For example, ATM switch vendors once assumed that data traffic is a multiplex of a large number of independent traffic streams. Such an assumption resulted in a Poisson process and, as a result, the vendors produced switches with relatively small buffers on the order of 10-100 cells. However, in use, cell losses were beyond that expected and, as a result, the switches had to be redesigned. 
     It is also known that a traditional Poisson assumption can not adequately represent the state of art packet network environment. It is further known that the total capacity is not merely a summation of individual traffic sources. How to implement a realistic Call Admission Control (CAC) to admit n+1 traffic sources when there are n traffic sources existing is a common concern. 
     Various approaches have been done to search for an improved Call Admission Control mechanism based on a required capacity of the network. A CAC algorithm based on a required capacity for self-similar traffic was proposed by Wang and Erramilli in Globecom Conference in December 1999. The proposed algorithm is based on a “Scaling Law.” The major defect to this approach is that when a new source added, it is likely that the total required capacity is to be reduced. Referring to  FIG. 1 , two 2-dimensional plots are constructed having a number of sources as the X axis and a estimated required capacity as the Y axis. The plotted line labeled with “H1” represents the condition that the sources are nonhomogeneous, while “H2” is for the homogeneous sources. It is evident, that according to this approach, when the number of sources increases above 8, the required capacity actually drops. This is clearly wrong, and the unreliability of this approach remains to be improved. On the other hand, the algorithm attempts to handle homogeneous sources (i.e., all the involved sources have a same Hurst parameter). This restriction significantly limits the application of this algorithm since the existence of nonhomogeneous sources is a matter of fact. 
     What is needed is a reliable Call Admission Control mechanism based on required capacity that can reliably deal with nonhomogeneous self-similar traffic sources. 
     SUMMARY OF THE INVENTION 
     A reliable system and method is provided for approximating a required network capacity for inhomogeneous self-similar traffic sources in a multimedia packet network. In one embodiment, a diffusion model is first constructed for the multimedia packet network, the diffusion model assuming an input process representing the traffic sources is a sum of a plurality of independent fractional Gaussian noise processes with a plurality of corresponding Hurst parameters. A predetermined Weibull function contained in the diffusion model is then approximated, and the acceptance of a new traffic source is determined based on a predetermined packet loss probability parameter contained in the diffusion model. 
     In essence, when determining whether a new traffic source should be accepted or not, a desired level of Packet Loss Probability ε(N) is first identified, and a required capacity C N  is then obtained to accommodates N traffic sources. If C N  is less than a predetermined available capacity C 0 , then the new traffic source will be accepted, if not, it will be rejected. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  illustrates two 2-dimensional plots constructed demonstrating the relation between a number of sources and an estimated capacity according to the prior art. 
         FIG. 2  is a diagram of an exemplary network for implementing one emboidment of the present invention. 
         FIG. 3  illustrates two 2-dimensional plots demonstrating the relation between a number of sources and an estimated capacity according to one example of the present invention. 
     
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENT 
     The present invention relates to packet data networks and system and methods used therein. The present disclosure provides many different embodiments, or examples, for implementing different features of the invention. The following examples, components, and processes are described to help clarify the invention. These are, of course, merely examples and are not intended to limit the invention from that described in the claims. 
     Referring now to  FIG. 2  of the drawings, the reference numerals  10  designates, in general, a simplified packet network. The network may be the Internet, or any other type of network or combination of networks. The networks  10  includes two servers  12 ,  14  connected in the present example by a backbone  16 . Two nodes  18 ,  20  connect to the two servers  12 ,  14 , respectively. Each of the nodes  18 ,  20  and servers  12 ,  14  include a processing subsystem and memory for performing various tasks. In some embodiments, the procssing subsystems and memory for any node or server may be distributed throughout the network  10 . Furthermore, node  18  can call node  20  by making a connection to the server  12 , through the backbone  16 , and further to the server  14 . 
     The present disclosure provides an improved Call Admission Control mechanism is disclosed based on fractional Brownian motion model, such as may be operable in the network  10  of FIG.  2 . The fractional Brownian motion model is well known in the industry and the study of which can be found in many scientific literatures including B. B. Mandelbrot, Fractional Brownian Motions, Fractional Noises and Application, SIAM Rev., 10, 1968, which is incorporated herein by reference. In essence, when determining whether a new traffic source should be accepted or not, a desired level of Packet Loss Probability ε(N) is first identified, and a required capacity C N  is then obtained to accommodates N traffic sources. If C N  is less than a predetermined available capacity C 0 , then the new traffic source will be accepted, if not, it will be rejected. 
     Using a diffusion approximation model, assuming that an input process is a sum of N independent fractional Gaussian noise processes with different Hurst parameters, or mathematically: 
         A   ⁢           ⁢     (   t   )       ≡       ∑     i   =   1     N     ⁢           ⁢       A   i     ⁢           ⁢     (   t   )             
 
where A i (t) has a mean of m i , and a variance of σ i   2 =a i m i |t| 2H     i   , with a Hurst parameter H i . The diffusion approximation model is known in the industry and described in detail in I. Norros, Studies for a Model for Connectionless Traffic Based on Fractional Brownian Motion, Conference on Applied Probability in Engineering, Computer and Communication Sciences, Paris, June 1993, which is herein incorporated by reference. Further from the diffusion approximation model, the Packet Loss Probability is: 
         ∈     =       Pr   ⁡     [       V   ⁢           ⁢     (   t   )       &gt;   x     ]       ≥       Max     t   ≥   0       ⁡     [     Q   ⁢     {       x   +       (     C   -   m     )     ⁢           ⁢   t       σ     }       ]             ,       
 
where A(t) has a mean of 
         m   =       ∑     i   =   1     N     ⁢           ⁢     m   i         ,       
 
and a variance of 
           σ   2     =         ∑     i   =   1     N     ⁢           ⁢     σ   i   2       =       ∑     i   -   1     N     ⁢           ⁢       a   i     ⁢           ⁢     m   i     ⁢           ⁢          t          2   ⁢           ⁢     H   i                 ,       
 
and Q is the Weibull function.
 
     The Weibull function Q can be approximated by the following formula: 
         Q   ⁢           ⁢     (   x   )       =     e       -     x   2       2           
 
Hence, the Packet Loss Probability 
         ∈     ≥         Max     t   ≥   0       ⁡     [     e     -       (       x   +       (     C   -   m     )     ⁢           ⁢   t       σ     )     2         ]       ⁢           ⁢   where   ⁢           ⁢     σ   2           =       ∑     i   =   1     N     ⁢           ⁢       a   t     ⁢           ⁢     m   i     ⁢           ⁢            t          2   ⁢           ⁢     H   i         .             
 
     By reversing the immediate above equation for the Packet Loss Probability, for a predetermined Packet Loss Probability, using the above approximation form for the Weibull function, a capacity can be determined as follows: 
     Since ε&lt;1, so ln ε&lt;0. Thus, 
         -   ln     ∈     ≤       Min     t   ≥   0       ⁢           ⁢       (       x   +       (     C   -   m     )     ⁢           ⁢   t       σ     )     2             
               ⁢     Thus   ,     C   ≥       Max     t   ≥   0       ⁢     {     m   +       1   t     ⁡     [       -   x     +       {       (       -   ln     ∈     )     ⁢           ⁢     σ   2       }       1   /   2         ]         }               
 
Assume that the system already has N−1 connections, the Nth connection will be accepted if the above equation is satisfied. The relation among all variables can be represented in the following function: 
         f   ⁢           ⁢     (     t   ,   H     )       =     m   -     x   t     +            t          (     H   -   1     )       ⁢       {       (       -   ln     ∈     )     ⁢           ⁢     (       ∑     i   =   1     N     ⁢           ⁢       a   i     ⁢           ⁢     m   i         )       }       1   /   2               
 
wherein, at a high level, it is understood that m represents a mean value, x represents a buffer size, and the last complex component on the right hand side of the plus sign of the equation represents a measurement of self-similarity. Notice that for 
             f   N     ⁢           ⁢     (   t   )       ≡     m   +       1   t     ⁡     [       -   x     +       {       (       -   ln     ∈     )     ⁢           ⁢     (       ∑     i   =   1     N     ⁢           ⁢       a   t     ⁢           ⁢     m   i     ⁢           ⁢          t          2   ⁢           ⁢     H   i             )       }       1   /   2         ]           ,     
     ⁢           f   N     ⁢           ⁢     (   t   )       -       f     N   -   1       ⁢           ⁢     (   t   )         =         (       -   ln     ∈     )       1   /   2       ⁢     {         (       ∑     i   =   1     N     ⁢           ⁢       a   i     ⁢           ⁢     m   i     ⁢           ⁢          t          2   ⁢           ⁢     H   i             )       1   /   2       -       (       ∑     i   =   1       N   -   1       ⁢           ⁢       a   i     ⁢           ⁢     m   i     ⁢           ⁢          t          2   ⁢           ⁢     H   i             )       1   /   2         }         ,       
 
where a i &gt;0, m i &gt;0, t&gt;0, and 0.5≦H i ≦1.
 
     Since the function y=√{overscore (a−x)}−√ā is positive when x&gt;0 and a&gt;0, so f N (t)−f N−1 (t)&gt;0. That is, the function f N (t) above increases as N increases. Consequently, the present invention avoids the above-mentioned unstability defect suffered by the Scaling Law Call Admission Control algorithm. 
     Consider now a function of a form of: 
           g   ⁢           ⁢     (   t   )       =     m   +         -   x     +     at   H       t         ,       
 
where m, x, a and H are positive constants, with 0.5≦H≦1. In a geometrical representation, this function is a shift along an axis by the amount of m of the function 
           f   ⁢           ⁢     (   t   )       =         -   x     +     at   H       t       ,       
 
In the neighborhood of zero for the value of t, the portion 
         -   x     t       
 
dominates f(t), while when t is large, the portion 
       a     t     1   -   H           
 
dominates f(t). Since 
         -   x     t       
 
is negative when t=0, and as 
       a     t     1   -   H           
 
is positive for large t, so f(t) crosses the t-axis at some point t=t 0 . Therefore, 
         t   0     =         (     x   a     )       1   /   H       .         
 
     In order to find the maximum value of f(t), a derivative of f(t) can be taken, set it equal to zero, and then solve for t. That is, 
             f   ′     ⁢           ⁢     (   t   )       =         x   +     a   ⁢           ⁢     (     H   -   1     )     ⁢           ⁢     t   H           t   2       =   0       ,           ⁢       so   ⁢           ⁢   t     =       (     x     a   ⁢           ⁢     (     1   -   H     )         )       1   /   H             
 
Let it be defined that 
           T   i     ≡       (     x       (     1   -     H   i       )     ⁢           ⁢         (       -   ln     ∈     )     ⁢           ⁢     (       ∑     j   =   1     N     ⁢           ⁢       a   j     ⁢           ⁢     m   j         )             )       1   /     H   i           ,       
 
and let
 
 T   min   ≡Min   1≦i≦N   {T   i }
 
 T   max   ≡Max   1≦i≦N {T i }, 
 
then the solution t=t Max  satisfying 
         Max     t   ≥   0       ⁢     {     m   +       1   t     ⁡     [       -   x     +       {       (       -   ln     ∈     )     ⁢           ⁢     (       ∑     i   =   1     N     ⁢           ⁢       a   i     ⁢           ⁢     m   i     ⁢           ⁢          t          2   ⁢           ⁢     H   i             )       }       1   /   2         ]         }         
 
would be in the interval [T min , T max ], i.e. T min ≦t Max ≦T Max .
 
     Substituting t Max  into 
           C   N     ⁢           ⁢     (   t   )       ≡     {     m   +       1   t     ⁡     [       -   x     +       {       (       -   ln     ∈     )     ⁢           ⁢     (       ∑     i   -   1     N     ⁢           ⁢       a   i     ⁢           ⁢     m   i     ⁢           ⁢          t          2   ⁢           ⁢     H   i             )       }       1   /   2         ]         }         
 
would result in 
               C   N     ≡       ⁢       C   N     ⁢           ⁢     (     t   Max     )                   =       ⁢       Max     t   ≥   0       ⁢     {     m   +       1   t     ⁡     [       -   x     +       {       (       -   ln     ∈     )     ⁢           ⁢     (       ∑     i   =   1     N     ⁢           ⁢       a   i     ⁢           ⁢     m   i     ⁢          t          2   ⁢           ⁢     H   i             )       }       1   /   2         ]         }                 
 
where C N  is the required capacity for N traffic sources to be admitted to the network.
 
     It is further noted that in the case of homogeneous traffic sources, then T min =T max , in which case the solution t=t Max  satisfies t=t Max =T min =T max . 
     An example representing the Call Admission Control algorithm described above is shown in  FIG. 3  below. This example uses parameters x=0, n=10, ε=0.01, with the arrays m and a given by
         m=[0.1, 0−0.07, 0.05, 0.1, 0.11, 0.08, 0.06, 0.09, 0.12, 0.075]   a=[0.05, 0.09, 0.07, 0.1, 0.08, 0.11, 0.09, 0.12, 0.06, 0.075]
 
and the different Hurst parameters for the 10 traffic sources as
   H=[0.95, 0.90, 0.90, 0.90, 0.85, 0.95, 0.90, 0.85, 0.95, 0.850]
 
for the self-similar curve, and H 2 =0.5 for the non-self-similar case.
       

     The present invention is capable to handle inhomogeneous self-similar traffic sources and avoids the instability that is inherent for the Scaling Law Call Admission Control mechanism as described. 
     While the invention has been particularly shown and described with reference to the preferred embodiment thereof, it will be understood by those skilled in the art that various changes in form and detail may be made therein without departing from the spirit and scope of the invention, as set forth in the following claims.