Global repair bandwidth cost optimization of generalized regenerating codes in clustered distributed storage systems

In clustered distributed storage systems (CDSSs), one of the main design goals is minimizing the transmission cost during the failed storage nodes repairing. Generalized regenerating codes (GRCs) are proposed to balance the intra-cluster repair bandwidth and the inter-cluster repair bandwidth for guaranteeing data availability. The trade-off performance of GRCs illustrates that, it can reduce storage overhead and inter-cluster repair bandwidths simultaneously. However, in practical big data storage scenarios, GRCs cannot give an effective solution to handle the heterogeneity of bandwidth costs among different clusters for node failures recovery. This paper proposes an asymmetric bandwidth allocation strategy (ABAS) of GRCs for the inter-cluster repair in heterogeneous CDSSs. Furthermore, an upper bound of the achievable capacity of ABAS is derived based on the information flow graph (IFG), and the constraints of storage capacity and intra-cluster repair bandwidth are also elaborated. Then, a metric termed global repair bandwidth cost (GRBC), which can be minimized regarding of the inter-cluster repair bandwidths by solving a linear programming problem, is defined. The numerical results demonstrate that, maintaining the same data availability and storage overhead, the proposed ABAS of GRCs can effectively reduce the GRBC compared to the traditional symmetric bandwidth allocation schemes

Downlink MIMO-NOMA for Ultra-Reliable Low-Latency Communications

© 2019 IEEE. With the emergence of the mission-critical Internet of Things applications, ultra-reliable low-latency communications are attracting a lot of attentions. Non-orthogonal multiple access (NOMA) with multiple-input multiple-output (MIMO) is one of the promising candidates to enhance connectivity, reliability, and latency performance of the emerging applications. In this paper, we derive a closed-form upper bound for the delay target violation probability in the downlink MIMO-NOMA, by applying stochastic network calculus to the Mellin transforms of service processes. A key contribution is that we prove that the infinite-length Mellin transforms resulting from the non-negligible interferences of NOMA are Cauchy convergent and can be asymptotically approached by a finite truncated binomial series in the closed form. By exploiting the asymptotically accurate truncated binomial series, another important contribution is that we identify the critical condition for the optimal power allocation of MIMO-NOMA to achieve consistent latency and reliability between the receivers. The condition is employed to minimize the total transmit power, given a latency and reliability requirement of the receivers. It is also used to prove that the minimal total transmit power needs to change linearly with the path losses, to maintain latency and reliability at the receivers. This enables the power allocation for mobile MIMO-NOMA receivers to be effectively tracked. The extensive simulations corroborate the accuracy and effectiveness of the proposed model and the identified critical condition

A quality of experience approach in smartphone video selection framework for energy efficiency

Online video streaming is getting more common in the smartphone device nowadays. Since the Corona Virus (COVID-19) pandemic hit all human across the globe in 2020, the usage of online streaming among smartphone user are getting more vital. Nevertheless, video streaming can cause the smartphone energy to drain quickly without user to realize it. Also, saving energy alone is not the most significant issues especially if with the lack of attention on the user Quality of Experience (QoE). A smartphones energy management is crucial to overcome both of these issues. Thus, a QoE Mobile Video Selection (QMVS) framework is proposed. The QMVS framework will govern the tradeoff between energy efficiency and user QoE in the smartphone device. In QMVS, video streaming will be using Dynamic Video Attribute Pre-Scheduling (DVAP) algorithm to determine the energy efficiency in smartphone devices. This process manages the video attribute such as brightness, resolution, and frame rate by turning to Video Content Selection (VCS). DVAP is handling a set of rule in the Rule Post-Pruning (RPP) method to remove an unused node in list tree of VCS. Next, QoE subjective method is used to obtain the Mean Opinion Score (MOS) of users from a survey experiment on QoE. After both experiment results (MOS and energy) are established, the linear regression technique is used to find the relationship between energy consumption and user QoE (MOS). The last process is to analyze the relationship of VCS results by comparing the DVAP to other recent video streaming applications available. Summary of experimental results demonstrate the significant reduction of 10% to 20% energy consumption along with considerable acceptance of user QoE. The VCS outcomes are essential to help users and developer deciding which suitable video streaming format that can satisfy energy consumption and user QoE

Multi-Objective Computation Sharing in Energy and Delay Constrained Mobile Edge Computing Environments

In a mobile edge computing (MEC) network, mobile devices, also called edge clients, offload their computations to multiple edge servers that provide additional computing resources. Since the edge servers are placed at the network edge, transmission delays between edge servers and clients are shorter compared to those of cloud computing. In addition, edge clients can offload their tasks to other nearby edge clients with available computing resources by exploiting the Fog Computing (FC) paradigm. A major challenge in MEC and FC networks is to assign the tasks from edge clients to edge servers, as well as to other edge clients, so that their tasks are completed with minimum energy consumption and processing delay. In this paper, we model task offloading in MEC as a constrained multi-objective optimization problem (CMOP) that minimizes both the energy consumption and task processing delay of the mobile devices. To solve the CMOP, we design an evolutionary algorithm that can efficiently find a representative sample of the best trade-offs between energy consumption and task processing delay, i.e., the Pareto-optimal front. Compared to existing approaches for task offloading in MEC, we see that our approach finds offloading decisions with lower energy consumption and task processing delay

Optimal Placement Delivery Arrays from tt-Designs with Application to Hierarchical Coded Caching

Coded caching scheme originally proposed by Maddah-Ali and Niesen (MN) achieves an optimal transmission rate $R$ under uncoded placement but requires a subpacketization level $F$ which increases exponentially with the number of users $K$ where the number of files $N \geq K$. Placement delivery array (PDA) was proposed as a tool to design coded caching schemes with reduced subpacketization level by Yan \textit{et al.} in \cite{YCT}. This paper proposes two novel classes of PDA constructions from combinatorial $t$-designs that achieve an improved transmission rate for a given low subpacketization level, cache size and number of users compared to existing coded caching schemes from $t$-designs. A $(K, F, Z, S)$ PDA composed of a specific symbol $\star$ and $S$ non-negative integers corresponds to a coded caching scheme with subpacketization level $F$, $K$ users each caching $Z$ packets and the demands of all the users are met with a rate $R=\frac{S}{F}$. For a given $K$, $F$ and $Z$, a lower bound on $S$ such that a $(K, F, Z, S)$ PDA exists is given by Cheng \textit{et al.} in \cite{MJXQ} and by Wei in \cite{Wei} . Our first class of proposed PDA achieves the lower bound on $S$. The second class of PDA also achieves the lower bound in some cases. From these two classes of PDAs, we then construct hierarchical placement delivery arrays (HPDA), proposed by Kong \textit{et al.} in \cite{KYWM}, which characterizes a hierarchical two-layer coded caching system. These constructions give low subpacketization level schemes.Comment: Title has been changed. Some changes have been incorporated in the results. 11 pages, 5 figures and 3 table