Teletraffic characteristics of a mobile packet communication network, which supports mobile Internet, were quantitatively evaluated by using a terminal migration model in which the cell dwell time possesses self-similarity. I used a migration model in which the migration speed of the terminal is determined by the density of the dwell terminals in a cell (determined from measured vehicular mobility characteristics). The transmission rates per terminal in a cell were estimated as teletraffic on the mobile packet communication networks using this migration model. I found that when there is self-similarity in the terminal cell dwell time, communicating terminals may be concentrated in the cell and restricted for an indefinite period of time to using only a narrow bandwidth.

A self-similar behavior characterizes the traffic in many real-world communication networks. This traffic is traditionally modeled as an ON/OFF discrete-time second-order self-similar random process. The self-similar processes are identified by means of a polynomially decaying trend of the autocovariance function. In this work we concentrate on two criteria to build a chaotic system able to generate self-similar trajectories. The first criterion relates self-similarity with the polynomially decaying trend of the autocovariance function. The second one relates self-similarity with the heavy-tailedness of the distributions of the sojourn times in the ON and/or OFF states. A family of discrete-time chaotic systems is then devised among the countable piecewise affine Pseudo-Markov maps. These maps can be constructed so that the quantization of their trajectories emulates traffic processes with different Hurst parameters and average load. Some simulations are reported showing how, according to the theory, the map design is able to fit those specifications.

It has been reported that IP packet traffic exhibits the self-similar nature and causes the degradation of network performance. Therefore it is crucial for the appropriate buffer design of routers and switches to predict the queueing behavior with self-similar input. It is well known that the fitting methods based on the second-order statistics of counts for the arrival process are not sufficient for predicting the performance of the queueing system with self-similar input. However recent studies have revealed that the loss probability of finite queuing system can be well approximated by the Markovian input models. This paper studies the time-scale impact on the loss probability of MMPP/D/1/K system where the MMPP is generated so as to match the variance of the self-similar process over specified time-scales. We investigate the loss probability in terms of system size, Hurst parameters and time-scales. We also compare the loss probability of resulting MMPP/D/1/K with simulation. Numerical results show that the loss probability of MMPP/D/1/K are not significantly affected by time-scale and that the loss probability is well approximated with resulting MMPP/D/1/K.

Recent studies on traffic measurement analysis in the various networks (LAN, MAN, WAN) have shown that packet traffic exhibits Self-Similarity. The packet traffic represents some behavior quite different from what it has been assumed. Some papers reported that Self-Similarity degrades the network performance, such as buffer overflow and network congestion. Thus, we need new network control scheme considering Self-Similar properties. The control scheme requires high-speed calculation method of Hurst Parameter. In this paper, we propose high-speed calculation method of Hurst Parameter based on the Variance-Time Plot method, and show its performance. Furthermore, we try to apply this method to the simple network control, in order to show effectiveness of the network control with Self-Similarity.

The cellular-communication systems of the future will be required to provide multimedia services to users moving about in a variety of ways (on foot, in automobiles etc.). Different forms of motion have different characteristics. The characterization of the different forms of motion and their effects on telecommunications traffic is important in the planning, design and operation of mobile communication networks. The characterization of the motion of various platform types (inter-city buses, recreational vehicles, freight trucks, and taxis) based on measurements using Global Positioning System is presented in this paper. The measured characteristics of motion are then used to evaluate teletraffic statistics such as cell cross-over rate and cell dwell time by overlaying hypothetical cell systems on the measured loci of vehicles. Self-similarity was discovered in the cell dwell time characteristic of the taxis.

Recent development of compact and powerful portable computers and mobile phones and proliferation of the Internet will enable mobile multimedia communications. From the viewpoint of implementing multimedia services into mobile communications, it allows us to predict that traffic characteristics of mobile networks change. For planning, designing, and operating mobile multimedia networks, it is important to investigate traffic models which take the effect of multimedia services into consideration. This paper investigates population of active users in a micro-cell and proposes a traffic model for mobile multimedia networks. This model describes a population process of active users in a micro-cell in diffusion model, and its characteristics include self-similarity and activity of mobility. We also made an evaluation of network performance by using simulation, in order to show that characteristics of the proposed traffic model have impact on planning and designing networks.

This letter proposes a diffusion model that considers both mobility and multimedia based on the user population process to examine the effects of multimedia in mobile communications. As an application example of this model, the shared bandwidth that can be used by one user in packet communications is evaluated. In this model, the user speed and variation in the number of users in a cell are interrelated with respect to mobility. By examining the shared bandwidth behavior based on multimedia teletraffic characteristics, assuming that the number of simultaneously-communicating users within a cell have self-similarity, we found that shared bandwidth and its variance are not dependent on self-similarity but that variance in the shared bandwidth is dependent on user speed.

This paper studies how the self-similarity of traffic changes through shaper (buffered leaky bucket) and switch in ATM networks by numerical experiments. Further the applicability of CAC algorithm to shaped self-similar traffic is also investigated. Numerical experiments show self-similarity of total output traffic from shapers and switch is kept while connection-wise self-similarity is broken.

We show that characteristic functions of elements of self-similar tilings can be used as scaling functions of multiresolution analysis of L2(Rn). This multiresolution analysis is a generalization of a self-affine tiling multiresolution analysis using a characteristic function of element of self-affine tiling as a scaling function. We give a method of constructing a wavelet basis which realizes such an MRA.

In this paper an algorithm of Connection Admission Control in ATM is considered. It is shown that it works under many different kinds of dependence among arrivals, including long range dependence. This point is relevant, since recent papers show that ATM traffic is characterised by self-similarity, and hence by long range dependence. An upper bound for CLR is given, without assuming any specific cell arrival process. Applications to simulated and real data (obtained by segmenting and shaping Ethernet packets) are considered. They show the goodness and the tightness of the considered upper bound.

We consider statistical multiplexing for various types of input data with different statistics in an integrated multimedia system such as ATM networks. The system is assumed to have a constant service rate and a finite buffer. The bit-rate of each data input is variable and is modeled by a fractional Brownian motion process. Under a criterion of quality of service, we obtain an acceptable region of statistical multiplexing. We introduce a new method of investigating the acceptable region of a statistical multiplexer. The results show that transmitting multitype input processes will increase the multiplexing gain.