Generating a minimum-cost circulation topology in a microservice mesh network

A computing system, comprising:

• one or more processors;
• and
• one or more non-transitory computer-readable storage devices storing computer-executable instructions, the instructions operable to cause the one or more processors to perform operations comprising:
• receiving, from a client computer, a service request;
• identifying a group of different services for the service request, each service being represented by a plurality of replicated service instances, each service instance being configured to identify its dependency with other service instances and executed by an application server;
• iteratively querying a global registry for each service of the group of services to obtain respective groups of active service instances;
• generating an adjacency table including a plurality of service dependency paths, each service dependency path comprising the respective group of different active service instances with respective dependency between one another;
• determining a minimum-cost service dependency path by applying a predetermined cost algorithm on the adjacency table;
• and
• executing a first service instance of the minimum-cost service dependency path and routing the service request to execute a second service instance in the minimum-cost dependency path.

A computing system, comprising:

• one or more processors;
• and
• one or more non-transitory computer-readable storage devices storing computer-executable instructions, the instructions operable to cause the one or more processors to perform operations comprising:
• receiving, from a client computer, a service request;
• identifying a group of different services for the service request, each service being represented by a plurality of replicated service instances, each service instance being configured to identify its dependency with other service instances and executed by an application server;
• iteratively querying a global registry for each service of the group of services to obtain respective groups of active service instances;
• generating an adjacency table including a plurality of service dependency paths, each service dependency path comprising the respective group of different active service instances with respective dependency between one another;
• determining a minimum-cost service dependency path by applying a predetermined cost algorithm on the adjacency table;
• executing a first service instance of the minimum-cost service dependency path and routing the service request to execute a second service instance in the minimum-cost dependency path;
• and
• querying the global registry to determine respective statuses of respective service instances along the determined minimum-cost service dependency path.