SIGMETRICS

The complexity of computer systems, networks and applications, as well as the advancements in computer technology, continue to grow at a rapid pace. Mathematical analysis, modeling and optimization have been playing, and continue to play, an important ...

In this work we point out that some common methods for estimating self-similarity parameters -- involving packet counting for the estimate of statistical moments -- are affected by distortion at the finest resolutions and quantization errors and we ...

A flow-level Markov model for fair bandwidth sharing with packet retransmissions and random flow arrivals/departures is proposed. The model accounts for retransmissions by assuming that file transfer rates are determined by the end-to-end goodputs ...

The performance of computer systems such as Web systems is measured to guarantee quality of service (QoS) or to compare difference configurations of the systems [8]. We consider the problem of whether we should measure mean response time or throughput ...

The M/G/s queueing system is the oldest and most classical example of multiserver systems. Such multiserver systems are commonplace in a wide range of applications, ranging from call centers to manufacturing systems to computer systems, because they are ...

Recently, new services have emerged which utilize the Internet as a delivery mechanism for multimedia content. With the advent of broadband accesses, more users are willing to download large volume content from servers, such as video files of TV shows. ...

Capacity optimization by optimizing transmission schedules of wireless networks has been an active area of research for at least 20 years. The challenge is that the space over which the optimization is performed is exponential in the number of links in ...

A common problem arising in network performance analysis with the stochastic network calculus is the evaluation of (min, +) convolutions. This paper presents a method to solve this problem by applying a maximal inequality to a suitable constructed ...

Join-the-Shortest-Queue (JSQ) is a very old and popular routing policy for server farms. Figure 1 shows two examples of server farm architectures employing JSQ routing. In both cases, each incoming job is immediately dispatched, via a front-end router, ...

Markovian Arrival Processes (MAPs) [9] are a general class of point processes which admits, hyper-exponential, Erlang, and Markov Modulated Poisson Processes (MMPPs) as special cases. MAPs can be easily integrated within queueing models. This makes MAPs ...

Fluid models have for some time been used to approximate stochastic networks with discrete state. These range from traditional 'heavy traffic' approximations to the recent advances in bio-chemical system models. Here we use an approximate compositional ...

Recent advances in the fields of sensor networks and mobile robotics have provided the means to place monitoring/sensing equipment in an increasingly wide variety of environments - a significant proportion of which can reasonably be expected to lack ...

We consider a flow-level model of Internet congestion control introduced by Massoulié and Roberts [2]. We assume that bandwidth is shared amongst elastic documents according to a weighted proportional fair bandwidth sharing policy. With Poisson arrivals ...

A large number of application areas involve resource allocation problems in which resources of different capabilities are used to provide service to various classes of customers at their arrival instants, otherwise the opportunity to serve the customer ...