Faculty Publications

Permanent URI for this communityhttps://idr.nitk.ac.in/handle/123456789/18736

Publications by NITK Faculty

Browse

Has files: NoSubject: search.filters.subject.Matching theory

Search Results

Now showing 1 - 5 of 5
  • No Thumbnail Available
    Item
    ESMA: Towards elevating system happiness in a decentralized serverless edge computing framework
    (Academic Press Inc., 2024) Datta, S.; Addya, S.K.; Ghosh, S.K.
    Due to the rapid growth in the adoption of numerous technologies, such as smartphones and the Internet of Things (IoT), edge and serverless computing have started gaining momentum in today's computing infrastructure. It has led to the production of huge amounts of data and has also resulted in increased network traffic, which if not managed well can cause network congestion. To address this and maintain the quality of service (QoS), in this work, a novel dispatch (destination selection) algorithm called Egalitarian Stable Matching Algorithm (ESMA) for faster data processing has been developed while also considering the best use of server resources in a decentralized Serverless-Edge environment. This will allow us to effectively utilize the enormous volumes of data that are generated. The proposed algorithm has been able to achieve lower overall dissatisfaction scores for the entire system. Individually, the client's happiness as well as the server's happiness have improved over the baseline. Moreover, there has been a drop of 25.7% in the total execution time and the total network resources consumed are lower as compared to the baseline algorithm as well as random-allocation algorithm. © 2023 Elsevier Inc.
  • No Thumbnail Available
    Item
    TReB: Task dependency aware-Resource allocation for Internet of Things using Binary offloading
    (Elsevier B.V., 2025) Soni, P.; Hajare, A.G.; Keerthan Kumar, K.K.; Addya, S.K.
    The rapid growth of Internet of Things (IoT) applications in domains such as healthcare, smart homes, and autonomous vehicles has led to an exponential increase in data generated by compute intensive tasks. Efficiently offloading these tasks to nearby computational resources in fog environments remains a significant challenge due to the inherent heterogeneity and constrained resources of Fog Nodes (FNs). Most of the existing approaches fail to address the trade-offs between latency, energy, and resource utilization, particularly when managing dependent and independent task workloads. Moreover, establishing an offloading strategy within a densely interconnected IoT network is known to be NP-hard. To overcome these limitations, in this work, we propose a Task dependency-Aware Resource allocation for IoT using Binary offloading (TReB) framework by considering both independent and dependent tasks of IoT applications. The TReB utilizes the Analytic Hierarchy Process (AHP) technique to generate the preferences of FNs and tasks by considering diverse attributes. With preferences established, a binary offloading is handled through a one-to-many matching procedure, utilizing a Deferred Acceptance Algorithm (DAA). It allows TReB to jointly minimize system energy consumption, latency, and the number of outages in an IoT network. We evaluated the effectiveness of TReB through simulation experiments, and results show that the proposed approach achieves a 49.1%, 62.4%, and 41.7% minimization in overall system latency, energy, and outages compared to the existing baselines. © 2025 Elsevier B.V.
  • No Thumbnail Available
    Item
    DCRDA: deadline-constrained function scheduling in serverless-cloud platform
    (Springer, 2025) Birajdar, P.A.; Meena, D.; Satpathy, A.; Addya, S.K.
    The serverless computing model frees developers from operational and management tasks, allowing them to focus solely on business logic. This paper addresses the computationally challenging function-container-virtual machine (VM) scheduling problem, especially under stringent deadline constraints. We propose a two-stage holistic scheduling framework called DCRDA targeting deadline-constrained function scheduling. In the first stage, the function-to-container scheduling is modeled as a one-to-one matching game and solved using the classical Deferred Acceptance Algorithm (DAA). The second stage addresses the container-to-VM assignment, modeled as a many-to-one matching problem, and solved using a variant of the DAA, the Revised-Deferred Acceptance Algorithm (RDA), to account for heterogeneous resource demands. Since matching-based strategies require agent preferences, a Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) ranking mechanism is employed to prioritize alternatives based on execution time, deadlines, and resource demands. The primary goal of DCRDA is to maximize the success ratio (SR), defined as the ratio of functions executed within the deadline to the total functions. Extensive test-bed validations over commercial providers such as Amazon EC2 show that the proposed framework significantly improves the success ratio compared to baseline approaches. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
  • No Thumbnail Available
    Item
    Delay-aware partial task offloading using multicriteria decision model in IoT–fog–cloud networks
    (Academic Press, 2025) S.a, S.; E, M.; Addya, S.K.; Rahman, S.; Pal, S.; Karmakar, C.
    Fog computing plays a prominent role in offloading computational tasks in heterogeneous environments since it provides less service delay than traditional cloud computing. The Internet of Things (IoT) devices cannot handle complex tasks due to less battery power, storage and computational capability. Full offloading has issues in providing efficient computation delay due to more response time and transmission cost. A suitable solution to overcome this problem is to partition the tasks into splittable subtasks. Considering multi-criteria decision parameters like processing efficiency and deadline helps to achieve efficient resource allocation and task assignment. The matching theory is applied to map task nodes to heterogeneous fog nodes and VMs for stability. Compared to baseline algorithms, proposed algorithms like Resource Allocation based on Processing Efficiency (RABP) and Task Assignment Based on Completion Time (TAC) are efficient enough to provide reasonable service delay and discard the non-beneficial tasks, i.e., tasks that do not execute within the deadline. © 2025 The Authors
  • No Thumbnail Available
    Item
    SEDViN: Secure embedding for dynamic virtual network requests using a multi-attribute matching game
    (Academic Press Inc., 2025) Kumar, T.G.K.; Kumar, R.; Achal, A.M.; Satpathy, A.; Addya, S.K.
    Network virtualization (NV) has gained significant attention as it allows service providers (SP) to share substrate network (SN) resources. It is achieved by partitioning them into isolated virtual network requests (VNRs) comprising interrelated virtual machines (VMs) and virtual links (VLs). Although NV provides various advantages, such as service separation, enhanced quality-of-service, reliability, and improved SN utilization, it also presents multiple scientific challenges. In this context, one pivotal challenge encountered by the researchers is secure virtual network embedding (SVNE). The SVNE encompasses assigning SN resources to components of VNR, i.e., VMs and VLs, adhering to the security demands, which is a computationally intractable problem, as it is proven to be NP-Hard. In this context, maximizing the acceptance and revenue-to-cost ratios remains of utmost priority for SPs as it not only increases the revenue but also effectively utilizes the large pool of SN resources. Though VNE is a well-researched problem, the existing literature has the following flaws: (i.) security features of VMs and VLs are ignored, (ii.) limited consideration of topological attributes, and (iii.) restricted to static VNRs. However, SPs need to develop an embedding framework that overcomes the abovementioned pitfalls. Therefore, this work proposes a framework Secure Embedding for Dynamic Virtual Network requests using a multi-attribute matching game (SEDViN). In SedViN, the deferred acceptance algorithm (DAA) based matching game is used for effective embedding. SEDViN operates primarily in two steps to obtain a secure embedding of dynamic VNRs. Firstly, it generates a unified ranking for VMs and servers using a combination of entropy and a technique for order of preference by similarity to the ideal solution (TOPSIS), considering network, security, and system attributes. Taking these as inputs, in the second step, VNR embedding is conducted using the deferred acceptance approach based on a one-to-many matching strategy for VM embedding and VL embedding using the shortest path algorithm. The performance of SEDViN is evaluated through simulations and compared against different baseline approaches. The simulation outcomes exhibit that SEDViN surpasses the baselines with a gain of 56% in the acceptance and 44% in the revenue-to-cost ratios. © 2025 Elsevier Inc.