We present a robust generalised queuing network algorithm as an evaluative procedure for optimising production line configurations using simulated annealing. We compare the results obtained with our algorithm to those of other studies and find some interesting similarities but also striking differences between them in the allocation of buffers, numbers of servers, and their service rates. While...

We propose a new Per Hop Behavior (PHB) for differentiated services in IP networks. In this PHB, each network subscriber (or flow) receives a bandwidth allocation proportional to the subscribed information rate. This new PHB is called "Proportional Forwarding PHB" or PF PHB. The marking mechanism at the source or ingress router and the queuing and discard behavior at core routers are clearly de...

Cloud computing is distinguished from such conventional computing paradigms as grid computing and cluster computing in that it provides a practical business model for customers to use the resources remotely. It is natural for service providers to allocate the pooled cloud resources dynamically among the differentiated customers to maximise their revenue. This paper addresses the problem of the ...

Many applications that consist of streams of data are inherently distributed. Since input stream rates and other system parameters such as the amount of available computing resources can fluctuate significantly, a stream query plan must be able to adapt to these changes. Routing tuples between operators of a distributed stream query plan is used in several data stream management systems as an a...

In the Petrol Station Replenishment Problem (PSRP) the aim is to jointly determine an allocation of petroleum products to tank truck compartments and to design delivery routes to stations. This article describes an exact algorithm for the PSRP. This algorithm was extensively tested on randomly generated data and on a real-life case arising in Eastern Quebec.

In this paper we study systems that allocate different types of scarce resources to heterogeneous allocatees based on predetermined priority rules, e.g., the U.S. deceased-donor kidney allocation system or the public housing program. We tackle the problem of estimating the wait time of an allocatee who possesses incomplete system information with regard, for example, to his relative priority, o...

In this paper we study systems that allocate different types of scarce resources to heterogeneous allocatees based on predetermined priority rules, e.g., the U.S. deceased-donor kidney allocation system or the public housing program. We tackle the problem of estimating the wait time of an allocatee who possesses incomplete system information with regard, for example, to his relative priority, o...

The paper explains the main idea of how the Estelle semantics may be reinterpreted within the queuing network model making possible a translation of Estelle into the algorithmic language of the Queuing Network Analysis Package (QNAP2). Such a translation gives access to all utilities of the package and enables the performance analysis to be integrated into the design process of Estelle specific...

QoS-Driven Adaptive Resource Allocation for Mobile Wireless Communications and Networks. (December 2006) Jia Tang, B.S. Xi’an Jiaotong University, Xi’an, China Chair of Advisory Committee: Dr. Xi Zhang Quality-of-service (QoS) guarantees will play a critically important role in future mobile wireless networks. In this dissertation, we study a set of QoS-driven resource allocation problems for m...