Efficient radio resource utilization and fairness are important goals that must be achieved since wireless ATM systems support various services with different traffic characteristics such as CBR and UBR. This paper proposes a novel delay-and-queuing data size-based MAC protocol for broadband wireless ATM. The proposed MAC protocol relies on a new resource scheduling algorithm that decides the priority of channel assignment based on both the queuing delay and the queuing data size in the transmission buffer. Simulation results confirm that the proposed MAC protocol is able to provide throughput fairness and to achieve excellent throughput performance for ATM services that experience dynamic traffic fluctuations.

The feasibility of a dynamic zone configuration technique has been investigated. To make it easy to implement this technique in wireless communication systems, a simplified method for determining a suitable weight vector by using the least squares (LS) methods was developed. Simulations showed that the developed system is more effective than the present omni-directional zone system. Moreover, combining dynamic zone configuration technique with dynamic channel assignment strategy reduced blocking rate, forced call termination ratio, and required transmission power.

In this paper, a new overload control strategy is proposed for a call control processor (CCP) in the base station controller (BSC) and processor utilization is measured. The proposed overload control strategy can regulate the call attempts by adopting measured processor utilization. A function, specifically a linear interpolation function based on Inverse Transform theory is used to convert controlled predictive average load rate in a call rejection rate. Then a call admission rate is obtained from the call rejection rate. Simulation shows that the proposed algorithm yields better performance than the conventional algorithm does under the heavy transient overload status in terms of call admission rate.

The storage utilizations of existing similar key search files based on B+-tree and extensible hashing were under 70% and should be improved. A similar key search file based on extensible hashing with partial expansion and that on linear hashing with partial expansion are proposed. Computer simulations on about 230 thousand English words show that the storage utilizations of the files with 32 expansive steps are about 97%.

Many activities are being promoted for the coming multimedia age. In this paper, background information for multimedia communications is followed by an outline of joint tests in multimedia communications with some examples of the projects and applications. These trials are also explained from the aspects of project specifications, which include application classifications and details of multimedia-on-demand offerings, as well as technical issues in experimental environments which mainly include those related to ATM technology.

In future mobile radio, high-speed transmission and efficient spectrum utilization will be important. However, multipath propagation with large delay difference and cochannel interference are obstacles to the advanced mobile communication system. An adaptive antenna can suppress multipath signals and cochannel interference signals. This paper reviews basic performance of multipath fading reduction and cochannel interference suppression using the adaptive antenna. After a brief explanation of adaptive antenna concepts, we show simulation and experimental results of the fading reduction. It is pointed out that the adaptive antenna cancels multipath signals with large delay difference strongly. This feature is very important for high-speed TDMA systems. Moreover, it is shown from simulation results that the adaptive antenna improves the spectrum efficiency by suppressing the cochannel interference signals.

This paper proposes a half-chip offset QPSK (Quadrature Phase Shift Keying) modulation CDMA (Code Division Multiple Access) scheme to allow the simple differential detection while realizing a compact spectrum in nonlinear channels for wireless LAN systems. The experimental results show the proposed scheme achieves excellent Pe (probability of error) performances in ACI (adjacent channel interference) and CCI (co-channel interference) environments. Moreover, by employing time diversity and high-coding-gain FEC (Forward Error Correction), the half-chip offset QPSK-CDMA scheme realizes an improvement of 3.0 dB (in terms of Eb/No at a Pe of 105) in Rician fading environments with a Doppler frequency fD of 10 Hz and a delay spread of 40 nsec.

The throughput performance of the non-persistent carrier sense spread spectrum with overload detection (NP-CSSS/OD) protocol is analysed and compared with that of the conventional non-persistent and one-persistent carrier sense multiple access with collision detection (NP-CSMA/CD and 1P-CSMA/CD) and the one-persistent carrier sense spread spectrum with overload detection (1P-CSSS/OD) protocols. We also introduced utilization measurements and did some performance comparisons between these protocols. At high offered loads, the NP-CSSS/OD protocol is found to offer the best throughput and utilization performances amongst them.

Processors are important resources of stored program control (SPC) switching systems, and estimation of their workload level is crucial to maintaining service quality. Processor utilization is measured as processor usage per unit time, and workload level is usually estimated from measurement of this utilization during a given interval. This paper provides an approximate distribution of processor utilization of SPC switching systems, and it provides a method for designing an overload detection scheme. This method minimizes the observation interval required to keep overload detection errors below specified values. This observation interval is obtained as an optimal solution of a linear programming.

A job shop system typically seen in flexible manufacturing systems (FMS) is a system composed of a set of machines and a various kind of jobs processed with the machines. A production system of semiconductor fabrication is an example of job shop systems, which has main features of repetitive processes of one part and set-up times required for machines processing different types of parts. On the other hand, timed Petri nets are used for modelling and analyzing a wide variety of discrete event systems. There are many applications of timed Petri nets to the scheduling problems of job shop systems. The performance evaluation and steady state behaviors are studied by using the maximum cycle time of timed marked graphs. The aim of this paper is to propose a new model for production systems including repetitive processes and set-up time requirements which enables the quantitative analysis of real time system performance. In job shop systems such as a semiconductor fabrication system, it takes considerable amount of set-up time to prepare different types of chemical reactions and the model should take account of a set-up time for each machine. We focus upon the relationship between facility utilization factor and production cycle time in the steady state. In the proposed model, the minimum total set-up time can be attained. Quantitative relationship between utilization factor and production cycle time is derived by using the proposed model. A utilization factor of a system satisfying a given limit of the cycle time is evaluated, and the improvement of the utilization factor is considered. Conversely, we consider the improvement of the cycle time of a system satisfying a given limit of utilization factor.