For enterprise-wide and cross-enterprise workflow (WF) applications, the load of the WF servers and the amount of communication in the subnets may become a bottleneck. This paper shows how a distributed WF control can be realized in a way that the load of the components at run time is minimized. For that purpose, the control of a WF instance may migrate from one WF server to another. The WF ser...

Achieving high performance in many multi-server systems (e.g., web hosting center, cloud) requires finding a good assignment of worker threads to servers and also effectively allocating each server’s resources its assigned threads. The allocation components this problem have been studied extensively but largely separately the literature. In paper, we introduce <italic xmlns:mml="http://www.w3.o...

Workflow management systems (WfMS) offer a promising approach for realizing process-oriented information systems. Central WfMS, with a single server controlling all workflow (WF) instances, however, may become overloaded very soon. In the literature, therefore, many approaches suggest using a multi-server WfMS with distributed WF control. In such a distributed WfMS, the concrete WF server for t...

We study an online assignment problem where the offline servers have capacities, and the objective is to obtain a maximum-weight assignment of requests that arrive online. The weight of edges incident to any server can be at most the server capacity. Our problem is related to the adwords problem, where the assignment to a server is allowed to exceed its capacity. In many applications, however, ...

We study the dynamic assignment of cross-trained servers to stations in understaffed lines with finite buffers. Our objective is to maximize the production rate. We identify optimal server assignment policies for systems with three stations, two servers, different flexibility structures, and either deterministic service times and arbitrary buffers or exponential service times and small buffers....

Consider a tandem queueing network with an infinite supply of jobs in front of the first station, infinite room for completed jobs after the last station, finite buffers between stations, and a number of flexible servers who are subject to failures. We study the dynamic assignment of servers to stations with the goal of maximizing the long-run average throughput. Our main conclusion is that the...

Assignment problem in content distribution networks (CDN) is unsplittable hard-capacitated facility location problem (UHCFLP) because of underlying anycast routing protocol. We extend assignment problem in CDN to multidimensional facility location problem (MFLP). With our devised algorithm, assignment cost considers CPU utilization parameter along with request size and distance between client a...

A time-bound hierarchical key assignment scheme is a cryptographic key assignment scheme that organizes and encrypts the resources, according to the hierarchical tree relations and the time constraint, such that only authorized users can efficiently access the resources. This paper proposes a practical time-bound key assignment scheme, which is efficient and is proved secure. We, based on the t...