Fetching topologies using timestamp-callback map
US-12184500-B1 · Dec 31, 2024 · US
US2015127815A1 · US · A1
| Field | Value |
|---|---|
| Publication number | US-2015127815-A1 |
| Application number | US-201414165684-A |
| Country | US |
| Kind code | A1 |
| Filing date | Jan 28, 2014 |
| Priority date | Nov 7, 2013 |
| Publication date | May 7, 2015 |
| Grant date | — |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method for modeling dependencies in a computing system including a plurality of resources, the method includes monitoring data communications made between the resources of the plurality of resources; modeling dependencies, at least among and between the resources, based, at least in part, upon the monitored data communications; and generating a set of topology graph(s), including at least a first topology graph, based upon the modeled dependencies.
Opening claim text (preview).
What is claimed is: 1 . A method comprising: monitoring data communications between a plurality of resources in a computing environment; determining dependencies between the resources in real time based on the data communications; generating a set of topology graph(s) based upon the dependencies between the resources; and displaying the set of topology graph(s), wherein the topology graph(s) indicate a measure of bonding between the plurality of resources. 2 . The method of claim 1 wherein the dependencies between the resources are dynamically updated. Computing a DRF: I have provided DRF computation details in claims 4 and 5 . Please tell me if you want to see more detail regarding the computation of the DRF. 3 . The method of claim 1 wherein: the computing environment comprises a plurality of users; and the monitoring of data communications further includes monitoring of data communications made between resources and users and between users and users. 4 . The method of claim 3 wherein: the measure of bonding between the plurality of resources includes calculating a set of dynamic relationship factors (DRFs) respectively corresponding to pairs of first user and/or resource and a second user and/or resource; and calculating the set of DRFs is based upon one or more of the following: volume of data communicated in data communication(s) in the pair, recency of data communication(s) in the pair, and/or frequency of communications in the pair. 5 . The method of claim 3 wherein: the measure of bonding between the plurality of resources includes calculating a set of dynamic relationship factors (DRFs) respectively corresponding to pairs of first user and/or resource and a second user and/or resource; and calculating the set of DRF's is based upon one or more of the following: the entities involved in the data exchange, and/or the characteristics of data exchanged. 6 . The method of claim 1 wherein the resources in the computing environment includes a sub-system virtual machine. 7 . The method of claim 1 wherein the dependencies include transitive dependencies among resources and/or users.
Discovery or management of network topologies · CPC title
for graphical visualisation of monitoring data · CPC title
Utilisation of link capacity · CPC title
involving simulating, designing, planning or modelling of a network · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.