This chapter reviews the theory of loss networks, in which calls of various types are accepted
for service provided that this can commence immediately; otherwise they are rejected. An …

In this paper we consider the problem of estimating blocking probabili ties in the multiservice
loss system via simulation, applying the static Monte Carlo method with importance …

The rapid growth of wireless services and mobile users drives a great interest in cellular
networks with a hierarchical structure. Hierarchical cellular networks (HCNs) can provide …

Cloud providers apply overbooking to increase utilization of data center resources, which is
associated with the risk of overloading cloud resources. In this paper, we study an admission …

We consider the problem of admitting sets of, possibly heterogenous, virtual machines (VMs)
with stochastic resource demands onto physical machines (PMs) in a Cloud environment …

A multiserver queuing system with recurrent input flows is considered. A fast simulation
method is proposed for evaluation of stationary loss probability. It is based on the joint use of …

Two well-known approaches to reducing complexity in large-scale communication networks
are flow and network aggregation. Flow aggregation bundles together a group of individual …

Based on a loss network model, we present an adaptive source routing scheme for a large,
hierarchically organized network. To represent the “available” capacity of a peer group …

Traditional formulation of resource access often leads to unfair blocking probabilities among
distinct classes of services in multi-rate loss networks where full sharing polices are …

We develop an efficient reduced load fixed-point technique for obtaining estimates of the
blocking probabilities in large multirate loss systems, which are commonly used to model the …