COLLAPSING AND PLACEMENT OF APPLICATIONS
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.
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.
2 . The method of claim 1 , comprising:
selecting the limited number of logical entities to represent the multi-tier application based on query criteria, and
arranging the limited number of logical entities based on the query criteria.
3 . The method of claim 1 , comprising:
representing logical entities being a cluster of additional logical entities in a first representation, while representing logical entities that have been fully exploded to reveal all dependencies in a second representation.
4 . The method of claim 1 , wherein logical entities that are partially exploded such that some dependencies are revealed while other dependencies are clustered are represented in the first representation.
5 . The method of claim 1 , comprising:
anchoring a logical entity in response to receiving an input, wherein when the dynamic graph is rearranged, the logical entity remains anchored in place.
6 . The method of claim 1 , comprising:
receiving a selection of one of the plurality of logical entities; and
presenting a description of the logical entity.
7 . The method of claim 5 , wherein the rearranging the dynamic graph to accommodate the plurality of additional logical entities includes shifting the existing logical entities to the left, except the anchored logical entity, and introducing the additional logical entities to the right
8 . The method of claim 1 , comprising:
hiding a logical entity in response to a received input.
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.
10 . The system of claim 9 , wherein the instructions are effective to:
select the nodes representing logical entities to represent the multi-tier application based on query criteria, and
arrange the nodes representing logical entities based on the query criteria.
11 . The system of claim 9 , wherein the instructions are effective to:
represent nodes being a cluster of additional logical entities in a first representation, while representing nodes that have been fully exploded to reveal all dependencies in a second representation.
12 . The system of claim 9 , wherein nodes are partially exploded such that some dependencies are revealed while other dependencies are clustered are represented in the first representation.
13 . The system of claim 9 , wherein the instructions are effective to:
anchor a node in response to receiving an input, wherein when the dynamic graph is rearranged, the node remains anchored in place.
14 . The system of claim 9 , wherein the instructions are effective to:
receive a selection of one of nodes; and
present a description of the logical entity represented by the node.
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.
16 . The non-transitory computer readable medium of claim 15 , wherein the instructions are effective to:
select the nodes representing logical entities to represent the multi-tier application based on query criteria, and
arrange the nodes representing logical entities based on the query criteria.
17 . The non-transitory computer readable medium of claim 15 , wherein the instructions are effective to:
represent nodes being a cluster of additional logical entities in a first representation, while representing nodes that have been fully exploded to reveal all dependencies in a second representation.
18 . The non-transitory computer readable medium of claim 15 , wherein nodes are partially exploded such that some dependencies are revealed while other dependencies are clustered are represented in the first representation.
19 . The non-transitory computer readable medium of claim 15 , wherein the instructions are effective to:
anchor a node in response to receiving an input, wherein when the dynamic graph is rearranged, the node remains anchored in place.
20 . The non-transitory computer readable medium of claim 15 , wherein the instructions are effective to:
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, wherein the expanded additional nodes are presented to give an illusion of a tree structure.