# US 2012/0269085 A1 · Multicast-Based Inference of Temporal Loss Characteristics in Packet Data Networks

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2012/0269085 A1
- Document ID: US20120269085A1
- Status: Published application
- Kind: A1
- Application number: 13/534,412
- Filed: 2012-06-27
- Published: 2012-10-25
- Earliest claimed: 2007-09-20
- Assignees: AT&T Intellectual Property II, L.P.
- Inventors: Nicholas Geoffrey Duffield; Vijay Arya; Darryl Neil Veitch
- Web page: https://patentgrep.com/patent/US20120269085A1

## CPC

- H04L 43/10: Active monitoring, e.g. heartbeat, ping or trace-route
- H04L 43/0852: Delays
- H04L 43/0829: Packet loss
- H04L 43/0864: Round trip delays
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Disclosed are method and apparatus for characterizing the temporal loss characteristics of a packet data network by multicast-based inference. Multicast probes are transmitted from a source node to a plurality of receiver nodes, which record the arrivals of the multicast probes. From the aggregate data comprising recorded arrivals of the end-to-end paths from the source node to each receiver node, temporal loss characteristics of individual links within the network may be calculated. In a network with a tree topology, the complexity of calculations may be reduced through a process of subtree partitioning.

## Claims

### Claim at position 1

1-10. (canceled)

### Claim 11

A method for characterizing a packet data network comprising a source node, a plurality of receiver nodes, and a plurality of paths, wherein each path in the plurality of paths connects the source node with one of the plurality of receiver nodes and wherein each of the paths comprises one or more links, the method comprising:
recording at each of the plurality of receiver nodes arrivals of a plurality of multicast probe messages transmitted from the source node; and
calculating, by a processor communicatively coupled to a data storage device, a probability that a length of a pass-run or a length of a loss-run exceeds a specific value over a selected variable time interval for each link in the plurality of links for each path in the plurality of paths by inference from the arrivals of the plurality of multicast probe messages.

### Claim 12 (depends on 11)

The method of claim 11 wherein the selected variable time interval is non-contiguous.

### Claim 13 (depends on 11)

The method of claim 11 wherein a topology of the packet data network is a binary tree and wherein the binary tree is partitioned into two subtrees.

### Claim 14 (depends on 11)

The method of claim 11 wherein a topology of the packet data network is an arbitrary tree and wherein the arbitrary tree is partitioned into two subtrees.

### Claim 15 (depends on 14)

The method of claim 14 further comprising calculating a joint probability of concurrent probe message paths within the two subtrees.

### Claim 16

An apparatus for characterizing a packet data network comprising a source node, a plurality of receiver nodes, and a plurality of paths wherein each path in the plurality of paths connects the source node with one of the plurality of receiver nodes and wherein each of the paths comprises a plurality of links, the apparatus comprising:
a data storage device storing computer program instructions; and
a processor communicatively coupled to the data storage device, the processor configured to execute the computer program instructions, which, when executed on the processor, cause the processor to perform a method comprising:
recording at each of the plurality of receiver nodes arrivals of a plurality of multicast probe messages transmitted from the source node; and
calculating a probability that a length of a pass-run or a length of a loss-run exceeds a specific value over a selected variable time interval for each link in the plurality of links for each path in the plurality of paths by inference from the recorded arrivals.

### Claim 17 (depends on 16)

The apparatus of claim 16 wherein the selected variable time interval is non-contiguous.

### Claim 18 (depends on 16)

The apparatus of claim 16 wherein a topology of the packet data network is a binary tree and wherein the method further comprises partitioning the binary tree into two subtrees.

### Claim 19 (depends on 16)

The apparatus of claim 16 wherein a topology of the packet data network is an arbitrary tree and wherein the method further comprises partitioning the arbitrary tree into two subtrees.

### Claim 20 (depends on 19)

The apparatus of claim 19 wherein the method further comprises calculating a joint probability of concurrent probe message paths within the two subtrees.

### Claim 21

A computer readable medium storing computer program instructions for characterizing a packet data network comprising a source node, a plurality of receiver nodes, and a plurality of paths wherein each path in the plurality of paths connects the source node with one of the plurality of receiver nodes and wherein each of the paths comprises one or more links, which, when executed on a processor, cause the processor to perform a method comprising:
recording at each of the plurality of receiver nodes arrivals of a plurality of multicast probe messages transmitted from the source node; and
calculating a probability that a length of a pass-run or a length of a loss-run exceeds a specific value over a selected variable time interval for each link in the plurality of links for each path in the plurality of paths by inference from the recorded arrivals.

### Claim 22 (depends on 21)

The computer readable medium of claim 21 wherein the selected variable time interval is non-contiguous.

### Claim 23 (depends on 21)

The computer readable medium of claim 21 wherein a topology of the packet data network is a binary tree and wherein the method further comprises partitioning the binary tree into two subtrees.

### Claim 24 (depends on 21)

The computer readable medium of claim 21 wherein a topology of the packet data network is an arbitrary tree and wherein the method further comprises partitioning the arbitrary tree into two subtrees.

### Claim 25 (depends on 24)

The computer readable medium of claim 24 wherein the method further comprises calculating a joint probability of concurrent probe message paths within the two subtrees.
