# US 2008/0304413 A1 · Control of Data Flow in a Network

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

- Number: US 2008/0304413 A1
- Document ID: US20080304413A1
- Status: Published application
- Kind: A1
- Application number: 11/795,948
- Filed: 2006-01-31
- Published: 2008-12-11
- Earliest claimed: 2005-01-31
- Assignees: British Telecommunications public limited company
- Inventors: Robert J. Briscoe; Arnaud Jacquet
- Web page: https://patentgrep.com/patent/US20080304413A1

## CPC

- H04L 69/16: Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
- H04L 69/161: {Implementation details of TCP/IP or UDP/IP stack architecture; Specification of modified or new header fields}
- H04L 69/163: In-band adaptation of TCP data exchange; In-band control procedures
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Methods and apparatus for encoding a number of small dynamic values over an n-bit field. Also methods and apparatus allowing for the stateless extraction of separate sequences from repetitions of a single field whereby to communicate more than one signal at once.

## Claims

### Claim 1

A method of encoding information using a plurality of messages traversing a plurality of nodes in a network, said messages each having a header associated therewith comprising one or more fields, at least a selected portion of each header providing at least three codepoints; said method comprising assigning a codepoint from a first set of codepoints of the selected portion in headers associated with a first proportion of messages, and assigning a codepoint from a second set of codepoints of the selected portion in headers associated with a second proportion of messages, characterised in that
said first proportion is determined in dependence on a first network characteristic;
said second proportion is determined in dependence on a second network characteristic; and
at least one of said first and second network characteristics is variable independently of the other of said network characteristics.

### Claim 2 (depends on 1)

A method according to claim 1 wherein said selected portion is an n-bit field, where n is greater than 1.

### Claim 3 (depends on 2)

A method according to claim 2 wherein said n-bit field is a 2-bit field.

### Claim 4 (depends on 1)

A method according to claim 1, wherein said selected portion comprises an existing field in the header associated with each message.

### Claim 5 (depends on 1)

A method according to claim 1, wherein said selected portion comprises a contiguous subset of bits selected from the header associated with each message.

### Claim 6 (depends on 1)

A method according to claim 1, wherein said selected portion comprises a non-contiguous subset of bits selected from the header associated with each message.

### Claim 7 (depends on 1)

A method according to claim 1, wherein said selected portion comprises a Congestion Notification field.

### Claim 8 (depends on 1)

A method according to claim 1, wherein said selected portion comprises the Explicit Congestion Notification field.

### Claim 9 (depends on 1)

A method according to claim 1, wherein said information comprises at least one value.

### Claim 10 (depends on 1)

A method according to claim 1, wherein at least one of said network characteristics is a dynamic characteristic.

### Claim 11 (depends on 1)

A method according to claim 1, wherein said first and second network characteristics are dynamic characteristics.

### Claim 12 (depends on 1)

A method according to claim 1, wherein at least one of said network characteristics relates to congestion in said network.

### Claim 13 (depends on 1)

A method according to claim 1, wherein at least one of said network characteristics relates to a measure of end-to-end congestion on a path in said network.

### Claim 14 (depends on 13)

A method according to claim 13, wherein said network characteristic relating to end-to-end path congestion is dynamic in the sense that it may vary after a period corresponding to a round-trip time of a message traversing said path.

### Claim 15 (depends on 1)

A method according to claim 1, wherein at least one of said network characteristics relates to a measure of upstream congestion on a path in said network.

### Claim 16 (depends on 15)

A method according to claim 15, wherein said network characteristic relating to upstream congestion is dynamic in the sense that it may vary during a period corresponding to a round-trip time of a message traversing said path.

### Claim 17 (depends on 15)

A method according to claim 15, wherein said selected portion comprises the Explicit Congestion Notification field, and wherein a codepoint CE indicative of “Congestion Experienced” is assigned to the Explicit Congestion Notification field in the headers associated with a first proportion of messages in dependence on said measure of upstream congestion.

### Claim 18 (depends on 1)

A method according to claim 1, further comprising a step of changing at least one of said first and second proportions in response to an indication from a receiver of a message that said information requires updating, said changing step comprising:
selecting a proportion of messages from a plurality of subsequently-sent messages, said proportion being dependent on a characteristic of an indication from said receiver;
assigning codepoints to said selected messages such as to cause said information to be updated.

### Claim 19 (depends on 18)

A method according to claim 18 wherein said selected portion comprises the Explicit Congestion Notification field, and wherein said indication comprises a “Congestion Experienced” notification, and said step of selecting comprises selecting a message subsequent to receipt of said “Congestion Experienced” notification.

### Claim 20 (depends on 16)

A method according to claim 16 wherein said selected portion comprises the Explicit Congestion Notification field, and wherein said indication comprises a plurality of echoes of a “Congestion Experienced” notification, and said step of selecting comprises determining an estimate for the number N of messages acknowledged between receipt of two successive echoes and selecting one message for approximately every N−1 messages acknowledged.

### Claim 21 (depends on 20)

A method according to claim 20, wherein said estimate is a moving average and said step of selecting consists of:
selecting one message for every echo received;
and selecting one extra message for every N−1 echoes received.

### Claim 22 (depends on 1)

A method according to claim 1, wherein one or both of said sets of codepoints consists of one codepoint.

### Claim 23 (depends on 1)

A method according to claim 1 for performing the stateless extraction of separate sequences from repetitions of a single field whereby to communicate more than one signal at once.

### Claim 24 (depends on 23)

A method according to claim 23, further comprising superposition of the results of each by various arithmetic combinations.

### Claim 25 (depends on 1)

A method according to claim 1, at least one of said steps of assigning codepoints being performed by a node in said network when sending messages on a path traversing a plurality of nodes in the network.

### Claim 26 (depends on 1)

A method according to claim 1, at least one of said steps of assigning codepoints being performed by a node in said network when forwarding messages on a path traversing a plurality of nodes in the network.

### Claim 27 (depends on 1)

Apparatus for encoding information comprising means for carrying out the steps for implementing methods according to claim 1.
