We consider the maximal covering location-allocation problem with multiple servers. The objective is to maximize the population covered, subject to constraints on the number of service centers, total number of servers in all centers, and the average waiting time at each center. Each center operates as an M/M/k queuing system with variable number of servers. The total costs of establishing cen...

In this note, we show that the arguments in Rykov [9] on the optimality of a threshold routing policy when there are more than two heterogeneous servers are incomplete.

Data centers consume anywhere between 1.7% and 2.2% of the United States' power. A handful of studies focused on ways of predicting power consumption of computing platforms based on performance events counters. Most of existing power-consumption models retrieve performance counters from hardware, which offer accurate measurement of energy dissipation. Although these models were verified on seve...

To overcome the limited bandwidth of streaming servers, Content Distribution Networks (CDNs) are deployed on the edge of the Internet. A large number of such servers have to be installed to make the whole system scalable, making CDN a very expensive way to distribute media. The primary concern of this research is to find an inexpensive way to alleviate the traffic load for media streaming on th...

Studies of queuing models with resequencing of jobs to keep the order at the output in the order of arrival are reviewed. A focus on recent authors results regarding optimal jobs assignment to heterogeneous servers is presented.

The recently proposed RCube network is a cube-based server-centric data center (DCN), including two types of heterogeneous servers, called core and edge servers. Remarkably, it takes the latter as backup servers to deal with server failures thus achieve high availability. This paper first points out that suitable candidate topology DCNs for computing. Three transmission are among based on deman...

with the notion of virtual servers, peers participating in a heterogeneous, structured peer-to-peer (P2P) network may host different numbers of virtual servers, and by migrating virtual servers, peers can balance their loads proportional to their capacities. The existing and decentralized load balance algorithms designed for the heterogeneous, structured P2P networks either explicitly construct...

The Distributed Interactive Engineering Toolbox (DIET) is an Application Service Provider (ASP) platform providing remote execution of computational problems on distributed, heterogeneous resources. Traditional ASP toolkits are based on a single, centralized scheduling agent coordinating computation requests from clients with service offerings from servers. DIET is based on a hierarchy of agent...