# US 2002/0057706 A1 · Method and arrangement for prioritized data transmission of packets

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

- Number: US 2002/0057706 A1
- Document ID: US20020057706A1
- Status: Published application
- Kind: A1
- Application number: 09/090,589
- Filed: 1998-06-04
- Published: 2002-05-16
- Earliest claimed: 1997-06-20
- Assignees: Alcatel
- Inventors: HERMAN MICHIEL
- Web page: https://patentgrep.com/patent/US20020057706A1

## CPC

- H04L 47/623: {Weighted service order}
- H04L 47/50: Queue scheduling
- H04L 47/522: {Dynamic queue service slot or variable bandwidth allocation}
- H04L 47/6215: {Individual queue per QOS, rate or priority}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method and arrangement for prioritised transmission of packets from a plurality of storage queues, each interfacing one corresponding input bitstream to one common transmission medium, is disclosed, whereby the respective queue priorities, on the basis of which access to the common transmission medium is determined, are itself dependent upon respective weigths associated to the corresponding input bitstreams. This dependency on these respective weight; relates to a respective amount of successive values of these respective queue priorities, to be selected from an arbitrary interval and sorted in a predetermined sequence.

## Claims

### Claim 1

Method for prioritised transmission of packets from a plurality of storage queues (SQ1, . . . , SQm), each interfacing one corresponding input bitstream (BS1, . . . , BSm) to one common transmission medium (UDATA), said method including a step of determining a respective queue priority (QPR1, . . . , QPRm) for each respective storage queue (SQ1, . . . , SQm), on the basis of which access to said common transmission medium (UDATA) is determined in accordance to a predetermined access criterion,
characterised in that
said respective queue priority (QPR1, . . . , QPRm) is dependent upon a respective weight (w1, . . . , wm), being a positive real number and associated to said corresponding input bitstream (BS1, . . . , BSm).

### Claim 2 (depends on 1)

Method according to claim 1
characterised in that
the dependency of said respective queue priority (QPR1, . . . , QPRm) upon said respective weight (w1, . . . , wm) relates to a respective amount (K1, . . . , Km), of successive values of said respective queue priorities, said respective amount of successive values being a respective set of said respective amount of distinct values, selected within an interval [Pmin,Pmax] and sorted out in a predetermined sequence, with Pmin being a first real number lower than a second real number Pmax, said predetermined access criterion thereby being related to said predetermined sequence.

### Claim 3 (depends on 2)

Method according to claim 2
characterised in that
said respective queue priority is reset, at respective predetermined instances related to said respective weights, to a respective value at a predetermined position of said respective set.

### Claim 4 (depends on 2)

Method according to claim 2
characterised in that
said respective amount (K1, . . . , Km) is determined as the integer most approximating the product of said respective weight (w1, . . . , wm) and a normalisation factor (NF).

### Claim 5 (depends on 4)

Method according to claim 4
characterised in that
said normalisation factor is determined as a value not lower than the maximum between the inverse value (1/Rw) of a predetermined resolution (Rw) of said weights and the inverse value (1/wmin) of a predetermined minimum limit value (wmin) of said weights, whereby 1 added to the product of the width of said interval (Pmax−Pmin) and the inverse value (1/Rp) of a predetermined resolution (Rp) of said priorities is not lower than the product of a predetermined maximum limit value (wmax) for said respective weights and said normalisation factor (NF).

### Claim 6 (depends on 2)

Method according to claim 2
characterised in that
for said respective amount (K1, . . . , Km) being larger than 1, said respective amount of distinct values are equidistantly spaced over the total width of said interval [Pmin,Pmax].

### Claim 7

Arrangement (DTA) for prioritised data transmission of packets from a first plurality of storage queues (SQ1, . . . , SQm) included in said arrangement, each interfacing one corresponding input bitstream (BS1, . . . , BSm) to one common transmission medium (UDATA) coupled to said plurality of storage queues, said arrangement (DTA) including a second plurality of queue priority determining means (QPDM1, . . . , QPDMm), each respective queue priority determining means (QPDM1, . . . , QPDMm) of said second plurality being associated to a respective storage queue (SQ1, . . . , SQm) of said first plurality and adapted to determine a respective queue priority (QPR1, . . . , QPRm), said arrangement (DTA) further including an access control device (ACD) adapted to receive from said each respective queue priority determining means (QPDM1, . . . , QPDMm) said respective queue priority (QPR1, . . . , QPRm) and to determine therefrom, in accordance to a predetermined access criterion, which storage queue of said first plurality gets access to said common transmission medium (UDATA),
characterised in that
said each respective queue priority determining means (QPDM1, . . . , QPDMm) is further adapted to determine said respective queue priority (QPR1, . . . , QPRm) from a respective weight (w1, . . . , wm), being a positive real number and associated to said corresponding input bitstream (BS1, . . . , BSm).

### Claim 8 (depends on 7)

Arrangement according to claim 7
characterised in that
said each respective queue priority determining means (QPDM1, . . . , QPDMm) is further adapted to determine a respective amount (K1, . . . , Km) of successive values of said respective queue priorities as a respective set of said respective amount of distinct values, selected within an interval [Pmin,Pmax], and sorted out in a predetermined sequence, said respective amount (K1, . . . , Km) thereby being dependent upon said respective weight (w1, . . . , wm) associated to said corresponding input bitstream (BS1, . . . , BSm), and Pmin being a first real number smaller than Pmax being a second real number, whereby said predetermined access criterion is related to said predetermined sequence.

### Claim 9 (depends on 8)

Arrangement according to claim 8
characterised in that
said each respective queue priority determining means (QPDM1, . . . , QPDMm) is further adapted to reset said respective queue priority at respective predetermined instances related to said respective weights, to a respective value at a predetermined position, of said respective set.

### Claim 10 (depends on 8)

Arrangement according to claim 8
characterised in that
said each respective queue priority determining means (QPDM1, . . . , QPDMm) is further adapted to determine said respective amount (K1, . . . , Km) as the integer most approximating the product of said respective weight (w1, . . . , wm) and a normalisation factor (NF).

### Claim 11 (depends on 10)

Arrangement according to claim 10
characterised in that
said arrangement further includes a device adapted to determine said normalisation factor (NF) as a value not lower than the maximum between the inverse value (1/Rw) of a predetermined resolution (Rw) of said weights and the inverse value (1/wmin) of a predetermined minimum limit value (wmin) of said weights, said arrangement further including a second device adapted to determine said first real number Pmin and said second real number Pmax so that 1 added to the product of the width of said interval (Pmax−Pmin) and the inverse value (1/Rp) of a predetermined resolution (Rp) of said priorities is not lower than the product of a predetermined maximum limit value (wmax) for said respective weights, and said normalisation factor (NF).

### Claim 12 (depends on 8)

Arrangement according to claim 8
characterised in that
said each respective queue priority determining means (QPDM1, . . . , QPDMm) is further adapted to determine said respective amount of successive values of said respective queue priorities as equidistantly spaced real values over the total width of said interval [Pmin,Pmax], in case said respective amount is larger than 1.
