# US 2015/0146516 A1 · Layered Multicast and Fair Bandwidth Allocation and Packet Prioritization

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

- Number: US 2015/0146516 A1
- Document ID: US20150146516A1
- Status: Published application
- Kind: A1
- Application number: 14/612,335
- Filed: 2015-02-03
- Published: 2015-05-28
- Earliest claimed: 2005-01-26
- Assignees: Blitz Stream Video, LLC
- Applicants: Blitz Stream Video, LLC
- Inventors: Erik Van Zijst
- Web page: https://patentgrep.com/patent/US20150146516A1

## CPC

- H04L 45/02: Topology update or discovery
- H04L 1/1874: {Buffer management}
- H04L 1/1887: {Scheduling and prioritising arrangements}
- H04L 12/1836: {with heterogeneous network architecture}
- H04L 43/0829: Packet loss
- H04L 45/04: {Interdomain routing, e.g. hierarchical routing}
- H04L 45/12: Shortest path evaluation
- H04L 45/123: {Evaluation of link metrics (techniques for monitoring network metrics H04L43/08)}
- H04L 45/16: Multipoint routing
- H04L 45/18: Loop-free operations
- H04L 45/302: Route determination based on requested QoS
- H04L 45/48: Routing tree calculation
- H04L 45/64: using an overlay routing layer
- H04L 47/10: Flow control; Congestion control
- H04L 47/11: Identifying congestion
- H04L 47/125: by balancing the load, e.g. traffic engineering
- H04L 47/15: {in relation to multipoint traffic (arrangements for broadcast or multicast in data networks H04L12/18)}
- H04L 47/2408: for supporting different services, e.g. a differentiated services [DiffServ] type of service
- H04L 47/2416: Real-time traffic
- H04L 47/2441: relying on flow classification, e.g. using integrated services [IntServ]
- H04L 47/30: in combination with information about buffer occupancy at either end or at transit nodes
- H04L 47/32: by discarding or delaying data units, e.g. packets or frames
- H04L 47/34: ensuring sequence integrity, e.g. using sequence numbers
- H04L 61/00: Network arrangements, protocols or services for addressing or naming
- H04L 61/103: across network layers, e.g. resolution of network layer into physical layer addresses or address resolution protocol [ARP]
- H04N 19/34: Scalability techniques involving progressive bit-plane based encoding of the enhancement layer, e.g. fine granular scalability [FGS]
- H04N 19/39: involving multiple description coding [MDC], i.e. with separate layers being structured as independently decodable descriptions of input picture data
- H04N 21/234327: {by decomposing into layers, e.g. base layer and one or more enhancement layers}
- H04N 21/23605: {Creation or processing of packetized elementary streams [PES]}
- H04N 21/2383: Channel coding {or modulation} of digital bit-stream, e.g. QPSK modulation (arrangements for detecting or preventing errors in the information received by adapting the channel coding H04L1/0009; analogue front ends or means for connecting modulators, demodulators or transceivers to a transmission line H04L27/0002)
- H04N 21/6125: {involving transmission via Internet (transmission by internet of broadcast information H04H60/82)}
- H04N 21/6405: Multicasting {(data broadcast and multicast in packet switching networks H04L12/18)}
- H04N 21/64322: {IP}
- H04L 1/18: Automatic repetition systems, e.g. Van Duuren systems
- H04L 12/1868: {Measures taken after transmission, e.g. acknowledgments}
- H04L 12/1881: {with schedule organisation, e.g. priority, sequence management}
- H04L 2101/604: Address structures or formats
- H04N 21/2662: Controlling the complexity of the video stream, e.g. by scaling the resolution or bitrate of the video stream based on the client capabilities
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

Embodiments include an overlay multicast network. The overlay multicast network may provide a set of features to ensure reliable and timely arrival of multicast data. The embodiments include a congestion control system that may prioritize designated layers of data within a data stream over other layers of the same data stream. Each data stream transmitted over the network may be given an equal share of the bandwidth. Addressing in routing tables maintained by routers in the may utilize summarized addressing based on the difference in location of the router and destination address. Summarization levels may be adjusted to minimize travel distances for packets in the network. Data from high priority data stream layers may also be retransmitted upon request from a destination machine to ensure reliable delivery of data

## Claims

### Claim 1

A method of replacing lost packets within a data transmission network distributing packets from a source to a plurality of receivers, said network including a plurality of connected nodes, each node including a buffer memory, said method comprising:
receiving a plurality of packets in a stream of data originating from said source at a first node within said network;
detecting in the first node the loss of a packet from said received stream of data;
sending from the first node toward said source a request for retransmission of said missing packet;
determining, at a preceding node of said network in response to receipt of a retransmission request, whether the missing packet is contained within a buffer within said preceding node; and
either forwarding the missing packet from the preceding node to the first node in response to the retransmission request if the packet is located in said buffer, or forwarding the retransmission request from the preceding node toward the source if the packet is not located in said buffer and said preceding node is not said source.

### Claim 2 (depends on 1)

A method of replacing lost packets within a data transmission network distributing packets from a source to a plurality of receivers, as set forth in claim 1, wherein each packet in said stream includes a sequence designation indicating its order within the sequence and the loss of a packet in said stream is detected by examining the sequence designations.

### Claim 3 (depends on 1)

A method of replacing lost packets within a data transmission network distributing packets from a source to a plurality of receivers, as set forth in claim 1, wherein packets are stored within said buffer for a fixed period of time after which they are discarded from said buffer.

### Claim 4 (depends on 1)

A method of replacing lost packets within a data transmission network distributing packets from a source to a plurality of receivers, as set forth in claim 1, wherein said buffer is allocated a fixed amount of memory space within said preceding node reserved to store the most recently forwarded packets and the older packets exceeding said fixed amount of memory space are discarded from said buffer.

### Claim 5 (depends on 1)

A method of replacing lost packets within a data transmission network distributing packets from a source to a plurality of receivers, as set forth in claim 1, wherein each of said data packets includes a priority designation selected from a plurality of priority designations to define a plurality of virtual streams of data, each virtual stream having a different priority and, further, that each packet within each virtual stream includes a sequence designation indicating its order in the sequence of packets within its virtual stream and wherein a retransmission request for a missing packet is generated only in the event the missing packet is from a virtual stream having a priority designation greater than a preselected value.

### Claim 6

A method of replacing lost packets within a data stream in a data transmission network distributing packets from a source to a plurality of receivers wherein each data packet includes a priority designation to define a plurality of separate virtual streams of data, each virtual stream having an associated priority, said method comprising:
receiving a plurality of packets in a plurality of virtual streams of data into a first node;
determining a congestion level of the network;
detecting in the first node the loss of a packet from one of said received virtual streams of data; and
deciding whether to send toward said source a request for retransmission of said missing packet based upon the congestion level of said network and the priority associated with the virtual stream of data from which the packet is missing.

### Claim 7 (depends on 6)

A method of replacing lost packets within a data stream in a data transmission network distributing packets from a source to a plurality of receivers as set forth in claim 6 wherein said retransmission request is sent in response to detection of a missing packet within one of the virtual streams of data if the congestion level of said network is less than a selected value.

### Claim 8 (depends on 6)

A method of replacing lost packets within a data stream in a data transmission network distributing packets from a source to a plurality of receivers as set forth in claim 6, wherein:
each data packet includes a priority designation corresponding to the priority of the packets' virtual stream;
each packet includes a sequence designation indicating its order in the sequence of packets within its virtual stream; and
said retransmission request is sent in response to detection of a missing packet within said sequence of packets within one of the virtual streams of data if the priority designation of the missing packet is greater than a selected priority value.

### Claim 9 (depends on 6)

A method of replacing lost packets within a data stream in a data transmission network distributing packets from a source to a plurality of receivers as set forth in claim 6 wherein the data in the packets represents video, each data packet being associated with a virtual stream, each virtual stream having an associated priority level, said priority designations based upon the perceived quality of the video represented by the packets in the virtual stream.

### Claim 10 (depends on 1)

A method of replacing lost packets within a data transmission network distributing packets from a source to a plurality of receivers, as set forth in claim 1, wherein packets are stored within said memory until they are successfully transmitted from said preceding node containing said memory, after which they are discarded from said memory.
