Performance Evaluation in Single or Multi-Cluster C-RAN Supporting Quasi-Random Traffic

In this paper, a cloud radio access network (C-RAN) is considered where the remote radio heads (RRHs) are separated from the baseband units (BBUs). The RRHs in the C-RAN are grouped in different clusters according to their capacity while the BBUs form a centralized pool of computational resource units. Each RRH services a finite number of mobile users, i.e., the call arrival process is the quasi-random process. A new call of a single service-class requires a radio and a computational resource unit in order to be accepted in the C-RAN for a generally distributed service time. If these resource units are unavailable, then the call is blocked and lost. To analyze the multi-cluster C-RAN, we model it as a single-rate loss system, show that a product form solution exists for the steady state probabilities and propose a convolution algorithm for the accurate determination of congestion probabilities. The accuracy of this algorithm is verified via simulation. The proposed model generalizes our recent model where the RRHs in the C-RAN are grouped in a single cluster and each RRH accommodates quasi-random traffic

Call blocking probabilities for Poisson traffic under the Multiple Fractional Channel Reservation policy

In this paper, we study the performance of the Multiple Fractional Channel Reservation (MFCR) policy, which is a bandwidth reservation policy that allows the reservation of real (not integer) number of channels in order to favor calls of high channel (bandwidth) requirements. We consider a link of fixed capacity that accommodates Poisson arriving calls of different service-classes with different bandwidth-per-call requirements. Calls compete for the available bandwidth under the MFCR policy. To determine call blocking probabilities, we propose approximate but recursive formulas based on the notion of reserve transition rates. The accuracy of the proposed method is verified through simulation

Properties of Recurrent Equations for the Full-Availability Group with BPP Traffic

The paper proposes a formal derivation of recurrent equations describing the occupancy distribution in the full-availability group with multirate Binomial-Poisson-Pascal (BPP) traffic. The paper presents an effective algorithm for determining the occupancy distribution on the basis of derived recurrent equations and for the determination of the blocking probability as well as the loss probability of calls of particular classes of traffic offered to the system. A proof of the convergence of the iterative process of estimating the average number of busy traffic sources of particular classes is also given in the paper

Journal of Telecommunications and Information Technology, 2018, nr 1

We consider a two-link system that accommodates Poisson arriving calls from different service-classes and propose a multirate teletraffic loss model for its analysis. Each link has two thresholds, which refer to the number of in-service calls in the link. The lowest threshold, named support threshold, defines up to which point the link can support calls offloaded from the other link. The highest threshold, named offloading threshold, defines the point where the link starts offloading calls to the other link. The adopted bandwidth sharing policy is the complete sharing policy, in which a call can be accepted in a link if there exist enough available bandwidth units. The model does not have a product form solution for the steady state probabilities. However, we propose approximate formulas, based on a convolution algorithm, for the calculation of call blocking probabilities. The accuracy of the formulas is verified through simulation and found to be quite satisfactory

Design and analysis of a 3-dimensional cluster multicomputer architecture using optical interconnection for petaFLOP computing

In this dissertation, the design and analyses of an extremely scalable distributed multicomputer architecture, using optical interconnects, that has the potential to deliver in the order of petaFLOP performance is presented in detail. The design takes advantage of optical technologies, harnessing the features inherent in optics, to produce a 3D stack that implements efficiently a large, fully connected system of nodes forming a true 3D architecture. To adopt optics in large-scale multiprocessor cluster systems, efficient routing and scheduling techniques are needed. To this end, novel self-routing strategies for all-optical packet switched networks and on-line scheduling methods that can result in collision free communication and achieve real time operation in high-speed multiprocessor systems are proposed. The system is designed to allow failed/faulty nodes to stay in place without appreciable performance degradation. The approach is to develop a dynamic communication environment that will be able to effectively adapt and evolve with a high density of missing units or nodes. A joint CPU/bandwidth controller that maximizes the resource allocation in this dynamic computing environment is introduced with an objective to optimize the distributed cluster architecture, preventing performance/system degradation in the presence of failed/faulty nodes. A thorough analysis, feasibility study and description of the characteristics of a 3-Dimensional multicomputer system capable of achieving 100 teraFLOP performance is discussed in detail. Included in this dissertation is throughput analysis of the routing schemes, using methods from discrete-time queuing systems and computer simulation results for the different proposed algorithms. A prototype of the 3D architecture proposed is built and a test bed developed to obtain experimental results to further prove the feasibility of the design, validate initial assumptions, algorithms, simulations and the optimized distributed resource allocation scheme. Finally, as a prelude to further research, an efficient data routing strategy for highly scalable distributed mobile multiprocessor networks is introduced

Satellite Networks: Architectures, Applications, and Technologies

Since global satellite networks are moving to the forefront in enhancing the national and global information infrastructures due to communication satellites' unique networking characteristics, a workshop was organized to assess the progress made to date and chart the future. This workshop provided the forum to assess the current state-of-the-art, identify key issues, and highlight the emerging trends in the next-generation architectures, data protocol development, communication interoperability, and applications. Presentations on overview, state-of-the-art in research, development, deployment and applications and future trends on satellite networks are assembled