# US 2008/0304416 A1 · Method and Apparatus for Solving Data Packet Traffic Congestion

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

- Number: US 2008/0304416 A1
- Document ID: US20080304416A1
- Status: Published application
- Kind: A1
- Application number: 12/158,946
- Filed: 2005-12-23
- Published: 2008-12-11
- Earliest claimed: 2005-12-23
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Inventors: Gabor Fodor; Reiner Ludwig
- Web page: https://patentgrep.com/patent/US20080304416A1

## CPC

- H04L 47/11: Identifying congestion
- H04L 47/25: with rate being modified by the source upon detecting a change of network conditions
- H04L 67/61: taking into account QoS or priority requirements
- H04W 8/04: Registration at HLR or HSS [Home Subscriber Server]
- H04W 28/0284: {detecting congestion or overload during communication (monitoring arrangements H04L43/00)}
- H04W 28/0289: {Congestion control (load shedding arrangements in network planning H04W16/08; performing reselection for handling the traffic H04W36/22; wireless traffic scheduling H04W72/12)}
- H04W 72/52: based on load
- H04W 72/542: using measured or perceived quality
- H04W 72/566: of the information or information source or recipient
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

The present invention relates to data packet traffic congestion solving mechanism in a node of a Radio Access Network (RAN), said mechanism is capable of blocking the transmission of data packets between a user terminal (UT) and said node in both uplink and downlink directions, if a created blocking table indicates for a scheduler that said user terminal has been determined to have been idle for more than a pre-determined time.

## Claims

### Claim 1

A data packet traffic congestion solving method for cellular radio communication comprising a Radio Access Network (RAN), said network comprising at least one node, said node comprises a channel dependent scheduler for monitoring and controlling UT scheduling due to Channel Quality Identification (CQI) and stored data packet information belonging to data packets waiting to be selected for transmission to or from identified and addressed user terminals UT, wherein the method comprises the steps of:
creating a table comprising those of said user terminals UT that belongs to the same service class (P), when a state of traffic congestion has occurred or is close to occur;
maintaining said table as long as said congestion state is present; —blocking the transmission of data packets between a user terminal (UT) and said node in both uplink and downlink directions, if the table indicates for said scheduler that said user terminal has been determined to have been idle for more than a pre-determined time.

### Claim 2 (depends on 1)

The method according to claim 1, wherein said method further involves the step of:
allowing transmission of data packets between a user terminal and said node in both uplink and downlink directions, if the scheduler readable table indicates for said scheduler that said user terminal is determined to be still active.

### Claim 3 (depends on 1)

The method according to claim 1, wherein said creating step involves the step of:
introducing in said table one entry for each user terminal, and for each user terminal one per-UT timer.

### Claim 4 (depends on 3)

The method according to claim 3, wherein said creating step involves the step of:
setting each represented user terminal as IDLE and the corresponding per-UT timer to a pre-determined start value.

### Claim 5 (depends on 1)

The method according to claim 1, wherein said maintaining step involves the step of:
changing a user terminal entry in the table from IDLE to ACTIVE if the corresponding data packet(s) has/have been successfully transmitted, e.g. that an acknowledgement has been received from the receiving party.

### Claim 6 (depends on 5)

The method according to claim 5, wherein said maintaining step also involves the step of:
setting the counting value of the corresponding per-UT timer to a predetermined start value.

### Claim 7 (depends on 6)

The method according to claim 6, wherein said maintaining step also involves the steps of:
setting the counting value of the corresponding per-UT timer to a predetermined large positive start value N.

### Claim 8 (depends on 7)

The method according to claim 7, wherein said maintaining step also involves the steps of:
decrementing said counting value for each per-UT timer for each successful transmission of data packets, except for the one UT whose data packet(s) just has/have been successfully transmitted.

### Claim 9 (depends on 7)

The method according to claim 7, wherein said maintaining step also involves the steps of:
decrementing said counting value for each per-UT timer by a predetermined decrement value.

### Claim 10 (depends on 8)

The method according to claim 8, wherein said maintaining step involves the step of:
setting a user terminal as IDLE when the corresponding per-UT timer reaches a pre-determined stop value.

### Claim 11 (depends on 1)

The method according to claim 1, wherein said creating step, maintaining step and blocking step is controlled by said channel dependent scheduler, which is a Medium Access Control (MAC) scheduler.

### Claim 12 (depends on 11)

The method according to claim 11, wherein said Medium Access Control scheduler is capable of blocking data packet(s) waiting to be selected for transmission to or from an identified and addressed user terminal by dropping one or more corresponding send-tokens, representing stored data packet information belonging to said user terminal, if said user terminal is indicated IDLE in said table due to the fact that corresponding per-UT timer has reached the predetermined stop value.

### Claim 13

A node in a Radio Access Network (RAN) for cellular radio communication, said node comprises a channel dependent scheduler for monitoring and controlling UT scheduling due to Channel Quality Identification (CQI) and stored data packet information belonging to data packets waiting to be selected for transmission to or from identified and addressed user terminals, comprising the following means for solving traffic congestion:
means for creating a table comprising those of said user terminals that belongs to the same service class, when a state of traffic congestion has occurred or is close to occur;
means for maintaining said table as long as said congestion state is present;
means for blocking the transmission of data packets between a user terminal (UT) and said node in both uplink and downlink directions, if the table indicates for said scheduler that said user terminal has been determined to have been idle for more than a pre-determined time.

### Claim 14 (depends on 13)

The node according to claim 13, comprising means for allowing transmission of data packets between a user terminal and said node in both uplink and downlink directions, if the scheduler readable table indicates for said scheduler that said user terminal is determined to be still active.

### Claim 15 (depends on 13)

The node according to claim 13, comprising means for introducing in said table one entry for each user terminal, and for each user terminal one per-UT timer.

### Claim 16 (depends on 15)

The node according to claim 15, comprising means for setting each represented user terminal as IDLE and the corresponding per-UT timer to a pre-determined start value in said table.

### Claim 17 (depends on 1)

The node according to claim 1, wherein said channel dependent scheduler is a Medium Access Control (MAC) scheduler.

### Claim 18 (depends on 17)

The node according to claim 17, wherein said Medium Access Control (MAC) scheduler comprises means for blocking data packet(s) waiting to be selected for transmission to or from an identified and addressed user terminal (UT) by dropping one or more corresponding send-tokens, representing stored data packet information belonging to said user terminal, if said user terminal is indicated IDLE in the said table due to the fact that corresponding per-UT timer has reached the pre-determined stop value.

### Claim 19 (depends on 18)

The node according to claim 18, wherein said node also comprises a policy-based IP/L2-PDU scheduler for scheduling accepted send requests generated by a sending entity in the node to said MAC scheduler that is able to store said accepted send requests as send-tokens.

### Claim 20 (depends on 18)

The node according to claim 18, wherein said sending entity is a Hybrid Automatic Repeated Request (HARQ).
