COLLAPSING AND PLACEMENT OF APPLICATIONS
First Claim
1. A method for visualizing a multi-tier application comprising:
- representing the multi-tier application in a dynamic graph as a limited number of logical entities, at least one logical entity being a first cluster of additional logical entities;
receiving an input effective to explode the first cluster of logical entities in to a plurality of additional logical entities, at least one of the additional logical entities being a second cluster of logical entities; and
rearranging the dynamic graph to accommodate the plurality of additional logical entities.
1 Assignment
0 Petitions
Accused Products
Abstract
The present technology is directed to providing visibility of data flows in a multi-tier application and to help network teams understand the dataflow of an application and develop the application'"'"'s dataflow. The technology is directed to an application dependency map visualized in a collapsible chart. The collapsible chart displays the policies/relationships between each logical entity that carries a multi-tier application. The collapsible multi-tier application UI displays the data flows of a multi-tier application. Such charts are large and complex, and the present technology attempts to avoid displaying the entire topology of such multi-tier applications, while focusing on dependency relationships of interest.
160 Citations
20 Claims
-
1. A method for visualizing a multi-tier application comprising:
-
representing the multi-tier application in a dynamic graph as a limited number of logical entities, at least one logical entity being a first cluster of additional logical entities; receiving an input effective to explode the first cluster of logical entities in to a plurality of additional logical entities, at least one of the additional logical entities being a second cluster of logical entities; and rearranging the dynamic graph to accommodate the plurality of additional logical entities. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A system for arranging a graph representing a multi-tier application the system comprising:
-
a processor; and a non-transitory computer readable medium storing processor executable instructions, the instructions effective to cause the processor to; represent the multi-tier application in a dynamic graph as a limited number of nodes representing logical entities, at least one node being a first cluster of additional logical entities; receive an input effective to explode the first cluster of logical entities in to a plurality of additional nodes representing logical entities, at least one of the additional nodes being a second cluster of logical entities; and rearranging the dynamic graph to accommodate the plurality of additional nodes representing logical entities. - View Dependent Claims (10, 11, 12, 13, 14)
-
-
15. A non-transitory computer readable medium comprising instructions stored thereon, the instructions effective to cause the processor to:
-
represent the multi-tier application in a dynamic graph as a limited number of nodes representing logical entities, at least one node being a first cluster of additional logical entities; receive an input effective to explode the first cluster of logical entities in to a plurality of additional nodes representing logical entities, at least one of the additional nodes being a second cluster of logical entities; and rearranging the dynamic graph to accommodate the plurality of additional nodes representing logical entities. - View Dependent Claims (16, 17, 18, 19, 20)
-
Specification