In this paper, we present an analysis of a high-speed slotted ring with a single packet buffer at each station. Assuming that distances between stations affect the network performance only through the sum of themselves (this will be called the "lumpability assumption"), we introduce a model system called the lumped model in which stations are aggregated at a single point on the ring with their relative positions preserved. At the instant when each slot visits the aggregated point of the lumped model, we build a Markov chain by recording the system state of buffers and slots. From the steady state probabilities of the Markov chain, we obtain the mean waiting time and the blocking probability of each station. It will be shown analytically and by simulation that the analysis based on the lumped model yields accurate results for various network conditions.

We study an asynchronous transfer mode (ATM) multiplexer with selective cell discarding (SCD), and propose as a new traffic parameter the ratio of high and low priority cell streams when a cell stream multiplexed is classified by the cell loss priority (CLP) field in a cell header. By having loss priority control, it is possible to increase the multiplexing gain. For performance analysis we assume that an on-of T bursty traffic is described with several traffic parameters and the proposed priority ratio, and is approximately modeled by a Markov-modulated deterministic process (MMDP). Assuming that several independent and homogeneous on-off bursty traffics with priority discrimination are multiplexed, we present an analytical procedure for the cell loss probability of each priority level in statistical cell multiplexing with loss priority control, and use the performance results for connection admission control (CAC). Also, we consider the effect of the proposed priority ratio. Although loss priority control increases the statistical multiplexing gain, it is not appropriate for the on-off bursty traffic to change the value of the high-priority ratio in order to obtain a larger multiplexing gain, since the admissible load is determined by the loss probability of low priority traffic for most cases and the values of the ratio in a certain range slightly affect it.

In this letter, we present a channel access strategy with both downward and upward (thus called both-way) overflow mechanisms, which allocates channel bandwidth dynamically to multiple heterogeneous traffics with differing intensities, bit rates and holding times. Each input traffic has its own service channel and finite waiting room and can overflow to any other channels. The threshold parameter which limits overflow is also considered, and the performance of this channel access strategy is analyzed as an M/M/S/N system with state-dependent arrival rates.

We propose a large capacity broadband packet switch architecture using multiple optical star couplers and tunable devices whose tuning range is restricted. The proposed switch has the conventional three-stage switch structure. With the use of the generalized knockout principle and tunable lasers arranged in an appropriate manner, the switch becomes an output queueing system that yields the best possible delay/throughput performance. This switch requires minimal hardware at the cost of the increased number of wavelengths.

In this paper, an efficient voice/data integrated access algorithm for future personal communication networks (PCNs) is proposed and analyzed based on an equilibrium point analysis (EPA) method. A practical wireless communication channel may be impaired by noise and multipath distortion, and thus corrupted real-time packets have to recompete immediately in order to be transmitted within the stringent delay constraint. Also, real-time traffic users have to transmit their packets irrespective of the amount of non real-time data messages so that heavy non real-time traffic does not degrade the quality of real-time traffic. In the proposed algorithm, request subslots are distributed in the beginning of every slot to reduce access delay of real-time traffic. Moreover, slots are assigned to real-time traffic first and the remaining idle slots are assigned later to non real-time traffic by using the scheme of contention separation. We analyze the throughput and delay characteristics of this system based on an EPA mothod, and validate their performances by simulations. This scheme can support different quality of services (QoSs) imposed by different services efficiently and show good quality of real-time traffic, especially voice packets, no matter how heavy non real-time traffic is.

In this paper, we study an algorithm of route optimization using the first-derivative length (FDL) path in a hybrid-switching network with movable-boundary for heterogeneous traffics, and investigate the interactions among four different classes of traffics in a time division multiplexing (TDM) network. This algorithm has some desirable properties compared with the gradient projection method or the flow deviation method. That is, it requires no initial specification of traffic flow, and the convexity of the objective function is not required. The numerical results show that the solution is close to the optimal solution and this method yields a substantial improvement in convergence time over the gradient projection method.