Swarup Kumar Mohalik

Swarup Kumar Mohalik

Auto-generated profile, based on publicly available information

Swarup Kumar Mohalik

Ericsson India, Bangalore, Karnataka, India

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 June 2021 in Journal of ICT Standardization
Verified
Journal Article
Closed access
PDF file
PGPedro Henrique Gomes
Pedro Henrique Gomes
MBMagnus Buhrgard
Magnus Buhrgard
JHJános Harmatos
János Harmatos
SMSwarup Kumar Mohalik
Swarup Kumar Mohalik
DRDinand Roeland
Dinand Roeland
JNJörg Niemöller
Jörg Niemöller
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.

1 March 2013
Verified
Conference Paper
Closed access
APA. Petrenko
A. Petrenko
ADA. Dury
A. Dury
SRS. Ramesh
S. Ramesh
SMS. Mohalik
S. Mohalik
Completely automatic generation of tests from formal executable test models of industrial size still looks like a “holy grail”, in spite of significant progress in model-based testing research and tool development. Realizing this, we follow a more down-to-earth approach by assuming that, even if a test model is available, the test expert manually derives powerful test fragments and what remains to be automated is chaining them into an optimal test. Focusing on this task, we develop a test optimization framework using an FSM extended with input variables and clocks, which reflects important features of Simulink/Stateflow statecharts. The test optimization is expressed as the Asymmetric Travelling Salesman Problem (ATSP). We show how this approach can be used for solving some testing problems specific to automotive controllers. We describe a proof-of-concept prototype, implementing the proposed approach, which we tested on a case study of a particular controller available along with some tests. Experiments with the prototype indicate that the approach scales well for hundreds of tests.


25 October 2023
Verified
Conference Paper
Open access
AKAjay Kattepur
Ajay Kattepur
SMSwarup Kumar Mohalik
Swarup Kumar Mohalik
IBIan Burdick
Ian Burdick
MOMarin Orlic
Marin Orlic
LMLeonid Mokrushin
Leonid Mokrushin
The emergence of 5G allows the network to be sliced to meet multiple service requirements. However, current design systems are policy-driven, which limits the ability to redesign the 5G network adaptively for requirements or traffic patterns. In this paper, we propose Conrad, an autonomous and intent-driven framework that can allocate resources efficiently to meet 5G slice requirements. Via the use of a cognitive intent handling engine, the requirements are transformed to goals that may be solved using machine reasoning techniques. Four agents are registered for forecasting, design planning, evaluation and actuation to enable dynamic re-design of the 5G slices. Exploiting automated planning techniques, proposals are provided to optimally provision the network slice resources. This process is demonstrated over a radio access network (RAN) slicing use case with intents on average expected throughput.

6 May 2025
Verified
Conference Paper
Open access
AAAman Aryan
Aman Aryan
MMManan Modi
Manan Modi
ISIndranil Saha
Indranil Saha
RMRupak Majumdar
Rupak Majumdar
SMSwarup Mohalik
Swarup Mohalik

22 April 2021 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
KRKaustabha Ray
Kaustabha Ray
ABAnsuman Banerjee
Ansuman Banerjee
SMSwarup Kumar Mohalik
Swarup Kumar Mohalik
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.