Abstract: We consider queueing systems with multiple classes of customers and heterogeneous servers where customers have the flexibility of being processed by more than one server and servers possess the capability of processing more than one customer class. We provide a unified framework for the modeling and analysis of these systems under arbitrary customer and server flexibility and for a rich set of control policies that includes customer/server-specific priority schemes for server and customer selection. We use our models to generate several insights into the effect of system configuration and control policies. In particular, we examine the relationship between flexibility, control policies and throughput under varying assumptions for

Abstract--An important design issue in distributed data processing systems is to determine optimal data distribution. The problem requires a tradeoff between time and cost. For instance, quick response time conflicts with low cost. The paper addresses the data distribution problem in this conflicting environment. A formulation of the problem as a non-linear program is developed. An algorithm employing a simple search procedure is presented, which gives an optimal data distribution. An example is solved to illustrate the method.

This report presents an Advanced Real-time Ramp Metering System (ARMS), which consists of three levels of control algorithms integrated for control of freeway ramp metering systems.

Abstract not found

Distributed multimedia applications need convenient framework for their realization in a distributed computer system. This paper deals with the problem of mapping distributed multimedia applications to a distributed computer system. An approach for formalization of this problem as well as a set of abstractions, mathematical programming formulations, models and solution procedures are proposed. Distributed multimedia application is represented by one or a set of data flow graphs that specify quality of service and resource requirements of the application. Distributed computer system is represented as a relevant directed weighted graph with information about available computer and communication resources. A problem of best placement (from the point of preliminary defined cost criteria) of data flow graphs onto distributed computer system is decided. 2 CONTENTS 1. INTRODUCTION..................................................................................................5 2. DATA FLO...

Abstract—We develop a framework called DEDI based on differential equations (DE) and differential inclusions (DI) to describe the rank evolution of random network coding (RNC). The DEDI serves as a powerful numerical and analytical tool to study RNC and we demonstrate this via numerical examples as well as an alternate proof of a well known result on RNC – a multicast at rate R exists if and only if a unicast at rate R exists separately for each destination. Index Terms—Random network coding, rank evolution, differential equation, differential inclusion I.