Data envelopment analysis (DEA) is a non-parametric method for assessing relative efficiency of decision-making units (DMUs). Every single decision-maker with the use of inputs produces outputs. These decision-making units will be defined by the production possibility set. Resource allocation to DMUs is one of the concerns of managers since managers can employ the results of this process to a...

Given the need to provide users with reasonable feedback about the \costs" their network usage incurs, and the increasingly commercial nature of the Internet, we believe that the allocation of cost among users will play an important role in future networks. This paper discusses cost allocation in the context of multicast ows. The question we discuss is this: when a single data ow is shared amon...

Dynamic, heterogenous and distributively owned resource environments present unique challenges to the problems of resource representation, allocation and management. Conventional resource management methods that rely on static models of resource allocation policy and behavior fail to address these challenges. We previously argued that Matchmaking provides an elegant and robust solution to resou...

Parallel algorithms of the hypercube allocation strategies are considered in this paper. Although the sequential algorithms of various hypercube allocation strategies are easier to implement, their worst case time complexities exponentially increase as the dimension of the hypercube increases. We show that the free processors can be utilized t o perform the allocation jobs in parallel to improv...

Given the need to provide users with reasonable feedback about the \costs" their network usage incurs, and the increasingly commercial nature of the Internet, we believe that the allocation of cost among users will play an important role in future networks. This paper discusses cost allocation in the context of multicast ows. The question we discuss is this: when a single data ow is shared amon...

While for single processor and SMP machines, memory is the allocatable quantity, for machines made up of large amounts of parallel computing units, each with its own local memory, the allocatable quantity is a single computing unit. Where virtual address management is used to keep memory coherent and allow allocation of more than physical memory is actually available, virtual communication chan...

In the single vehicle routing allocation problem we have a single vehicle, together with a set of customers, and the problem is one of deciding a route for the vehicle (starting and ending at given locations) such that it visits some of the customers. Customers not visited by the vehicle can either be allocated to a customer on the vehicle route, or they can be isolated. The objective is to min...

Coordination between base stations (BSs) is a promising solution for cellular wireless systems to mitigate intercell interference, improving system fairness, and increasing capacity in the years to come. The aim of this manuscript is to propose a new distributed power allocation scheme for the downlink of distributed precoded multicell MISOOFDM systems. By treating the multicell system as a sup...

ECONOMICS OF SPECTRUM ALLOCATION IN COGNITIVE RADIO NETWORKS Gaurav S. Kasbekar Supervisor: Saswati Sarkar Cognitive radio networks (CRNs) are emerging as a promising technology for the efficient use of radio spectrum. In these networks, there are two levels of networks on each channel, primary and secondary, and secondary users can use the channel whenever the primary is not using it. Spectrum...

As described in chapter 1, computer networks must contend with a diverse variety of network applications. Given a finite supply of network resources and ever changing demands, networks need to allocate resources in a fair and efficient manner to provide the QoS these applications require. Different from single-user allocation (chapters 2 and 3), this chapter concerns the allocation of resources...