# US 2012/0254459 A1 · Managing data file transmission

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

- Number: US 2012/0254459 A1
- Document ID: US20120254459A1
- Status: Published application
- Kind: A1
- Application number: 13/077,420
- Filed: 2011-03-31
- Published: 2012-10-04
- Earliest claimed: 2011-03-31
- Assignees: Alcatel-Lucent USA Inc.
- Inventors: Mohammadali Maddah-Ali
- Web page: https://patentgrep.com/patent/US20120254459A1

## 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

In a method for managing transmission of data files to users, a first file is divided into a plurality of first segments and a second file is divided into a plurality of second segments. A first segment is sent to a first user and a different first segment is sent to a second user. A second segment is sent to the first user and a different second segment is sent to the second user. At least part of a segment sent to the first user is combined with at least part of a segment sent to the second user to produce a combined segment which is of smaller size than the total size of the at least parts of segments before combining. The combined segment is transmitted to the first user and to the second user for each user to recover a segment using the combined segment and at least part of a segment.

## Claims

### Claim 1

A method for managing transmission of data files to users, comprising:
dividing a first file into a plurality of first segments;
dividing a second file into a plurality of second segments;
sending a first segment to a first user and a different first segment to a second user;
sending a second segment to the first user and a different second segment to the second user;
combining at least part of a segment sent to the first user with at least part of a segment sent to the second user to produce a combined segment which is of smaller size than the total size of the at least parts of segments before combining; and
transmitting the combined segment to the first user and to the second user for each user to recover a segment using the combined segment and at least part of a segment.

### Claim 2 (depends on 1)

The method as claimed in claim 1 wherein the at least part of a segment sent to the first user is combined with at least part of a segment sent to the second user by using addition in a finite field.

### Claim 3 (depends on 2)

The method as claimed in claim 2 wherein the finite field is the binary field.

### Claim 4 (depends on 1)

The method as claimed in claim 1 wherein the first and second segments sent to the first and second users are sent prior to the combined segment being sent to the first and second users.

### Claim 5 (depends on 4)

The method as claimed in claim 4 and including storing the first and second segments sent to the first user at a first cache memory local to the first user; and storing the first and second segments sent to the second user at a second cache memory local to the second user.

### Claim 6 (depends on 1)

The method as claimed in claim 1 and including dividing a segment into first and second parts; incorporating the first part into the combined segment; and transmitting the second part to the first and second users.

### Claim 7 (depends on 6)

The method as claimed in claim 6 and including transmitting the second part with the combined segment.

### Claim 8 (depends on 1)

The method as claimed in claim 1 and including choosing the sizes of the first segments and of the second segments to minimize the average rate.

### Claim 9 (depends on 1)

The method as claimed in claim 1 and including using the probability that the first file and the second file will be required by the first user and/or the second user in optimizing the sizes of the first segments and of the second segments.

### Claim 10 (depends on 1)

The method as claimed in claim 1 and including the first user using the combined segment in reconstituting one of the first and second files; and the second user using the combined segment in reconstituting one of the first and second files.

### Claim 11 (depends on 1)

The method as claimed in claim 1 and including, where there are f files and K users, partitioning each file into 2 to the power of K segments, where for each subset of users, there is a segment which is saved on all of the users in that subset.

### Claim 12 (depends on 11)

The method as claimed in claim 11 and including optimizing the size of the segments to minimize at least one of: the average transmission load; the maximum transmission load; or another function of the transmission load.

### Claim 13

Data transmission manager for managing transmission of data files to users, comprising: a divider for dividing a first file into a plurality of first segments and for dividing a second file into a plurality of second segments; transmitter apparatus for sending a first segment to a first user and a different first segment to a second user, and for sending a second segment to the first user and a different second segment to the second user; a combiner for combining at least part of a segment sent to the first user with at least part of a segment set to the second user to produce a combined segment which is of smaller size than the total size of the at least parts of segments before combining; and said transmitter apparatus being operative to send the combined segment to the first user and to the second user for each of the first and second users to recover a segment using the combined segment and at least part of a segment.

### Claim 14 (depends on 13)

The data transmission manager as claimed in claim 13 wherein the combiner is operative to combine the at least part of a segment sent to the first user with at least part of a segment sent to the second user by using addition in a finite field.

### Claim 15 (depends on 14)

The data transmission manager as claimed in claim 14 wherein the finite field is the binary field.

### Claim 16 (depends on 13)

The data transmission manager as claimed in claim 13 wherein said transmission apparatus is operative to send the first and second segments to the first and second users prior to the combined segment being sent to the first and second users.

### Claim 17 (depends on 13)

The data transmission manager as claimed in claim in claim 13 wherein the divider is operative to divide a segment into first and second parts; the combiner is operative to incorporate the first part into the combined segment; and said transmitter apparatus is operative to send the second part to the first and second users.

### Claim 18 (depends on 17)

The data transmission manager as claimed in claim 17 wherein said transmitter apparatus is operative to transmit the second part with the combined segment.

### Claim 19 (depends on 13)

The data transmission manager as claimed in claim 13 and including a processor for choosing the sizes of the first segments and of the second segments to minimize the average rate.

### Claim 20 (depends on 13)

The data transmission manager as claimed in claim 13 and including a processor for using the probability that the first file and the second file will be required by the first user and/or the second user to optimize the sizes of the first segments and of the second segments.

### Claim 21 (depends on 13)

The data transmission manager as claimed in claim 13 wherein, where there are f files and K users, partitioning each file into 2 to the power of K segments, where for each subset of users, there is a segment which is saved on all of the users in that subset.

### Claim 22 (depends on 21)

The data transmission manager as claimed in claim 21 and including a processor for optimizing the size of the segments to minimize at least one of: the average transmission load; the maximum transmission load; or another function of the transmission load.
