Network description mechanisms for anonymity between systems

Patent metadata

Field	Value
Publication number	US-2016359728-A1
Application number	US-201514729810-A
Country	US
Kind code	A1
Filing date	Jun 3, 2015
Priority date	Jun 3, 2015
Publication date	Dec 8, 2016
Grant date	—

Abstract

Techniques are disclosed for exchanging anonymized information between autonomous systems. In one example, a method comprises accessing an eigenvalue, wherein the eigenvalue is based on topology data associated with the first autonomous system; encoding the eigenvalue into a message; and transmitting, by a network element located in the first autonomous system, the message to an external edge router located in the second autonomous system. A further method can comprise receiving, by a network component located in a first autonomous system, a message, wherein the message comprises an eigenvalue and the message is received from an external network element located in a second autonomous system; accessing another other eigenvalue, the another eigenvalue corresponding to an autonomous system different from the first autonomous system; analyzing the another eigenvalue and the eigenvalue; and executing, by the network element, an action based on the analyzing.

First claim

What is claimed is:

1 . A method comprising:
accessing, by an edge router located in a first autonomous system, at least one eigenvalue, wherein the at least one eigenvalue is based on topology data associated with the first autonomous system; encoding, by the edge router using a routing protocol, the at least one eigenvalue into a routing message; and transmitting, by the edge router, the routing message to an external edge router located in a second autonomous system.

2 . The method of claim 1 , wherein the routing protocol is a standardized border gateway protocol (BGP) that is extended to include anonymized topology data and the routing message is a network layer reachability information (NLRI) tuple comprising: a type field and a value field; and
wherein the encoding the at least one eigenvalue into the routing message comprises:
encoding an identifier corresponding to anonymous topology data into the type field of the NLRI tuple, and
encoding the at least one eigenvalue into the value field of the NLRI tuple.

3 . The method of claim 1 , wherein the routing message is an Internet protocol flow information export (IPFIX) data record; and
wherein the encoding the at least one eigenvalue into the routing message comprises:
encoding, in an IPFIX template record, an identifier corresponding to an eigenvalue field into the information element identifier field of a field specifier, and encoding the at least one eigenvalue into a field value of the IPFIX data record.

4 . The method of claim 1 , wherein the accessing the at least one eigenvalue comprises:
retrieving the topology data from a memory, wherein the topology data comprises a matrix, the matrix comprising a plurality of values and the plurality of values correspond to connections between network elements within the first autonomous system; calculating eigenvalues of the matrix using the plurality of values; and retrieving the at least one eigenvalue from the eigenvalues.

5 . The method of claim 4 , wherein all of the network elements are associated with a same network prefix and the same network prefix is one of a plurality of network prefixes within the first autonomous system, and wherein the eigenvalues are calculated using the plurality of values corresponding to the connections between the network elements that are associated with the same network prefix.

6 . The method of claim 4 , further comprising:
receiving information indicative of a problem in a data flow, the data flow spanning the first autonomous system and the second autonomous system; and calculating a first value of network criticality based on the eigenvalues of the matrix; and calculating a second value of network criticality based on the other eigenvalues corresponding to the second autonomous system;

7 . The method of claim 4 , wherein each diagonal element of the matrix identifies a degree of one of the network elements within the first autonomous system; and
wherein one or more non-diagonal element of the matrix identifies, at least in part, connectivity between two of the network elements within the first autonomous system.

8 . A method comprising:
receiving, by an edge router located in a first autonomous system, a routing message, wherein the routing message is encoded, based on a routing protocol, comprising an eigenvalue and the routing message is received from an external network element located in a second autonomous system; accessing, by the edge router, one or more other eigenvalue, each of the one or more eigenvalue corresponding to an autonomous system that is different from the first autonomous system; analyzing, by the edge router, each of the one or more other eigenvalue and the eigenvalue; and executing, by the edge router, an action based on the analyzing.

9 . The method of claim 8 , wherein the analyzing comprises:
calculating a first value of network criticality based on the eigenvalues of the matrix; and calculating at least one additional value of network criticality based on the eigenvalues of the matrix.

10 . The method of claim 8 , wherein the routing protocol is a standardized border gateway protocol (BGP) that is extended to include anonymized topology data and the routing message is a network layer reachability information (NLRI) tuple comprising: a type field and a value field; and
wherein the routing message being encoded, based on the routing protocol, comprising the eigenvalue comprises: the type field in the NLRI tuple being encoded containing an identifier corresponding to anonymous topology data, and the value field of the NLRI tuple being encoded containing the at least one eigenvalue.

11 . The method of claim 8 , wherein the routing message is an Internet protocol flow information export (IPFIX) data record; and
wherein the routing message being encoded, based on the routing protocol, comprising the eigenvalue comprises: a field value of the IPFIX data record being encoded to contain the eigenvalue; a identifier field of the IPFIX data record being encoded to contain a set identifier that matches a template identifier of an IPFIX template record.

12 . A network element located in a first autonomous system, the network element comprising:
a memory element storing electronic code; a processor coupled to the memory element and operable to execute the electronic code, wherein the processor, when executing the electronic code, performs operations comprising:
accessing at least one eigenvalue, wherein the at least one eigenvalue is based on topology data associated with the first autonomous system;
encoding, using a routing protocol, the at least one eigenvalue into a routing message; and
transmitting the routing message to an external edge router located in a second autonomous system.

13 . The network element of claim 12 , wherein the routing protocol is a standardized border gateway protocol (BGP) that is extended to include anonymized topology data and the routing message is a network layer reachability information (NLRI) tuple comprising: a type field and a value field; and
wherein the encoding the at least one eigenvalue into the routing message comprises:
encoding an identifier corresponding to anonymous topology data into the type field of the NLRI tuple, and
encoding the at least one eigenvalue into the value field of the NLRI tuple.

14 . The network element of claim 12 , wherein the routing message is an Internet protocol flow information export (IPFIX) data record; and
wherein the encoding the at least one eigenvalue into the routing message comprises:
encoding, in an IPFIX template record, an identifier corresponding to an eigenvalue field into the information element identifier field of a field specifier, and
encoding the at least one eigenvalue into a field value of the IPFIX data record.

15 . The network element of claim 12 , wherein the accessing the at least one eigenvalue comprises:
retrieving the topology data from a memory, wherein the topology data comprises a matrix, the matrix comprising a plurality of values and the plurality of values correspond to connections between network elements within the first autonomous system; calculating eigenvalues of the matrix using the plurality of values; and retrieving the at least one eigenvalue from the eigenvalues.

16 . The network element of claim 15 , wherein all of the network elements are associated with a same network prefix and the same network prefix is one of a plurality of network prefixes within the first autonomous system, and wherein the eigenvalues are calculated using the

Assignees

• Cisco Tech Inc

Inventors

• Ficara Domenico
• Cuda Davide
• Choukir Amine

Classifications

• H04L45/14 Primary

  Routing performance; Theoretical aspects · CPC title

• H04L45/033

  by updating distance vector protocols · CPC title

• H04L45/04 Primary

  Interdomain routing, e.g. hierarchical routing · CPC title

• H04L63/00

  Network architectures or network communication protocols for network security (cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00; network architectures or network communication protocols for wireless network security H04W12/00; security arrangements for protecting computers or computer systems against unauthorised activity G06F21/00) · CPC title

• H04L45/02

  Topology update or discovery · CPC title