# US 2019/0245773 A9 · Selective data transmission in networks

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

- Number: US 2019/0245773 A9
- Document ID: US20190245773A9
- Status: Published application
- Kind: A9
- Application number: 15/607,701
- Filed: 2017-05-30
- Published: 2019-08-08
- Earliest claimed: 2017-05-30
- Assignees: Avaya Inc.
- Applicants: Avaya Inc.
- Inventors: Farook BASHA; Deepak RAMESH
- Web page: https://patentgrep.com/patent/US20190245773A9

## CPC

- H04L 45/12: Shortest path evaluation
- H04L 45/74: Address processing for routing
- H04L 47/20: Traffic policing
- H04L 47/32: by discarding or delaying data units, e.g. packets or frames
- H04L 61/5007: Internet protocol [IP] addresses
- H04W 72/04: Wireless resource allocation
- 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

Implementations generally relate to data transmission in networks. In some implementations, a method includes determining communication paths in a network, where the communication paths connect a plurality of network nodes, and where the network nodes include one or more edge devices and one or more core devices. The method further includes determining if a forwarding information base (FIB) is permitted at at least one network node. The method further includes filtering one or more packets at the at least one network node if the FIB is not permitted. The method further includes enabling traffic flow of one or more packets at the at least one network node if the FIB is permitted.

## Claims

### Claim 1

A computer-implemented method comprising:
determining communication paths in a network, wherein the communication paths connect a plurality of network nodes, and wherein the network nodes include one or more edge devices and one or more core devices;
determining if a forwarding information base (FIB) is permitted at at least one network node;
filtering one or more packets at the at least one network node if the FIB is not permitted; and
enabling traffic flow of one or more of the packets at the at least one network node if the FIB is permitted.

### Claim 2 (depends on 1)

The method of claim 1, wherein the determining of the communication paths is based on shortest path bridging.

### Claim 3 (depends on 1)

The method of claim 1, wherein the determining if the FIB is permitted is based on one or more access policies.

### Claim 4 (depends on 1)

The method of claim 1, wherein the determining if the FIB is permitted is based on one or more access policies, and wherein one or more of the access polices are unicast protocol access policies.

### Claim 5 (depends on 1)

The method of claim 1, wherein the determining if the FIB is permitted is based on one or more access policies, and wherein one or more of the access polices restrict communication between at least two different network nodes.

### Claim 6 (depends on 1)

The method of claim 1, wherein the filtering comprises:
determining that the FIB is not permitted; and
dropping one or more of the packets in response to determining that the FIB is not permitted.

### Claim 7 (depends on 1)

The method of claim 1, wherein, if the FIB is permitted, the method further comprises:
downloading the FIB; and
enabling traffic flow of one or more of the packets using the downloaded FIB.

### Claim 8

A non-transitory computer-readable storage medium with program instructions stored thereon, the instructions when executed by one or more processors cause the one or more processors to perform operations comprising:
determining communication paths in a network, wherein the communication paths connect a plurality of network nodes, and wherein the network nodes include one or more edge devices and one or more core devices;
determining if a forwarding information base (FIB) is permitted at at least one network node;
filtering one or more packets at the at least one network node if the FIB is not permitted; and
enabling traffic flow of one or more of the packets at the at least one network node if the FIB is permitted.

### Claim 9 (depends on 8)

The computer-readable storage medium of claim 8, wherein the determining of the communication paths is based on shortest path bridging.

### Claim 10 (depends on 8)

The computer-readable storage medium of claim 8, wherein the determining if the FIB is permitted is based on one or more access policies.

### Claim 11 (depends on 8)

The computer-readable storage medium of claim 8, wherein the determining if the FIB is permitted is based on one or more access policies, and wherein one or more of the access polices are unicast protocol access policies.

### Claim 12 (depends on 8)

The computer-readable storage medium of claim 8, wherein the determining if the FIB is permitted is based on one or more access policies, and wherein one or more of the access polices restrict communication between at least two different network nodes.

### Claim 13 (depends on 8)

The computer-readable storage medium of claim 8, wherein, to filter the one or more packets, the instructions further cause the one or more processors to perform operations comprising:
determining that the FIB is not permitted; and
dropping one or more of the packets in response to determining that the FIB is not permitted.

### Claim 14 (depends on 8)

The computer-readable storage medium of claim 8, wherein, if the FIB is permitted, the instructions further cause the one or more processors to perform operations comprising:
downloading the FIB; and
enabling traffic flow of one or more of the packets using the downloaded FIB.

### Claim 15

A system comprising:
one or more processors; and
logic encoded in one or more non-transitory computer-readable storage media for execution by the one or more processors and when executed operable to perform operations comprising:
determining communication paths in a network, wherein the communication paths connect a plurality of network nodes, and wherein the network nodes include one or more edge devices and one or more core devices;
determining if a forwarding information base (FIB) is permitted at at least one network node;
filtering one or more packets at the at least one network node if the FIB is not permitted; and
enabling traffic flow of one or more of the packets at the at least one network node if the FIB is permitted.

### Claim 16 (depends on 15)

The system of claim 15, wherein the determining of the communication paths is based on shortest path bridging

### Claim 17 (depends on 15)

The system of claim 15, wherein the determining if the FIB is permitted is based on one or more access policies.

### Claim 18 (depends on 15)

The system of claim 15, wherein the determining if the FIB is permitted is based on one or more access policies, and wherein one or more of the access polices are unicast protocol access policies.

### Claim 19 (depends on 15)

The system of claim 15, wherein the determining if the FIB is permitted is based on one or more access policies, and wherein one or more of the access polices restrict communication between at least two different network nodes.

### Claim 20 (depends on 15)

The system of claim 15, wherein, to filter the one or more packets, the logic when executed is further operable to perform operations comprising:
determining that the FIB is not permitted, and
dropping one or more of the packets in response to determining that the FIB is not permitted.
