Voigt, T. 2002: Architectures for Service Differentiation in Overloaded Internet Servers. SICS Dissertation Series 30. Also as DoCS 02/119. 153 pp. Uppsala. ISBN 91-5061559-9. Web servers become overloaded when one or several server resources such as network interface, CPU and disk become overutilized. Server overload leads to low server throughput and long response times experienced by the cli...

With the rapid increase of Electric vehicle (EV) penetration, EV charging network become an important infrastructure. This paper studies configuration from a safety perspective. It is found that cascading failures may happen if one station out work and its load has to be redistributed neighboring stations. The failure model borrowed science area used in study, results show effects system parame...

This paper introduces Playa, a high-level user interface layer for composing algorithms for complex multiphysics problems out of objects from other Trilinos packages. Among other features, Playa provides very high-performance overloaded operators implemented through an expression template mechanism. In this paper, we give an overview of the central Playa objects from a user’s perspective, show ...

A new procedure for computing stationary probabilities for an overloaded Markovian model is proposed in terms of the rotated Markov chain. There are two advantages to use this procedure: i) This procedure allows us to approximate an overloaded nite model using a stable innnite Markov chain. This will make the study easier when the innnite model has a simpler solution. ii) Numerically, this proc...

In this paper, we study binary and ternary matrices that are used for CDMA applications that are injective on binary or ternary user vectors. In other words, in the absence of additive noise, the interference of overloaded CDMA can be removed completely. Some new algorithms are proposed for constructing such matrices. Also, using an information theoretic approach, we conjecture the extent to wh...

We propose a workload balancing based approach to discourage free riding in Peer-to-Peer (P2P) network. The heart of our mechanism is to migrate some shared files from the overloaded peers to the neighbored free riders automatically and transparently, which enforces free riders to offer services when altruistic peers are heavily overloaded. The implementation techniques are discussed in detail....