On the Statistical Multiplexing Gain of Virtual Base Station Pools

Facing the explosion of mobile data traffic, cloud radio access network (C-RAN) is proposed recently to overcome the efficiency and flexibility problems with the traditional RAN architecture by centralizing baseband processing. However, there lacks a mathematical model to analyze the statistical multiplexing gain from the pooling of virtual base stations (VBSs) so that the expenditure on fronthaul networks can be justified. In this paper, we address this problem by capturing the session-level dynamics of VBS pools with a multi-dimensional Markov model. This model reflects the constraints imposed by both radio resources and computational resources. To evaluate the pooling gain, we derive a product-form solution for the stationary distribution and give a recursive method to calculate the blocking probabilities. For comparison, we also derive the limit of resource utilization ratio as the pool size approaches infinity. Numerical results show that VBS pools can obtain considerable pooling gain readily at medium size, but the convergence to large pool limit is slow because of the quickly diminishing marginal pooling gain. We also find that parameters such as traffic load and desired Quality of Service (QoS) have significant influence on the performance of VBS pools.Comment: Accepted by GlobeCom'1

IPTV deployment - Trigger for advanced network services!

C

The financial clouds review

This paper demonstrates financial enterprise portability, which involves moving entire application services from desktops to clouds and between different clouds, and is transparent to users who can work as if on their familiar systems. To demonstrate portability, reviews for several financial models are studied, where Monte Carlo Methods (MCM) and Black Scholes Model (BSM) are chosen. A special technique in MCM, Least Square Methods, is used to reduce errors while performing accurate calculations. The coding algorithm for MCM written in MATLAB is explained. Simulations for MCM are performed on different types of Clouds. Benchmark and experimental results are presented for discussion. 3D Black Scholes are used to explain the impacts and added values for risk analysis, and three different scenarios with 3D risk analysis are explained. We also discuss implications for banking and ways to track risks in order to improve accuracy. We have used a conceptual Cloud platform to explain our contributions in Financial Software as a Service (FSaaS) and the IBM Fined Grained Security Framework. Our objective is to demonstrate portability, speed, accuracy and reliability of applications in the clouds, while demonstrating portability for FSaaS and the Cloud Computing Business Framework (CCBF), which is proposed to deal with cloud portability

Performance analysis of a caching algorithm for a catch-up television service

The catch-up TV (CUTV) service allows users to watch video content that was previously broadcast live on TV channels and later placed on an on-line video store. Upon a request from a user to watch a recently missed episode of his/her favourite TV series, the content is streamed from the video server to the customer's receiver device. This requires that an individual flow is set up for the duration of the video, and since it is hard to impossible to employ multicast streaming for this purpose (as users seldomly issue a request for the same episode at the same time), these flows are unicast. In this paper, we demonstrate that with the growing popularity of the CUTV service, the number of simultaneously running unicast flows on the aggregation parts of the network threaten to lead to an unwieldy increase in required bandwidth. Anticipating this problem and trying to alleviate it, the network operators deploy caches in strategic places in the network. We investigate the performance of such a caching strategy and the impact of its size and the cache update logic. We first analyse and model the evolution of video popularity over time based on traces we collected during 10 months. Through simulations we compare the performance of the traditional least-recently used and least-frequently used caching algorithms to our own algorithm. We also compare their performance with a "perfect" caching algorithm, which knows and hence does not have to estimate the video request rates. In the experimental data, we see that the video parameters from the popularity evolution law can be clustered. Therefore, we investigate theoretical models that can capture these clusters and we study the impact of clustering on the caching performance. Finally, some considerations on the optimal cache placement are presented