IP Library Granted Patent US 12,190,178
Granted Patent B2
US 12,190,178 · App. 17/525,760 · Granted Jan 7, 2025

Automation solutions for event logging and debugging on kubernetes

Inventors: Zain Mohamed Asgar (San Francisco, CA); Omid Jalal Azizi (San Francisco, CA); James Michael Bartlett (San Francisco, CA); Ruizhe Cheng (San Francisco, CA); Phillip Kuznetsov (San Francisco, CA); Ishan Mukherjee (San Francisco, CA); Michelle Aimi Nguyen (San Francisco, CA); Natalie Grace Serrino (San Francisco, CA); Yaxiong Zhao (San Francisco, CA)
Assignee: New Relic, Inc.
G06F9/545G06F8/60G06F9/542G06F11/0709G06F11/3006G06F11/3089G06F11/3093G06F11/323G06F11/3476G06F11/3495G06F11/362G06F16/2455G06F16/26G06F16/285G06N5/02G06N20/00H04L63/02G06F2201/86
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,190,178
App. No.
17/525,760
Granted
Jan 7, 2025
Kind
B2
Abstract

Automation solutions for event logging and debugging on KUBERNETES are disclosed. A method for navigating data associated with a distributed application cluster includes providing an edge module configured to deploy a Berkeley Packet Filter (BPF) probe and a corresponding BPF program in a computing environment. The BPF probe is triggered based on an event associated with a distributed application running in a user space of the computing environment, the distributed application being one entity of a plurality of entities on the distributed application cluster. Data associated with the event is collected in a kernel space of the computing environment via the BPF program. At least one relationship is identified between the distributed application and at least one entity of the plurality of entities based on the collected data. At least one recommended data set based on the at least one identified relationship is provided via a user interface.

Claims (39)

1. A method for navigating data associated with a distributed application cluster, the method comprising:

providing an edge module configured to deploy a Berkeley Packet Filter (BPF) probe and a corresponding BPF program in a computing environment, the computing environment comprising a first entity of a plurality of hierarchically-related entities comprising the distributed application cluster;

triggering the BPF probe based on an event associated with a second entity of the plurality of hierarchically-related entities running in a user space of the computing environment, the second entity corresponding to a distributed application executing in the distributed application cluster;

collecting data associated with the event in a kernel space of the computing environment via the BPF program;

identifying at least one relationship between the second entity corresponding to the distributed application and at least one other entity of the plurality of hierarchically-related entities based on the collected data; and

providing, via a user interface, at least one recommended data set based on the at least one identified relationship.

2. The method of claim 1 , further comprising transferring the collected data from the BPF program to the edge module.

3. The method of claim 1 , wherein the at least one recommended data set includes at least a portion of the collected data.

4. The method of claim 1 , wherein providing the at least one recommended data set includes providing at least one of a data table and a graphical visualization representing the data set.

5. The method of claim 1 , wherein identifying the at least one relationship between the second entity and at least one other entity of the plurality of hierarchically-related entities based on the collected data includes identifying the relationship based on a user context and a knowledge graph that represents at least the hierarchical relationships between the plurality of hierarchically-related entities.

6. The method of claim 5 , wherein the knowledge graph further represents interactions between two or more entities of the plurality of hierarchically-related entities, the interactions comprising one or more of how much the entities communicate, how often the entities are linked together, and behavior of the entities within relevant time windows.

7. The method of claim 1 , wherein the first entity comprising the computing environment corresponds to a node in the distributed application cluster and the second entity comprising the distributed application corresponds to a service running on the node.

8. The method of claim 7 , wherein the plurality of hierarchically-related entities comprises two or more of nodes, pods, containers, and services running on the distributed application cluster.

9. The method of claim 5 , further comprising:

providing, via the user interface, a command entry field;

receiving, via the command entry field, a partially completed command from a user; and

suggesting at least one command corresponding to the at least one recommended data set based on the knowledge graph and the user context in response to receiving the partially completed command.

10. The method of claim 9 , wherein the at least one command instructs the user interface to display at least one of a data table and a graphical visualization representing the at least one recommended data set.

11. A system for navigating data associated with a distributed application cluster, the system comprising:

at least one memory storing computer-executable instructions; and

at least one processor for executing the computer-executable instructions stored in the memory, wherein the instructions, when executed, instruct the at least one processor to:

provide an edge module configured to deploy a Berkeley Packet Filter (BPF) probe and a corresponding BPF program in a computing environment, the computing environment comprising one entity of a plurality of hierarchically-related entities comprising the distributed application cluster;

trigger the BPF probe based on an event associated with a second entity of the plurality of hierarchically-related entities running in a user space of the computing environment, the second entity corresponding to a distributed application executing in the distributed application cluster;

collect data associated with the event in a kernel space of the computing environment via the BPF program;

identify at least one relationship between the second entity corresponding to the distributed application and at least one other entity of the plurality of hierarchically-related entities based on the collected data; and

provide, via a user interface, at least one recommended data set based on the at least one identified relationship.

12. The system of claim 11 , wherein the instructions, when executed, further instruct the at least one processor to:

transfer the collected data from the BPF program to the edge module.

13. The system of claim 11 , wherein the at least one recommended data set includes at least a portion of the collected data.

14. The system of claim 11 , wherein providing the at least one recommended data set includes providing at least one of a data table and a graphical visualization representing the data set.

15. The system of claim 11 , wherein identifying the at least one relationship between the second entity and at least one other entity of the plurality of hierarchically-related entities based on the collected data includes identifying the relationship based on a user context and a knowledge graph that represents at least the hierarchical relationships between the plurality of hierarchically-related entities.

16. The system of claim 15 , wherein the relationships represented in the knowledge graph comprise the hierarchical organization of the entities and interactions between two or more entities, the interactions comprising one or more of how much the entities communicate, how often the entities are linked together, and behavior of the entities within relevant time windows.

17. The system of claim 11 , wherein the first entity comprising the computing environment corresponds to a node in the distributed application cluster and the second entity comprising the distributed application corresponds to a service running on the node.

18. The system of claim 17 , wherein the plurality of hierarchically-related entities comprises two or more of nodes, pods, containers, and services running on the distributed application cluster.

19. The system of claim 15 , wherein the instructions, when executed, further instruct the at least one processor to:

provide, via the user interface, a command entry field;

receive, via the command entry field, a partially completed command from a user; and

suggest at least one command corresponding to the at least one recommended data set based on the knowledge graph and the user context in response to receiving the partially completed command.

20. The system of claim 19 , wherein the at least one command instructs the user interface to display at least one of a data table and a graphical visualization representing the at least one recommended data set.

Assignments (2)
SECURITY INTEREST Recorded Nov 8, 2023
From: NEW RELIC, INC.
To: BLUE OWL CAPITAL CORPORATION, AS COLLATERAL AGENT
Reel/Frame 065491/0507 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 27, 2022
From: ASGAR, ZAIN MOHAMED; AZIZI, OMID JALAL; BARTLETT, JAMES MICHAEL; CHENG, RUIZHE; KUZNETSOV, PHILLIP; MUKHERJEE, ISHAN; NGUYEN, MICHELLE AIMI; SERRINO, NATALIE GRACE; ZHAO, YAXIONG
To: NEW RELIC, INC.
Reel/Frame 059742/0841 →
Continuity (2)
Provisional Application 63113112 · Nov 12, 2020
Related Publication 20220147433A1 · May 12, 2022
References Cited (73)
US 9722879B1 · Muthu · 2017 [cited by examiner]
US 10747875B1 · Stoler · 2020 [cited by applicant]
US 10791168B1 · Dilley et al. · 2020 [cited by applicant]
US 10992652B2 · Putatunda et al. · 2021 [cited by applicant]
US 11574242B1 · Burke · 2023 [cited by examiner]
US 11709720B1 · Fournier · 2023 [cited by applicant]
US 11977934B2 · Asgar et al. · 2024 [cited by applicant]
US 12045676B2 · Asgar et al. · 2024 [cited by applicant]
US 20020007468A1 · Kampe et al. · 2002 [cited by applicant]
US 20020019870A1 · Chirashnya et al. · 2002 [cited by applicant]
US 20020174218A1 · Dick et al. · 2002 [cited by applicant]
US 20030028509A1 · Sah et al. · 2003 [cited by applicant]
US 20030220740A1 · Intriligator et al. · 2003 [cited by applicant]
US 20030220984A1 · Jones et al. · 2003 [cited by applicant]
US 20050210133A1 · Florissi et al. · 2005 [cited by applicant]
US 20060056285A1 · Krajewski et al. · 2006 [cited by applicant]
US 20060092179A1 · Sumizawa et al. · 2006 [cited by applicant]
US 20060182034A1 · Klinker et al. · 2006 [cited by applicant]
US 20070156919A1 · Potti et al. · 2007 [cited by applicant]
US 20090287791A1 · Mackey · 2009 [cited by applicant]
US 20110145639A1 · Farahmand et al. · 2011 [cited by applicant]
US 20120215779A1 · Lipstone · 2012 [cited by applicant]
US 20130054603A1 · Birdwell et al. · 2013 [cited by applicant]
US 20130097320A1 · Ritter et al. · 2013 [cited by applicant]
US 20130211546A1 · Lawson et al. · 2013 [cited by applicant]
US 20140040275A1 · Dang et al. · 2014 [cited by applicant]
US 20140136726A1 · Van Wie et al. · 2014 [cited by applicant]
US 20140181274A1 · Bazin et al. · 2014 [cited by applicant]
US 20140359719A1 · Iida · 2014 [cited by applicant]
US 20140379901A1 · Tseitlin · 2014 [cited by examiner]
US 20150019553A1 · Shaashua et al. · 2015 [cited by applicant]
US 20150261886A1 · Wu et al. · 2015 [cited by applicant]
US 20150293660A1 · Chiu · 2015 [cited by applicant]
US 20150363702A1 · Baum · 2015 [cited by applicant]
US 20160026919A1 · Kaisser et al. · 2016 [cited by applicant]
US 20180121843A1 · Connely, IV et al. · 2018 [cited by applicant]
US 20180285744A1 · Kang · 2018 [cited by applicant]
US 20190140983A1 · Tu et al. · 2019 [cited by applicant]
US 20190173841A1 · Wang et al. · 2019 [cited by applicant]
US 20190324882A1 · Borello et al. · 2019 [cited by applicant]
US 20200014663A1 · Chen et al. · 2020 [cited by applicant]
US 20200026859A1 · Sun · 2020 [cited by examiner]
US 20200145337A1 · Keating et al. · 2020 [cited by applicant]
US 20200175156A1 · Bhamidipati · 2020 [cited by examiner]
US 20200177372A1 · Bhamidipati · 2020 [cited by examiner]
US 20200193017A1 · Bannister et al. · 2020 [cited by applicant]
US 20200220794A1 · Barabash et al. · 2020 [cited by applicant]
US 20200389531A1 · Lee et al. · 2020 [cited by applicant]
US 20200409780A1 · Balasubramanian et al. · 2020 [cited by applicant]
US 20210058424A1 · Chang et al. · 2021 [cited by applicant]
US 20220147407A1 · Asgar et al. · 2022 [cited by applicant]
US 20220147408A1 · Asgar et al. · 2022 [cited by applicant]
US 20220147434A1 · Asgar et al. · 2022 [cited by applicant]
US 20220147542A1 · Asgar et al. · 2022 [cited by applicant]
US 20230104007A1 · Viswambharan et al. · 2023 [cited by applicant]
US 20230168986A1 · Larkin et al. · 2023 [cited by applicant]
US 20230231830A1 · Shin et al. · 2023 [cited by applicant]
Asgar, Zain Mohamed; Final Office Action for U.S. Appl. No. 17/525,749, filed Nov. 12, 2021, mailed Aug. 25, 2023, 15 pgs. [cited by applicant]
Asgar, Zain Mohamed; Non-Final Office Action for U.S. Appl. No. 17/525,749, filed Nov. 12, 2021, mailed Feb. 28, 2023, 17 pgs. [cited by applicant]
Asgar, Zain Mohamed; Notice of Allowance for U.S. Appl. No. 17/525,749, filed Nov. 12, 2021, mailed Jan. 29, 2024, 13 pgs. [cited by applicant]
Asgar, Zain Mohamed; Issue Notification for U.S. Appl. No. 17/525,755, filed Nov. 12, 2021, mailed Mar. 13, 2024, 2 pgs. [cited by applicant]
Asgar, Zain Mohamed; Non-Final Office Action for U.S. Appl. No. 17/525,755, filed Nov. 12, 2021, mailed Mar. 10, 2023, 22 pgs. [cited by applicant]
Asgar, Zain Mohamed; Notice of Allowance for U.S. Appl. No. 17/525,755, filed Nov. 12, 2021, mailed Dec. 28, 2023, 13 pgs. [cited by applicant]
Asgar, Zain Mohamed; Notice of Allowance for U.S. Appl. No. 17/525,755, filed Nov. 12, 2021, mailed Sep. 8, 2023, 11 pgs. [cited by applicant]
Asgar, Zain Mohamed; Non-Final Office Action for U.S. Appl. No. 17/525,757, filed Nov. 12, 2021, mailed Sep. 21, 2023, 20 pgs. [cited by applicant]
Asgar, Zain Mohamed; Non-Final Office Action for U.S. Appl. No. 17/525,757, filed Nov. 12, 2021, mailed Aug. 21, 2024, 26 pgs. [cited by applicant]
Asgar, Zain Mohamed; Issue Notification for U.S. Appl. No. 17/525,749, filed Nov. 12, 2021, mailed Apr. 17, 2024, 2 pgs. [cited by applicant]
Asgar, Zain Mohamed; Notice of Allowance for U.S. Appl. No. 17/525,755, filed Nov. 12, 2021, mailed May 6, 2024, 12 pgs. [cited by applicant]
Asgar, Zain Mohamed; Non-Final Office Action for U.S. Appl. No. 17/525,767, filed Nov. 12, 2021, mailed May 22, 2024, 21 pgs. [cited by applicant]
Asgar, Zain Mohamed; Final Office Action for U.S. Appl. No. 17/525,757, filed Nov. 12, 2021, mailed Apr. 29, 2024, 30 pgs. [cited by applicant]
Asgar, Zain Mohamed; Issue Notification for U.S. Appl. No. 17/525,755, filed Nov. 12, 2021, mailed Jul. 3, 2024, 2 pgs. [cited by applicant]
Asgar, Zain Mohamed; Notice of Allowance for U.S. Appl. No. 17/525,767, filed Nov. 12, 2021, mailed Sep. 23, 2024, 18 pgs. [cited by applicant]
Asgar, Zain Mohamed; Notice of Allowance for U.S. Appl. No. 17/525,757, filed Nov. 12, 2021, mailed Nov. 20, 2024, 14 pgs. [cited by applicant]
Cited By (1)
US 12,236,292