Method and apparatus for communicating data within measurement traffic

Information

  • Patent Grant
  • 7756032
  • Patent Number
    7,756,032
  • Date Filed
    Wednesday, October 17, 2001
    23 years ago
  • Date Issued
    Tuesday, July 13, 2010
    14 years ago
Abstract
The present invention is directed to using measurement packets to compute network performance. Embodiments that send, receive and both send and receive measurement packets are described. Some embodiments are described that compute statistics based at least partly on measurement traffic. Some embodiments are described that communicate computed statistics within measurement traffic. Some embodiments are described that rank and select paths based at least partly on computed statistics.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


This invention relates to the field of networking. In particular, the invention relates to communicating data within measurement traffic.


2. Description of the Related Art


Internetworks such as the Internet provide a best-effort service and do not reserve resources for a path. Hence, performance characteristics of the path such as delay, jitter and loss can change over time due to routing changes, congestion, and lack of connectivity, and therefore it is important to being able to measure them. There are several tools available to measure the performance characteristics of a path:


Ping uses ICMP packets to measure reachability and round trip delay from a source host to a remote host.


Traceroute detects common reachability problems such as routing loops and network black holes by sending ICMP packets from a source host to a destination host, and by receiving ICMP responses from intermediate routers along the path between the source host and the remote host. Each intermediate router in the path decrements the TTL value stored in the header of an ICMP packet by one; when the TTL field expires (reaches the value zero) in a router, the router does not forward the packet towards the destination host. Instead, it returns the ICMP to the source host responding with a Time Exceeded response. By starting with an initial TTL value of 1 and gradually incrementing the TTL field in successive ICMP packets, the source host is able to receive an ICMP response from all the routers in the path. Traceroute also computes the round trip time of each ICMP packet, hence being able to determine the round trip delay between the source host and intermediate routers.


Pathchar measures congestion of a path by estimating performance characteristics of each node along a path from a source to a destination. Pathchar also leverages the ICMP protocol's Time Exceeded response to packets whose TTL has expired. By sending a series of UDP packets of various sizes to each hop, pathchar uses knowledge about earlier nodes and the round trip time distribution to this node to assess incremental bandwidth, latency, loss, and queue characteristics across the link connected to this node.


These tools are mainly used for troubleshooting purposes. A more formal attempt to measure performance characteristics of Internet paths is being developed by the IP Performance Metrics (IPPM) working group of the Internet Engineering Task Force (IETF). The IPPM working group has specified a general framework for measuring performance characteristics of a path, including specifications for clock synchronization and for size, number and inter-transmission time of measurement packets. The IPPM working group has also specified specific performance metrics for one-way delay, one-way inter-packet delay variation, and one-way loss, among others. The goal of the IPPM measurement framework is to allow service providers and other network providers to develop and operate and inter-operable measurement infrastructure, for performance and billing purposes, among other purposes.


However, even if this measurement infrastructure is in place, a way to communicate measurements and performance characteristics of measured paths to appropriate points of the network where decisions based on those performance characteristics can be made, is needed. In addition, this communication should be efficient, i.e., it should minimize the amount of bandwidth consumed.


SUMMARY OF THE INVENTION

The invention includes methods and apparatuses for communicating data within measurement traffic. Some embodiments of the invention will consist of a sender of measurement packets. Some embodiments of the invention will consist of a receiver of measurement packets. Some embodiments of the invention will consist of both a sender and a receiver of measurement packets.


In some embodiments of the invention, measurement packets will traverse one or more paths traversing at least a portion of an internetwork.


In some embodiments of the invention, the measurement packet will include information for a receiver of the measurement packet to compute measurements of performance characteristics of at least a portion of the path of the measurement packet. In some embodiments, the measurement packet sizes and times between measurement packets will simulate the traffic pattern of one or more applications such as—by way of a non-limiting example—voice and video.


In an embodiment that includes a receiver of measurement packets, measurement statistics may be computed that are at least partly recomputed with the arrival of each measurement packet. This computation may include at least one of a moving average, an average based on the Robbins-Moro estimator, a window-based average, and a bucket-based average.


In some embodiments of the invention, the measurement packets will contain data including one or more of measurement statistics, a generic communication channel, network information, and control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver.


In an embodiment wherein the data includes measurement statistics, the measurement statistics may include one or more of delay, jitter and loss.


Some embodiments of the invention will contain clocks synchronized by GPS, IRIG, NTP or NIST. Some other embodiments will use unsynchronized clocks and will adjust for clock skew and drift by performing computations on the measurement data.


In some embodiments of the invention, paths will be selected based at least in part on at least one of: one or more of the measurement statistics from the measurement packet and one or more of the computed statistics.


These and other embodiments are described further herein.





BRIEF DESCRIPTION OF THE FIGURES


FIG. 1 shows some possible embodiments of devices that are communicating with each other, for example sending and receiving measurement packets.



FIG. 2 shows one specific detailed embodiment of two devices, where each device is sending and receiving measurement packets as well as selecting a subset of paths.



FIG. 3 shows an embodiment with more than two devices that are sending and receiving measurement packets to obtain measurements of performance characteristics of paths and to communicate measurements statistics about those paths.





DETAILED DESCRIPTION

Measurement Packets


A measurement packet is a packet sent by a sender over an internetwork that includes information necessary for the receiver of the packet to compute measurements of the performance characteristics of the path the packet has traversed over that internetwork. The information includes information for a receiver of the measurement packet to compute measurements of performance characteristics of at least a portion of the path of the measurement packet; and data including one or more of measurement statistics, a generic communication channel, network information, and control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver.


In some embodiments of the invention, the information included in the measurement packet to compute measurements includes at least one of a timestamp of a sending time of the packet and a number to identify the packet by itself and/to identify the relative position of the measurement packet in a sequence of measurement packets,


In some embodiments of the invention, the measurement packet is implemented using the following data structure:

















struct MeasurementHeader {









/**



 * A generation number. This value represents when the



 * sender began sending. This value is a standard Unix



 * timestamp that seconds since Jan 1, 1970 UTC.



 **/



uint32_t mGeneration;



/**



 * A sequence number for the packet. This increments each



 * time a packet is sent and rolls over when 16 bits is



 * exceeded.



 **/



uint16_t mSequence;



/**



 * The IP address the packet is sent to.



 **/



uint32_t mDstAddr;



/**



 * The send timestamp for this packet.



 **/



uint64_t mSendTime;









};










The mGeneration field is used to detect when a sending process has started a new session. This field is used by the receiver to determine that a discontinuity in the stream's sequence numbers is the result of a sender restart, rather than due to large network latencies, duplicate packets or dropped packets.


The sequence number msequence field is incremented by one each time a packet is sent. This approach allows the receiver to deduce lost and duplicate packets by identifying missing and duplicate sequence numbers.


The mSendTime field contains the time at which the packet was sent, represented as microseconds since Jan. 1, 1970 UTC. This field is compared to the time the packet arrived at the receiver to determine the delay between the sender and the receiver.


In some embodiments of the invention, a plurality of one or more packets are sent over a path continuously. In some embodiments of the invention, the continuous stream of packet is denoted as a measurement stream. Each measurement stream is uniquely identified by the source and destination IP addresses. The sender maintains one socket descriptor for each source IP address it sends from and writes the destination IP address into the mDstAddr field. On the receiver side, the source IP address is returned by the recv( ) system call and the destination address is retrieved from the measurement packet.


Data Included in the Measurement Packets


In measurement packets that contain sufficient space, data will be included, including one or more of measurement statistics, a generic communication channel, network information, and control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver.


Some embodiments of the invention will add a single type of data to each packet. Some embodiments of the invention will use a complex data, including subpackets.


Some embodiments of the invention use subpackets that include a single byte subpacket type identifier, followed by a 2-byte length field (including the length of the type and length fields) and finally including the data that is to be sent. One embodiment will store all values in network byte order. Other byte orders will be apparent to those skilled in the art. The following data structure definition describes some embodiments.

















class SubPacket {









/*



 * The type identifier for this subpacket.



 */



uint8_t mType;



/*



 * The length of this subpacket, in network byte order.



 */



uint16_t mLength;









};










One embodiment of this invention will include data describing a momentary snapshot of the measurement statistics for a given path between a sender and a receiver.


In some embodiments of this invention, this data will include one or more of the following information: the source and destination IP addresses that define the path, a measurement packet size for which the statistics have been calculated as well as computed measurement statistics that are at least partly responsive to delay; computed measurement statistics that are at least partly responsive to jitter and computed measurement statistics that are at least partly responsive to packet loss.


In one embodiment of this invention, these statistics will be in units of microseconds expressed as 64-bit floating-point quantities and transmitted in a standard network byte order.


In one embodiment of this invention, the following data structure will store the computed statistics:

















class TunnelStatsSubPacket : public SubPacket {









/**



 * The time that this statistic snapshot was taken (in



 * microseconds since 1970).



 **/



uint64_t mTimestamp;



/**



 * The source IP address of the tunnel these statistics









apply









 * to.



 **/



uint32_t mSrcAddr;



/**



 * The destination IP address of the tunnel these









statistics









 * apply to.



 **/



uint32_t mDstAddr;



/**



 * The size of measurement packet that these statistics









apply









 * to. A size of 0 indicates that these statistics









apply to









 * all packet sizes.



 **/



uint16_t mPktSize;



/**



 * The average delay in microseconds.



 **/



double mDelay;



/**



 * The average jitter in microseconds.



 **/



double mJitter;



/**



 * The percentage of packets that have been lost, in the









range









 * 0 to 1.



 **/



double mLoss;









};










Some embodiments of this invention include the time at which the statistics were computed such that those statistics are sent over multiple paths for improved reliability and to take advantage of one path having less delay than another. One embodiment at the receiving end is able to compare the computation times of received statistics to place them in their original temporal order, regardless of their relative arrival times over the paths.


Some embodiments of this invention will send computed statistics specific to the paths that are part of the plurality of one or more paths that are between the specific sender and receiver. Other embodiments will send additional computed statistics for paths that are not one of the plurality of one or more paths that are between the specific sender and receiver.


Some embodiments of this invention will include network information concerning network topology including but not limited to information retrieved from routers such as in-bound or out-bound link utilization, inbound or out-bound link bandwidth and/or CPU utilization. Other network information determined from routers and other network devices will be apparent to someone skilled in the art.


Some embodiments of this invention will also include control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver.


In some embodiments of the invention, the control data will instruct a receiver to alter its configuration, including but not limited to zero or more of the following examples: instructing a receiver to initiate sending a plurality of one or more measurement packets, change one or more of the measurement packet sizes, inter-measurement packet transmission times and mix of packet sizes, and stop sending one or more of the plurality of measurement packets.


In some embodiments of the invention, this control information will include notification of measurement devices that have joined or left the network.


In many embodiments of the invention, the measurement packets will be encrypted by the sender and decrypted by the receiver. Some of these embodiments will use IPSec.


In some embodiments of the invention, the encryption and decryption will be done by an external device using IPSec.


Other encryption and decryption options will be apparent to one skilled in the art.


In some embodiments of the invention, the measurement packets will be digitally signed.


In some embodiments of the invention, a generic communication channel will be used by a sender and a receiver to communicate data between them.


Performance Characteristics of a Path


Measurements are used to compute performance characteristics of the paths traversed by the measurement packets. The measurements can either be computed from the measurement packets themselves, or extracted from the arbitrary data carried by the measurement packets. The measurements of performance characteristics include at least one or more of one-way measurements and round-trip measurements. The performance characteristics include at least one or more reachability, delay, jitter, loss, available bandwidth, and total bandwidth. Other performance characteristics will be apparent to those skilled in the art.


In some embodiments of the invention, delay measurements are computed as the interval of time from the moment the measurement packet is sent by the sender to the moment of time the measurement packet is received by the receiver. The sending time is carried by the packet, and it is measured by the clock the sender refers to. The receiving time is measured by a clock that the receiver refers to, which may or may not be synchronized with the sender's clock.


In some embodiments of the invention, the clock of the sender and the clock of the receiver are synchronized. A plurality of one or more precise clock inputs such as GPS, NTP, IRIG and NIST will be used. Some embodiments of this invention will use the same clock as an input to more than one of the plurality of one or more senders and receivers. In some embodiments of the invention, the clock of the sender and the clock of the receiver are the same.


In some embodiments of the inventions the clock of the sender and the clock of the receiver are not synchronized, and mechanisms based on the measurement data are used to correct the clock skew and clock drift, the mechanisms including using minimum delay across multiple measurement samples, and using a mechanism to track the minimum delay over time.


Some embodiments of the invention will use the minimum round-trip delay between the devices to place a lower bound on clock skew.


Some embodiments of the invention will use the lower bound of multiple paths between the sender and receiver to further reduce the lower bound.


Some embodiments of the invention will correct for clock drift by tracking the relative clock skew between the sender and receiver over time and adjusting for the slope of the drift.


In some embodiments of the invention, jitter measurements, also known as inter-measurement packet delay variations, are computed as the difference in delay on consecutive, successfully received packets.


In some embodiments of the invention, jitter can also be computed as the difference between the instantaneous delay of a packet, and the average delay of all the measurement packets previously received.


In some embodiments of the invention, loss measurements are computed by assigning a timeout value to each measurement packet that indicates the instant of time after which the measurement packet will be declared lost, if the packet has not arrived by that time. In some embodiments of the invention, the timeout value of a measurement packet can be computed with the transmission time of a previously received packet, an estimation of the inter-transmission time between measurement packet, and an estimation of the transmission delay of the measurement packet. In some embodiments of the invention, the inter-transmission time can be estimated if the receiver knows about the scheduling pattern of transmission of measurement packets. In some embodiments of the invention, the transmission delay of packet can be estimated based on delay and jitter performance characteristics.


Performance characteristics of a path could be the measurement themselves, or statistics on those measurements. In the statistics case, a dynamic algorithm is used to updates the statistics associated with a path with every new measurement obtained with the arrival of every new packet over the path.


In some embodiments of the invention, the algorithm computes statistics over the performance characteristics of the path.


In some embodiments of the invention, the statistics include averages, deviations, and variances. Other statistics will be apparent to those skilled in the art. In some embodiments of the invention, averages can be computed using a plurality of one or more techniques including a moving average, an average based on the Robbins-Moro estimator, a window-based average or a bucket-based average. Other techniques to compute averages will be apparent to those skilled in the art.


In some embodiments of the invention, the moving average is an exponentially moving average computed using a Robbins-Moro estimator. The Robbins-Moro stochastic approximation estimator finds a solution of the equation:

E[ƒ(t)−x]=0

where E is the expectation, f(t) a function and x the estimator. The general form of the solution is:

x(t)=x(t−1)+alpha*[ƒ(t)−x(t−1)]=(1−alpha)*x(t−1)+alpha*ƒ(t)

or, with alpha=(1−μ),

x=μ*x+(1−μ)*ƒ

μ is the weight of the estimator, and determines the amount contributed to the average by the function. In some embodiments of the invention, μ is constant.


In some embodiments of the invention, μ is a dynamic value, whose value depends on the last value of the function f according to the formula:

μ=e^(−ƒ/K)

where K is a constant that also determines the importance of the last value of ƒ with respect to the current value of the estimator x.


In some embodiments of the invention, average delay can be computed using an exponentially moving average as follows,

d=μ*d+(1−μ)*m

where d is the exponentially moving average of delay, m is the last delay sample, and μ is the weight of the moving average.


In some embodiments of the invention, average jitter can be computed using an exponentially moving average as follows,

ν=μ*ν+(1−μ)*|d−m|

where v is the exponentially moving average of jitter, |d−m| is the last sample of jitter, and μ is the weight of the average.


In some embodiments of the invention, average jitter can be computed using an exponentially moving average as follows,

ν=μ*ν+(1−μ)*|m−m′|

Where v is the exponentially moving average of jitter, |m−m′| is the last sample of jitter, m is the last delay sample, m′ is the previous delay sample, and μ is the weight of the average.


In some embodiments of the invention, delay and jitter averages can be combined into a single value as follows:

l=d+M*ν

Where d is the average delay, ν is the average jitter and M is a constant.


In some embodiments of the invention, average loss can be computed using an exponentially moving average as follows,

p-hat=μ*p-hat+(1−μ)*p

where p-hat is the moving average of the loss, p={0 if packet is received, 1 is the packet is declared lost}, and μ is the weight of the exponentially moving average.


In some embodiments of the invention, μ is determined based on the notion of forgiveness against a single packet loss. The forgiveness period is the interval of time between the time the packet loss occurs and the time the average loss is forgiven. The forgiveness period can be either defined in units of time, or in number of packets if the rate of the monitoring flow is known. That is, the forgiveness period will end after n consecutive packets have been received after the loss, when these packets have been transmitted at a certain rate.


The value of the exponentially moving average after receiving the n packets is needed before μ can be determined, and this value is known as the forgiveness threshold. In some embodiments of the invention, the forgiveness threshold is chosen arbitrarily. In some embodiments of the invention, the forgiveness threshold takes the value:

½(1−μ)

This value is half of the value of the estimator after the singe loss occurs, and thus we call it the half-life threshold. Similarly, we also call the forgiveness period under this threshold the half-life period. The advantage of using a forgiveness threshold greater than zero is that issues related to host-dependent floating-point representations reaching that value are avoided.


In some embodiments of the invention, μ is computed by comparing the value of the estimator after n consecutive packet arrivals since the loss with the half-life threshold:

p-hat=(1−μ)*μ^n<½(1−μ)

Given that n is known because is determined by the value of the half-life period and the transmission rate, μ is computed as:

μ=exp((ln½)/n)

In some embodiments of the invention, two thresholds are defined, an upper threshold and a lower threshold. When the value of p-hat exceeds the upper threshold, the loss is not forgiven until enough measurement packets are received consecutively so that the value of p-hat gets below the lower threshold.


Other mechanisms to compute μ will be apparent to for those skilled in the art.


Path Description


In some embodiments of the invention, the path traversed by the measurement packets from the sender to the receiver is such that the path is at least partly implemented with at least one of a GRE tunnel, an IPSEC tunnel and IPonIP tunnel. Other path implementations using tunnel will be apparent for those skilled in the art.


In some embodiments of the invention, the path traversed by the measurement packets from the sender to the receiver is implemented with a virtual circuit, including a frame relay PVC, an ATM PVC or MPLS. Other path implementations using virtual circuits will be apparent for those skilled in the art.


Other path implementations will be apparent to those skilled in the art.


Internetwork Description


In some embodiments of the invention, the internetwork is implemented by a plurality of one or more subnetworks, including a plurality of one or more VPNs, a plurality of one or more BGP autonomous systems, a plurality of one or more local area networks, a plurality of one or metropolitan area networks, and a plurality of one or more wide area networks.


In some embodiments of the invention, the internetwork is implemented by an overlay network.


Other internetwork implementations will be apparent to those skilled in the art.


Packet Sizes and Transmission Times


In some embodiments of the invention, the measurement packets are of varying sizes, including 64, 256, 512, 1024, 1500 bytes.


In some embodiments of the invention, the size of the measurement packets is specified with an external API.


In some embodiments of the invention, the measurement packets are of a fixed size.


In some embodiments of the invention, the measurement packet sizes and times between measurement packets simulate the traffic pattern of a plurality of one or more applications


In some embodiments of the invention, traffic patterns correspond to voice applications, where the packets re of small size, e.g., 30 bytes, and the inter-transmission time between consecutive packets is constant, e.g., 10 ms. These examples do not limit the possible size values and inter-transmission time values.


In some embodiments of the invention, traffic patterns correspond to video applications, where the packets size is the largest permitted to be transmitted by an internetwork without being fragmented, and the inter-transmission time between consecutive packets varies depending on the spatial and temporal complexity of the video content being transmitted, the compression scheme, the encoding control scheme.


In some embodiments of the invention, traffic patterns correspond to the plurality of applications observed in an internetwork, including at least one or more of HTTP transactions, FTP downloads, IRC communications, NNTP exchanges, streaming video sessions, VoIP sessions, videoconferencing sessions and e-commerce transactions. Other types of applications will be apparent to those skilled in the art.


In some embodiments of the invention, the inter-measurement packet transmission times are of varying length.


In some embodiments of the invention, the inter-measurement packet transmission times are of fixed length.


In some embodiments of the invention, the inter-measurement packet transmission times specified with an external API.


In some embodiments of the invention, the length of the inter-measurement packet transmission times is randomized according to a distribution. In some embodiments of the invention, this distribution is based at least in part on a uniform distribution. In some embodiments of the invention, this distribution is based at least in part on an exponential distribution. In some embodiments of the invention, this distribution is based at least in part on a geometric distribution. Other distributions will be apparent to those skilled in the art.


In some embodiments of the invention, the length of the inter-measurement packet transmission times is provided by a table.


In some embodiments of the invention, the length of the inter-measurement packet transmission times is controlled by a scheduler. In some embodiments of the invention, the scheduler uses a priority queue, keyed on desired send time.


Other mechanisms to specify the inter-measurement packet transmission time will be apparent to those skilled in the art.


Other packet sizes and transmission times will be apparent to those skilled in the art.


Path Selection


It is possible that multiple alternative paths between a sender and a receiver are available through an internetwork at any given moment. Performance characteristics of each of these paths can be used to select a subset of the paths.


In some embodiments of the invention, the subset of the plurality of paths is selected based at least in part on at least one of: one or more of the measurement statistics from the measurement packet and one or more of the computed statistics.


In some embodiments of the invention, the selection of the subset of the plurality of paths is based at least partly on the position of paths in a ranking. In some embodiments of the invention, the ranking is at least partly based on one or more of the measurement statistics included as data in the measurement packet. In some embodiments of the invention the ranking is at least partly based on the computed statistics of the path. In some embodiments of the invention the ranking is implemented by using a comparison function to compare the paths, and by ordering the paths in a decreasing order. In some embodiments of the invention the ranking is implemented by using a comparison function to compare the paths, and by ordering the paths in an increasing order. Other ranking techniques will be apparent to those skilled in the art.


In some embodiments of the invention, the ranking is based on a single score associated to each path. In some embodiments of the invention, this score is denoted magic Score (MS), and it is computed as follows:

MS=ML*MF
ML=d+M*ν
MF=delta*p-hat+1

where ML is the Magic Latency, a component of the MS obtained using delay and jitter respectively calculated with statistics; and MF is the Magic scaling Factor that multiplies the value of ML, and is computed based on loss statistics. M is a constant that takes several values, including 4, for example. MS can be seen as a scaled-up version of ML, and the scaling factor MF is a function of p-hat and delta, a constant. As p-hat not only reflects loss but also detects large delay spikes before they happen, p-hat can be seen as an indicator of the departure of the path from a “normal mode” operation, and thus the scaling factor is only applied when there are loss or spikes. The goal of MF is to differentiate between paths that have very similar delay characteristics, but with one having losses and the other not having them.


In some embodiments of the invention, ML is used as a delay indicator, given that jitter is accounted as an increase in delay. In contrast, MS, although a scaled version of ML, cannot be used to indicate delay, except when MF=1 (p-hat=0), which leads to MS=ML. That means the value of MS is useful not by itself but to compare it with the MSs of other tunnels.



FIGS. 1-3 show devices in accordance with the present invention. FIG. 1 shows 9 examples of devices sending and receiving measurement packets in accordance with the present invention. Example 1 illustrates a sending device 101 and a device 110, with the sending device 101 sending a measurement packet 200. Example 2 illustrates the device 110 and a receiving device 120, with the receiving device receiving a measurement packet 201. Example 3 illustrates the sending device 101 sending a measurement packet 203 and the receiving device 120 receiving the measurement packet 203. Example 4 illustrates the sending device 101 sending to the receiving device 120 one measurement packet 207 over a first path and another measurement packet 211 over a second path. Example 5 illustrates a sending/receiving device 125 and the device 110, with the sending/receiving device 125 receiving a measurement packet 213 and sending a measurement packet 215.


Example 6 illustrates the sending/receiving device 125 receiving a measurement packet 217 and sending a measurement packet 219 and the receiving device 120 receiving the measurement packet 219. Example 7 illustrates the sending/receiving device 125 receiving a measurement packet 223 and sending a measurement packet 224 along a first path to the receiving device 120 and sending a measurement packets 229 along a second path to the receiving device 120. Example 8 illustrates the sending device 101 sending to the sending/receiving device 125 a measurement packet 231 along a first path and a measurement packet 235 along a second path. Example 8 also illustrates the sending/receiving device 125 sending a measurement packet 237. Example 9 illustrates the sending/receiving device 125 receiving a measurement packet 239 and sending a measurement packet 241 along a first path and a measurement packet 243 along a second path. Example 9 also illustrates a sending/receiving device 126 receiving the measurement packets 241 and 243 and sending a measurement packet 245.



FIG. 2 is a block diagram of a sending/receiving device A 310 communicating with a sending/receiving device B 325. The sending/receiving device A 310 sends a measurement packet 400 with measurement statistics to the sending/receiving device B 325 and receives a measurement packet 410 with measurement statistics 410 from the sending/receiving device B 325.



FIG. 2 also illustrates steps 1010, 1015, 1020, 1025, 1030, 1035 performed by the sending/receiving device A 310 and steps 1040, 1045, 1050, 1055, 1060, and 1065 performed by the sending/receiving device B 325. When the sending/receiving device B 325 transmits the measurement packet 410, the sending/receiving device A 310 receives the packet 410 in the step 1010 and, in the step 1015, computes measurements from the packet 410 and extracts measurement statistics. From the step 1015, the sending/receiving device A 310 selects a subset of paths based on the measurement statistics in the step 1020 and also computes measurement statistics from the measurements in the step 1025. The sending/receiving device A 310 puts the measurement statistics into a packet in the step 1030. In the step 1035, the sending/receiving device A 310 sends the measurement packet 400 with measurement statistics to the sending/receiving device B 325.



FIG. 2 illustrates that the sending/receiving device B 325 performs steps 1040, 1045, 1050, 1055, 1060, and 1065, similar to the steps 1010, 1015, 1020, 1025, 1030, and 1035, respectively. Accordingly, the steps 1040, 1045, 1050, 1055, 1060, and 1065 will not be discussed here.



FIG. 3 illustrates multiple sending/receiving devices A-C, labeled 500, 510, and 520, respectively. As shown in FIG. 3, the sending/receiving device A 500 sends to the sending/receiving device B 510 a measurement packet 701 along Path 1601 and a measurement packet 702 along Path 2602. The sending/receiving device A 500 sends to the sending/receiving device C 520 a measurement packet 711 along Path 3603 and a measurement packet 712 along Path 4604.


As also illustrated in FIG. 3, the sending/receiving device B 510 sends to the sending/receiving device A 500 a measurement packet 703 along Path 1601 and a measurement packet 704 along Path 2602. The sending/receiving device B 510 sends to the sending/receiving device C 520 a measurement packet 723 alone Path 5605 and a measurement packet 724 along Path 6606. The sending/receiving device C 520 sends to the sending/receiving device A 500 a measurement packet 713 along Path3603 and a measurement packet 714 along Path 4604. The sending/receiving device C 520 sends to the sending/receiving device B 510 a measurement packet 721 along Path 5605 and a measurement packet 722 along Path 6606.


In some embodiments of the invention, loss statistics can be used as a discriminator instead of a scaling factor. That is, p-hat can eliminate paths experimenting loss. Then, the remaining paths can be selected using MS=ML.


In some embodiments of the invention, the selection of a subset of paths is based on applying at least one or more thresholds to at least one of more of the statistics.


In some embodiments of the invention, a single threshold is used, and computed as a certain percentage of the highest score of the paths. In some embodiments of the invention, the threshold is determined by subtracting a fixed quantity to the highest score of the paths.


In some embodiments of the invention, the number of paths in the subset of paths is fixed. In some embodiments of the invention, this fixed number of paths N out of M paths is determined such that the probability of having loss in (M−N) paths simultaneously is less than a certain threshold. In some embodiments of the invention, this probability is a binomial, with the assumption that all paths have the same probability of loss.


In some embodiments of the invention, the selection of the subset of the plurality of paths is based at least partly on a probability associated with each path. In some embodiments of the invention, the probability of each path is at least partly based on one or more of the measurement statistics included as data in the measurement packet.


In some embodiments of the invention, the probabilities of each path are equal.


In some embodiments of the invention, the selection of the subset of the plurality of paths is based at least partly on the cost of the path.


In some embodiments of the invention, the selection of the subset of the plurality of paths is based at least partly on the amount of bandwidth consumed over a period of time.


Other possibilities to compute path probabilities will be apparent to those skilled in the art.


Other mechanisms to select a subset of the paths will be apparent to those skilled in the art.

Claims
  • 1. A method for communicating data within measurement traffic, the method comprising: sending a plurality of one or more measurement packets over a plurality of one or more paths, each of the first plurality of one or more measurement packets having a common source and destination IP address, each of the plurality of one or more paths traversing at least a portion of an internetwork, and each of the plurality of one or more measurement packets including:information for a receiver of the measurement packet to compute measurements of performance characteristics of at least a portion of the path of the measurement packet,
  • 2. The method of claim 1, wherein the measurements of performance characteristics include one-way measurements.
  • 3. The method of claim 1, wherein the data includes measurement statistics that include at least one of averages, deviations, and variances determined by analyzing at least two of the plurality of one or more measurement packets.
  • 4. The method of claim 1, farther comprising: determining a delay average for the plurality of one or more measurement packets by analyzing at least two packets from the plurality of one or more measurement packets;determining a jitter average for the plurality of one or more measurement packets by analyzing at least two packets from the plurality of one or more measurement packets; andcombining the jitter average and delay average for the plurality of one or more measurement packets into a single value; andincluding the single value in the data measurement statistics.
  • 5. The method of claim 1, wherein the data comprises network information retrieved from network routers, wherein the network information comprises one or more of in-bound link utilization, out-bound link utilization, in-bound link bandwidth, out-bound link bandwidth, and CPU utilization.
  • 6. A method for communicating data within measurement traffic, the method comprising: receiving a plurality of one or more measurement packets over a plurality of one or more paths, each of the plurality of one or more measurement packets being assigned a sequence number from a range of sequence numbers, each of the plurality of one or more paths traversing at least a portion of an internetwork, and each of the plurality of one or more measurement packets including:information for a receiver of the measurement packet to compute measurements of performance characteristics of at least a portion of the path of the measurement packet, the information including the assigned sequence number,data including control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver, the data further including one or more of measurement statistics, a generic communication channel, network information; anddetermining a delay average for the plurality of one or more measurement packets by analyzing at least two packets from the plurality of one or more measurement packets;determining a jitter average for the plurality of one or more measurement packets by analyzing at least two packets from the plurality of one or more measurement packets; andcombining the jitter average and delay average for the plurality of one or more measurement packets into a single value; andincluding the single value in the data measurement statistics.
  • 7. The method of claim 6, wherein the measurements of performance characteristics include one-way measurements.
  • 8. The method of claim 6, wherein the data includes measurement statistics calculated for a given path between a sender and the receiver.
  • 9. The method of claim 6, further comprising analyzing of the measurement packet based on a dynamic algorithm, the dynamic algorithm computing computed statistics on one or more of the measurements of performance characteristics of at least a portion of the path of the measurement packet.
  • 10. The method of claim 9, wherein a subset of the plurality of one or more paths is selected based at least in part on at least one of: one or more of the measurement statistics from the measurement packet and one or more of the computed statistics.
  • 11. A method for communicating data within measurement traffic, the method comprising: sending a first plurality of one or more measurement packets over a first plurality of one or more paths, each of the first plurality of one or more measurement packets having a common source and destination IP address, each of the first plurality of one or more paths traversing at least a portion of an internetwork, and each of the first plurality of one or more measurement packets including:information for a receiver of the measurement packet to compute measurements of performance characteristics of at least a portion of the path of the measurement packet, the performance characteristics including at least one of averages, deviations, and variances determined by analyzing at least two of the first plurality of one or more measurement packets,data including control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver, the data further including one or more of measurement statistics, a generic communication channel, network information, anddetermining a delay average for the first plurality of one or more measurement packets by analyzing at least two packets from the first plurality of one or more measurement packets;determining a utter average for the first plurality of one or more measurement packets by analyzing at least two packets from the first plurality of one or more measurement packets; andcombining the utter average and delay average for the first plurality of one or more measurement packets into a single value; andincluding the single value in the data measurement statistics,receiving a second plurality of one or more measurement packets over a second plurality of one or more paths, each of the second plurality of one or more paths traversing at least a portion of an internetwork, and each of the second plurality of one or more measurement packets including:information for a receiver of the measurement packet to compute measurements of performance characteristics of at least a portion of the path of the measurement packet, anddata including control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver, the data further including one or more of measurement statistics, a generic communication channel, network information, anddetermining a delay average for the second plurality of one or more measurement packets by analyzing at least two packets from the second plurality of one or more measurement packets;determining a jitter average for the second plurality of one or more measurement packets by analyzing at least two packets from the second plurality of one or more measurement packets; andcombining the jitter average and delay average for the second plurality of one or more measurement packets into a single value; andincluding the single value in the data measurement statistics.
  • 12. The method of claim 11, wherein the measurements of performance characteristics include one-way measurements.
  • 13. The method of claim 11, wherein the data includes measurement statistics.
  • 14. The method of claim 13, wherein the measurement statistics are at least partly responsive to jitter.
  • 15. The method of claim 13, wherein the measurement statistics are at least partly responsive to path delay.
  • 16. The method of claim 13, wherein the measurement statistics are at least partly responsive to loss deduced by identifying missing sequence numbers.
  • 17. The method of claim 11, wherein the data includes a generic communication channel.
  • 18. The method of claim 11, wherein the data includes network information.
  • 19. The method of claim 11, wherein the data is embedded in multiple measurement packets that are sent over multiple paths for improved communication performance, including redundancy and shorter transmission time.
  • 20. The method of claim 11, wherein the measurement packets are at least one of encrypted and digitally signed.
  • 21. The method of claim 11, wherein a clock referred to by a sender of the measurement packet and a clock referred to by the receiver of the measurement packet are synchronized the synchronization methods including at least one or more of GPS, NTP, IRIG, and NIST.
  • 22. The method of claim 11, further comprising analyzing of the measurement packet based on a dynamic algorithm, the dynamic algorithm computing computed statistics on one or more of the measurements of performance characteristics of at least a portion of the path of the measurement packet.
  • 23. The method of claim 22, wherein the algorithm computes averages of the measurements, including at least one of a moving average, an average based on the Robbins-Moro estimator, a window-based average, and a bucket-based average.
  • 24. The method of claim 22, wherein the algorithm is at least partly specified through an external API.
  • 25. The method of claim 22, wherein the computed statistics are at least partly recomputed upon the arrival of every measurement packet.
  • 26. The method of claim 22, wherein the computed statistics are based at least partly on measurement statistics from the measurement packet.
  • 27. The method of claim 22, wherein a subset of the plurality of one or more paths is selected based at least in part on at least one of: one or more of the measurement statistics from the measurement packet and one or more of the computed statistics.
  • 28. The method of 27, wherein the selection of the subset of the plurality of one or more paths is based at least partly on the position of paths in a ranking.
  • 29. The method of 28, wherein the ranking is at least partly based on one or more of the measurement statistics included as data in the measurement packet.
  • 30. The method of 27, wherein the selection of the subset of the plurality of one or more paths is based at least partly on a probability associated with each path of the plurality of one or more paths.
  • 31. The method of claim 30, wherein the probability of each path of the plurality of one or more paths is at least partly based on one or more of the measurement statistics included as data in the measurement packet.
  • 32. The method of 27, wherein the selection of the subset of the plurality of one of more paths is based at least partly on applying one or more thresholds to at least one of the measurement statistics included as data in the measurement packet.
  • 33. The method of claim 11, wherein measurement packets at least partly rely on UDP.
  • 34. The method of claim 11, wherein at least one of the plurality of one or more paths is at least partly implemented with at least one of a GRE tunnel and an IPSEC tunnel.
  • 35. The method of claim 11, wherein at least one of the plurality of one or more paths is at least partly implemented with at least one of a frame relay PVC, an ATM PVC, and MPLS.
  • 36. The method of claim 11, wherein the internetwork is a plurality of one or more subnetworks, including at least one of a plurality of one or more VPNs; an overlay network; a plurality of one or more BGP autonomous systems; a plurality of one or more local area networks; a plurality of one or more metropolitan area networks; and a plurality of one or more wide area networks.
  • 37. The method of claim 11, wherein the measurement packet sizes and times between measurement packets simulate the traffic pattern of a plurality of one or more applications.
  • 38. The method of claim 37, wherein the plurality of one or more applications includes voice applications.
  • 39. The method of claim 37, wherein the plurality of one or more applications includes video applications.
  • 40. The method of claim 11, wherein the sending and receiving are performed on a single device configured to change the one or more configuration parameters in response to receiving control data.
  • 41. The method of claim 11, wherein the measurement statistics are at least partly responsive to jitter, delay, and loss.
  • 42. A networking system, comprising: a plurality of one or more devices communicating at least a first plurality of one or more measurement packets over a first plurality of one or more paths, each of the plurality of one or more measurement packets being assigned a sequence number from a range of sequence numbers, each of the first plurality of one or more paths traversing at least a portion of an internetwork, and each of the first plurality of one or more measurement packets including:information for a receiver of the measurement packet to compute measurements of performance characteristics of at least a portion of the path of the measurement packet, the performance characteristics including at least one of averages, deviations, and variances determined by analyzing at least two of the plurality of one or more measurement packets, anddata including control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver, the data further including one or more of measurement statistics, a generic communication channel, network information; anddetermining a delay average for the first plurality of one or more measurement packets by analyzing at least two packets from the first plurality of one or more measurement packets;determining a jitter average for the first plurality of one or more measurement packets by analyzing at least two packets from the first plurality of one or more measurement packets; andcombining the jitter average and delay average for the first plurality of one or more measurement packets into a single value; andincluding the single value in the data measurement statistics.
  • 43. The networking system of claim 42, wherein the plurality of one or more devices includes a first sub-plurality of one or more devices, wherein the first sub-plurality of one or more devices sends one or more of the first plurality of one or more measurement packets.
  • 44. The networking system of claim 43, wherein the plurality of one or more devices includes a second sub-plurality of one or more devices, wherein the second sub-plurality of one or more devices receives one or more of a second plurality of one or more measurement packets over a second plurality of one or more paths, each of the second plurality of one or more paths traversing at least a portion of the internetwork, each of the second plurality of one or more measurement packets including: information for a receiver of the measurement packet to compute measurements of performance characteristics of at least a portion of the path of the measurement packet, anddata including one or more of measurement statistics, a generic communication channel, network information, and control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver.
  • 45. The networking system of claim 44, wherein at least one of the first plurality of one or more measurement packets and at least one of the second plurality of one or more measurement packets are the same packet.
  • 46. The networking system of claim 42, wherein at least one of the plurality of one or more devices receives one or more of the first plurality of one or more measurement packets.
  • 47. The networking system of claim 42, wherein the plurality of one or more devices includes a first sub-plurality of one or more devices, wherein the first sub-plurality of one or more devices receives one or more of a second plurality of one or more measurement packets over a second plurality of one or more paths and sends one or more of the first plurality of one or more measurement packets, each of the second plurality of one or more paths traversing at least a portion of the internetwork, each of the second plurality of one or more measurement packets including: information for a receiver of the measurement packet to compute measurements of performance characteristics of at least a portion of the path of the measurement packet, anddata including one or more of measurement statistics, a generic communication channel, network information, and control data directing a receiver of the measurement packet to change one or more configuration parameters of the receiver.
  • 48. The networking system of claim 47, wherein at least one of the first plurality of one or more measurement packets and at least one of the second plurality of one or more measurement packets are the same packet.
  • 49. The networking system of claim 47, wherein the plurality of one or more devices includes a second sub-plurality of one or more devices, wherein the second sub-plurality of one or more devices sends one or more of the first plurality of one or more measurement packets.
  • 50. The networking system of claim 49, wherein at least one of the first plurality of one or more measurement packets and at least one of the second plurality of one or more measurement packets are the same packet.
  • 51. The networking system of claim 47, wherein the plurality of one or more devices includes a second sub-plurality of one or more devices, wherein the second sub-plurality of one or more devices receives one or more of the second plurality of one or more measurement packets.
  • 52. The networking system of claim 51, wherein at least one of the first plurality of one or more measurement packets and at least one of the second plurality of one or more measurement packets are the same packet.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is (a) the National Stage of PCT Application No. PCT/US01/32309, filed Oct. 17, 2001; and (b) is a continuation-in-part of PCT Application No. PCT/US01/32312, filed Oct. 17, 2001; (c) PCT Application No. PCT/US01/31259, filed Oct. 5, 2001; (d) PCT Application No. PCT/US01/31420, filed Oct. 4, 2001; and (e) PCT Application No. PCT/US01/31419, filed Oct. 4, 2001; which (a), (b), (c), (d) and (e) are continuations-in-part of (i) U.S. application Ser. No. 09/960,623, filed Sep. 20, 2001; (ii) U.S. application Ser. No. 09/903,423, filed Jul. 10, 2001; (iii) U.S. application Ser. No. 09/923,924, filed Aug. 6, 2001; and (iv) U.S. application Ser. No. 09/903,441, filed Jul. 10, 2001; which (i), (ii), (iii) and (iv) claim the benefit of (1) U.S. Provisional Application No. 60/275,206, filed Mar. 12, 2001; and (2) U.S. Provisional Application No. 60/241,450, filed Oct. 17, 2000. These applications are hereby incorporated by reference.

PCT Information
Filing Document Filing Date Country Kind 371c Date
PCT/US01/32309 10/17/2001 WO 00 1/17/2003
Publishing Document Publishing Date Country Kind
WO02/33893 4/25/2002 WO A
US Referenced Citations (206)
Number Name Date Kind
4284852 Szybicki et al. Aug 1981 A
4345116 Ash et al. Aug 1982 A
4495570 Kitajima et al. Jan 1985 A
4594704 Ollivier Jun 1986 A
4669113 Ash et al. May 1987 A
4704724 Krishnan et al. Nov 1987 A
4726017 Krum et al. Feb 1988 A
4748658 Gopal et al. May 1988 A
4788721 Krishnan et al. Nov 1988 A
4839798 Eguchi et al. Jun 1989 A
4901244 Szeto Feb 1990 A
4920432 Eggers et al. Apr 1990 A
4931941 Krishnan Jun 1990 A
4939726 Flammer et al. Jul 1990 A
4949187 Cohen Aug 1990 A
4949248 Caro Aug 1990 A
5142570 Chaudhary et al. Aug 1992 A
5172413 Bradley et al. Dec 1992 A
5253341 Rozmanith et al. Oct 1993 A
5271000 Engbersen et al. Dec 1993 A
5287537 Newmark et al. Feb 1994 A
5291554 Morales Mar 1994 A
5341477 Pitkin et al. Aug 1994 A
5343463 van Tetering et al. Aug 1994 A
5371532 Gelman et al. Dec 1994 A
5375070 Hershey et al. Dec 1994 A
5406502 Haramaty et al. Apr 1995 A
5410343 Coddington et al. Apr 1995 A
5414455 Hooper et al. May 1995 A
5442389 Blahut et al. Aug 1995 A
5442390 Hooper et al. Aug 1995 A
5442749 Northcutt et al. Aug 1995 A
5452294 Natarajan Sep 1995 A
5467345 Cutler, Jr. et al. Nov 1995 A
5471622 Eadline Nov 1995 A
5471623 Napolitano, Jr. Nov 1995 A
5475615 Lin Dec 1995 A
5477536 Picard Dec 1995 A
5508732 Bottomley et al. Apr 1996 A
5515511 Nguyen et al. May 1996 A
5519435 Anderson May 1996 A
5521591 Arora et al. May 1996 A
5528281 Grady et al. Jun 1996 A
5535195 Lee Jul 1996 A
5537394 Abe et al. Jul 1996 A
5563875 Hefel et al. Oct 1996 A
5574938 Bartow et al. Nov 1996 A
5590126 Mishra et al. Dec 1996 A
5629930 Beshai et al. May 1997 A
5631897 Pacheco et al. May 1997 A
5636216 Fox et al. Jun 1997 A
5652841 Nemirovsky et al. Jul 1997 A
5654958 Natarajan Aug 1997 A
5659796 Thorson et al. Aug 1997 A
5668800 Stevenson Sep 1997 A
5675741 Aggarwal et al. Oct 1997 A
5729528 Salingre et al. Mar 1998 A
5754639 Flockhart et al. May 1998 A
5787253 McCreery et al. Jul 1998 A
5793976 Chen et al. Aug 1998 A
5802106 Packer Sep 1998 A
5805594 Kotchey et al. Sep 1998 A
5812528 VanDervort Sep 1998 A
5835710 Nagami et al. Nov 1998 A
5841775 Huang Nov 1998 A
5845091 Dunne et al. Dec 1998 A
5884047 Aikawa et al. Mar 1999 A
5892754 Kompella et al. Apr 1999 A
5935216 Benner et al. Aug 1999 A
5940478 Vaudreuil et al. Aug 1999 A
5944779 Blum Aug 1999 A
5974457 Waclawsky et al. Oct 1999 A
6006264 Colby et al. Dec 1999 A
6009081 Wheeler et al. Dec 1999 A
6012088 Li et al. Jan 2000 A
6026441 Ronen Feb 2000 A
6034946 Roginsky et al. Mar 2000 A
6052718 Gifford Apr 2000 A
6064946 Beerends May 2000 A
6069889 Feldman et al. May 2000 A
6078963 Civanlar et al. Jun 2000 A
6108703 Leighton et al. Aug 2000 A
6111881 Soncodi Aug 2000 A
6119235 Vaid et al. Sep 2000 A
6130890 Leinwand et al. Oct 2000 A
6167052 McNeill et al. Dec 2000 A
6173324 D'Souza Jan 2001 B1
6178448 Gray et al. Jan 2001 B1
6185598 Farber et al. Feb 2001 B1
6185601 Wolff Feb 2001 B1
6189044 Thomson et al. Feb 2001 B1
6226266 Galand et al. May 2001 B1
6275470 Ricciulli Aug 2001 B1
6282562 Sidi et al. Aug 2001 B1
6286045 Griffiths et al. Sep 2001 B1
6292832 Shah et al. Sep 2001 B1
6311144 Abu et al. Oct 2001 B1
6317778 Dias et al. Nov 2001 B1
6339595 Rekhter et al. Jan 2002 B1
6341309 Vaid et al. Jan 2002 B1
6363332 Rangarajan et al. Mar 2002 B1
6385198 Ofek et al. May 2002 B1
6385643 Jacobs et al. May 2002 B1
6415323 McCanne et al. Jul 2002 B1
6426955 Dalton, Jr. et al. Jul 2002 B1
6434606 Borella et al. Aug 2002 B1
6438592 Killian Aug 2002 B1
6446028 Wang Sep 2002 B1
6452950 Ohlsson et al. Sep 2002 B1
6453356 Sheard et al. Sep 2002 B1
6463454 Lumelsky et al. Oct 2002 B1
6493353 Kelly et al. Dec 2002 B2
6522627 Mauger Feb 2003 B1
6526056 Rekhter et al. Feb 2003 B1
6538416 Hahne et al. Mar 2003 B1
6556582 Redi Apr 2003 B1
6560204 Rayes May 2003 B1
6594307 Beerends Jul 2003 B1
6601098 Case et al. Jul 2003 B1
6601101 Lee et al. Jul 2003 B1
6608841 Koodli Aug 2003 B1
6611872 McCanne Aug 2003 B1
6614789 Yazdani et al. Sep 2003 B1
6625648 Schwaller et al. Sep 2003 B1
6631419 Green Oct 2003 B1
6633640 Cohen et al. Oct 2003 B1
6661797 Goel et al. Dec 2003 B1
6687229 Kataria et al. Feb 2004 B1
6704768 Zombek et al. Mar 2004 B1
6707824 Achilles et al. Mar 2004 B1
6711137 Klassen et al. Mar 2004 B1
6711152 Kalmanek, Jr. et al. Mar 2004 B1
6714549 Phaltankar Mar 2004 B1
6714896 Barrett Mar 2004 B1
6728484 Ghani Apr 2004 B1
6728779 Griffin et al. Apr 2004 B1
6735177 Suzuki May 2004 B1
6748426 Shaffer et al. Jun 2004 B1
6751562 Blackett et al. Jun 2004 B1
6751664 Kogan et al. Jun 2004 B1
6757255 Aoki et al. Jun 2004 B1
6760775 Anerousis et al. Jul 2004 B1
6760777 Agarwal et al. Jul 2004 B1
6766381 Barker et al. Jul 2004 B1
6795399 Benmohamed et al. Sep 2004 B1
6795860 Shah Sep 2004 B1
6801502 Rexford et al. Oct 2004 B1
6810417 Lee Oct 2004 B2
6819662 Grover et al. Nov 2004 B1
6820133 Grove et al. Nov 2004 B1
6826613 Wang et al. Nov 2004 B1
6829221 Winckles et al. Dec 2004 B1
6836463 Garcia-Luna-Aceves et al. Dec 2004 B2
6839745 Dingari et al. Jan 2005 B1
6839751 Dietz et al. Jan 2005 B1
6885641 Chan et al. Apr 2005 B1
6909700 Benmohamed et al. Jun 2005 B1
6912222 Wheeler et al. Jun 2005 B1
6956858 Hariguchi et al. Oct 2005 B2
6963575 Sistanizadeh et al. Nov 2005 B1
6963914 Breitbart et al. Nov 2005 B1
6973490 Robertson et al. Dec 2005 B1
6981055 Ahuja et al. Dec 2005 B1
6984991 Bond et al. Jan 2006 B2
6993584 Border et al. Jan 2006 B2
6999432 Zhang et al. Feb 2006 B2
7002917 Saleh Feb 2006 B1
7020086 Juttner et al. Mar 2006 B2
7024475 Abaye et al. Apr 2006 B1
7043541 Bechtolsheim et al. May 2006 B1
7043562 Dally et al. May 2006 B2
7065584 Shavitt et al. Jun 2006 B1
7085230 Hardy Aug 2006 B2
7099282 Hardy Aug 2006 B1
7110393 Tripathi et al. Sep 2006 B1
7111073 Jain et al. Sep 2006 B1
7123620 Ma Oct 2006 B1
7139242 Bays Nov 2006 B2
7155436 Hegde et al. Dec 2006 B2
7162539 Garcie-Luna-Aceves Jan 2007 B2
7269157 Klinker et al. Sep 2007 B2
20010010059 Burman et al. Jul 2001 A1
20010026537 Massey Oct 2001 A1
20010037311 McCoy et al. Nov 2001 A1
20020038331 Flavin Mar 2002 A1
20020087687 Zaifman et al. Jul 2002 A1
20020101821 Feldmann et al. Aug 2002 A1
20020124100 Adams Sep 2002 A1
20020152318 Menon et al. Oct 2002 A1
20020184527 Chun et al. Dec 2002 A1
20030016770 Trans et al. Jan 2003 A1
20030039212 Lloyd et al. Feb 2003 A1
20030112788 Erhart et al. Jun 2003 A1
20040030776 Cantrell et al. Feb 2004 A1
20040062267 Minami et al. Apr 2004 A1
20040218546 Clark Nov 2004 A1
20050044270 Groove et al. Feb 2005 A1
20050083912 Asfar et al. Apr 2005 A1
20050132060 Mo et al. Jun 2005 A1
20050185654 Zadikian et al. Aug 2005 A1
20050201302 Gaddis et al. Sep 2005 A1
20050243726 Narendran Nov 2005 A1
20060026682 Zakas Feb 2006 A1
20060036763 Johnson et al. Feb 2006 A1
20070271066 Nikitin et al. Nov 2007 A1
20080101793 Koch et al. May 2008 A1
Foreign Referenced Citations (28)
Number Date Country
0 504 537 Mar 1991 EP
0 528 075 Feb 1993 EP
0 788 267 Aug 1997 EP
0 598 969 Feb 1999 EP
0 942 560 Sep 1999 EP
0 977 456 Feb 2000 EP
0 982 901 Mar 2000 EP
0 999 674 Apr 2004 EP
WO 9408415 Apr 1994 WO
WO 9906913 Feb 1999 WO
WO 9914907 Mar 1999 WO
WO 9914931 Mar 1999 WO
WO 9914932 Mar 1999 WO
WO 9918751 Apr 1999 WO
WO 9930460 Jun 1999 WO
WO 9939481 Aug 1999 WO
WO 0004458 Jan 2000 WO
WO 0025224 May 2000 WO
WO 0038381 Jun 2000 WO
WO 0045560 Aug 2000 WO
WO 0052906 Sep 2000 WO
WO 0062489 Oct 2000 WO
WO 0072528 Nov 2000 WO
WO 0079362 Dec 2000 WO
WO 0079730 Dec 2000 WO
WO 0106717 Jan 2001 WO
WO 0113585 Feb 2001 WO
WO 0233896 Apr 2002 WO
Related Publications (1)
Number Date Country
20070115840 A1 May 2007 US
Provisional Applications (2)
Number Date Country
60275206 Mar 2001 US
60241450 Oct 2000 US
Continuation in Parts (8)
Number Date Country
Parent PCT/US01/32312 Oct 2001 US
Child 10070339 US
Parent PCT/US01/31259 Oct 2001 US
Child PCT/US01/32312 US
Parent PCT/US01/31420 Oct 2001 US
Child PCT/US01/31259 US
Parent PCT/US01/31419 Oct 2001 US
Child PCT/US01/31420 US
Parent 09960623 Sep 2001 US
Child PCT/US01/31419 US
Parent 09923924 Aug 2001 US
Child 09960623 US
Parent 09903423 Jul 2001 US
Child 09923924 US
Parent 09903441 Jul 2001 US
Child 09903423 US