# US 2010/0165855 A1 · Apparatus and method for a multi-level enmeshed policer

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

- Number: US 2010/0165855 A1
- Document ID: US20100165855A1
- Status: Published application
- Kind: A1
- Application number: 12/317,807
- Filed: 2008-12-30
- Published: 2010-07-01
- Earliest claimed: 2008-12-30
- Assignees: Alcatel Lucent
- Inventors: Thyagarajan Nandagopal; Thomas Y. Woo
- Web page: https://patentgrep.com/patent/US20100165855A1

## CPC

- H04L 47/20: Traffic policing
- H04L 47/50: Queue scheduling
- H04L 47/60: implementing hierarchical scheduling
- H04L 47/621: {Individual queue per connection or flow, e.g. per VC}
- H04L 49/901: using storage descriptor, e.g. read or write pointers
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An enmeshed hierarchy of policers, different from traditional tree-based hierarchical system of policers is used in accordance with the present invention. A goal of using an enmeshed architecture of policing systems is to allow for a more complex set of policies to be defined across a network. Hierarchical/cascading systems ensure that the higher granularity assignments essentially dictate/constrain the behavior of finer grained assignments at higher levels for sub-flows. There is only one type of metric possible for the largest granular policer, so the only way to implement multiple system-wide metrics is to repeat the hierarchy multiple times over, which adds to the delay of the packet and the complexity of the router. In accordance with the enmeshed architecture of the present invention, multiple system-wide metrics can be implemented simultaneously, which allows for easier management of the various macro-level policies by the manager of an access network.

## Claims

### Claim 1

An architecture for policing packets in a communications network comprising:
a plurality policing elements, each policing element processing packet flows to indicate whether a packet is in conformance with given parameters of a flow; and
at least two hierarchical levels of said policing elements, wherein a flow is capable of being policed by multiple policing elements such that hierarchies of said policing elements become enmeshed with one another.

### Claim 2 (depends on 1)

The architecture of claim 1, wherein a resulting hierarchical graph of enmeshed ones of said policing elements is acyclic.

### Claim 3 (depends on 2)

The architecture of claim 2, wherein the occurrence of a cycle is defined as a same flow definition and all its subsets being processed more than once by any particular policing element.

### Claim 4 (depends on 1)

The architecture of claim 1, wherein each policing element polices a flow definition, and all of its subsets, at most once, wherein an output of a policing element is categorized by a new flow definition, and can be fed as the input into another policing element.

### Claim 5 (depends on 4)

The architecture of claim 4, wherein a packet belonging to a specific flow is marked as conforming only if said packet is not violative of conformance parameters of a policing element through which said packet passes.

### Claim 6 (depends on 1)

The architecture of claim 1, wherein packet includes a data queue pointer and a number of control queue pointers wherein said number of control queue pointers is the total number of policing elements across all hierarchical levels.

### Claim 7 (depends on 6)

A architecture of claim 6, wherein the data queue pointer includes a pointer to the location of the entire packet in memory, l(p), the size of the packet, s(p), and the conformance status of the packet c(p).

### Claim 8 (depends on 6)

The apparatus of claim 6, wherein the control queue pointer includes a pointer, d_i(p), to the data queue pointer D(p), and a flow definition, f_i(p), to which this flow currently belongs.

### Claim 9

A method of operating a cascaded hierarchical network of policing elements in a communications network comprising:
processing packet flows through said policing elements to indicate whether a packet is conformance with given parameters of a flow; and
policing a given flow of packets in said network by multiple policing elements such that hierarchies of said policing elements become enmeshed with one another.

### Claim 10 (depends on 9)

The method of claim 9, wherein a resulting hierarchical graph of enmeshed ones of said policing elements is acyclic, wherein the occurrence of a cycle is defined as a same flow definition and all its subsets being processed more than once by any particular policing element.

### Claim 11 (depends on 10)

The method of claim 10, wherein a packet belonging to a specific flow is marked as conforming only if said packet is not violative of conformance parameters of a policing element through which said packet passes.

### Claim 12 (depends on 9)

The architecture of claim 9, wherein each packet of a flow includes a data queue pointer and a number of control queue pointers wherein said number of control queue pointers for the packet equals the number of policing elements that police the flow or a sub-flow to which this packet belongs.

### Claim 13 (depends on 12)

A architecture of claim 12, wherein the data queue pointer includes a pointer to the location of the entire packet in memory, l(p), the size of the packet, s(p), and the conformance status of the packet c(p).

### Claim 14 (depends on 12)

The method of claim 12, wherein the control queue pointer includes a pointer, d_i(p), to the data queue pointer D(p), and a flow definition, f_i(p), to which this flow currently belongs.

### Claim 15

A policing apparatus for use in an enmeshed cascade of policers comprising:
a processor for processing packet flows to indicate whether a packet is in conformance with given parameters of a flow; and
at least one input and out put port for receiving and transmitting said packet flows, respectively;
wherein a flow definition can be policed by more than one policer and each policer polices a flow definition, and all of its subsets, at most once.

### Claim 16 (depends on 15)

The apparatus of claim 15, an output of a policer is categorized by a new flow definition, and can be fed as the input into another policer.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein each policer has its own set of flow parameters, including peak/excess burst size and peak/committed information rate, wherein each policer operates independently and is not be influenced by the parameters of other policers processing same flows

### Claim 18 (depends on 17)

The apparatus of claim 17, wherein a packet belonging to a flow is marked as conforming only if it does not violate any conformance parameters at any of the policers it passes through.

### Claim 19 (depends on 15)

The apparatus of claim 15, wherein each packet of a flow includes a data queue pointer and a number of control queue pointers wherein said number of control queue pointers for the packet equals the number of policing elements that police the flow or a sub-flow to which this packet belongs.

### Claim 20 (depends on 19)

The apparatus of claim 19, wherein a resulting hierarchical graph of enmeshed ones of said policing apparatus is acyclic, wherein the occurrence of a cycle is defined as a same flow definition and all its subsets being processed more than once by any particular policing apparatus.
