Eduard Axel Jorswieck

arXiv2022

Online Admission Control and Resource Allocation in Network Slicing under Demand Uncertainties

One of the most important aspects of moving forward to the next generation networks like 5G/6G, is to enable network slicing in an efficient manner. The most challenging issues are the uncertainties in computation and communication demand. Because the slices' arrive to the network in different times and their lifespans vary, the solution should dynamically react to online slice requests. The joint problem of online admission control and resource allocation considering the energy consumption is formulated mathematically. It is based on Binary Linear Programming (BLP), where, the $Γ$-Robustness concept is exploited to overcome Virtual Links (VL) bandwidths' and Virtual Network Functions (VNF) workloads' uncertainties. Then, an optimal algorithm is proposed. This optimal algorithm cannot be solved in a reasonable amount of time for real-world and large-scale networks. To find near-optimal solution efficiently, a new heuristic algorithm is developed. The assessments' results indicate that the efficiency of heuristic is vital in increasing the accepted requests' count, decreasing power consumption and providing adjustable tolerance vs. the VNFs workloads' and VLs traffics' uncertainties, separately. Considering the acceptance ratio and power consumption that constitute the two important components of the objective function, heuristic has about 7% and 10% optimality gaps, respectively, while being about 30X faster than that of optimal algorithm.

cs.NI↗

arXiv2017

Stealthy Secret Key Generation

In this work, we consider a complete covert communication system, which includes the source-model of a stealthy secret key generation (SSKG) as the first phase. The generated key will be used for the covert communication in the second phase of the current round and also in the first phase of the next round. We investigate the stealthy SK rate performance of the first phase. The derived results show that the SK capacity lower and upper bounds of the source-model SKG are not affected by the additional stealth constraint. This result implies that we can attain the SSKG capacity for free when the sequences observed by the three terminals Alice ($X^n$), Bob ($Y^n$) and Willie ($Z^n$) follow a Markov chain relationship, i.e., $X^n-Y^n-Z^n$. We then prove that the sufficient condition to attain both, the SK capacity as well as the SSK capacity, can be relaxed from physical to stochastic degradedness. In order to underline the practical relevance, we also derive a sufficient condition to attain the degradedness by the usual stochastic order for Maurer's fast fading Gaussian (satellite) model for the source of common randomness.

cs.IT↗