# US 2014/0207913 A1 · System and method for managing distribution of network information

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

- Number: US 2014/0207913 A1
- Document ID: US20140207913A1
- Status: Published application
- Kind: A1
- Application number: 13/746,406
- Filed: 2013-01-22
- Published: 2014-07-24
- Earliest claimed: 2013-01-22
- Assignees: Alcatel-Lucent USA Inc.
- Applicants: Alcatel-Lucent USA Inc.
- Inventors: Mohammadali MADDAH-ALI; Urs NIESEN
- Web page: https://patentgrep.com/patent/US20140207913A1

## CPC

- H04L 67/06: specially adapted for file transfer, e.g. file transfer protocol [FTP]
- H04L 67/10: in which an application is distributed across nodes in the network (software deployment G06F8/60; multiprogramming arrangements G06F9/46)
- H04L 67/104: Peer-to-peer [P2P] networks
- H04L 67/1076: {Resource dissemination mechanisms or network resource keeping policies for optimal resource availability in the overlay network}
- H04L 67/108: {characterised by resources being split in blocks or fragments}
- H04L 67/1091: {Interfacing with client-server systems or between P2P systems}
- H04L 67/5651: Reducing the amount or size of exchanged application data
- H04L 67/568: Storing data temporarily at an intermediate stage, e.g. caching
- H04L 67/5681: Pre-fetching or pre-delivering data based on network characteristics
- H04L 69/329: in the application layer [OSI layer 7]
- H04N 21/2225: Local VOD servers
- H04N 21/4331: {Caching operations, e.g. of an advertisement for later insertion during playback}
- H04N 21/47202: {for requesting content on demand, e.g. video on demand}
- H04N 21/632: {using a connection between clients on a wide area network, e.g. setting up a peer-to-peer communication via Internet for retrieving video segments from the hard-disk of other client devices (broadcast-related systems characterised by transmission among terminal devices H04H60/80; distributed application using peer-to-peer [P2P] networks H04L67/104)}
- H04N 21/8456: {by decomposing the content in the time domain, e.g. in time segments}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

A method for distributing information in a network includes independently selecting and sending segments of N files to a plurality of terminals through a network. One or more of the selected segments except a first segment are sent to a first number of the K terminals, and one or more of the selected segments except a second segment are sent to a second number of the K terminals. A first logical combination of segments is then generated and sent to the terminals. By logically combining the first logical combination with previously sent files, a new file not previously received may be recovered.

## Claims

### Claim 1

A method for distributing information in a network, comprising:
independently selecting segments of N files with N 2;
sending the selected segments to K terminals with K 2, the sending including sending one or more of the selected segments except a first segment to a first number of the K terminals and sending one or more of the selected segments except a second segment to a second number of the K terminals;
generating a first logical combination of segments of L files of the N files with L≦N; and
sending the first logical combination to Q terminals of the K terminals, with Q≦K, the one or more selected segments sent to the first number of K terminals including the second segment and the one or more selected segments sent to the second number of K terminals including the first segment, a logical combination of the first logical combination and the one or more selected segments sent to the first terminal corresponding to the first segment and a logical combination of the first logical combination and the one or more selected segments sent to the second terminal corresponding to the second segment.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first and second segments correspond to different files of the N files.

### Claim 3 (depends on 1)

The method of claim 1, wherein the first and second segments correspond to a same file of the N files.

### Claim 4 (depends on 1)

The method of claim 1, wherein the first number of the K terminals is one or more.

### Claim 5 (depends on 1)

The method of claim 1, wherein the second number of the K terminals is one or more.

### Claim 6 (depends on 1)

The method of claim 1, wherein the first number of the K terminals equals the second number of the K terminals.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
combining a first number of bits from a first one of the N files with a second number of bits from a second one of the N files; and
forming one of the first segment or the second segment based on a combination of the first and second numbers of bits.

### Claim 8 (depends on 7)

The method of claim 7, wherein the first number of bits is different from the second number of bits.

### Claim 9 (depends on 1)

The method of claim 1, further comprising:
generating the first and second segments in different servers.

### Claim 10 (depends on 1)

The method of claim 1, wherein the N files are sub-files of same content.

### Claim 11

An apparatus for distributing information, comprising:
a selector configured to independently select segments of N files; and
a controller configured to send the selected segments to K terminals, where, N≧2 and K≧2, the controller configured to send one or more of the selected segments except a first segment to a first number of the K terminals and to send one or more of the selected segments except a second segment to a second number of the K terminals, the controller further configured to:
generate a first logical combination of segments of L files of the N files with L≦N; and
send the first logical combination to Q terminals of the K terminals, with Q≦K, the one or more selected segments sent to the first number of K terminals including the second segment and the one or more selected segments sent to the second number of K terminals including the first segment, a logical combination of the first logical combination and the one or more selected segments sent to the first terminal corresponding to the first segment and a logical combination of the first logical combination and the one or more selected segments sent to the second terminal corresponding to the second segment.

### Claim 12 (depends on 11)

The apparatus of claim 11, wherein the first and second segments correspond to different files of the N files.

### Claim 13 (depends on 11)

The apparatus of claim 11, wherein the first and second segments correspond to a same file of the N files.

### Claim 14 (depends on 11)

The apparatus of claim 11, wherein the first number of the K terminals is one or more.

### Claim 15 (depends on 11)

The apparatus of claim 11, wherein the second number of the K terminals is one or more.

### Claim 16 (depends on 11)

The apparatus of claim 11, wherein the first number of the K terminals equals the second number of the K terminals.

### Claim 17 (depends on 11)

The apparatus of claim 11, wherein the controller is configured to:
combine a first number of bits from a first one of the N files with a second number of bits from a second one of the N files; and
form one of the first segment or the second segment based on a combination of the first and second numbers of bits.

### Claim 18 (depends on 17)

The apparatus of claim 17, wherein the first number of bits is different from the second number of bits.

### Claim 19 (depends on 11)

The apparatus of claim 11, wherein the N files are sub-files of same content.

### Claim 20 (depends on 11)

The apparatus of claim 11, wherein the N files are different movies.
