In this paper we present an approximate analysis of fork/join prim-itives with two parallel servers, limited buuers and non-zero join times where either jobs arrive according to a Poisson process (open system) or the number of jobs is limited according to the CONWIP rule (closed system). The approximation method is based on the concept of ow-equivalent servers and enables the approximate analys...

In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of an LR server is determined by two parameters—the latency and the allocated rate. Several well-known scheduling algorithms, such as Weighted Fair Queueing, VirtualClock, SelfClocked Fair Queueing, Weighted Round Robin...

Most online first person shooter (FPS) games require clients to discover game servers through a two-step process. The client initially queries a well-known master server for a list of currently registered game servers. Each game server is then probed in the order they were returned by the master server. It may take quite some time to discover playable game servers (within a tolerable round trip...

Electronic Medical Records (EMR) in academic medical centers often have additional complexity to them due to structural and organizational differences. Often the hospital operates independent of the medical school such as the physicians often work for the medical school, while the nurses and other ancillary departments work for the hospital. Such differences require special consideration when m...

We present a mathematically rigorous Quality-of-Service (QoS) metric which relates the achievable quality of service metric (QoS) for a real-time analytics service to the server energy cost of offering the service. Using a new iso-QoS evaluation methodology, we scale server resources to meet QoS targets and directly rank the servers in terms of their energy-efficiency and by extension cost of o...

Consider a Markovian system of two stations in tandem with finite intermediate buffer and two servers. The servers are heterogeneous, flexible, and more efficient when they work on their own than when they collaborate. We determine how the servers should be assigned dynamically to the stations with the goal of maximizing the system throughput. We show that the optimal policy depends on whether ...

In a large-scale adaptive mobile wireless network, long-distance message transfer can be routed by introduced mobile servers while nearby mobile units can contact each other through direct constructed communication channels. In order to achieve scalability by direct connection among mobile units and reliability sustained by mobile servers for QoS, a mixed wireless infrastructure incorporating m...

For a Markovian queueing network with two stations in tandem, finite intermediate buffer, and M flexible servers, we study how the servers should be assigned dynamically to stations in order to obtain optimal long-run average throughput. We assume that each server can work on only one job at a time, that several servers can work together on a single job, and that the travel times between statio...

Response times in large distributed systems can be reduced by exchanging jobs between idle servers and servers with pending jobs. When a pull strategy is deployed the initiative to exchange jobs is taken by the idle servers, while servers with pending jobs initiate the exchange when a push strategy is implemented. In this paper the performance of a class of rate-based pull and push strategies f...