# US 6,731,605 B1 · Prioritized optimal server side bandwidth allocation in a multimedia session with push and pull sources

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

- Number: US 6,731,605 B1
- Document ID: US6731605B1
- Status: Granted
- Kind: B1
- Application number: 09/596,515
- Filed: 2000-06-19
- Granted: 2004-05-04
- Earliest claimed: 2000-06-19
- Assignees: Sharp Laboratories of America, Inc.
- Inventors: Sachin G. Deshpande
- Web page: https://patentgrep.com/patent/US6731605B1

## CPC

- H04L 47/822: {Collecting or measuring resource availability data}
- H04L 47/2416: Real-time traffic
- H04L 47/2433: {Allocation of priorities to traffic types}
- H04L 47/283: in response to processing delays, e.g. caused by jitter or round trip time [RTT]
- H04L 47/70: Admission control; Resource allocation
- H04L 47/801: {Real time traffic}
- H04L 47/805: {QOS or priority aware}
- H04L 65/612: for unicast
- H04L 65/70: Media network packetisation
- H04L 65/80: Responding to QoS
- H04N 21/2385: Channel allocation (H04N21/266 takes precedence); Bandwidth allocation (H04N21/24 takes precedence {; allocation of channels according to the instantaneous demands of the users in time-division multiplex systems H04J3/1682; admission control, resource allocation in open networks H04L12/5692; arrangements for maintenance or administration in data switching networks involving bandwidth and capacity management H04L41/0896; negotiating bandwidth in wireless networks H04W28/16})
- H04N 21/2402: {Monitoring of the downstream path of the transmission network, e.g. bandwidth available (traffic monitoring in data switching networks H04L43/00; monitoring data switching networks utilization H04L43/0876)}
- 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 computer network, the bandwidth of the communication channel connecting nodes of the network is limited. A cost function is used to allocate the bandwidth of the channel among the data for a plurality of elements in a multimedia session. The cost function relates the distortion produced by a change in encoding rate for one or more media with a delay in transferring data related to another medium at a particular rate. A fairness criterion, expressing the relative weighting of the distorted and delayed elements for specific applications, can be included in the cost function. The cost function can be used to allocate the bandwidth between media from both push and pull sources.

## Claims

### Claim 1

A method of allocating a channel bandwidth to data for a plurality of media comprising the steps of:
(a) determining a distortion of a first medium as a function of a first data transfer rate;
(b) determining a delay of a second medium as a function of a second data transfer rate; and
(c) determining at least one of said first and said second data transfer rates that will minimize a cost function relating said distortion of said first medium and said delay of said second medium.

### Claim 2 (depends on 1)

The method of claim 1 wherein said cost function further relates a relative priority of said first and said second data transfer rates.

### Claim 3 (depends on 1)

The method of claim 1 wherein said first medium is a push medium and said second medium is at least one of a pull medium.

### Claim 4 (depends on 1)

The method of claim 1 wherein said first data transfer rate is controlled by a first computer and said second data transfer rate is controlled by a second computer.

### Claim 5 (depends on 1)

The method of claim 1 wherein:
(a) said first medium is transferred with a protocol providing unreliable delivery; and
(b) said second medium is transferred with a protocol providing reliable delivery.

### Claim 6

A method of allocating a communication channel bandwidth to data for a plurality of media comprising the steps of:
(a) reducing said bandwidth by a sum of all data rates for media having fixed data rates;
(b) determining a distortion of at least one variable data rate medium as a function of said variable data rate;
(c) determining a delay for at least one delayed medium as a function of a delayed medium data rate; and
(d) determining at least one of said variable data rate and said delayed medium data rate that will minimize a cost function relating said distortion of said variable data rate medium and said delay of said delayed medium.

### Claim 7 (depends on 6)

The method of claim 6 wherein said variable data rate medium is a push medium.

### Claim 8 (depends on 6)

The method of claim 6 wherein said at least one delayed medium is pull medium.

### Claim 9 (depends on 6)

The method of claim 6 wherein said cost function further comprises at least one priority factor relating a relative priority of a medium.

### Claim 10 (depends on 10)

The method of claim 10 wherein said at least one variable data rate is controlled by a first computer and said at least one delayed medium data rate is controlled by a second computer.

### Claim 11

A method of allocating a communication channel bandwidth to data for a plurality of media comprising the steps of:
(a) reducing said bandwidth by a sum of all data rates for media having fixed data rates;
(b) determining a distortion of at least one variable data rate medium as a function of a variable encoding rate established by a first computer;
(c) determining a delay for at least one delayed medium as a function of a delayed medium data rate controlled by a second computer;
(d) assigning a fairness criterion expressing a relative priority of said variable data rate medium and said delayed medium and
(e) determining at least one of said variable encoding rate and said delayed medium data rate that will minimize a cost function relating said distortion of said variable data rate medium, said fairness criterion, and said delay of said delayed medium.

### Claim 12 (depends on 11)

The method of claim 11 wherein said at least one variable data medium is transferred with a protocol providing unreliable delivery.

### Claim 13 (depends on 11)

The method of claim 11 wherein said at least one variable data medium is transferred using a Real Time Transport Protocol.

### Claim 14 (depends on 12)

The method of claim 12 wherein said protocol providing unreliable delivery is a User Datagram Protocol.

### Claim 15 (depends on 11)

The method of claim 11 wherein said delayed medium is transferred by a protocol providing reliable delivery.

### Claim 16 (depends on 15)

The method of claim 15 wherein said protocol providing reliable delivery is a Hypertext Transport Protocol.
