18 September 2018 in IEEE/ACM Transactions on Networking
Distributed cloud networking enables the deployment of a wide range of services in the form of interconnected software functions instantiated over general purpose hardware at multiple cloud locations distributed throughout the network. We consider the problem of optimal service delivery over a distributed cloud network, in which nodes are equipped with both communication and computation resources. We address the design of distributed online solutions that drive flow processing and routing decisions, along with the associated allocation of cloud and network resources. For a given set of services, each described by a chain of service functions, we characterize the cloud network capacity region and design a family of dynamic cloud network control (DCNC) algorithms that stabilize any service input rate inside the capacity region, while achieving arbitrarily close to minimum resource cost. The proposed DCNC algorithms are derived by extending Lyapunov drift-plus-penalty control to a novel multi-commodity-chain (MCC) queuing system, resulting in the first throughput and cost optimal algorithms for a general class of MCC flow problems that generalizes traditional multi-commodity flow by including flow chaining, flow scaling, and joint communication/computation resource allocation. We provide throughput and cost optimality guarantees, convergence time analysis, and extensive simulations in representative cloud network scenarios.
13 February 2020 in IEEE Access
The concentrated popularity distribution of video files and the caching of popular files on users and their subsequent distribution via device-to-device (D2D) communications have dramatically increased the throughput of wireless video networks. However, since popularity distribution is not time-invariant, and the files available in the neighborhood can change when other users move into and out of the neighborhood, there is a need for replacement of cache content. In this work, we propose a practical and feasible replacement architecture for base station (BS) assisted wireless D2D caching networks by exploiting the broadcasting of the BS. Based on the proposed architecture, we formulate a caching content replacement problem, with the goal of maximizing the time-average service rate under the cost constraint and queue stability. We combine the reward-to-go concept and the drift-plus-penalty methodology to develop a solution framework for the problem at hand. To realize the solution framework, two algorithms are proposed. The first algorithm is simple, but exploits only the historical record. The second algorithm can exploit both the historical record and future information, but is complex. Our simulation results indicate that when dynamics exist, the systems exploiting the proposed designs can outperform the systems using a static policy.
19 October 2018 in IEEE Transactions on Wireless Communications
Augmented information (AgI) services allow users to consume information that results from the execution of a chain of service functions that process source information to create real-time augmented value. Applications include realtime analysis of remote sensing data, real-time computer vision, personalized video streaming, and augmented reality, among others. We consider the problem of optimal distribution of AgI services over a wireless computing network, in which nodes are equipped with both communication and computing resources. We characterize the wireless computing network capacity region and design a joint flow scheduling and resource allocation algorithm that stabilizes the underlying queuing system while achieving a network cost arbitrarily close to the minimum, with a tradeoff in network delay. Our solution captures the unique chaining and flow scaling aspects of AgI services, while exploiting the use of the broadcast approach coding scheme over the wireless channel.
5 February 2020 in IEEE Transactions on Wireless Communications
This paper investigates the capability of millimeter-wave (mmWave) channel sounders with phased arrays to perform super-resolution parameter estimation, i.e., determine the parameters of multipath components (MPC), such as direction of arrival and delay, with resolution better than the Fourier resolution of the setup. We analyze the question both generally, and with respect to a particular novel multi-beam mmWave channel sounder that is capable of performing multiple-input-multiple-output (MIMO) measurements in dynamic environments. We firstly propose a novel two-step calibration procedure that provides higher-accuracy calibration data that are required for Rimax or SAGE. Secondly, we investigate the impact of center misalignment and residual phase noise on the performance of the parameter estimator. Finally we experimentally verify the calibration results and demonstrate the capability of our sounder to perform super-resolution parameter estimation.