Mmpp analysis of network traffic using a transition window

Abstract

Data communication in network traffic is modeled in real time and is analyzed using a 2-state Markov modified Poissen process (MMPP). The traffic inter-arrival times for bursty and idle states define a transition window [λ 1 max , λ 2 min ] represented by the boundary values λ 1 max max for the inter-arrival time for bursty traffic, and λ 2 min for the inter-arrival time for idle traffic. Changes in the values of λ 1 max and λ 2 min are tracked over time, and the size of the transition window is enlarged or decreased based upon relative changes in these values. If the inter-rival times for the bursty state and the idle state become approximately equal, the model defaults to a single state model. The modeling is applicable to the synchronization of polling and blocking in a low-latency network system. This permits the adoptive selection of poll or block to maximize CPU utilization and interrupt latency.

1 . An article comprising a computer-readable medium which stores computer-executable instructions for processing traffic flow patterns associated with network data transmission, the instructions, when executed on a computer, causing a machine to: 
 a) receive traffic pattern data associated with the network transmission of data packets relating to the times of arrival of network data packets;    b) apply a Markov modulated Poisson process (MMPP) algorithm to the received pattern; and    c) repeat the steps a) and b) one or more additional times at different time levels.    
   
   
       2 . The article according to  claim 1  wherein the medium includes instructions for the synchronization of polling and blocking in a low-latency network system.  
   
   
       3 . The method of using a transition window [λ 1   max , λ 2   min ] based on a Markov modulated Poisson process (MMPP) model to implement a poll-block policy, comprising the steps of: 
 a) measuring the traffic pattern to use as a reference by recording the time stamp of two consecutive packets (t 2  followed by t 1 ) and calculating the time interval between packets as λ i =t 1 −t 2 ;    b) predicting the delay of an incoming message based on the measured traffic pattern; and    c) if the traffic is within the transition window, implementing a poll(tp)block policy which switches from polling to blocking when λ i  is greater than λ 2   min  and from blocking to polling when λ i  is less than λ 1   max .    
   
   
       4 . The method according to  claim 3  wherein the value of λ 1   max  is set the same as the value for an interrupt latency.  
   
   
       5 . The method according to  claim 3  further including the use of the poll-block policy to optimize CPU utilization (U cpu ) by: 
 establishing a deadline U d  for the maximum value of U cpu  below which the arrival latency is minimized;    checking the current U cpu ; and    setting the parameter λ 1   max  to a specified reference value λ 1   max-ref  if the utilization is below U d , or setting the parameter λ 1   max  to a modified reference value of λ 1   max-ref  that is proportional to the ratio of the current CPU utilization and the deadline value U cpu /U d .