Method and apparatus for visual logging in networking systems

Patent metadata

Field	Value
Publication number	US-2016299958-A1
Application number	US-201514685571-A
Country	US
Kind code	A1
Filing date	Apr 13, 2015
Priority date	Apr 13, 2015
Publication date	Oct 13, 2016
Grant date	—

Abstract

A method in a network controller and an apparatus for visual logging is described. The method includes receiving one or more log entries from one of a plurality of network elements in a network, wherein the one or more log entries indicate the occurrence of one or more events on the network; converting the one or more log entries into one or more graph log entries using a set of one or more graph log commands, wherein log entries of a certain type are associated with a corresponding graph identifier; and storing the one or more graph log entries in a graph log file of the corresponding graph identifier.

First claim

What is claimed is:

1 . A method in a network controller of visual logging, the method comprising:
receiving one or more log entries from one of a plurality of network elements in a network, wherein the one or more log entries indicate the occurrence of one or more events on the network; converting the one or more log entries into one or more graph log entries using a set of one or more graph log commands, wherein log entries of a certain type are associated with a corresponding graph identifier; and storing the one or more graph log entries in a graph log file of the corresponding graph identifier.

2 . The method of claim 1 , wherein the one or more graph log commands includes at least one of an add graph command, a delete graph command, an add node command, a delete node command, an add edge command, a delete edge command, and an add event command.

3 . The method of claim 2 , wherein each of the one or more graph log commands includes as a parameter at least a graph identifier, an event identifier, a metadata entry, and a visual attributes entry.

4 . The method of claim 2 , wherein the add node command and the delete node command each include as parameters a node identifier.

5 . The method of claim 2 , wherein the add edge command and the delete edge command each include as parameters a first node identifier and a second node identifier, wherein the first node identifier identifies the source of the edge and the second node identifier identifies the destination of the edge.

6 . The method of claim 1 , further comprising:
receiving one or more query commands including the graph identifier; and displaying the graph corresponding to the graph identifier based on the query command.

7 . The method of claim 6 , wherein the one or more query commands includes at least one of a get time duration command, a get all events command, a display graph at a first timestamp command, a display graph between the first timestamp and a second timestamp command, and a get event information command.

8 . An apparatus for visual logging, comprising:
a processor and a non-transitory machine readable storage medium, said storage medium containing instructions executable by said processor whereby said apparatus is operative to:
receive one or more log entries from one of a plurality of network elements in a network, wherein the one or more log entries indicate the occurrence of one or more events on the network,
convert the one or more log entries into one or more graph log entries using a set of one or more graph log commands, wherein log entries of a certain type are associated with a corresponding graph identifier, and
store the one or more graph log entries in a graph log file of the corresponding graph identifier.

9 . The apparatus of claim 8 , wherein the one or more graph log commands includes at least one of an add graph command, a delete graph command, an add node command, a delete node command, an add edge command, a delete edge command, and an add event command.

10 . The apparatus of claim 9 , wherein each of the one or more graph log commands includes as a parameter at least a graph identifier, an event identifier, a metadata entry, and a visual attributes entry.

11 . The apparatus of claim 9 , wherein the add node command and the delete node command each include as parameters a node identifier.

12 . The apparatus of claim 9 , wherein the add edge command and the delete edge command each include as parameters a first node identifier and a second node identifier, wherein the first node identifier identifies the source of the edge and the second node identifier identifies the destination of the edge.

13 . The apparatus of claim 8 , wherein the apparatus is further operative to:
receive one or more query commands including the graph identifier; and display the graph corresponding to the graph identifier based on the query command.

14 . The apparatus of claim 13 , wherein the one or more query commands includes at least one of a get time duration command, a get all events command, a display graph at a first timestamp command, a display graph between the first timestamp and a second timestamp command, and a get event information command.

15 . A non-transitory computer readable medium, having stored thereon a computer program, which when executed by a processor performs the following operations:
receiving one or more log entries from one of a plurality of network elements in a network, wherein the one or more log entries indicate the occurrence of one or more events on the network, converting the one or more log entries into one or more graph log entries using a set of one or more graph log commands, wherein log entries of a certain type are associated with a corresponding graph identifier, and storing the one or more graph log entries in a graph log file of the corresponding graph identifier.

16 . The non-transitory computer medium of claim 15 , wherein the one or more graph log commands includes at least one of an add graph command, a delete graph command, an add node command, a delete node command, an add edge command, a delete edge command, and an add event command.

17 . The non-transitory computer medium of claim 16 , wherein each of the one or more graph log commands includes as a parameter at least a graph identifier, an event identifier, a metadata entry, and a visual attributes entry.

18 . The non-transitory computer medium of claim 16 , wherein the add node command and the delete node command each include as parameters a node identifier.

19 . The non-transitory computer medium of claim 16 , wherein the add edge command and the delete edge command each include as parameters a first node identifier and a second node identifier, wherein the first node identifier identifies the source of the edge and the second node identifier identifies the destination of the edge.

20 . The non-transitory computer medium of claim 15 , wherein the operations further include:
receiving one or more query commands including the graph identifier; and displaying the graph corresponding to the graph identifier based on the query command.

21 . The non-transitory computer medium of claim 20 , wherein the one or more query commands includes at least one of a get time duration command, a get all events command, a display graph at a first timestamp command, a display graph between the first timestamp and a second timestamp command, and a get event information command.

Assignees

• Ericsson Telefon Ab L M

Inventors

• Kumar Harsh
• Handige Shankar Ganesh

Classifications

• G06F17/30958

  Physics · mapped topic

• G06F17/30569 Primary

  Physics · mapped topic

• G06F17/30477

  Physics · mapped topic

• G06F17/30185

  Physics · mapped topic

• G06F16/9024

  Graphs; Linked lists (G06F16/9027 takes precedence) · CPC title