This article presents a universal and versatile model of multiservice overflow systems based on Hayward's concept. The model can be used to analyze modern telecommunications and computer networks, mobile networks in particular. The advantage of the proposed approach lies in its ability to analyze overflow systems with elastic and adaptive traffic, systems with distributed resources and systems with non-full-availability in primary and secondary resources.

This article proposes a versatile model of a multiservice queueing system with elastic traffic. The model can provide a basis for an analysis of telecommunications and computer network systems, internet network systems in particular. The advantage of the proposed approach is a possibility of a determination of delays in network nodes for a number of selected classes of calls offered in modern telecommunications networks.

We study the impact of incorporating handoff prediction information in the session admission control process in mobile cellular networks. We evaluate the performance of optimal policies obtained with and without the predictive information, while taking into account possible prediction errors. Two different approaches to compute the optimal admission policy were studied: dynamic programming and reinforcement learning. Numerical results show significant performance gains when the predictive information is used in the admission process.

In this paper we propose a new algorithm for computing the optimal configuration of the Multiple Fractional Guard Channel (MFGC) admission policy in multiservice mobile wireless networks. The optimal configuration maximizes the offered traffic that the system can handle while meeting certain QoS requirements. The proposed algorithm is shown to be more efficient than previous algorithms appeared in the literature.

Unlike in existing mobile networks, a variety of services having different quality requirements will be provided in future mobile networks, where any single group of service users can not characterize the whole traffic distribution in the system. Beginning at the mobile network design, the population of service subscribers is estimated and then base stations are located. As the service market evolves, the volume of users might grow or the population of users distributed between the multiple services as well as the located cells might change. In this case, two questions are of interest: how much growth in user population and what change in user distribution can be accommodated in the current cell configuration. If such shifts could not be admitted, current frequency and base station allocations should be expanded or reallocated. In this paper, we provide a framework that can decide whether the present network configuration is able to admit the changes of interest. Admissibility decision rules are addressed with proofs.

Quality of service requirements are satisfied conjointly by the service model, which determines how resources are shared and by network engineering, which determines how much capacity is provided. In this paper we consider the impact of the adopted charging scheme on the feasibility of fulfilling QoS requirements. We identify three categories of charging scheme based respectively on flat rate pricing, congestion pricing and transaction pricing.

Next generation personal communication systems will provide a range of different services to moving users. In parallel, packet switching is being proposed as a way to statistical multiplexing and hence to better resource exploitation. The co-existence of different services may prove difficult due to the different requirements on quality of service parameters like packet loss, delay, and so on. This requires a careful design of Call Admission Control policies, which are to be quite different from those used in fixed network, due to two phenomena which are typical of mobile systems, namely co-channel interference and handovers. In this paper we address these complex topics, and propose some basic rules for Call Admission Control policies suitable in this context.