Input and output queueing nonblocking switch with feed-back loop is proposed in order to reduce the system delay. It has b head of the line (HOL)'s and b output ports feed-backed into the HOL's of feed-back loop. The cell which receives backpressure over threshold is switched and enters one of these HOL's through a feed-back loop. It provides the cell, which should wait behind the HOL of input queue until the cell in that HOL is served, with opportunity to be served immediately by vacating the HOL of the input queue. We obtain the mean system delay and consider the effect of the size of b by computer simulation. As the results, it is shown that proposed switch with appropriate size of b can reduce the system delay compared to the conventional switch.

This paper proposes a bandwidth allocation scheme which improves degradation of communication quality due to handoffs in mobile multimedia networks. In general, a multimedia call consists of several component calls. For example, a video phone call consists of a voice call and a video call. In realistic environments, each component call included in one multimedia call may have different requirements for quality-of-service (QoS) from each other, and priorities among these component calls often exist with respect to importance for communications. When the available bandwidth is not enough for a handoff call, the proposed scheme eliminates a low priority component call and defers bandwidth allocation for a component call whose delay related QoS is not strict. Moreover, in the allocation, the scheme gives priority to new calls and handoff calls over a deferred call and also performs bandwidth reallocation to eliminated component calls. By computer simulation, we evaluate the performance such as call dropping probability and show effectiveness of the proposed scheme.

The performance of a nonblocking switch with two kinds of correlated input calls is analyzed. We define two kinds of calls as the waiting call and the immediate call, and assume that the immediate call has the priority over the waiting call. If the traffic density of one kind of calls is larger than maximum throughput, the ratio of the corresponding kind of calls to the total traffic must be restrained in some range. We derive the maximum ratio of the waiting call by using two approximate methods. The effects of traffic densities and transition probabilities of two kinds of calls on the maximum ratio of the waiting call are also considered. It is shown that, if the traffic density of the immediate call is smaller than that of the waiting call, our approximate methods are useful to derive the maximum ratio of the waiting call to the total traffic.

Input and output queueing two stage ATM switch model which is effective under variable hot-spot traffic is proposed. In order to prevent the degradation of performance due to hot-spot traffic, the hot-spot route is added in which cells destined to the hot-spot port bypass. The switch applies the backpressure mode basically. When the switch judges that the hot-spot port exists, it routes cells destined there to the hot-spot route and applies the queue loss mode on them. We evaluate both the cell loss probability and the mean system delay under the nonuniform traffic with variable hot-spot port by computer simulation. As the results, it is shown that our proposed switch can achieve better switching performance than those of conventional switches under variable traffic condition.

One of the important properties of multihop network is the mean internodal distance to evaluate the transmission delay, and the connective semi-random network achieves smaller mean internodal distance than other networks. However, the results are shown only by computer simulation and no theoretical analysis is investigated. Moreover, the network connective probability of the connective semi-random network is relatively small. In this paper, we propose the restricted connective semi-random network whose network connective probability is larger than that of the conventional connective semi-random network. And we theoretically analyze the mean internodal distance and the network connective probability of these two networks. It is shown that if the restriction is loose, the mean internodal distance of our model is almost the same as that of the conventional model, whereas the network connective probability of our model is larger than that of the conventional model. Moreover, the theoretical analyzed results of the mean internodal distance agree well with the simulated results in the conventional model and our model with small restriction.