🤖 AI Summary
This paper addresses the lack of formal, reconfigurable architectural models for cloud-native applications (CNApps). We propose a graph-theoretic and functionally semantic abstraction method: modeling CNApps as dynamic, reconfigurable directed acyclic multigraphs, where vertices represent microservices and edges encode communication protocols; microservices are further abstracted as event-driven serverless function collections, with dependencies captured via event-triggered dataflow graphs. Our key contribution is the first introduction of *functionals*—higher-order constructs from functional computation—as a formal mechanism to specify protocol implementations and service recombination logic. Integrating relational calculus with event-driven semantics, the model enables runtime protocol switching and topology-aware adaptive reconfiguration. This yields significant improvements in verifiability, elasticity, and service composability.
📝 Abstract
Cloud Native Application CNApp (as a distributed system) is a collection of independent components (micro-services) interacting via communication protocols. This gives rise to present an abstract architecture of CNApp as dynamically re-configurable acyclic directed multi graph where vertices are microservices, and edges are the protocols. Generic mechanisms for such reconfigurations evidently correspond to higher-level functions (functionals). This implies also internal abstract architecture of microservice as a collection of event-triggered serverless functions (including functions implementing the protocols) that are dynamically composed into event-dependent data-flow graphs. Again, generic mechanisms for such compositions correspond to calculus of functionals and relations.