An optimum dynamic priority-based call admission control scheme for universal mobile telecommunications system

The dynamism associated with quality of service (QoS) requirement for traffic emanating from smarter end users devices founded on the internet of things (IoTs) drive, places a huge demand on modern telecommunication infrastructure. Most telecom networks, currently utilize robust call admission control (CAC) policies to ameliorate this challenge. However, the need for smarter CAC has becomes imperative owing to the sensitivity of traffic currently being supported. In this work, we developed a prioritized CAC algorithm for third Generation (3G) wireless cellular network. Based on the dynamic priority CAC (DP-CAC) model, we proposed an optimal dynamic priority CAC (ODP-CAC) scheme for Universal Mobile Telecommunication System (UMTS). We then carried out simulation under heavy traffic load while also exploiting renegotiation among different call traffic classes. Also, we introduced queuing techniques to enhance the new calls success probability while still maintaining a good handoff failure across the network. Results show that ODP-CAC provides an improved performance with regards to the probability of call drop for new calls, network load utilization and grade of service with average percentage value of 15.7%, 5.4% and 0.35% respectively

Quality of Service over Specific Link Layers: state of the art report

The Integrated Services concept is proposed as an enhancement to the current Internet architecture, to provide a better Quality of Service (QoS) than that provided by the traditional Best-Effort service. The features of the Integrated Services are explained in this report. To support Integrated Services, certain requirements are posed on the underlying link layer. These requirements are studied by the Integrated Services over Specific Link Layers (ISSLL) IETF working group. The status of this ongoing research is reported in this document. To be more specific, the solutions to provide Integrated Services over ATM, IEEE 802 LAN technologies and low-bitrate links are evaluated in detail. The ISSLL working group has not yet studied the requirements, that are posed on the underlying link layer, when this link layer is wireless. Therefore, this state of the art report is extended with an identification of the requirements that are posed on the underlying wireless link, to provide differentiated Quality of Service

Managing QoS in multiservice data networks

Abstract: Next-generation networks require organized methods to offer Quality of Service (QoS) guaranteed IP network connectivity. This study suggests a solution for combined control of routing and flow problems, namely an algorithm based on flow deterministic network models. The algorithm solves the problem by identifying optimal routes and triggering the flow control law only for those paths. This experiment aims to assess how QoS and MPLS traffic engineering (TE) can advance Internet performance. It also aims to ascertain avenues for Internet improvement and to devise innovative mechanisms to ensure traffic engineering provision, and Class-of-Service (CoS) features in next-generation networks. The performances of the algorithm were evaluated on a fully connected six-node network, the data for which were extracted from a realistic network

Low-complexity medium access control protocols for QoS support in third-generation radio access networks

One approach to maximizing the efficiency of medium access control (MAC) on the uplink in a future wideband code-division multiple-access (WCDMA)-based third-generation radio access network, and hence maximize spectral efficiency, is to employ a low-complexity distributed scheduling control approach. The maximization of spectral efficiency in third-generation radio access networks is complicated by the need to provide bandwidth-on-demand to diverse services characterized by diverse quality of service (QoS) requirements in an interference limited environment. However, the ability to exploit the full potential of resource allocation algorithms in third-generation radio access networks has been limited by the absence of a metric that captures the two-dimensional radio resource requirement, in terms of power and bandwidth, in the third-generation radio access network environment, where different users may have different signal-to-interference ratio requirements. This paper presents a novel resource metric as a solution to this fundamental problem. Also, a novel deadline-driven backoff procedure has been presented as the backoff scheme of the proposed distributed scheduling MAC protocols to enable the efficient support of services with QoS imposed delay constraints without the need for centralized scheduling. The main conclusion is that low-complexity distributed scheduling control strategies using overload avoidance/overload detection can be designed using the proposed resource metric to give near optimal performance and thus maintain a high spectral efficiency in third-generation radio access networks and that importantly overload detection is superior to overload avoidance

A framework for fast handoff schemes in wireless ATM networks

Includes bibliographical references.In this research, we focus on providing a framework that extends the fixed ATM standard to support user mobility in future WATM networks. The WATM architecture allows for the migration of fixed ATM networks without major modifications. Thus most of the mobility functions are implemented on the wireless access network. The most important component supporting mobility in a cluster is the Mobility Enhanced Switch (MES). We propose using direct links between adjacent MESs to support Permanent Virtual Channels (PVCs) in order to facilitate fast inter-cluster handoffwith minimum handofflatency. This research addresses a framework on handoff mobility by proposing three fast handoff re-routing schemes based on the support of PVCs

The application of forward error correction techniques in wireless ATM

Bibliography: pages 116-121.The possibility of providing wireless access to an ATM network promises nomadic users a communication tool of unparalleled power and flexibility. Unfortunately, the physical realization of a wireless A TM system is fraught with technical difficulties, not the least of which is the problem of supporting a traditional ATM protocol over a non-benign wireless link. The objective of this thesis, titled "The Application of Forward Error Correction Techniques in Wireless ATM' is to examine the feasibility of using forward error correction techniques to improve the perceived channel characteristics to the extent that the channel becomes transparent to the higher layers and allows the use of an unmodified A TM protocol over the channel. In the course of the investigation that this dissertation describes, three possible error control strategies were suggested for implementation in a generic wireless channel. These schemes used a combination of forward error correction coding schemes, automatic repeat request schemes and interleavers to combat the impact of bit errors on the performance of the link. The following error control strategies were considered : 1. A stand alone fixed rate Reed-Solomon encoder/decoder with automatic repeat request. 2. A concatenated Reed-Solomon, convolution encoder/decoder with automatic request and convolution interleaving for the convolution codec. 3. A dynamic rate encoder/decoder using either a concatenated Reed-Solomon, convolution scheme or a Reed-Solomon only scheme with variable length Reed-Solomon words

Efficient Algorithms and Framework for Bandwidth Allocation, Quality-of-Service Provisioning and Location Management in Mobile Wireless Computing

The fusion of computers and communications has promised to herald the age of information super-highway over high speed communication networks where the ultimate goal is to enable a multitude of users at any place, access information from anywhere and at any time. This, in a nutshell, is the goal envisioned by the Personal Communication Services (PCS) and Xerox's ubiquitous computing. In view of the remarkable growth of the mobile communication users in the last few years, the radio frequency spectrum allocated by the FCC (Federal Communications Commission) to this service is still very limited and the usable bandwidth is by far much less than the expected demand, particularly in view of the emergence of the next generation wireless multimedia applications like video-on-demand, WWW browsing, traveler information systems etc. Proper management of available spectrum is necessary not only to accommodate these high bandwidth applications, but also to alleviate problems due to sudden explosion of traffic in so called hot cells. In this dissertation, we have developed simple load balancing techniques to cope with the problem of tele-traffic overloads in one or more hot cells in the system. The objective is to ease out the high channel demand in hot cells by borrowing channels from suitable cold cells and by proper assignment (or, re-assignment) of the channels among the users. We also investigate possible ways of improving system capacity by rescheduling bandwidth in case of wireless multimedia traffic. In our proposed scheme, traffic using multiple channels releases one or more channels to increase the carried traffic or throughput in the system. Two orthogonal QoS parameters, called carried traffic and bandwidth degradation, are identified and a cost function describing the total revenue earned by the system from a bandwidth degradation and call admission policy, is formulated. A channel sharing scheme is proposed for co-existing real-time and non-real-time traffic and analyzed using a Markov modulated Poisson process (MMPP) based queueing model. The location management problem in mobile computing deals with the problem of a combined management of location updates and paging in the network, both of which consume scarce network resources like bandwidth, CPU cycles etc. An easily implementable location update scheme is developed which considers per-user mobility pattern on top of the conventional location area based approach and computes an update strategy for each user by minimizing the average location management cost. The cost optimization problem is elegantly solved using a genetic algorithm