2021 Moratuwa Engineering Research Conference (MERCon) 2021
DOI: 10.1109/mercon52712.2021.9525743
|View full text |Cite
|
Sign up to set email alerts
|

Using dependency graph and graph theory concepts to identify anti-patterns in a microservices system: A tool-based approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 13 publications
0
6
0
Order By: Relevance
“…Gammage et. al [12] introduce an algorithm that utilizes graph theory to detect anti-patterns such as the bottleneck, the knot, and cyclic dependencies. This paper builds upon the existing knowledge of graph elements, such as strongly connected components, to provide a way for detecting anti-patterns.…”
Section: Analysis Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…Gammage et. al [12] introduce an algorithm that utilizes graph theory to detect anti-patterns such as the bottleneck, the knot, and cyclic dependencies. This paper builds upon the existing knowledge of graph elements, such as strongly connected components, to provide a way for detecting anti-patterns.…”
Section: Analysis Resultsmentioning
confidence: 99%
“…Visualizing the architecture of a system is of great benefit to those who want a complete view of the architecture. The most basic way of visually describing a microservicebased system is through a graph [12], [33]. Having a node representing a service, and an edge representing the communication between services, allows for a simple understanding of how the system is working at runtime.…”
Section: B Anti-patterns In Graphsmentioning
confidence: 99%
See 3 more Smart Citations