Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 22 min ago
Peer-reviewedCC BY 4.0Mathematics

TAVRUM: Feasibility-First Contract Matching for Fragmentation-Aware Resource Allocation in IoT–Fog Networks

  1. 1Department of Computer Science and Artificial Intelligence, College of Computing, Umm Al-Qura University, Makkah 21961, Saudi Arabia

Abstract

The rapid growth of Internet of Things (IoT) applications has increased the need for task-offloading mechanisms that can operate efficiently under heterogeneous Fog resources, dynamic workloads, and stringent latency requirements. A recurring limitation in existing allocation and matching approaches is that the choice of resource-bundle granularity is often treated as a secondary sizing step rather than as an integral part of the association decision. This paper presents Task-Adaptive Virtual Resource Unit Matching (TAVRUM), a contract-level framework in which each allocation decision explicitly couples a task, a Fog node, and a discrete Virtual Resource Unit (VRU) level. TAVRUM applies feasibility-first filtering to enforce multidimensional resource and deadline constraints before preference ranking, incorporates allocation waste into contract utility, and uses risk-aware admission together with event-triggered local rematching and hysteresis for dynamic conditions. Under the trace-calibrated experimental setting, TAVRUM reduces allocation fragmentation from 0.733 for the EDF-Feasible comparator to 0.656, an improvement of approximately 10.5%, while its task-outage rate is 33.27% compared with 32.89% for EDF-Feasible. This resource-efficiency gain is accompanied by higher mean latency (1.431 versus 1.216) and nearly unchanged P95 latency (3.247 versus 3.235). On the evaluated small instances, TAVRUM has a mean objective gap of 11.76% relative to the exact MILP reference. The results therefore characterize a measurable resource-efficiency–QoS trade-off rather than universal superiority across all metrics.

Related

  1. Latency-Aware Uplink NOMA-MEC with PASS: A Feasibility-First Resource Allocation Framework
    Sepehr Abolhasani, Saba Asaad, S. Mohammad Razavizadeh +1
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  2. Optimal Dynamic Resource Allocation for Multicore Real-time Systems
    Georgiy A. Bondar, Abigail Eisenklam, Ripon C. Sarker +2
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. A Resource Allocation Tournament
    Adam Nathaniel, Refael Hassin
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  4. Multi-view Semantic-aware Resource Allocation for Edge AI
    Jiawei Luo, Hussein Saleh, Mohamad Assaad
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  5. An Inertial Split Feasibility Framework for Bandwidth Allocation Problems in Communication Networks
    Atid Kangtunyakarn, Araya Kheawborisut, Kanchana Kumnungkit
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
BibTeX
@article{alsadie2026tavrum,
  title = {{TAVRUM: Feasibility-First Contract Matching for Fragmentation-Aware Resource Allocation in IoT–Fog Networks}},
  author = {Deafallah Alsadie},
  journal = {Mathematics},
  year = {2026},
  month = sep,
  doi = {10.3390/math14193546},
  url = {https://www.mdpi.com/2227-7390/14/19/3546},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - TAVRUM: Feasibility-First Contract Matching for Fragmentation-Aware Resource Allocation in IoT–Fog Networks
AU  - Deafallah Alsadie
PY  - 2026
DA  - 2026/09/30
JO  - Mathematics
DO  - 10.3390/math14193546
UR  - https://www.mdpi.com/2227-7390/14/19/3546
AB  - The rapid growth of Internet of Things (IoT) applications has increased the need for task-offloading mechanisms that can operate efficiently under heterogeneous Fog resources, dynamic workloads, and stringent latency requirements. A recurring limitation in existing allocation and matching approaches is that the choice of resource-bundle granularity is often treated as a secondary sizing step rather than as an integral part of the association decision. This paper presents Task-Adaptive Virtual Resource Unit Matching (TAVRUM), a contract-level framework in which each allocation decision explicitly couples a task, a Fog node, and a discrete Virtual Resource Unit (VRU) level. TAVRUM applies feasibility-first filtering to enforce multidimensional resource and deadline constraints before preference ranking, incorporates allocation waste into contract utility, and uses risk-aware admission together with event-triggered local rematching and hysteresis for dynamic conditions. Under the trace-calibrated experimental setting, TAVRUM reduces allocation fragmentation from 0.733 for the EDF-Feasible comparator to 0.656, an improvement of approximately 10.5%, while its task-outage rate is 33.27% compared with 32.89% for EDF-Feasible. This resource-efficiency gain is accompanied by higher mean latency (1.431 versus 1.216) and nearly unchanged P95 latency (3.247 versus 3.235). On the evaluated small instances, TAVRUM has a mean objective gap of 11.76% relative to the exact MILP reference. The results therefore characterize a measurable resource-efficiency–QoS trade-off rather than universal superiority across all metrics.
SN  - 2227-7390
ER  -