Performance Analysis of Preemption Algorithms in an IDNX Circuit Switch Communications Network

Access to communication networks is increasing rapidly. The increase access to these networks results in delays and at times loss of data. At times of peak traffic or when trunks or nodes are down, very important customers\u27 communications requirements are not met. One way to combat this problem is to prioritize the network and provide different levels of grade of service (GOS) for each priority. Call preemption provides an effective method of obtaining different levels of GOS. This research seeks to design the best circuit switch communications network preemption model for the DoD by analyzing previously developed preemption algorithms. Four simulation network models are developed. The grades of service per priority are obtained as the network capacity decreases and as the calls generated in node 0 increases. The analysis of preemption network models is based on the grade of service, average number of preemptions, and average network bandwidth. The networks are simulated under the same input parameters. The analysis showed that preemption can significantly lower the grade of service for high priority customers in a congested network. The best configuration preemption model depends on the bandwidth flexibility of the network and the goals of the communications network organization

Queueing models for capacity changes in cellular networks

With the rapid development of cellular communication techniques, many recent studies have focused on improving the quality of service (QoS) in cellular networks. One characteristic of the systems in cellular networks, which can have direct impact on the system QoS, is the fluctuation of the system capacity. In this thesis, the QoS of systems with capacity fluctuations is studied from two perspectives: (1) priority queueing systems with preemption, and (2) the M/M/~C/~C system. In the first part, we propose two models with controlled preemption and analyze their performance in the context of a single reference cell that supports two kinds of traffic (new calls and handoff calls). The formulae for calculating the performance measures of interest (i.e., handoff call blocking probability, new call blocking and dropping probabilities) are developed, and the procedures for solving optimization problems for the optimal number of channels required for each proposed model are established. The proposed controlled preemption models are then compared to existing non-preemption and full preemption models from the following three perspectives: (i) channel utilization, (ii) low priority call (i.e., new calls) performance, and (iii) flexibility to meet various constraints. The results showed that the proposed controlled preemption models are the best models overall. In the second part, the loss system with stochastic capacity, denoted by M/M/~C/~C, is analyzed using the Markov regenerative process (MRGP) method. Three different distributions of capacity interchange times (exponential, gamma, and Pareto) and three different capacity variation patterns (skip-free, distance-based, and uniform-based) are considered. Analytic expressions are derived to calculate call blocking and dropping probabilities and are verified by call level simulations. Finally, numerical examples are provided to determine the impact of different distributions of capacity interchange times and different capacity variation patterns on system performance

Spectrum Allocation in Networks with Finite Sources and Data-Driven Characterization of Users\u27 Stochastic Dynamics

During emergency situations, the public safety communication systems (PSCSs) get overloaded with high traffic loads. Note that these PSCSs are finite source networks. The goal of our study is to propose techniques for an efficient allocation of spectrum in finite source networks that can help alleviate the overloading of PSCSs. In a PSCS, there are two system segments, one for the system-access control and the other for communications, each having dedicated frequency channels. The first part of our research, consisting of three projects, is based on modeling and analysis of finite source systems for optimal spectrum allocation, for both access-control and communications. In the first project, Chapter 2, we study the allocation of spectrum based on the concept of cognitive radio systems. In the second project, Chapter 3, we study the optimal communication channel allocation by call admission and preemption control. In the third project, Chapter 4, we study the optimal joint allocation of frequency channels for access-control and communications. Note that the aforementioned spectrum allocation techniques require the knowledge of the call traffic parameters and the priority levels of the users in the system. For practical systems, these required pieces of information are extracted from the call records meta-data. A key fact that should be considered while analyzing the call records is that the call arrival traffic and the users priority levels change with a change in events on the ground. This is so because a change in events on the ground affects the communication behavior of the users in the system, which affects the call arrival traffic and the priority levels of the users. Thus, the first and the foremost step in analyzing the call records data for a given user, for extracting the call traffic information, is to segment the data into time intervals of homogeneous or stationary communication behavior of the user. Note that such a segmentation of the data of a practical PSCS is the goal of our fourth project, Chapter 5, which constitutes the second part of our study

The AMSC network control system

The American Mobile Satellite Corporation (AMSC) is going to construct, launch, and operate a satellite system in order to provide mobile satellite services to the United States. AMSC is going to build, own, and operate a Network Control System (NCS) for managing the communications usage of the satellites, and to control circuit switched access between mobile earth terminals and feeder-link earth stations. An overview of the major NCS functional and performance requirements, the control system physical architecture, and the logical architecture is provided

Time Protection: the Missing OS Abstraction

Timing channels enable data leakage that threatens the security of computer systems, from cloud platforms to smartphones and browsers executing untrusted third-party code. Preventing unauthorised information flow is a core duty of the operating system, however, present OSes are unable to prevent timing channels. We argue that OSes must provide time protection in addition to the established memory protection. We examine the requirements of time protection, present a design and its implementation in the seL4 microkernel, and evaluate its efficacy as well as performance overhead on Arm and x86 processors