Joint Reliability-aware and Cost Efficient Path Allocation and VNF Placement using Sharing Scheme

Abolfazl Ghazizadeh; Behzad Akbari; Mohammad Mahdi Tajiki

Home/Archive/arXiv

arXiv · 1912.06742

Joint Reliability-aware and Cost Efficient Path Allocation and VNF Placement using Sharing Scheme

Abolfazl Ghazizadeh·Behzad Akbari·Mohammad Mahdi Tajiki

View original source ↗Read source document ↗Export metadata ↓

Abstract

Network Function Virtualization (NFV) is a vital player of modern networks providing different types of services such as traffic optimization, content filtering, and load balancing. More precisely, NFV is a provisioning technology aims at reducing the large Capital Expenditure (CAPEX) of network providers by moving services from dedicated hardware to commodity servers using Virtualized Network Functions (VNF). A sequence of VNFs/services following a logical goal is referred to as a Service Function Chain (SFC). The movement toward SFC introduces new challenges to those network services which require high reliability. To address this challenge, redundancy schemes are introduced. Existing redundancy schemes using dedicated protection enhance the reliability of services, however, they do not consider the cost of redundant VNFs. In this paper, we propose a novel reliability enhancement method using a shared protection scheme to reduce the cost of redundant VNFs. To this end, We mathematically formulate the problem as a Mixed Integer Linear Programming (MILP). The objective is to determine optimal reliability that could be achieved with minimum cost. Although the corresponding optimization problem can be solved using existing MILP solvers, the computational complexity is not rational for realistic scenarios. Thereafter, we propose a Reliability-aware and minimum-Cost based Genetic (RCG) algorithm to solve this problem with low computational complexity. In order to evaluate the proposed solution, We have compared it with four different solutions. Simulation results show that RCG achieves near-optimal performance at a much lower complexity compared with the optimal solution.

Explore related subjects

cs.NI

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Abolfazl Ghazizadeh, Behzad Akbari, Mohammad Mahdi Tajiki. 2020-04-19. Joint Reliability-aware and Cost Efficient Path Allocation and VNF Placement using Sharing Scheme. https://arxiv.org/abs/1912.06742

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

CSI Simulation: Why Additive Noise Fails and How to Fix It

Channel State Information (CSI) has become a widely used wireless channel sensing modality for applications such as indoor localization, activity recognition, and respiration monitoring. Because collecting labeled data under every target condition is impractical, training CSI-based models often relies on simulated data produced by adding noise or perturbations to recorded channel estimates, most commonly additive white Gaussian noise (AWGN). This practice assumes that the receiver chain between the antenna and the channel estimator is linear and gain-invariant. We test this assumption empirically using RF jamming as a controlled perturbation on 6 commodity receivers across 2 indoor environments. The assumption does not hold. Automatic gain control compresses the channel estimate multiplicatively before digitization, producing amplitude distributions that no additive noise variance can reproduce. To close the resulting fidelity gap, we propose M_QTC, a measurement-calibrated model that learns the per-subcarrier distribution transformation through quantile mapping, temporal filtering, and copula-based cross-subcarrier reordering. M_QTC reduces amplitude error 8-fold and closes 89% of the aggregate fidelity gap across four complementary dimensions. The improvement transfers directly to downstream tasks, where 5 classifiers from different families trained on M_QTC-simulated data recover 93% of real-data jamming detection performance, while AWGN-trained classifiers remain near random decision.

cs.NI↗

arXiv2026

BALANCE: Hybrid Autoregressive-Speculative LLM Inference at the Network Edge

Edge inference is a promising paradigm to provide large language model (LLM) inference services in next-generation mobile networks. LLM inference mainly relies on two approaches: Autoregressive decoding (AD) generates output tokens sequentially, resulting in long latency; Speculative decoding (SD) accelerates inference by using a small language model (SLM) to generate multiple draft tokens for LLM verification, but incurs extra memory costs. Due to this latency-memory tradeoff, neither approach alone can efficiently serve users with heterogeneous demands under limited edge computing resources. To address this challenge, we propose a hybrid autoregressive-speculative inference (BALANCE) framework for edge LLM inference. In BALANCE, an edge server hosts both an SLM and an LLM, admits users, assigns each admitted user to the AD or SD mode, and performs the two modes simultaneously. To maximize the number of served users, we formulate a task throughput maximization problem to jointly determine user admission and computing resource allocation between AD and SD under user latency requirements and server memory constraints. Since the problem is NP-hard, we develop a polynomial-time algorithm that transforms the original problem into two sub-problems and obtains a sub-optimal solution with a constant approximation guarantee. Experiments demonstrate that BALANCE consistently outperforms conventional AD and SD and significantly improves task throughput.

cs.NI↗

arXiv2026

Zero-Knowledge Remote Adversarial Attack against Wi-Fi-based Human Activity Recognition for Privacy Protection

The growing capability of Wi-Fi devices to identify human activities using channel state information (CSI) raises privacy concerns. To counter this threat, we propose GRAW, an adversary system, acting as a privacy defender, that degrades the human activity recognition (HAR) system at the user device by perturbing the router's signals that the device uses to estimate CSI. GRAW employs generative adversarial imitation learning (GAIL) to construct perturbation signals, and thereby eliminates the need for any information on the target HAR systems and their inputs (i.e., zero-knowledge operation). We evaluate GRAW against seven representative HAR models, using datasets collected in five environments, including our own dataset. We observe that GRAW is the only remote attack scheme that degrades every tested HAR model to a random-selection level. At the same perturbation level, GRAW achieves an attack success ratio up to 76.7% higher than comparison methods, while maintaining over 99% packet success rate on regular Wi-Fi communication. We demonstrate the feasibility of GRAW through real-time, over-the-air experiments with software-defined radios.

cs.NI↗