US 7,756,032 B2Grant

Method and apparatus for communicating data within measurement traffic

Issue Date:2010-07-13

•52 Claims

•4 Drawing Sheets

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.

Metadata

Assignee

Avaya Inc.

Inventors

Wayne A. Feick
Sean P. Finn
Mansour J. Karam
Michael A. Lloyd
Herbert S. Madan
James G. McGuire
Jose-Miguel Pulido
Omar C. Baldonado

Application Information

Application Number:US 10/070,339

Filing Date:2001-10-17

Priority Date:2000-10-17

Art Unit:2453

Classifications

IPC:

G01R31/08G06F11/00G08C15/00H04J1/16G06F15/173G06F15/16

Patent Drawings (4 sheets)

Description

Cross Reference to Related Applications

[0001] 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.

Background of the Invention

[0002] 1. Field of the Invention

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

[0004] 2. Description of the Related Art

[0005] 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:

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

[0007] 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.

[0008] 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.

[0009] 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.

[0010] 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

[0011] 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.

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

[0013] 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.

[0014] 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.

[0015] 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.

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

[0017] 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.

[0018] 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.

[0019] These and other embodiments are described further herein.

Brief Description of the Figures

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

[0021] 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.

[0022] 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

[0023] 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.

[0024] 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,

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

[0026]


	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;
	};

[0027] 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.

[0028] 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.

[0029] 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.

[0030] 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

[0031] 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.

[0032] 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.

[0033] 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.

[0034]


	class SubPacket {
	/*
	* The type identifier for this subpacket.
	*/
	uint8_t mType;
	/*
	* The length of this subpacket, in network byte order.
	*/
	uint16_t mLength;
	};

[0035] 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.

[0036] 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.

[0037] 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.

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

[0039]


	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;
	};

[0040] 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.

[0041] 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.

[0042] 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.

[0043] 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.

[0044] 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.

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

[0046] 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.

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

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

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

[0050] 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

[0051] 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.

[0052] 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.

[0053] 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.

[0054] 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.

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

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

[0057] 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.

[0058] 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.

[0059] 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.

[0060] 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.

[0061] 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.

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

[0063] 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.

[0064] 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.

[0065] 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.

[0066] 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.

[0067] 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.

[0068] 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.

[0069] 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.

[0070] 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.

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

Path Description

[0072] 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.

[0073] 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.

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

Internetwork Description

[0075] 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.

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

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

Packet Sizes and Transmission Times

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

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

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

[0081] 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

[0082] 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.

[0083] 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.

[0084] 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.

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

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

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

[0088] 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.

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

[0090] 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.

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

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

Path Selection

[0093] 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.

[0094] 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.

[0095] 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.

[0096] 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.

[0097] 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.

[0098] 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.

[0099] 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.

[0100] 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.

[0101] 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.

[0102] 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.

[0103] 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 1 601 and a measurement packet 702 along Path 2 602. The sending/receiving device A 500 sends to the sending/receiving device C 520 a measurement packet 711 along Path 3 603 and a measurement packet 712 along Path 4 604.

[0104] 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 1 601 and a measurement packet 704 along Path 2 602. The sending/receiving device B 510 sends to the sending/receiving device C 520 a measurement packet 723 alone Path 5 605 and a measurement packet 724 along Path 6 606. The sending/receiving device C 520 sends to the sending/receiving device A 500 a measurement packet 713 along Path3 603 and a measurement packet 714 along Path 4 604. The sending/receiving device C 520 sends to the sending/receiving device B 510 a measurement packet 721 along Path 5 605 and a measurement packet 722 along Path 6 606.

[0105] 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.

[0106] 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.

[0107] 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.

[0108] 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.

[0109] 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.

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

[0111] 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.

[0112] 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.

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

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

Claims

What is claimed is:

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,

and data including control data comprising instructions that direct 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, and network information; and

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; and

combining the jitter average and delay average for the plurality of one or more measurement packets into a single value; and

including the single value in the data measurement statistics.

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; and

combining the jitter average and delay average for the plurality of one or more measurement packets into a single value; and

including 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; and

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; and

combining the jitter average and delay average for the plurality of one or more measurement packets into a single value; and

including 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,

determining 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; and

combining the utter average and delay average for the first plurality of one or more measurement packets into a single value; and

including 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, and

determining 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; and

combining the jitter average and delay average for the second plurality of one or more measurement packets into a single value; and

including 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:

determining 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; and

combining the jitter average and delay average for the first plurality of one or more measurement packets into a single value; and

including 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, 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.

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, and

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.

Patent Citations (234)

Patent	Date	Inventor	Cited By
US4284852(A)	1981-08-01	Szybicki et al.	Applicant
US4345116(A)	1982-08-01	Ash et al.	Applicant
US4495570(A)	1985-01-01	Kitajima et al.	Applicant
US4594704(A)	1986-06-01	Ollivier	Applicant
US4669113(A)	1987-05-01	Ash et al.	Applicant
US4704724(A)	1987-11-01	Krishnan et al.	Applicant
US4726017(A)	1988-02-01	Krum et al.	Applicant
US4748658(A)	1988-05-01	Gopal et al.	Applicant
US4788721(A)	1988-11-01	Krishnan et al.	Applicant
US4839798(A)	1989-06-01	Eguchi et al.	Applicant
US4901244(A)	1990-02-01	Szeto	Applicant
US4920432(A)	1990-04-01	Eggers et al.	Applicant
US4931941(A)	1990-06-01	Krishnan	Applicant
US4939726(A)	1990-07-01	Flammer et al.	Applicant
US4949187(A)	1990-08-01	Cohen	Applicant
US4949248(A)	1990-08-01	Caro	Applicant
US5142570(A)	1992-08-01	Chaudhary et al.	Applicant
US5172413(A)	1992-12-01	Bradley et al.	Applicant
US5253341(A)	1993-10-01	Rozmanith et al.	Applicant
US5271000(A)	1993-12-01	Engbersen et al.	Examiner
US5287537(A)	1994-02-01	Newmark et al.	Applicant
US5291554(A)	1994-03-01	Morales	Applicant
US5341477(A)	1994-08-01	Pitkin et al.	Applicant
US5343463(A)	1994-08-01	van Tetering et al.	Applicant
US5371532(A)	1994-12-01	Gelman et al.	Applicant
US5375070(A)	1994-12-01	Hershey et al.	Applicant
US5406502(A)	1995-04-01	Haramaty et al.	Applicant
US5410343(A)	1995-04-01	Coddington et al.	Applicant
US5414455(A)	1995-05-01	Hooper et al.	Applicant
US5442389(A)	1995-08-01	Blahut et al.	Applicant
US5442390(A)	1995-08-01	Hooper et al.	Applicant
US5442749(A)	1995-08-01	Northcutt et al.	Applicant
US5452294(A)	1995-09-01	Natarajan	Applicant
US5467345(A)	1995-11-01	Cutler, Jr. et al.	Applicant
US5471622(A)	1995-11-01	Eadline	Applicant
US5471623(A)	1995-11-01	Napolitano, Jr.	Applicant
US5475615(A)	1995-12-01	Lin	Applicant
US5477536(A)	1995-12-01	Picard	Applicant
US5508732(A)	1996-04-01	Bottomley et al.	Applicant
US5515511(A)	1996-05-01	Nguyen et al.	Applicant
US5519435(A)	1996-05-01	Anderson	Applicant
US5521591(A)	1996-05-01	Arora et al.	Applicant
US5528281(A)	1996-06-01	Grady et al.	Applicant
US5535195(A)	1996-07-01	Lee	Applicant
US5537394(A)	1996-07-01	Abe et al.	Applicant
US5563875(A)	1996-10-01	Hefel et al.	Applicant
US5574938(A)	1996-11-01	Bartow et al.	Applicant
US5590126(A)	1996-12-01	Mishra et al.	Applicant
US5629930(A)	1997-05-01	Beshai et al.	Applicant
US5631897(A)	1997-05-01	Pacheco et al.	Applicant
US5636216(A)	1997-06-01	Fox et al.	Applicant
US5652841(A)	1997-07-01	Nemirovsky et al.	Applicant
US5654958(A)	1997-08-01	Natarajan	Applicant
US5659796(A)	1997-08-01	Thorson et al.	Applicant
US5668800(A)	1997-09-01	Stevenson	Applicant
US5675741(A)	1997-10-01	Aggarwal et al.	Applicant
US5729528(A)	1998-03-01	Salingre et al.	Applicant
US5754639(A)	1998-05-01	Flockhart et al.	Applicant
US5787253(A)	1998-07-01	McCreery et al.	Applicant
US5793976(A)	1998-08-01	Chen et al.	Applicant
US5802106(A)	1998-09-01	Packer	Applicant
US5805594(A)	1998-09-01	Kotchey et al.	Applicant
US5812528(A)	1998-09-01	VanDervort	Applicant
US5835710(A)	1998-11-01	Nagami et al.	Applicant
US5841775(A)	1998-11-01	Huang	Applicant
US5845091(A)	1998-12-01	Dunne et al.	Applicant
US5884047(A)	1999-03-01	Aikawa et al.	Applicant
US5892754(A)	1999-04-01	Kompella et al.	Examiner
US5935216(A)	1999-08-01	Benner et al.	Applicant
US5940478(A)	1999-08-01	Vaudreuil et al.	Applicant
US5944779(A)	1999-08-01	Blum	Applicant
US5974457(A)	1999-10-01	Waclawsky et al.	Applicant
US6006264(A)	1999-12-01	Colby et al.	Applicant
US6009081(A)	1999-12-01	Wheeler et al.	Applicant
US6012088(A)	2000-01-01	Li et al.	Applicant
US6026441(A)	2000-02-01	Ronen	Applicant
US6034946(A)	2000-03-01	Roginsky et al.	Applicant
US6052718(A)	2000-04-01	Gifford	Applicant
US6064946(A)	2000-05-01	Beerends	Applicant
US6069889(A)	2000-05-01	Feldman et al.	Applicant
US6078963(A)	2000-06-01	Civanlar et al.	Applicant
US6108703(A)	2000-08-01	Leighton et al.	Applicant
US6111881(A)	2000-08-01	Soncodi	Applicant
US6119235(A)	2000-09-01	Vaid et al.	Applicant
US6130890(A)	2000-10-01	Leinwand et al.	Applicant
US6167052(A)	2000-12-01	McNeill et al.	Applicant
US6173324(B1)	2001-01-01	D'Souza	Applicant
US6178448(B1)	2001-01-01	Gray et al.	Applicant
US6185598(B1)	2001-02-01	Farber et al.	Applicant
US6185601(B1)	2001-02-01	Wolff	Applicant
US6189044(B1)	2001-02-01	Thomson et al.	Applicant
US6226266(B1)	2001-05-01	Galand et al.	Applicant
US6275470(B1)	2001-08-01	Ricciulli	Applicant
US6282562(B1)	2001-08-01	Sidi et al.	Applicant
US6286045(B1)	2001-09-01	Griffiths et al.	Applicant
US6292832(B1)	2001-09-01	Shah et al.	Applicant
US6311144(B1)	2001-10-01	Abu et al.	Applicant
US6317778(B1)	2001-11-01	Dias et al.	Applicant
US6339595(B1)	2002-01-01	Rekhter et al.	Applicant
US6341309(B1)	2002-01-01	Vaid et al.	Applicant
US6363332(B1)	2002-03-01	Rangarajan et al.	Applicant
US6385198(B1)	2002-05-01	Ofek et al.	Examiner
US6385643(B1)	2002-05-01	Jacobs et al.	Applicant
US6415323(B1)	2002-07-01	McCanne et al.	Applicant
US6426955(B1)	2002-07-01	Dalton, Jr. et al.	Applicant
US6434606(B1)	2002-08-01	Borella et al.	Applicant
US6438592(B1)	2002-08-01	Killian	Applicant
US6446028(B1)	2002-09-01	Wang	Applicant
US6452950(B1)	2002-09-01	Ohlsson et al.	Applicant
US6453356(B1)	2002-09-01	Sheard et al.	Applicant
US6463454(B1)	2002-10-01	Lumelsky et al.	Applicant
US6493353(B2)	2002-12-01	Kelly et al.	Applicant
US6522627(B1)	2003-02-01	Mauger	Applicant
US6526056(B1)	2003-02-01	Rekhter et al.	Applicant
US6538416(B1)	2003-03-01	Hahne et al.	Applicant
US6556582(B1)	2003-04-01	Redi	Applicant
US6560204(B1)	2003-05-01	Rayes	Applicant
US6594307(B1)	2003-07-01	Beerends	Applicant
US6601098(B1)	2003-07-01	Case et al.	Applicant
US6601101(B1)	2003-07-01	Lee et al.	Applicant
US6608841(B1)	2003-08-01	Koodli	Applicant
US6611872(B1)	2003-08-01	McCanne	Applicant
US6614789(B1)	2003-09-01	Yazdani et al.	Applicant
US6625648(B1)	2003-09-01	Schwaller et al.	Applicant
US6631419(B1)	2003-10-01	Green	Applicant
US6633640(B1)	2003-10-01	Cohen et al.	Applicant
US6661797(B1)	2003-12-01	Goel et al.	Applicant
US6687229(B1)	2004-02-01	Kataria et al.	Applicant
US6704768(B1)	2004-03-01	Zombek et al.	Applicant
US6707824(B1)	2004-03-01	Achilles et al.	Applicant
US6711137(B1)	2004-03-01	Klassen et al.	Applicant
US6711152(B1)	2004-03-01	Kalmanek, Jr. et al.	Applicant
US6714549(B1)	2004-03-01	Phaltankar	Applicant
US6714896(B1)	2004-03-01	Barrett	Applicant
US6728484(B1)	2004-04-01	Ghani	Applicant
US6728779(B1)	2004-04-01	Griffin et al.	Applicant
US6735177(B1)	2004-05-01	Suzuki	Examiner
US6748426(B1)	2004-06-01	Shaffer et al.	Applicant
US6751562(B1)	2004-06-01	Blackett et al.	Applicant
US6751664(B1)	2004-06-01	Kogan et al.	Examiner
US6757255(B1)	2004-06-01	Aoki et al.	Examiner
US6760775(B1)	2004-07-01	Anerousis et al.	Applicant
US6760777(B1)	2004-07-01	Agarwal et al.	Applicant
US6766381(B1)	2004-07-01	Barker et al.	Applicant
US6795399(B1)	2004-09-01	Benmohamed et al.	Applicant
US6795860(B1)	2004-09-01	Shah	Applicant
US6801502(B1)	2004-10-01	Rexford et al.	Applicant
US6810417(B2)	2004-10-01	Lee	Applicant
US6819662(B1)	2004-11-01	Grover et al.	Applicant
US6820133(B1)	2004-11-01	Grove et al.	Applicant
US6826613(B1)	2004-11-01	Wang et al.	Applicant
US6829221(B1)	2004-12-01	Winckles et al.	Applicant
US6836463(B2)	2004-12-01	Garcia-Luna-Aceves et al.	Applicant
US6839745(B1)	2005-01-01	Dingari et al.	Applicant
US6839751(B1)	2005-01-01	Dietz et al.	Applicant
US6885641(B1)	2005-04-01	Chan et al.	Applicant
US6909700(B1)	2005-06-01	Benmohamed et al.	Applicant
US6912222(B1)	2005-06-01	Wheeler et al.	Applicant
US6956858(B2)	2005-10-01	Hariguchi et al.	Applicant
US6963575(B1)	2005-11-01	Sistanizadeh et al.	Applicant
US6963914(B1)	2005-11-01	Breitbart et al.	Examiner
US6973490(B1)	2005-12-01	Robertson et al.	Applicant
US6981055(B1)	2005-12-01	Ahuja et al.	Applicant
US6984991(B2)	2006-01-01	Bond et al.	Applicant
US6993584(B2)	2006-01-01	Border et al.	Applicant
US6999432(B2)	2006-02-01	Zhang et al.	Applicant
US7002917(B1)	2006-02-01	Saleh	Applicant
US7020086(B2)	2006-03-01	Juttner et al.	Applicant
US7024475(B1)	2006-04-01	Abaye et al.	Applicant
US7043541(B1)	2006-05-01	Bechtolsheim et al.	Applicant
US7043562(B2)	2006-05-01	Dally et al.	Applicant
US7065584(B1)	2006-06-01	Shavitt et al.	Applicant
US7085230(B2)	2006-08-01	Hardy	Applicant
US7099282(B1)	2006-08-01	Hardy	Applicant
US7110393(B1)	2006-09-01	Tripathi et al.	Applicant
US7111073(B1)	2006-09-01	Jain et al.	Applicant
US7123620(B1)	2006-10-01	Ma	Applicant
US7139242(B2)	2006-11-01	Bays	Applicant
US7155436(B2)	2006-12-01	Hegde et al.	Applicant
US7162539(B2)	2007-01-01	Garcie-Luna-Aceves	Applicant
US7269157(B2)	2007-09-01	Klinker et al.	Applicant
US2001/0010059(A1)	2001-07-01	Burman et al.	Applicant
US2001/0026537(A1)	2001-10-01	Massey	Applicant
US2001/0037311(A1)	2001-11-01	McCoy et al.	Applicant
US2002/0038331(A1)	2002-03-01	Flavin	Applicant
US2002/0087687(A1)	2002-07-01	Zaifman et al.	Applicant
US2002/0101821(A1)	2002-08-01	Feldmann et al.	Applicant
US2002/0124100(A1)	2002-09-01	Adams	Applicant
US2002/0152318(A1)	2002-10-01	Menon et al.	Applicant
US2002/0184527(A1)	2002-12-01	Chun et al.	Applicant
US2003/0016770(A1)	2003-01-01	Trans et al.	Applicant
US2003/0039212(A1)	2003-02-01	Lloyd et al.	Applicant
US2003/0112788(A1)	2003-06-01	Erhart et al.	Applicant
US2004/0030776(A1)	2004-02-01	Cantrell et al.	Applicant
US2004/0062267(A1)	2004-04-01	Minami et al.	Applicant
US2004/0218546(A1)	2004-11-01	Clark	Applicant
US2005/0044270(A1)	2005-02-01	Groove et al.	Applicant
US2005/0083912(A1)	2005-04-01	Asfar et al.	Applicant
US2005/0132060(A1)	2005-06-01	Mo et al.	Applicant
US2005/0185654(A1)	2005-08-01	Zadikian et al.	Applicant
US2005/0201302(A1)	2005-09-01	Gaddis et al.	Applicant
US2005/0243726(A1)	2005-11-01	Narendran	Applicant
US2006/0026682(A1)	2006-02-01	Zakas	Applicant
US2006/0036763(A1)	2006-02-01	Johnson et al.	Applicant
US2007/0271066(A1)	2007-11-01	Nikitin et al.	Applicant
US2008/0101793(A1)	2008-05-01	Koch et al.	Applicant
EP504537	1991-03-01		Applicant
EP528075(A1)	1993-02-01		Applicant
EP788267(A2)	1997-08-01		Applicant
EP598969(B1)	1999-02-01		Applicant
EP942560(A2)	1999-09-01		Applicant
EP977456(A2)	2000-02-01		Applicant
EP982901(A1)	2000-03-01		Applicant
EP999674(B1)	2004-04-01		Applicant
WO94/08415	1994-04-01		Applicant
WO99/06913	1999-02-01		Applicant
WO99/14907	1999-03-01		Applicant
WO99/14931	1999-03-01		Applicant
WO99/14932	1999-03-01		Applicant
WO99/18751	1999-04-01		Applicant
WO99/30460	1999-06-01		Applicant
WO99/39481	1999-08-01		Applicant
WO/04458	2000-01-01		Applicant
WO/25224	2000-05-01		Applicant
WO/38381	2000-06-01		Applicant
WO/45560	2000-08-01		Applicant
WO/52906	2000-09-01		Applicant
WO/62489	2000-10-01		Applicant
WO/72528(A1)	2000-11-01		Applicant
WO/79362(A2)	2000-12-01		Applicant
WO/79730(A2)	2000-12-01		Applicant
WO1/06717(A1)	2001-01-01		Applicant
WO1/13585(A1)	2001-02-01		Applicant
WO2/33896(A3)	2002-04-01		Applicant

Non-Patent Literature (27)

Nick Feamster et al., “Controlling the Impact of BGP Policy Changes on IP Traffic”, Nov. 6, 2001, pp. 1-18.Applicant
Dean Jones, “Developing Shared Ontologies in Multi-Agent Systems”, pp. 1-10.Applicant
L. Massoulié et al., “Arguments in favour of admission control for TCP flows”, pp. 1-16.Applicant
“A Longest Prefix Match Search Engine for Multi-Gigabit IP Processing”, Masayoshi Kobayashi et al., C&C Media Research Laboratories, NEC Corporation, pp. 1360-1364, 2000 IEEE.Applicant
“Internet Protocol” from Nortel Networks, www.arvelo.net/net-bay-ip.html. Apr. 6, 2005, 26 pages.Applicant
Yasushi Saito et al., “Manageability, Availability and Performance in Porcupine: A Highly Scalable, Cluster-Based Mail Service”, 17th ACM Symposium on Operating System Principles, pp. 1-15, Dec. 1999.Applicant
Nikolaos Skarmeas et al., “Content Based Routing as the Basis for Intra-Agent Communication”, Department of Computing Imperial College London.Applicant
Nikolaos Skarmeas et al., “Intelligent Routing Based on Active Patterns as the Basis for the Integration of Distributed Information Systems”, Department of Computing Imperial College London, Feb. 1997.Applicant
Z. Wang et al., “Resource Allocation for Elastic Traffic: Architecture and Mechanisms,” pp. 158-169.Applicant
J. Yu, “Scalable Routing Design Principles,” The Internet Society, Jul. 2000, pp. 1-26.Applicant
Paul Francis et al., “An Architecture for a Global Internet Host Distance Estimation Service,” pp. 1-17.Applicant
T. Bates et al., “Multiprotocol Extensions for BGP-4”, The Internet Society, Jun. 2000, pp. 1-10.Applicant
S. Kumar et al., “The MASC/BGMP Architecture for Inter-domain Multicast Routing,” 12 pages.Applicant
S. Berson et al., “An Architecture for Advance Reservations in the Internet,” USC Information Sciences Institute, Jul. 16, 1998, pp. 1-21.Applicant
R. P. Draves et al., “Constructing Optimal IP Routing Tables,” 1999 IEEE, 1-10.Applicant
R. Govindan et al., “An Analysis of Internet Inter-Domain Topology and Route Stability,” USC Information Sciences Institute, 1997 IEEE, 8 pages.Applicant
V. Paxson, “Toward a Framework for Defining Internet Performance Metrics,” http://www.isoc.org/inet96/proceedings/d3/d3—3.htm, pp. 1-20.Applicant
C. Alaettinoglu et al. “Routing Policy Specification Language (RPSL),” http://quimby.gnus.org/internet-drafts/draft-ietf-rps-rpsl-v2-00.txt, pp. 1-56.Applicant
P. Traina, “BGP-4 Protocol Analysis,” Mar. 1995, pp. 1-10.Applicant
B. Krishnamurthy et al., “On Network-Aware Clustering of Web Clients,” 14 pages.Applicant
Sami Iren et al., “The Transport Layer: Tutorial and Survey”, ACM Computing Surveys, vol. 31, No. 4, Dec. 1999, pp. 361-405.Applicant
D. B. Ingham et al., “Supporting Highly Manageable Web Services”, Computer Networks and ISDN Systems 29 (1997), pp. 1405-1416.Applicant
Murthy, Shree, et al, “A loop-free routing protocol for large-scale internets using distance vectors,”Mar. 14, 2007, pp. 147-161, Computer Communications.Applicant
Francis, Paul, et al, “An Architecture for a Global Internet Host Distance Estimation Service,” 1999, pp. 210-217, IEEE.Applicant
Bouloutas, A. et al, “Some Graph Partitioning Problems and Algorithms Related to Routing in Large Computer Networks,” International Conference on Distributed Computing Systems, Newport Beach, Jun. 5-9, 1989, pp. 362-370, Washington, IEEE Comp. Soc. Press, US.Applicant
Yositsugu Ohmae et al, “Dividing Method for Topological Design of Corporate Communication Networks,” Aug. 1, 1992, pp. 54-62, Communications, Wiley Hoboken ,NJ, US.Applicant
D. New, “RFC 3620, The Tunnel Profile,” Oct. 2003, The Internet Society.Applicant

Abstract

Description

Cross Reference to Related Applications

Background of the Invention

[0002] 1. Field of the Invention

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

[0004] 2. Description of the Related Art

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

Summary of the Invention

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

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

[0019] These and other embodiments are described further herein.

Brief Description of the Figures

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

[0021] 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.

Detailed Description

Measurement Packets

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

[0026]


	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;
	};

Data Included in the Measurement Packets

[0032] 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.

[0034]


	class SubPacket {
	/*
	* The type identifier for this subpacket.
	*/
	uint8_t mType;
	/*
	* The length of this subpacket, in network byte order.
	*/
	uint16_t mLength;
	};

[0035] 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.

[0037] 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.

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

[0039]


	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;
	};