8 June 2021 in Journal of ICT Standardization
Closed loops are key enablers for automation that have been successfully used in many industries for long, and more recently for computing and networking applications. The Zero-touch network and service management (ZSM) framework introduced standardized components that allow the creation, execution, and governance of multiple closed loops, enabling zero-touch management of end-to-end services across different management domains. However, the coordinated and optimal instantiation and operation of multiple closed loops is an open question that is left for implementation by the ZSM specifications. In this paper, we propose a methodology that uses intents as a way of communicating requirements to be considered by autonomous management domains to coordinate hierarchies of closed loops. The intent-driven methodology facilitates hierarchical and peer interactions for delegation and escalation of intents. Furthermore, it extends the existing management capabilities of the ZSM framework and facilitates conflict-free integration of closed loops by setting optimal (and non-conflicting) goals that each closed loop in the hierarchy needs to account for. We show an example of the application of the proposed methodology in a network slicing assurance use case. The new capabilities introduced in this paper can be considered as an extension of the ZSM framework to be used in scenarios where multiple intent-driven closed loops exist.
22 April 2021 in IEEE Transactions on Services Computing
With the rapid proliferation of strategic alliances between service providers, enterprises cooperate towards service quality improvement abd provide lower cost service bundles. This paper presents a novel solution to the minimum cost service bundle selection problem for workflows in the presence of singleton subscription costs and service bundle offerings and compatibility requirements. Given a workflow specifying a set of tasks and a set of candidate services for each task, with a set of compatibility constraints between services, the selection problem has the objective of selecting the most suitable service offering(s) for each task. In this paper, we analyze the selection problem in the presence of service bundle offerings. We present a novel multi-partite hyper-graph visualization of the selection problem and analyze its hardness. Additionally we present a novel combination of ILP and abstraction refinement as a potential solution, that is shown to expedite a na\"ive ILP based solution. We present experiments to substantiate this claim.