|Numéro de publication||US7826351 B2|
|Type de publication||Octroi|
|Numéro de demande||US 11/966,286|
|Date de publication||2 nov. 2010|
|Date de dépôt||28 déc. 2007|
|Date de priorité||16 avr. 2003|
|État de paiement des frais||Payé|
|Autre référence de publication||US7330427, US20040208127, US20080013449, US20080101228|
|Numéro de publication||11966286, 966286, US 7826351 B2, US 7826351B2, US-B2-7826351, US7826351 B2, US7826351B2|
|Inventeurs||Jorge R. Rodriguez, Kaiqi Xiong|
|Cessionnaire d'origine||International Business Machines Corporation|
|Exporter la citation||BiBTeX, EndNote, RefMan|
|Citations de brevets (12), Citations hors brevets (7), Référencé par (3), Classifications (12), Événements juridiques (2)|
|Liens externes: USPTO, Cession USPTO, Espacenet|
This application is a continuation of application Ser. No. 10/417,467, filed Apr. 16, 2003, now U.S. Pat. No. 7,330,427 B2.
The present application is related to the following U.S. patent applications: U.S. Ser. No. 09/607,013 filed Jun. 29, 2000, entitled “Method and System for Reducing Latency in Message Passing Systems, now U.S. Pat. No. 7,615,005 U.S. Ser. No. 09/607,113, filed Jun. 29, 2000, for “Method and System for Predicting Inter-Packet Delays” now abandoned, and U.S. Ser. No. 10/417,468, filed Apr. 16, 2003, for “Multilevel Analysis of Self-Similar Network Traffic”. The content of these cross-referenced applications is hereby incorporated herein by reference.
This invention relates in general to the field of computer technology, and particularly to systems for the transfer of data. More specifically, the invention relates to the real-time modeling and analysis of the data communication aspect of network traffic.
The flow of information in a network is often called ‘traffic’. Units of information used in network communication are referred to as ‘packets’. Packets generally arrive at a point in the network at random intervals resulting in ‘bursts’ of traffic, causing congestion and ‘idle’ periods in which traffic is somewhat more sparse.
Systems that use a network for communication can benefit from the analysis and characterization of the network traffic to optimize the critical performance parameters that are involved in that communication. An example of the application of this type of analysis is the synchronization of a user process with the completion of the receive operation at the system to network interface. A common design problem with this process is the need to determine when the receive data is available at the input buffers. The method of synchronization used can directly affect the latency of the receive operation and the utilization of the host computer processor. One way to do the analysis of the network traffic is to provide a model that recognizes the characteristics of the network traffic. Since network traffic has been shown to be bursty, a method used to analyze network traffic should be able to represent behavior that is bursty.
Different methods are known for analyzing and characterizing network traffic. The Poisson Process is widely utilized to model aggregate traffic from voice sources. Bursty traffic has been shown to be approximated by a Markov modulated Poisson process (MMPP). An MMPP model can be a very effective means to provide effective network traffic analysis of data communication, either in batch mode or, preferably, in real time.
Low-latency network architectures provide special mechanisms to improve the performance of the network interconnect in message-passing systems. The synchronization of the user process with the completion of the receive operation at the network interface card (NIC) has the common design problem that it needs to be determined when receive data is available at the input buffers. One of the mechanisms used for synchronization is interrupts (blocking), but the problem with interrupts is that they can add to the cost of synchronization with excessive latency and CPU utilization. Polling is a mechanism intended to help reduce the high latency of interrupts by polling on a completion signal as an alternative to waiting for an interrupt as a method to synchronize the user process with the completion of the receive operation. If the polling is done from user space, then the time needed for kernel transitions is saved, thus reducing the latency of the operation even further. The polling operation, however, uses the host processor during the time it is polling the completion flag. Therefore, if the message arrival delay exceeds the interrupt time, then the increase in host processor utilization will actually have a negative impact on the performance of the application. It becomes necessary to select between polling and blocking (waiting for the interrupt) depending on the delay of the message. Therefore, two important concerns regarding the performance of the network interconnect are the overall latency of the message communication and the CPU overhead involving the send and receive primitives. The goal is to balance the latency requirements with the host processor utilization requirements to obtain the best performance for the various arrival patterns experienced at the NIC receive input port.
The present invention describes a method for the real-time analysis of network traffic based on a 2-state MMPP model The method can be used at the user-network interface during data transfer for the synchronization of a user process with the completion of the receive operation. A transition window [λ1 max, λ2 min] is used to analyze the state transition parameters corresponding to the packet inter-arrival time between the bursty state and the idle state.
Among the advantages of using this transition window are:
a) the accuracy of the selection; b) the ability to use dynamic algorithms that are adaptive to the workload; and c) the flexibility of the dynamic algorithms to adaptively adjust the burst length (busty state) to satisfy the requirements of the user process. Further advantages of the present invention include, for example, 1) a reduction in system storage requirements, since it is not necessary to store all received packets for further off-line analysis; 2) immediate real-time availability of information from the analysis for administrative and management purposes to identify or alleviate network problems; 3) availability of current usage information when resources, such as memory buffers or communication bandwidth, are otherwise allocated to support specific services; and 4) a reduction of dependency on human intervention, allowing for the fully automated future network management systems.
The invention includes a method and a system for adaptively analyzing communication of packets of data in a network traffic using a 2-state MMPP model. The inter-arrival λi time of individual data packets is determined, as well as whether the packet arrival rates are ‘bursty’ (λ1) representing heavy traffic conditions or ‘idle’ (λ2) representing light traffic conditions. A transition window is established with the values λ1 max and λ2 min representing the transition between bursty traffic and idle traffic. The probability ρ is determined as to whether a packet inter-arrival time is occurring in bursty traffic ρ1 or in idle traffic ρ2. The analysis of network traffic can be carried out in real-time. Typically, the bursty packet inter-arrival time has a mean value of λ1 mean, the idle packet inter-arrival time has a mean value of λ2 mean, and the traffic characteristics are such that λ1 mean<<λ2 mean. As the value for λ1 mean begins to approximate the value for λ2 mean, the model can be set to default to a single state MMPP model. Changes in the values of λ1 max and λ2 min can be tracked over time and the size of the transition window can be enlarged or decreased based upon relative changes in these values.
The understanding of the present invention is facilitated by reference to the following flow diagrams, timing diagrams and other drawings as follows.
An illustration of a 2-state MMPP model is shown in
For the 2-state MMPP model to be a valid representation of the network traffic, the behavioral characteristics of the traffic are such that λ1 mean<<λ2 mean. In the model, the traffic inter-arrival times for the bursty and idle states are represented by the boundary values λ1 max and λ2 min respectively. For the special case where λ1 mean is approximately equal to λ2 mean the model defaults to a single state model. This is explained in greater detail below. These values are used as the transition criteria between bursty and idle states, as shown in
Since the representation of the network traffic in a model is an approximation, the length of the burst during state P1 is an approximation with burst edges that are defined somewhat arbitrarily. In practice, the burst length is defined to satisfy the requirements of the user process. For example, in the synchronization of a user process with the completion of the receive operation at the system to network interface, the burst length is defined to aid in the selection between polling and blocking, in which case the burst length is determined by the interrupt latency time. As previously noted, the traffic inter-arrival times for the bursty and idle states are represented by the boundary values λ1 max and λ2 min, respectively. These boundary values define a transition window [λ1 max, λ2 min] that has as the left side the parameter λ1 max and the right side the parameter λ2 min. The parameter λ1 max determines an upper boundary for the packet inter-arrival time for the bursty state while λ2 min is the parameter that determines a lower boundary for the packet inter-arrival time for the idle state. For the bursty state, λ1 max defines the probability p1 that a packet with inter-arrival time lower than λ1 max belongs to the bursty state. Similarly, for the idle state, λ2 min defines the probability p2 that a packet with inter-arrival time higher than λ2 min belongs to the idle state. Based on these probabilities, a decision can be made for each arriving packet of the particular state transition induced by the arrival.
Algorithms are described that allow the model to track changes in the network traffic dynamically. As the network traffic characteristics change over time, the mean inter-arrival times for the bursty state (λ1 mean) and for the idle state (λ2 mean) also change over time. For the model to track these changes over time, the values λ1 max and λ2 min change in proportion to the changes in the traffic. The time values λ1 max and λ2 min define the sides of a transition window of length k=λ2 min−λ1 max. The size of the transition window [λ1 max, λ2 min] can be changed dynamically to be used in adaptive algorithms that control the process transition between states. For implementation in an algorithm used in that fashion, the transition window [λ1 max, λ2 min] can become larger or smaller by changing the value of λ2 min and λ1 max accordingly. The specific value of the parameters used depends on the specific application of the algorithm.
Examples of the use of this algorithm are:
a) the model adapts dynamically to changes in the workload, and
b) the burst length (bursty state) is adjusted to satisfy the requirements of the user process.
Although typically the network traffic can be characterized as being bimodal and thereby described by the MMPP model, a special case occurs under light traffic conditions where the network traffic can be characterized by a simple Poisson distribution. As traffic intensity goes down, the mean inter-arrival time λ1 mean of the bursty state approaches that of the idle state inter-arrival time λ2 mean to the point where the two are no longer distinguished by the model. When the characteristics of the traffic are such that λ2 mean approximately equals λ1 mean, a single state in the MMPP model is used to represent the network traffic.
Packet arrivals and inter-burst transitions are detected in the following manner. Assume that packet Pi-1 presently belongs to burst state P1. Then, the task is to detect whether packet P1 belongs still to burst state P1 or to the idle state p2. The detection logic compares the incoming packet inter-arrival time λi with λ1 max and λ2 min. This is illustrated in
Case 1. λi<λ1 max<λ2 min: Pi is detected to belong to burst state P1.
Case 2. λi>λ2 min>λ1 max: Pi is detected to belong to idle state P2.
Case 3. λ1 max<λi<λ2 min: Pi is detected to be inside of the transition window [λ1 max, λ2 min] In this case, the next state transition which is selected is dependent upon the user process requirements. As will be shown, this method can be applied to improve the performance of the network attached devices. In particular, application of the transition window approach to manage the synchronization process in low-latency, high-bandwidth networks will be shown.
Case 4. λi<λ1 max and λi>λ2 min: This is not a valid combination because both cannot occur with λ1 max being smaller than λ2 min.
In this algorithm, it is not necessary to compute the mean inter-arrival time for the burst state and for the idle state after every arrival. If it is required to realize certain savings in computation for performance reasons, it is possible to do the computation of the mean inter-arrival time and to readjust the value of λ1 max and λ2 min upon receipt of every X number of packets, where X can be specified. The justification of this algorithm is explained as follows.
First, check 406 the inter-arrival time λi 402 for the incoming packet. If the packet time is as indicated with a value that is less than λ1 max and λ2 min, the probability is that it is belongs in burst packet P1 408. If the value is greater than λ1 max and λ2 min, the probability is that it belongs in the idle packet p2 510. If the inter-arrival time λi 402 for the incoming packet is within the transition window [λ1 max, λ2 min] (Case 3), then the flow goes to 412, where a check is made of the current measurement and a decision is made whether to go to state P1 for bursty or to P2 for idle That decision is entirely application dependent. The decision as to whether the packet is bursty or idle goes into state memory 418. A reference value is given for the mean inter-arrival time in the bursty state λ1 mean-ref and a reference value for the mean inter-arrival time in the idle state λ2 mean-ref. This gives the reference value for the transition window parameters [λ1 max-ref, λ2 min-ref]. Assume the network traffic characteristics change so that the mean inter-arrival time of the new traffic in the bursty state is λ1 mean-new (420) and the new mean inter-arrival time in the idle state is λ2 mean-new (422). Define the probability p1 that a packet with inter-arrival time lower than λ1 max belongs to the bursty state. Define the probability p2 that a packet with inter-arrival time higher than λ2 min belongs to the idle state. This usually is defined so that p1<<p2.
If λ1 mean-new =N*λ 1 mean-ref and λ2 mean-new =M*λ 2 mean-ref, then the new transition window is determined at 428 and 430 as
[λ1 max-new =N*λ 1 max-ref, λ2 min-new =M*λ 2 min-ref].
This is based on principles that can be proven mathematically by equating the integral of the exponential distribution with a mean value λ1 mean-ref from λ1 max-ref to infinity to the probability p1. Then, the integral of the exponential distribution with a mean value N*λ1 mean-ref to infinity is also equal to p1. From this follows the desired results. A similar derivation can be followed for the idle state.
The present invention also relates to the use of a transition window and an MMPP in a low-latency network user process synchronization in the following manner. Some of the policies for the implementation of polling and blocking (waiting for interrupts) are the optimal policy, the poll policy (or spin policy), the block (or wait for interrupt) policy and the poll-block policy. The following provides a summary of performance for the various policies. The symbols listed below are used:
λd=the message arrival delay time (since the start of the synchronization period),
tLAT=receive latency (can exceed the arrival delay time),
tLAT-BOUND=bound for the receive latency,
tOH=the processor overhead due to polling and/or interrupt processing (time period),
tOH-BOUND=bound for the processor overhead,
tp=polling time: poll (tp).
tBLK=interrupt overhead time.
With the optimal policy, the receiving process can predict the delay of the expected message. If the delay is less than the interrupt overhead, then the process polls on a completion flag and the latency is minimized. If the delay is more than the interrupt overhead, then the process will block (will wait until it is interrupted) and excessive overhead due to polling is avoided. In practice, this policy is not realizable because there is no way that the process can predict exactly what the delay is for the expected message (although it can be approximated.) However, the optimal policy provides a good baseline for other methods that have as a goal to get as close to this bound as possible. For the optimal policy, the processor overhead (tOH) and transaction latency (tLAT) are as follows:
if λd<tBLK, then poll:
if λd>=tBLK, then block:
With the poll policy, the receiving process polls on a completion flag. This policy can provide good performance if the receive operation completes within a reasonably short amount of time. However, polling can consume processor utilization that could otherwise be used by the application. For the poll (tp) policy, the processor overhead (tOH) and transaction latency (tLAT) are:
With the block policy, the receiving process always blocks and waits for an interrupt to complete the receive operation. This policy is good when used to overcome the limitations of polling but, for short messages and frequent message arrivals, it contributes significant latency and processor overhead. For the block policy, the processor overhead (tOH) and transaction latency (tLAT) are:
The poll-block policy does not attempt to predict the delay of the expected message, but instead attempts to “minimize its losses”. With this policy, the process polls the completion flag for a time equal to the interrupt overhead. If it has not detected completion at the end of this time period, it blocks to wait for an interrupt. This policy achieves a cost that is no worse than twice that of the optimal policy (twice the interrupt overhead delay time). For the poll (tp)-block policy, the processor overhead (tOH) and transaction latency (tLAT) are:
if λd<tBLK, then the process polls for time td and:
if λd>=tBLK, then the process polls for time λd=tp=tBLK and:
Bounding the message latency (tLAT):
tLAT=tLAT-BOUND<=λd+tBLK, if λd<tBOUND
Bounding the processor overhead (tOH)
The present invention provides a solution to the problem of deciding between polling and blocking (waiting for interrupts) with a policy that attempts to make a prediction on what the delay of the expected message is likely to be. The decision on whether to poll or to block is made based on the Markov modulated Poisson process (MMPP) model characterizing the flow of traffic to a network adapter (for receive operations). The model characterizing the traffic and the parameters of the model are provided in a table, where the task making the poll vs. block is made. The performance of this policy will be between that of the optimal policy and the poll-block policy. If the prediction accuracy approaches 100%, then the cost will be closer to the optimal policy. If the prediction accuracy approaches 0%, then the cost will be closer to the poll-block policy. The accuracy of the prediction, as noted below, depends on the traffic and how effectively the algorithm can predict the presence of bursts in the traffic and the size of these bursts. Because of the bursty nature of network traffic, this approach can do much better than the poll-block policy, but no worse.
A diagram of the selection system is shown in
There are two main cases to consider: bursty traffic or non-bursty traffic. If the traffic is bursty, then the value for the λi measurements is compared with TB at 506 and 512. If λi<TB, then polling is used and the decision is made to continue polling 506 to 502. If, on the other hand, λi>TB, then blocking is used and the decision is made to continue blocking (512 to 508) or to go from polling to blocking (506 to 508).
However, the poll-block policy can do better. If the traffic is bursty, then the transition window [λ1 max, λ2 min] is examined to see if λi>λ1 max and λi<λ2 min. If so, the λi is inside the transition window and the poll-block policy can provide better results. This occurs in the transition between states as follows:
Case 1. λi<λ1 max<λ2 min: Pi belongs to the bursty state. Therefore, poll.
Case 2. λi>λ2 min>λ1 max: Pi belongs to the idle state. Therefore, block.
Case 3. λ1 max<λi<λ2 min: Pi is inside the transition window. Therefore, poll (tp)-block.
The size of the transition window is left to the specification of the designer. However, certain guidelines need to be followed. By making the transition window tighter or smaller, the accuracy of the selection of the next state is increased. On the other hand, the window length cannot be zero because, when the window size is zero, the selection of the poll (tp)-block policy is precluded.
Several techniques illustrate the application of the invention to adaptive selection of poll vs. block when there is a deadline either for the CPU utilization or the latency. One approach for using the transition window is to fix the value of the λ1 max parameter as the same value as that specified for the interrupt latency. On the other hand, if a deadline is specified for either the CPU utilization or for the maximum latency of arrival, then the following adaptive algorithm can be used. For example, where it is desired to optimize the CPU utilization, a deadline Ud is given for a maximum value of the CPU utilization UCPU below which the arrival latency is minimized. However, for CPU utilization above this value, the goal then is to minimize the CPU utilization.
The flow chart in
While the invention has been described in combination with specific embodiments thereof, there are many alternatives, modifications, and variations that are likewise deemed to be within the scope thereof. Accordingly, the invention is intended to embrace all such alternatives, modifications and variations as fall within the spirit and scope of the appended claims.
|Brevet cité||Date de dépôt||Date de publication||Déposant||Titre|
|US5343465 *||11 juin 1993||30 août 1994||Bell Communications Research, Inc.||Method and system for real-time burstiness analysis of network traffic|
|US5583792||27 mai 1994||10 déc. 1996||San-Qi Li||Method and apparatus for integration of traffic measurement and queueing performance evaluation in a network system|
|US5848057||3 avr. 1997||8 déc. 1998||Electronics And Telecommunications Research Institute||Apparatus for estimating variable bit rate (VBR) video traffic, and method therefor|
|US5886907||31 déc. 1996||23 mars 1999||Northern Telecom Limited||Method and system for modeling aggregate multimedia traffic within a shared transmission medium|
|US6075770||20 nov. 1996||13 juin 2000||Industrial Technology Research Institute||Power spectrum-based connection admission control for ATM networks|
|US6304549||8 mai 1997||16 oct. 2001||Lucent Technologies Inc.||Virtual path management in hierarchical ATM networks|
|US6310857||16 juin 1998||30 oct. 2001||At&T Corp.||Method and apparatus for smoothing and multiplexing video data flows|
|US6377545||16 juin 1997||23 avr. 2002||Telefonaktiebolaget Lm Ericsson (Publ)||Open loop adaptive access control of ATM networks using a neural network|
|US6445707||21 avr. 1999||3 sept. 2002||Ems Technologies Canada, Limited||Broadcast rate control allocation (BRCA) for congestion avoidance in satellite ATM networks|
|US6449282||20 oct. 1998||10 sept. 2002||Swisscom Ag||Method for random-access communication with binary feedback|
|US6526259||10 avr. 2000||25 févr. 2003||At&T Corp.||Portable self-similar traffic generation models|
|US6715005||29 juin 2000||30 mars 2004||International Business Machines Corporation||Method and system for reducing latency in message passing systems|
|1||"How does TCP generate Pseudo-self-similarity?", Guo et al, Boston University, 2001 IEEE.|
|2||"The Effect of Bursty Traffic on the Performance of Local Area Networks", Khalil et al, Bellcore, 1992, IEEE.|
|3||2001 ACM Symposium on Applied Computing, entitled "The sustainable cell-rate usage control with adjustable window for high-speed multimedia communications", Chen et al., Mar. 2001, pp. 467-471.|
|4||A Real-time Algorithm for ‘Burstiness’ Analysis of Network Traffic, Khalil, Bell Communications Research, 1992, IEEE.|
|5||A Real-time Algorithm for 'Burstiness' Analysis of Network Traffic, Khalil, Bell Communications Research, 1992, IEEE.|
|6||ACM SIGCOMM Computer Communication Review, vol. 23, Issue 4, entitled "HAP: A new model for packet arrivals", Lin et al., Oct. 1993, pp. 212-223.|
|7||Institute of Electronic Engineers Journal, vol. 3, entitled "Heavy traffic multiplexing behavior of highly-bursty heterogeneous source and their admission control in high-speed networks", Sohraby, K., Dec. 1992, pp. 1518-1523.|
|Brevet citant||Date de dépôt||Date de publication||Déposant||Titre|
|US8260953 *||16 févr. 2012||4 sept. 2012||JumpTime, Inc.||Method and system for determining overall content values for content elements in a web network and for optimizing internet traffic flow through the web network|
|US9177326||21 févr. 2012||3 nov. 2015||OpenX Technologies, Inc.||Method and system for determining overall content values for content elements in a web network and for optimizing internet traffic flow through the web network|
|US20120185327 *||16 févr. 2012||19 juil. 2012||Anke Audenaert||Method and system for determining overall content values for content elements in a web network and for optimizing internet traffic flow through the web network|
|Classification aux États-Unis||370/229, 370/235, 370/235.1|
|Classification internationale||H04L12/26, H04L12/56, H04L12/24|
|Classification coopérative||H04L41/147, H04L43/0882, H04L43/0894, H04L41/142|
|Classification européenne||H04L43/08G3, H04L41/14A|
|9 avr. 2012||AS||Assignment|
Effective date: 20120327
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:INTERNATIONAL BUSINESS MACHINES CORPORATION;REEL/FRAME:028015/0882
Owner name: FACEBOOK, INC., CALIFORNIA
|2 avr. 2014||FPAY||Fee payment|
Year of fee payment: 4