Ultra-reliable low latency communication (URLLC) is an important new feature brought by 5G, with a potential to support a vast set of applications that rely on mission-critical links. In this article, we first discuss the principles for supporting URLLC in the perspective to the traditional assumptions and models applied in communication/information theory. We then discuss how this principles a...

Handling skew is one of the major challenges in query processing. In distributed computational environments such as MapReduce, uneven distribution of the data to the servers is not desired. One of the dominant measures that we want to optimize in distributed environments is communication cost. In a MapReduce job this is the amount of data that is transferred from the mappers to the reducers. In...

—We investigate the performance of multihop-intervehicular communication systems with regenerative and nonregenerative relaying. We consider the so-called " n*Rayleigh distribution " as an adequate multipath fading channel model for vehicle-to-vehicle communication scenarios. We derive a novel approximation for the outage probability of maximum ratio combining (MRC) diversity reception. In addi...

Workflows is an important class of parallel applications that consist of many tasks with logical or data dependencies. A multitude of scheduling algorithms have been proposed to optimize the workflow execution in heterogeneous computing systems. However, in order to be efficiently applied in practice, these algorithms require accurate estimates of task execution and communication times. In this...

To design an efficient interference management and multiple access scheme for visible light communication (VLC) network, this letter leverages the non-orthogonal multiple access (NOMA), which has received significant attention in the 5 generation wireless communication. With the residual interference from the successive interference cancellation in NOMA taken into account, we optimize the power...

Advances in programming languages and parallelizing compilers are making parallel computers easier to use by providing a high-level portable programming model that protects software investment. However, experience has shown that simply finding parallelism is not always sufficient for obtaining good performance from today’s multiprocessors, largely because the cost of interprocessor communicatio...

In this paper, we study and optimize the aggregate query processing in a highly distributed Cloud Data Warehouse, where each database stores a subset of relational data in a star-schema. Existing aggregate query processing algorithms focus on optimizing various query operations but give less importance to communication cost overhead (Two-phase algorithm). However, in cloud architectures, the co...

In this paper we consider estimation of dynamical systems over wireless fading communication channels using a Kalman filter. We show the impact of the stochastic communication noise on the estimation process. We furthermore show how noisy packets should be handled in the receiver. More specifically, we illustrate the impact of the availability of a cross-layer information path on the optimum re...

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost...

Network-on-Chip (NoC) have been used as an interesting option in design of communication infrastructures for embedded systems, providing a scalable structure and balancing the communication between cores. Because several data packets can be transmitted simultaneously through the network, an efficient routing strategy must be used in order to avoid congestion delays. In this paper, ant colony al...