Arshad Jhumka
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Arshad Jhumka has a total of 24 co-authors. Here are the top co-authors by number of shared publications:
- Matthew Bradbury
School of Computing and Communications, Faculty of Science and Technology, Lancaster University, Lancaster LA1 4WA, UK
4 shared publications - Edward Chuah
The University of Aberdeen, Aberdeen, UK
2 shared publications - Abdullah Alhajri
University of Warwick, United Kingdom
1 shared publication - Carsten Maple
University of Warwick
1 shared publication - Chen Gu
Hefei University of Technology
1 shared publication - Denys A. Flores
Escuela Politécnica Nacional
1 shared publication
Latest Publications
- Open Access
- 14 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 19-24
Software Debloating from Exception-Handler Lenses
Software debloating tools typically prioritize the preservation of error-free paths by utilizing test cases that reflect the intended behavior or providing accurate configurations. As a result, exception-handling procedures, which handle abnormal application states, will be removed from debloated programs, affecting the application's robustness. In this paper, we elevate exception handlers to first-class status by envisioning an approach driven by exceptions. We aim to activate paths leading to different error situations and capture consistent behavior by applying fault injection and program-invariant techniques. We propose new metrics to evaluate the performance of exception handlers and also the performance of debloating techniques in the presence of exception handlers. We explain the challenges that the addition of exception handlers adds to the debloating process.
- 14 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 19-24
Open AccessSoftware Debloating from Exception-Handler Lenses
Software debloating tools typically prioritize the preservation of error-free paths by utilizing test cases that reflect the intended behavior or providing accurate configurations. As a result, exception-handling procedures, which handle abnormal application states, will be removed from debloated programs, affecting the application's robustness. In this paper, we elevate exception handlers to first-class status by envisioning an approach driven by exceptions. We aim to activate paths leading to different error situations and capture consistent behavior by applying fault injection and program-invariant techniques. We propose new metrics to evaluate the performance of exception handlers and also the performance of debloating techniques in the presence of exception handlers. We explain the challenges that the addition of exception handlers adds to the debloating process.
- 1 March 2024
- Published by Springer Nature
- p. 327-343
Transaction Fee Mechanism for Order-Sensitive Blockchain-Based Applications
- 1 March 2024
- Published by Springer Nature
- p. 327-343
Transaction Fee Mechanism for Order-Sensitive Blockchain-Based Applications
- 15 May 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (16) , 18445-18479
An empirical study of major page faults for failure diagnosis in cluster systems
- 15 May 2023
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (16) , 18445-18479
An empirical study of major page faults for failure diagnosis in cluster systems
- Open Access
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 316-317
Poster Abstract: Checkpointing in Transiently Powered IoT Networks | Proceedings of the 22nd International Conference on Information Processing in Sensor Networks
One of the major shortcomings in IoT/sensor networks is the finite energy supply available for computation and communication. To circumvent this issue, energy harvesting has been proposed to enable embedded devices to mitigate their dependency on traditional battery-driven power source. However, energy supply due to energy harvesting often varies, leading to nodes crashing due to energy exhaustion, with application(s) losing their state. Efficient state checkpointing in non-volatile memory (NMV) has been proposed to enable forward progress, albeit at the expense of significant overhead (viz., energy and time). In this poster, we show preliminary results that, for a certain class of applications, state checkpointing may adversely affect the performance of the applications. This is different from checkpointing in traditional distributed systems, where the network topology is generally assumed to be stable.
- 9 May 2023
- Published by Association for Computing Machinery (ACM)
- p. 316-317
Open AccessPoster Abstract: Checkpointing in Transiently Powered IoT Networks | Proceedings of the 22nd International Conference on Information Processing in Sensor Networks
One of the major shortcomings in IoT/sensor networks is the finite energy supply available for computation and communication. To circumvent this issue, energy harvesting has been proposed to enable embedded devices to mitigate their dependency on traditional battery-driven power source. However, energy supply due to energy harvesting often varies, leading to nodes crashing due to energy exhaustion, with application(s) losing their state. Efficient state checkpointing in non-volatile memory (NMV) has been proposed to enable forward progress, albeit at the expense of significant overhead (viz., energy and time). In this poster, we show preliminary results that, for a certain class of applications, state checkpointing may adversely affect the performance of the applications. This is different from checkpointing in traditional distributed systems, where the network topology is generally assumed to be stable.
- Open Access
- 27 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 321-330
OCC2T: An Early-Read Dual-Track OCC Algorithm For Mixed Mode Systems
In OLTP systems, serializability is a key property for executions; without this, integrity constraints on data can be violated due to concurrent activities. The serializability property can be guaranteed through the implementation of concurrency control mechanisms such as strict 2-phase locking (S2PL). However, modern OLTP systems are expected to execute millions of transactions concurrently and mechanisms such as S2PL do not scale to handle this level of concurrency. Thus, to get better performance, programmers may choose different isolation levels, rather than the default ones, which are more suitable for their applications. Due to differing requirements, transaction aborts may be high. Thus, this paper investigates the correctness of mixing transactions with different isolation levels and extends the mixing theorem introduced by Adya et al. The extension investigates the correctness of mixing transactions with different isolation levels, especially when optimistic concurrency control (OCC) schemes are used which are not the main focus of the theorem. We thus propose OCC2T, an OCC-based algorithm that is designed to improve the performance of DBMS by decreasing the abort rate of transactions and enhancing mixing transactions with different isolation levels. Our results show that OCC2T is able to reduce the abort rate in highly contended workloads by almost 5x over other algorithms.
- 27 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 321-330
Open AccessOCC2T: An Early-Read Dual-Track OCC Algorithm For Mixed Mode Systems
In OLTP systems, serializability is a key property for executions; without this, integrity constraints on data can be violated due to concurrent activities. The serializability property can be guaranteed through the implementation of concurrency control mechanisms such as strict 2-phase locking (S2PL). However, modern OLTP systems are expected to execute millions of transactions concurrently and mechanisms such as S2PL do not scale to handle this level of concurrency. Thus, to get better performance, programmers may choose different isolation levels, rather than the default ones, which are more suitable for their applications. Due to differing requirements, transaction aborts may be high. Thus, this paper investigates the correctness of mixing transactions with different isolation levels and extends the mixing theorem introduced by Adya et al. The extension investigates the correctness of mixing transactions with different isolation levels, especially when optimistic concurrency control (OCC) schemes are used which are not the main focus of the theorem. We thus propose OCC2T, an OCC-based algorithm that is designed to improve the performance of DBMS by decreasing the abort rate of transactions and enhancing mixing transactions with different isolation levels. Our results show that OCC2T is able to reduce the abort rate in highly contended workloads by almost 5x over other algorithms.
- Open Access
- 21 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 133487-133503
A Survey of Log-Correlation Tools for Failure Diagnosis and Prediction in Cluster Systems
System logs are the first source of information available to system designers to analyze and troubleshoot their cluster systems. For example, High-Performance Computing (HPC) systems generate a large volume of heterogeneous data from multiple sub-systems, so the idea of using a single source of data to achieve a given goal, such as identification of failures, is losing its validity. System log-analysis tools assist system designers gain understanding into a large volume of system logs. They enable system designers to perform various analyses (e.g., diagnosing node failures or predicting node failures). Current system log-analysis tools vary significantly in their function and design.We conduct a systematic review of literature on system log-analysis tools and select 46 representative articles out of 3,758 initial articles. To the best of our knowledge, there is no work that studied the characteristics of log-correlation tools (LogCTs) with respect to four quality attributes including (a) spurious correlations, (b) correlation threshold settings, (c) outliers in the data and (d) missing data. In this paper, we (a) propose a quality model to evaluate LogCTs and (b) use this quality model to evaluate and recommend current LogCTs. Through our review, we (a) identify papers on LogCTs, (b) build a quality model consisting of the four quality attributes and (c) discuss several open challenges for future research. Our study highlights the advantages and limitations of existing LogCTs and identifies research opportunities that could facilitate better failure handling in large cluster systems.
- 21 December 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 133487-133503
Open AccessA Survey of Log-Correlation Tools for Failure Diagnosis and Prediction in Cluster Systems
System logs are the first source of information available to system designers to analyze and troubleshoot their cluster systems. For example, High-Performance Computing (HPC) systems generate a large volume of heterogeneous data from multiple sub-systems, so the idea of using a single source of data to achieve a given goal, such as identification of failures, is losing its validity. System log-analysis tools assist system designers gain understanding into a large volume of system logs. They enable system designers to perform various analyses (e.g., diagnosing node failures or predicting node failures). Current system log-analysis tools vary significantly in their function and design.We conduct a systematic review of literature on system log-analysis tools and select 46 representative articles out of 3,758 initial articles. To the best of our knowledge, there is no work that studied the characteristics of log-correlation tools (LogCTs) with respect to four quality attributes including (a) spurious correlations, (b) correlation threshold settings, (c) outliers in the data and (d) missing data. In this paper, we (a) propose a quality model to evaluate LogCTs and (b) use this quality model to evaluate and recommend current LogCTs. Through our review, we (a) identify papers on LogCTs, (b) build a quality model consisting of the four quality attributes and (c) discuss several open challenges for future research. Our study highlights the advantages and limitations of existing LogCTs and identifies research opportunities that could facilitate better failure handling in large cluster systems.
- Open Access
- 18 November 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-16
Silence is Golden: A Source Location Privacy Scheme for Wireless Sensor Networks Based on Silent Nodes
Source location privacy (SLP) is an important property for security-critical wireless sensor network applications such as monitoring and tracking. However, cryptology-based schemes cannot protect the SLP effectively since an adversary can capture the source node regardless of the contents of messages. Most techniques use fake sources or message delay to provide SLP, but at the cost of high energy consumption or high message delivery latency. In this paper, we present a new technique to address SLP by selecting sets of nodes that are to be silent for a short period, forcing an attacker to either be delayed or to trace back to the source along a longer route. As such, we make a number of important contributions: (i) we formalise the silent nodes selection (SiNS) problem, (ii) we prove it to be NP-complete, and (iii) to circumvent the high complexity of SiNS, we propose a novel SLP-aware routing protocol. Results from extensive simulations show that our proposed routing protocol provides a high level of SLP under appropriate parameterization at the expense of only negligible latency and messages overhead.
- 18 November 2022
- Published by Wiley in Security and Communication Networks
- Vol. 2022, 1-16
Open AccessSilence is Golden: A Source Location Privacy Scheme for Wireless Sensor Networks Based on Silent Nodes
Source location privacy (SLP) is an important property for security-critical wireless sensor network applications such as monitoring and tracking. However, cryptology-based schemes cannot protect the SLP effectively since an adversary can capture the source node regardless of the contents of messages. Most techniques use fake sources or message delay to provide SLP, but at the cost of high energy consumption or high message delivery latency. In this paper, we present a new technique to address SLP by selecting sets of nodes that are to be silent for a short period, forcing an attacker to either be delayed or to trace back to the source along a longer route. As such, we make a number of important contributions: (i) we formalise the silent nodes selection (SiNS) problem, (ii) we prove it to be NP-complete, and (iii) to circumvent the high complexity of SiNS, we propose a novel SLP-aware routing protocol. Results from extensive simulations show that our proposed routing protocol provides a high level of SLP under appropriate parameterization at the expense of only negligible latency and messages overhead.
- Open Access
- 26 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 17 (15566013) , 3890-3905
Quantifying Source Location Privacy Routing Performance via Divergence and Information Loss
Source location Privacy (SLP) is an important property for security critical applications deployed over a wireless sensor network. This property specifies that the location of the source of messages needs to be kept secret from an eavesdropping adversary that is able to move around the network. Most previous work on SLP has focused on developing protocols to enhance the SLP imparted to the network under various attacker models and other conditions. Other works have focused on analysing the level of SLP being imparted by a specific protocol. In this paper, we introduce the notion of a routing matrix which captures when messages are first received. We then introduce a novel approach where an optimal SLP routing matrix is derived. In this approach, the attacker’s movement is modelled as a Markov chain where measures of conditional entropy and divergence are used to compare routing matrices and quantify if they provide high levels of SLP. We propose the notion of a properly competing paths that causes an attacker to divert when moving towards the source. This concept provides the basis for developing a perturbation model , similar to those used in privacy-preserving data mining. We formally prove that properly competing paths are both necessary and sufficient in ensuring the existence of an SLP-aware routing matrix and show their usage in developing an SLP-aware routing matrix. Further, we show how different SLP-aware routing matrices can be obtained through different instantiations of the framework. Those instantiations are obtained based on a notion of information loss achieved through the use of the perturbation model proposed.
- 26 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 17 (15566013) , 3890-3905
Open AccessQuantifying Source Location Privacy Routing Performance via Divergence and Information Loss
Source location Privacy (SLP) is an important property for security critical applications deployed over a wireless sensor network. This property specifies that the location of the source of messages needs to be kept secret from an eavesdropping adversary that is able to move around the network. Most previous work on SLP has focused on developing protocols to enhance the SLP imparted to the network under various attacker models and other conditions. Other works have focused on analysing the level of SLP being imparted by a specific protocol. In this paper, we introduce the notion of a routing matrix which captures when messages are first received. We then introduce a novel approach where an optimal SLP routing matrix is derived. In this approach, the attacker’s movement is modelled as a Markov chain where measures of conditional entropy and divergence are used to compare routing matrices and quantify if they provide high levels of SLP. We propose the notion of a properly competing paths that causes an attacker to divert when moving towards the source. This concept provides the basis for developing a perturbation model , similar to those used in privacy-preserving data mining. We formally prove that properly competing paths are both necessary and sufficient in ensuring the existence of an SLP-aware routing matrix and show their usage in developing an SLP-aware routing matrix. Further, we show how different SLP-aware routing matrices can be obtained through different instantiations of the framework. Those instantiations are obtained based on a notion of information loss achieved through the use of the perturbation model proposed.
- Open Access
- 14 May 2022
- Published by Elsevier in Future Generation Computer Systems
- Vol. 135, 348-363
Information management for trust computation on resource-constrained IoT devices
- 14 May 2022
- Published by Elsevier in Future Generation Computer Systems
- Vol. 135, 348-363
Open AccessInformation management for trust computation on resource-constrained IoT devices
- Open Access
- 4 February 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
- Vol. 18 (2) , 1-41
Threat-modeling-guided Trust-based Task Offloading for Resource-constrained Internet of Things
There is an increasing demand for Internet of Things (IoT) networks consisting of resource-constrained devices executing increasingly complex applications. Due to these resource constraints, IoT devices will not be able to execute expensive tasks. One solution is to offload expensive tasks to resource-rich edge nodes, which requires a framework that facilitates the selection of suitable edge nodes to perform task offloading. Therefore, in this article, we present a novel trust-model-driven system architecture , based on behavioral evidence , that is suitable for resource-constrained IoT devices and supports computation offloading. We demonstrate the viability of the proposed architecture with an example deployment of the Beta Reputation System trust model on real hardware to capture node behaviors. The open environment of edge-based IoT networks means that threats against edge nodes can lead to deviation from expected behavior. Hence, we perform a threat modeling to identify such threats. The proposed system architecture includes threat handling mechanisms that provide security properties such as confidentiality, authentication, and non-repudiation of messages in required scenarios and operate within the resource constraints. We evaluate the efficacy of the threat handling mechanisms and identify future work for the standards used.
- 4 February 2022
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
- Vol. 18 (2) , 1-41
Open AccessThreat-modeling-guided Trust-based Task Offloading for Resource-constrained Internet of Things
There is an increasing demand for Internet of Things (IoT) networks consisting of resource-constrained devices executing increasingly complex applications. Due to these resource constraints, IoT devices will not be able to execute expensive tasks. One solution is to offload expensive tasks to resource-rich edge nodes, which requires a framework that facilitates the selection of suitable edge nodes to perform task offloading. Therefore, in this article, we present a novel trust-model-driven system architecture , based on behavioral evidence , that is suitable for resource-constrained IoT devices and supports computation offloading. We demonstrate the viability of the proposed architecture with an example deployment of the Beta Reputation System trust model on real hardware to capture node behaviors. The open environment of edge-based IoT networks means that threats against edge nodes can lead to deviation from expected behavior. Hence, we perform a threat modeling to identify such threats. The proposed system architecture includes threat handling mechanisms that provide security properties such as confidentiality, authentication, and non-repudiation of messages in required scenarios and operate within the resource constraints. We evaluate the efficacy of the threat handling mechanisms and identify future work for the standards used.