We study the statistical multiplexing performance of self-similar traffic. We consider that input streams have different QoS (Quality of Service) requirements such as loss and delay jitter. By applying the FBM (fractal Brownian motion) model, we present methods of estimating the effective bandwidth of aggregated traffic. We performed simulations to evaluate the QoS performances and the bandwidths required to satisfy them. The comparison between the estimation and the simulation confirms that the estimation could give rough data of the effective bandwidth. Finally, we analyze the bandwidth gain with priority multiplexing against non-prioritized multiplexing and suggest how to get better performance with the right configuration of QoS parameters.

A new approach for bandwidth allocation of heterogeneous regulated traffics is proposed for cases of lossless multiplexing and statistical multiplexing under the constraint of maximum delay. Minimum bandwidth required for lossless multiplexing can be expressed as 1-dimensional unconstrained-optimization problem. The corresponding optimality condition gives an optimal bandwidth and buffer requirements. This optimality condition is extended to the case of statistical multiplexing. In case of statistical multiplexing with independent, periodic on-off fluid sources, two random variables representing stochastic worst cases for the amount of traffics generated in an arbitrary time interval are introduced and these are combined optimally. This combined model guarantees the worst case bound for the regulated traffics. Using the proposed approach, bandwidth and buffer requirements of each virtual circuit are obtained simultaneously. As these values are sensitive to multiplexing environments, an effective bandwidth considering trade-off between bandwidth and buffer requirements is introduced. The proposed effective bandwidth can be matched directly with the boundary of the acceptance region, which is less sensitive to mutiplexing environments.

Cell delay variation (CDV) has been considered as an important performance measure due to the stringent timing requirement for video and multimedia services. In this paper we address the problem of CDV performance guarantee in virtual path (VP)-based ATM multiplexing. We propose a rate-based and non-work-conserving scheduling algorithm, called interleaved round robin (IRR), for serving traffic streams among VPs into the outgoing link. Through our performance analysis, the proposed scheme is capable of providing upper and lower bounds on the inter-visit time (IVT) for each VP, where the difference between the upper bound and the lower bound is simply dependent upon the number of multiplexed VPs. The distribution of VP IVT scheduled by an IRR server can also be well approximated using a random incidence technique. In addition to the VP-level CDV performance, we further examine the virtual connection (VC)-level CDV incurred within a multi-stage network through simulation study. The simulation results show that the IRR server can provide traffic regulation and smoothness at each network node. Moreover, the CDV distribution of a tagged VC is insensitive to the source traffic characteristic, node location, and the hop count traversed in the network.

The Asynchronous Transfer Mode (ATM) is expected to be the basic transmission technology for B-ISDN. Before this happens, however, it will be necessary to predict the impact of fully-deployed ATM-based networks quantitatively. This paper compares the cost-efficiency of an ATM-based network with that of an STM-based network and clarifies the applicable areas of ATM network configurations, in terms of required facilities and considering the effect of statistical multiplexing. It shows cost-effective network configurations based on different service classes and a network configuration suited to ATM. It also discusses the effect of a Synchronous Digital Hierarchy architecture for Virtual Path dimensioning.