# US 2003/0076849 A1 · Dynamic queue allocation and de-allocation

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

- Number: US 2003/0076849 A1
- Document ID: US20030076849A1
- Status: Published application
- Kind: A1
- Application number: 10/264,786
- Filed: 2002-10-04
- Published: 2003-04-24
- Earliest claimed: 2001-10-10
- Assignees: Alcatel Lucent
- Inventors: David Lynn Morgan; Stephen Clawson; James Freeman
- Web page: https://patentgrep.com/patent/US20030076849A1

## CPC

- H04L 47/20: Traffic policing
- H04L 12/4625: {Single bridge functionality, e.g. connection of two networks over a single bridge}
- H04L 41/0894: Policy-based network configuration management
- H04L 47/10: Flow control; Congestion control
- H04L 47/2408: for supporting different services, e.g. a differentiated services [DiffServ] type of service
- H04L 47/2441: relying on flow classification, e.g. using integrated services [IntServ]
- H04L 47/245: {using preemption}
- H04L 47/76: using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
- H04L 47/781: {Centralised allocation of resources}
- H04L 47/805: {QOS or priority aware}
- H04L 47/822: {Collecting or measuring resource availability data}
- H04L 49/205: {Quality of Service based}
- H04L 49/90: Buffering arrangements
- H04Q 11/0478: {Provisions for broadband connections}
- H04L 49/254: {Centralised controller, i.e. arbitration or scheduling}
- H04L 49/30: {Peripheral units, e.g. input or output ports}
- H04L 49/3027: {Output queuing}
- H04L 2012/5625: {Operations, administration and maintenance [OAM]}
- H04L 2012/5678: {Traffic aspects, e.g. arbitration, load balancing, smoothing, buffer management}
- H04L 2012/5684: {Characteristics of traffic flows}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04Q: SELECTING (switches, relays, selectors H01H; wireless communication networks H04W)

## Abstract

A dynamic queue allocation and de-allocation mechanism for managing traffic flowing through a switching node. If a packet matches conditions of a particular QoS policy rule, a determination is made as to whether a queue associated with the matched QoS policy rule exists on an egress port that is to forward the packet. If such a queue does not exist, a determination is made as to whether enough resources are available for dynamically creating the queue according to the QoS action parameters of the matched QoS policy rule. If the new queue may not be created because of resource limitation, queues of lower priority existing on the port are reclaimed and their resources reassigned to the new queue.

## Claims

### Claim 1

A switching node in a data communications network, the switching node comprising:
an input receiving an inbound packet for forwarding on an output; and
a packet processor coupled to the input, the packet processor identifying a priority associated with the packet and dynamically creating at a destination associated with the output a queue for storing packets associated with the identified priority prior to forwarding the packet to the output.

### Claim 2 (depends on 1)

The switching node of claim 1, wherein the packet processor monitors network resources and allocates the resources to the queue based on availability of the network resources.

### Claim 3 (depends on 2)

The switching node of claim 2, wherein the packet processor de-allocates resources allocated to an existing queue.

### Claim 4 (depends on 3)

The switching node of claim 3, wherein at least a portion of the de-allocated resources are re-allocated to a new queue.

### Claim 5 (depends on 3)

The switching node of claim 3, wherein the resources are de-allocated if the existing queue is associated with a priority that is lower than a priority identified for a new queue.

### Claim 6 (depends on 3)

The switching node of claim 3, wherein contents of the existing queue are transferred to a default queue.

### Claim 7

A switching node in a data communications network, the switching node comprising:
an input receiving an inbound packet;
a data store storing a plurality of policy rules;
a packet processor coupled to the input and the data store, the packet processor identifying a policy rule applicable to the packet, determining if the identified policy rule indicates a quality of service parameter, and if the policy rule indicates a quality of service parameter, dynamically creating a queue according to the indicated quality of service parameter.

### Claim 8 (depends on 7)

The switching node of claim 7, wherein the quality of service parameter is a quality of service priority.

### Claim 9 (depends on 7)

The switching node of claim 7, wherein the packet processor monitors network resources and allocates the resources to the queue based on availability of the network resources.

### Claim 10 (depends on 9)

The switching node of claim 9, wherein the packet processor de-allocates resources allocated to an existing queue.

### Claim 11 (depends on 10)

The switching node of claim 10, wherein at least a portion of the de-allocated resources are re-allocated to the queue.

### Claim 12 (depends on 10)

The switching node of claim 10, wherein the resources are de-allocated if the existing queue is associated with a priority that is lower than the indicated priority.

### Claim 13 (depends on 10)

The switching node of claim 10, wherein contents of the existing queue are transferred to a default queue.

### Claim 14 (depends on 7)

The switching node of claim 7, wherein the packet processor creates a queue on an egress port identified for the packet.

### Claim 15

In a data communications network including a switching node, a method for managing network traffic comprising:
receiving an inbound packet;
identifying a policy rule applicable to the packet;
identifying an egress port for the packet;
determining if a destination associated with the egress port has a queue associated with the identified policy rule; and
if the destination does not have a queue associated with the identified policy rule, dynamically creating at the destination a queue in accordance with the identified policy rule.

### Claim 16 (depends on 15)

The method of claim 15, wherein the identified policy rule includes a quality of service parameter.

### Claim 17 (depends on 15)

The method of claim 15 further comprising:
monitoring network resources; and
allocating the resources to the new queue based on availability of the network resources.

### Claim 18 (depends on 17)

The method of claim 17 further comprising de-allocating resources allocated to an existing queue.

### Claim 19 (depends on 18)

The method of claim 18 further comprising re-allocating at least a portion of the de-allocated resources to the new queue.

### Claim 20 (depends on 19)

The method of claim 19, wherein the resources are de-allocated if the existing queue is associated with a priority that is lower than a priority indicated by the quality of service parameter.

### Claim 21 (depends on 19)

The method of claim 19 further comprising transferring contents of the existing queue to a default queue.

### Claim 22

A switching node in a data communications network, the switching node comprising:
an input receiving an inbound packet;
a data store storing a plurality of policy rules;
a packet processor coupled to the input and the data store, the packet processor identifying a policy rule applicable to the packet and dynamically creating a queue in accordance with the identified policy rule.

### Claim 23 (depends on 22)

The switching node of claim 22 wherein the identified policy rule has a quality of service parameter.

### Claim 24 (depends on 23)

The switching node of claim 23 wherein the packet processor determines if the identified policy rule has a quality of service parameter prior to dynamically creating the queue.
