This paper describes a perspective on Personal Communicatoins Services (PCS) and technological trends. It takes into consideration rules pertaining to the use of PCS for mobile radio communication and countermeasures to cope with the huge increase in PCS subscribers. In this paper, PCS network structures, inter-regional roaming, microcell structure, radio access and channel access methods are also covered as PCS technologies. Furthermore, trends in domestic and international standards are also described. Although these technologies present many difficulties, we believe that they will be overcome and PCS services will be introduced in the near future.

This paper describes the application of a neural network to the optimal routing problem in broadband multimedia networks, where the objective is to maximize network utilization while considering the performance required for each call. In a multimedia environment, the performance required for each call is different, and an optimal path must be found whenever a call arrives. A neural network is appropriate for the computation of an optimal path, as it provides real-time solutions to difficult optimization problems. We formulated optimal routing based on the Hop field neural network model, and evaluated the basic behavior of neural networks. This evaluation confirmed the validity of the neural network formulation, which has a small computation time even if there are many nodes. This characteristic is especially suitable for a large-scale system. In addition, we performed a computer simulation of the proposed routing scheme and compared it with conventional alternate routing schemes. The results show the benefit of neural networks for the routing problem, as our scheme always balances the network load and attains high network utilization.

This paper discusses and evaluates, from the viewpoints of definition, analysis, and performance, frequency assignment schemes that enable the efficient assignment of multiple-bandwidth carriers on the transponder in SCPC/FDMA systems with demand assignment operation. The system considered handles carriers of two different bandwidths, and assigns only consecutive slots on the transponder band to broadband carriers. Three types of frequency assignment schemes are proposed, each of which incorporates one or both of two assignment concepts: (1) pre-establishment of assignment priorities on the transponder band, and (2) establishment of broadband slots to guide broadband carrier assignment. Following a definition of the schemes, equations are derived to theoretically analyze performance factors such as call loss for the narrowband and broadband carriers, and system utilization efficiency. Finally, theoretical performance calculated for various traffic and system conditions are presented and evaluated, for the purpose of comparison between the three schemes. Computer simulation results are also presented, to demonstrate the accuracy of the derived equations and to supply data for models too large for theoretical computation. Main results obtained are as follows. (1) Regardless of traffic or system conditions, the assignment scheme incorporating both assignment priorities and broadband slots shows the best performance in terms of broadband call loss and system utilization efficiency. (2) The establishment of broadband slots improves performance when the ratio of broadband traffic to the total traffic volume is high, but worsens performance when the narrowband traffic ratio is higher. (3) All aspects of performance improve with the increase of the total number of assignable slots on the transponder band.

This paper deals with the problem of assigning tasks to the processors of a multiprocessor system such that the sum of execution and communication costs is minimized. If the number of processors is two, this problem can be solved efficiently using the network flow approach pioneered by Stone. This problem is, however, known to be NP-complete in the general case, and thus intractable for systems with a large number of processors. In this paper, we propose a network flow approach for the task assignment problem in homogeneous hypercube networks, i.e., hypercube networks with functionally identical processors. The task assignment problem for an n-dimensional homogeneous hypercube network of N (=2n) processors and M tasks is first transformed into n two-terminal network flow problems, and then solved in time no worse than O(M3 log N) by applying the Goldberg-Tarjan's maximum flow algorithm on each two-terminal network flow problem.

In general, dynamic channel assignment has a better performance than fixed channel assignment in a cellular mobile communication system. However, it is complex to control the system and a lot of equipments are required in each cell when dynamic channel assignment is applied to a large service area. Therefore, it is effective to limit the size of the service area in order to correct the defects of dynamic channel assignment. So, we propose an application of dynamic channel assignment to a part of a service area when fixed channel assignment is applied to the remaining part of the area. In the system, the efficiency of channel usage in some cells sometimes becomes terribly low. The system has such a problem to be improved. We show that the rearrangement of the channel allocation is effective on the problem.

Suppose that there are terminals on two concentric circles, Cin and Cout, with Cin inside of Cout. We are given a set of nets each of which consists of a terminal on Cin and a terminal on Cout. The routing area is the annular region between the two circles. In this paper, we present an O(nk-1) time algorithm for testing whether the given net set is k-layer routable without vias, where k2 and n is the number of nets.