# US 2006/0039394 A1 · Method for prioritizing grouped data reduction

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

- Number: US 2006/0039394 A1
- Document ID: US20060039394A1
- Status: Published application
- Kind: A1
- Application number: 10/923,576
- Filed: 2004-08-20
- Published: 2006-02-23
- Earliest claimed: 2004-08-20
- Assignees: OPNET Technologies, Inc.
- Inventors: George Zioulas; Dimitris Stassinopoulos; Han Wen
- Web page: https://patentgrep.com/patent/US20060039394A1

## CPC

- H04L 47/11: Identifying congestion
- H04L 41/0893: Assignment of logical groups to network elements
- H04L 43/00: Arrangements for monitoring or testing data switching networks
- H04L 43/026: using flow identification
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Nodes of a network may be allocated to a number of logical groups thereof, and storage space within a network traffic monitoring device coupled to the network then allocated so as to ensure network traffic data for at least a minimum number of the nodes of each of the logical groups is stored.

## Claims

### Claim 1

A method, comprising allocating nodes of a network to a number of logical groups thereof, and allocating storage space within a network traffic monitoring device coupled to the network so as to ensure network traffic data for at least a minimum number of the nodes of each of the logical groups is stored.

### Claim 2 (depends on 1)

The method of claim 1, wherein the storage space is allocated at each of a number of time scales for the network traffic data.

### Claim 3 (depends on 2)

The method of claim 2, wherein the storage space is allocated such that each logical group is permitted storage space for up to a minimum number of nodes determined by a ratio of a total number of nodes of the network and the number of logical groups of said nodes.

### Claim 4 (depends on 3)

The method of claim 3, wherein any excess storage space resulting from an absence of at least the minimum number of nodes in one or more of the logical groups of nodes is reallocated to those of the logical groups of nodes having more than the minimum number of nodes.

### Claim 5 (depends on 4)

The method of claim 4, wherein the reallocation of the excess storage space is made on a round-robin basis.

### Claim 6 (depends on 4)

The method of claim 4, wherein the reallocation of the excess storage space is made on a traffic volume basis.

### Claim 7 (depends on 4)

The method of claim 4, wherein the reallocation of the excess storage space is made on a number of nodes per group basis.

### Claim 8 (depends on 1)

The method of claim 1, wherein the storage space is allocated such that each logical group is permitted storage space for up to a minimum number of nodes determined by a ratio of a total number of nodes of the network and the number of logical groups of said nodes.

### Claim 9 (depends on 8)

The method of claim 8, wherein any excess storage space resulting from an absence of at least the minimum number of nodes in one or more of the logical groups of nodes is reallocated to those of the logical groups of nodes having more than the minimum number of nodes.

### Claim 10 (depends on 9)

The method of claim 9, wherein the reallocation of the excess storage space is made on a round-robin basis.

### Claim 11 (depends on 9)

The method of claim 9, wherein the reallocation of the excess storage space is made on a traffic volume basis.

### Claim 12 (depends on 9)

The method of claim 9, wherein the reallocation of the excess storage space is made on a number of nodes per group basis.
