Admission Control

In transactional systems, the objectives of quality of service regarding are often specified by Service Level Objectives (SLOs) that stipulate a response time to be achieved for a percentile of the transactions. Usually, there are different client classes with different SLOs. In this paper, we extend a technique that enforces the fulfilment of the SLOs using admission control. The admission

ABSTRACT We consider nonlinear control systems where the control and the state variables are submitted to explicit constraints. This paper has two objectives. First, for a class of nonlinear systems with constraints, an existence result of nontrivial admissible controls and some of their interesting properties are proved. Then, we investigate the problem of local controllability in a neighbourhood of an equilibrium point, while observing state and control constraints along the whole trajectory. An iterative procedure is also given, which allows one to compute the steering admissible control function. This procedure is illustrated with a classical example.

IEEE 802.16 technology has emerged as a competitive alternative to wireline broadband access solution. IEEE 802.16 can provide quality of service (QoS) guarantees for heterogeneous classes of traffic with different QoS requirements. The standard, however, leaves open the resource management and scheduling issues, which are crucial components to guarantee QoS performance. The main objective of this paper is to provide a better understanding of the missing components to ensure QoS support in IEEE 802.16 fixed broadband wireless networks (BWNs), namely scheduling and connection admission control (CAC) schemes. First, we highlight the key challenges in designing such schemes, for both point-to-multipoint (PMP) and mesh modes. Then, we survey, classify, and compare different scheduling and admission control mechanisms proposed in this work-in-progress area.

The artificial neural net development has had something of a renaissance in the last decade with an impressive range of application areas. From the viewpoint of telecommunication networks and systems, an increasing number of studies can be observed in recent literature dealing with proposed applications of neural nets in telecommunication environments, such as connection admission control in broadband networks, the control of high-speed interconnection networks, channel allocation in cellular mobile systems, adaptive routing, etc. These proposed applications largely use three main neural net classes: feed-forward nets with backpropagation learning, Hopfield feedback nets, and selforganising neural nets. In this paper, we first give an overview of neural net classes and their main properties, and then present a review of applications in telecommunication systems, where attention is devoted to numerical aspects such as the convergence property and learning speed of the proposed neural nets.

This paper focuses on an essential task of the enhanced NodeB eNodeB element in LTE architecture, the
Radio Resource Manager RRM, which aims to accept or reject requests for connection to the network
based on some constraints and ensuring optimal distribution of radio resources between Users Equipments
UEs. Its main functionalities include Admission Control AC and Packet Scheduling PS.
This paper will center mainly on the PS part of the RRM task, which performs the radio resource
allocation in both uplink and downlink directions. Several approaches and algorithms have been proposed
in the literature to address this need (allocate resources efficiently), the diversity and multitude of
algorithms is related to the factors considered for the optimal management of radio resource, specifically,
the traffic type and the QoS (Quality of Service) requested by the UE.
In this article, an art’s state of the radio resource allocation strategies and a detailed study of several
scheduling algorithms proposed for LTE (uplink and downlink) are made. Therefore, we offer our
evaluation and criticism.

Notice of Violation of IEEE Publication Principles"Towards a Unified Framework for Complexity Measurement in Aspect-Oriented Systems,"by A. Kumar, R. Kumar, P.S. Groverin the Proceedings of the 2008 International Conference on Computer Science and Software Engineering, vol.2, pp.98-103, Dec. 2008After careful and considered review of the content and authorship of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE's Publication Principles.This paper contains significant portions of original text from the paper cited below. The original text was copied without attribution (including appropriate references to the original author(s) and/or paper title) and without permission.Due to the nature of this violation, reasonable effort should be made to remove all past references to this paper, and future references should be made to the following article:"Towards a Unified Coupling Framework for Measuring Aspect-oriented Programs"by T.T. Bartolomei, A. Garcia, C. Sant'Anna, C., E. Figueiredoin the Proceedings of the 3rd International Workshop on Software Quality Assurance (Portland, Oregon, November 06 - 06, 2006). SOQUA '06. ACMAspect-oriented programming (AOP) is an emerging technique that provides a mechanism to clearly encapsulate and implement concerns that crosscut other modules. It is claimed that this technique improves code modularization and therefore reduce complexity of object-oriented programs (OOP). Most of the proposed complexity measurement frameworks and metrics for AOP are for AspectJ programming language. In this paper we have defined a generic complexity measurement framework that takes into account three, the most well known families of available AOP languages, AspectJ, CaesarJ and Hyper/J. The proposed unified framework contributes to better understanding of complexity in AOP, which in turn help to (i) define new complexity metrics whic- h permit the analysis and comparison of Java, AspectJ, CaesarJ and Hyper/J implementations, and (ii) integrating different existing measures and examine same concepts in different ways.

Abstract: This deliverable is the final resume of concepts and proposals of WP4 during the first phase of WINNER for the system description, with the aim cooperation schemes become an integral part of the WINNER system. ... Keyword list: Cooperation architecture, Common ...

While allocating the cloud's resources the most crucial task for any service provider is the fulfilment of SLA obligations, since, non-meeting of these obligations results in penalty cost that would ultimately increase the providers' cost and will also affect their customer's satisfaction level. This might further have an impact on the software services and may increase the administrative and resource management cost. The admission control mechanism can play a pivotal role in resolving this problem by acting as a guide for resource provisioning. Thus, one must make efforts for the establishment of a better admission control mechanism between SaaS and IaaS provider. The model and algorithm proposed in this paper is an effort to show the significance of admission control mechanism for a service provider during the process of resource allocation, so as to minimize SLA violation and it's after-effects. Findings of the simulation study show that the proposed model helps in the successful admission of tasks in Cloud, meeting QoS constraints defined in SLA.

This paper considers the support of real-time applications in an Integrated Services Packet Network (ISPN). We first review the characteristics of real-time applications. We observe that, contrary to the popular view that real-time applications necessarily require a fixed delay bound, some real-time applications are more flexible and can adapt to current network conditions. We then propose an ISPN architecture that supports two distinct kinds of real-time service: guaranteed service, which is the traditional form of real-time service ...

Cognitive radio (CR) technology is an innovative radio design philosophy in order to increase the spectrum utilization by exploiting the unused spectrum in dynamically changing environments. Specifically, the CR technology will allow a group of potential users (referred to as secondary users) to access available spectrum resources unused by primary users (PUs) for whom the band has been licensed. The spectrum available for secondary users (SUs) depends on PUs' activity in the licensed spectrum. In this paper, we develop a queuing analytic framework to study important performance measures experienced by SUs in a CR network. We study queuing delay and buffer statistics of SUs' packets by modeling PUs' activity as a two state Markov chain and SUs' channel quality variation as a finite state Markov chain (FSMC). In order to allocate available channels among the SUs, an opportunistic channel allocation scheme is considered. The proposed framework facilitates to design an admission controller for SUs' network in order to maintain a given quality service (QoS) requirement which is specified in the form of statistical delay guarantee.

The satisfactory electronic delivery of multimedia material not only requires a particular quality of service (QoS) level to be maintained to fulfil users' expectations; there is in addition another goal: maximizing the revenue earned for the network owner. In this paper, we designed an admission controller (AC) along with the necessary algorithms to allow an enterprise network (EN) to satisfy both of these goals. We consider the selection of both a server from several alternatives, and the selection of a delivery route, plus the reservation of resources both in the selected server and on the delivery route to achieve the two goals of guaranteed absolute QoS and revenue optimization. We simulated the AC; simulation results are provided together with explanations.