In this paper, asymptotic estimates for the blocking probability of a call pertaining to a given
route in a large multi-rate circuit-switched network are given. Concentrating on low load and …

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 …

Two general-purpose decomposition methods to calculate the blocking probabilities of
connection-oriented networks are presented. The methods are based on either the call …

Circuit-multiplexed networks are a modern generalization of classical circuit-switched
telephone models. Circuit-multiplexed networks are distinguished by the fact that each origin …

Circuit-switched networks are often called loss networks since they are accurate models for
such networks. The computational effort required to determine the blocking performance of a …

We study a discrete-time system consisting of N independent queues sharing a common
server of fixed capacity. Each queue is fed by an on/off packet flow. Flows are iid with …