| We consider the performance evaluation of routing and rate allocation (RRA) algorithms in multi-class rate-based networks, in particular, networks supporting the IntServ architecture. An RRA algorithm will result in a vector of carried traacs, with each element corresponding to a class. While maximising the aggregate weighted carried traac is a natural objective, it can lead to unfair operati...

Conventional aircraft generally employ mixing algorithms or lookup tables to determine control surface deflections needed to achieve moments commanded by the flight control system. Control allocation is the problem of converting desired moments into control effector commands. Next generation aircraft may have many multipurpose, redundant control surfaces, adding considerable complexity to the c...

To fully exploit the potential of a wideband CDMA-based mobile Internet computing system, an efficient algorithm is needed for judiciously performing rate allocation, so as to orchestrate and allocate bandwidth for voice services and high data rate applications. However, in existing standards (e.g., cdma2000), only a first-come-first-served equal sharing allocation algorithm is used, potentiall...

When designing control laws for systems with constraints on the tracking performance, control allocation methods can be utilized. Control allocation methods are used when there are more command inputs than controlled variables. Control allocators can be used to address surface saturation limits, structural load limits, drag reduction constraints, or actuator failures. Most transport aircraft ha...

In this paper, the efficiency of the performance of some independent units of police organization was evaluated to optimize the total used inputs and the total produced outputs of each unit. For this purpose, with regard to the efficiency and inefficiency of each unit, based on the location of the units to one another, and also due to the limitations on number and the way of transferring the fo...

We study a stochastic network that consists of a set of servers processing multiple classes of jobs. Each class of jobs requires a concurrent occupancy of several servers while being processed, and each server is shared among the job classes in a head-of-the-line processorsharing mechanism. The allocation of the service capacities is a real-time control mechanism: in each network state, the res...

In this paper, we study a queueing model of storage and transmission bandwidth allocation in computer and communication systems, so we are interested to the behavior of a network understanding a queue which contains a number infinite of items of size 1, 2, 3 and a bin of capacity C = N (N is finite). An analysis of the stability properties of the bandwidth allocation algorithm First Fit for the...

In this paper we show how a fundamental result from information theory can be used to calculate the aggregate channel capacity in the uplink of an access point or a base station. The fundamental limits for this cell capacity provide an upper bound for any practically implementable multiple-access scheme. The capacity loss due to various implementation constraints is evaluated and a method for a...