Asynchronous Transfer Mode (ATM) switching system is expected to handle various kinds of media (such as motion video, computer data, and voice), and traffic control becomes essential to satisfy various quality requirements and to maintain efficient utilization of system resources. Priority control is one possible solution for realizing such a traffic control. In priority control, cells from various media are scheduled for transmission with different priority according to the quality class to which they belong. In this paper, we propose a new priority control method in which cells from various media are stored in their own buffer, we call it class buffer, and priority assignments are carried out based on the number of cells in each class buffer and the delay time. The number of cells in each class buffer is maintained using the counter circuit. The delay time of the cell is checked by the timer circuit for cell group, each of which consists of cells arriving during a periodical time interval. For simulation model, we consider three kinds of traffic; video, computer data, and voice, of which quality requirements are quite different. We show performance results in terms of the cell delay and the cell loss probability in our method through simulation.

This paper proposes the GDV system, which provides a format-independent interface with which to access documents in various formats. It also proposes a new approach for document representation to be used in the GDV system. In this approach, a document is represented by a chain of objects, each of which belongs to a certain class and transforms access operations according to the class-specific transformation rule. A user's request is interpreted as a request to the uppermost object of the chain, transformed by objects in the chain successively, and executed by the lowermost object in the chain. The initial state of a document is an object chain containing an unidentified object. As the unidentified object identifies and divides itself, classification (and chain generation) proceeds step by step.

The mechanisms for executing concurrent applications proposed so far fall into one of three groups: processes, kernel-level threads, and user-level threads. Each of them is insufficient in terms of either parallelism, the flexibility to combine separately developed programs at run-time, or costs of operations such as creation, switching, and termination. A thread facility in the XERO operating system overcomes this problem and provides a uniform framework for executing concurrent applications. To achieve parallelism of threads, the flexibility to combine separately developed programs at run-time, and fast thread operations, the operating system kernel and a thread management module in a user address space manage threads cooperatively. We implemented the cooperative thread management mechanism and measured its performance to examine the effectiveness of our approach.

In case of the system identification problem, such as an echo canceller, estimated impulse response obtained by the frequency-domain adaptive filter based on the circular convolution has estimation error because the unknown system is based on the linear convolution in the time domain. In this correspondence, we consider a sufficient condition to reduce the estimation error.

This paper describes the integration of a qualitative method and a quantitative method by Bottleneck Diagnosis/Improvement Expert Systems for Synchronized queueing network (BDES-S and BIES-S). On the basis of qualitative reasoning, BDES-S can carry out parameter tuning in order to diagnose and improve bottlenecks of synchronized queueing networks. BDES-S can produce several alternative qualitative improvement plans for one bottleneck server. BIES-S can produce quantitative improvement equations for each qualitative improvement plan. Our method using BDES-S and BIES-S can integrate both quantitative and qualitative methods for parameter tuning on complicated queueing synchronized networks.

Relational query languages like SQL and QUEL require the users to understand the complex detabase structure. This is a burden on end users, especially novice end users who access the database on a casual and infrequent basis. To alleviate the need to know the logical database origanization, this paper proposes the use of a semantic data model, known as the Enhanced Entity-Relationship (EER) model, as a front-end to the relational systems. A formal, high-level Visual Knowledge Query Language (VKQL) has also been designed for this interface. This language provides for knowledge abstraction as the user communicates only domain knowledge with the system without any implication on the storage structure or search strategies. A translation algorithm is also described in this paper to translate VKQL queries to Standard SQL equivalents.

It is well known that the multiple-valued signed-digit (SD) arithmetic circuits have the attractive features of compactness and high-speed operation. However, both of these features have yet to be utilized fully. In this paper, we consider the application of a parallel-structure-based VLSI processor. A high-performance parallel-structure-based multiple-valued VLSI processor using the radix-2 SD number system is proposed. Its compactness makes the parallelism high under chip size limitations in comparison with the ordinary binary arithmetic circuits. Moreover, the speed of the single arithmetic module is very high in the SD arithmetic circuits, so that we can take advantage of the high-speed operation in the parallel-structure-based VLSI processor chip. The multiple-valued bidirectional current-mode technology is used not only in high-speed small sized arithmetic circuits, but also in reducing the number of connections in the parallel-structure-based VLSI processor. The proposed processor is specially developed for real-time digital control, where the performance is evaluated by delay time. Performance estimation using SPICE simulators shows that the delay time of proposed processor for matrix operations such as matrix multiplication is greatly reduced in comparison with a conventional binary processor.

Optical fiber cable systems are being developed in many countries for subscriber loops as the infrastructure to realize B-ISDN (Broadband Integrated Services Digital Network). The present systems are DLC (Digital Loop Carrier) systems which provide leased lines, POTS (Plain Old Telephone Services), and N-ISDN (Narrowband ISDN) services. Before FTTH (Fiber To The Home) networks can be implemented, their construction cost must be lowered to the level of the current metallic network. The FTTH network must also be easy to operate and maintain. In this paper, we describe optical fiber cables, splicing, and testing technologies used in the NTT cable networks, and introduce the technologies being developed to construct FTTH networks.

Subscriber network opticalization is the key issue for the next generation network. Fiber-optic systems have been limited to mainly big business applications, so far. Massive opticalization including home and small business customers remains the ultimate goal. Opticalization of the subscriber network needs an enormous investment and a long construction period. In order to achieve smooth evolution towards B-ISDN, the subscriber network must be effectively opticalized well in advance of full B-ISDN deployment. This paper presents the development concept of optical subscriber network. It also describes the design concept and configuration of fiber-optic subscriber systems. Deployment strategies and the developing technologies for the future subscriber network are also addressed.

Telecommunication services are accomplished by cooperative networks of widely distributed communication processes and service users. Those specifications are often modeled by a set of possible message sequences among cooperating processes and users. The distributed and cooperative nature of telecommunication services results in a wide variety of message sequences and makes it more difficult for service designers to design such telecommunication services. To mitigate the difficulty, we propose a design support system with MSRs (message sequence rules) as design knowledge. The system supports the following two design activities: (1) specification of a typical message sequence that corresponds to a service behavior in a successful case, and (2) specification of incidentally possible message sequences that involve service behaviors in successful and unsuccessful cases. For the former activity, the system interacts with designers and identifies the messages they give with MSRs to understand the context of the message sequence and suggest possible subsequent messages. For the latter activity, the system applies MSRs to the typical message sequence and reasons possible messages from/to relevant processes and users under every state to suggest incidentally possible message sequences. Accordingly, designers may be relieved of investigating a wide variety of service behaviors in successful and unsuccessful cases. The system capability is based on MSRs equivalent to reusable message sequence components. MSRs can be obtained through abstraction of implementation-dependent messages and decomposition of those sequences into temporal relations among messages. The rule acquisition method provides MSRs with the potential to generate a wide variety of message sequences. In order to verify rule applicability, we have experimentally designed three kinds of services and conducted an experimental rule application to those specifications. The experimental evaluation results indicate that applicability is fairly high.

In this paper we examine the architectural and operational design issues of a practical network management system using the Simple Network Management Protocol (SNMP) in the context of a large-scale OSI-based campus-network TAINS. Various design aspects are examined and the importance of time-management is elicited. In the proposed design, intelligent, time-synchronised agents are deployed to collect information about the network segments to which they are attached. The manager talks to the agents and gathers relevant network information. This information is used by the expert network manager, in conjunction with a network knowledge base (NKB) and a management information knowledge base (MIKB) , to reconstruct the overall network-traffic characteristic, to evaluate the status of the network and to take/suggest some action. This model is particularly useful in networks where some global control, monitoring and management is desired and installing agents on all elements, connected to the network, is impossible. The use of time labels and narrow time windows enables the manager to obtain a reasonably accurate picture of the network status. The introduction of time-labelled composite objects in the Management Information Base (MIB) provides a means of reducing the load of management-related traffic on the network. The MIKB containing a logical description of the behaviour of the managed objects defined in the MIB, drives the expert system and provides the knowledge of general nature that a human expert has about networks. The proposed MIKB concept provides a very convenient schema for building the knowledge base in an expert network management system. Further since the MIKB is MIB-specific, it can be used in network management systems for managing similar MIB's.

This paper proposes a next-generation narrow-band ISDN (N-ISDN), including a suitable network and network node architecture. The proposed N-ISDN allows every subscriber to use H0/HI-class calls as easily as present telephone calls, and could rapidly expand ISDN services to all the subscribers of a public network. The present status of ISDN is first analyzed then the need for popularization of H0/HI-call services is discussed. The proposed key technologies to popularize HO/HI services are (1) on-chip integration of ISDN switching systems, (2) distribution of small on-chip switching systems over the subscriber switching area, (3) H0-based trunk circuit networks using H0 on-chip switching systems and (4) efficient and flexible call management for 64-kb/s basic-class calls. An estimation of hardware volume of switching nodes is used to show that the proposed architecture is more economical than other possible alternatives, i.e. conventional ISDN and B-ISDN.

As the size and complexity of network increases, the distributed systems management (DSM) will be vital in order to improve the availability of network management, to reduce the complexity of network operations, and to provide the high reliability. In this paper, we (1) describe general requirements required for systems management in distributed environment, (2) introduce the basic structure of distributed network management system (DNMS) for efficient network management, and also especially illustrate the concrete design of system management application process which is an important element among them, (3) propose the connectionless CMIP to accomplish for effectively managing the distributed management system, and indicate its efficiency; this protocol is available to manage dynamically changing DSM environment, to negotiate among the managing systems, to handle the dynamic informations etc. Finally, (4) the behavior and software structure of a suggested management system during negotiation to execute the received request for implementation are presented.

This paper describes a super high definition (SHD) image processing system we have developed. The computing engine of this system is a parallel processing system with 128 processing elements called NOVI- HiPIPE. A new pipelined vector processor is introduced as a backend processor of each processing element in order to meet the great computing power required by SHD image processing. This pipelined vector processor can achieve 120 MFLOPS. The 128 pipelined vector processors installed in NOVI- HiPIPE yield a total system peak performance of 15 GFLOPS. The SHD image processing system consists of an SHD image scanner, and SHD image storage node, a full color printer, a film recorder, NOVI- HiPIPE, and a Super Frame Memory. The Super Frame Memory can display a ful color moving image sequence at a rate of 60 fps on a CRT monitor at a resolution of 2048 by 2048 pixels. Workstations, interconnected through an Ethernet, are used to control these units, and SHD image data can be easily transfered among the units. NOVI- HiPIPE has a frame memory which can display SHD still images on a color monitor, therefore, one processed frame can be directly displayed. We are developing SHD image processing algorithms and parallel processing methodologies using this system.

The main objective of this paper is to propose a new top-down subcube allocation scheme which has complete subcube recognition capability with quick response time. The proposed subcube allocation scheme, called Heuristic Subcube Allocation (HSA) strategy, is based on a heuristic and undirected graph, called Subcube (SC)-graph, whose vertices represent the free subcubes, and edge represents inter-relationships between free subcubes. It helps to reduce the response time and internal/external fragmentation. When a new subcube is released, the higher dimension subcube is generated by the cycle detection in the SC-graph, and the heuristic is used to reduce the allocation time and to maintain the dimension of the free subcube as high as possible. It is theoretically shown that the HSA strategy is not only statically optimal but also it has a complete subcube recognition capability in a dynamic environment. Extensive simulation results show that the HSA strategy improves the performance and significantly reduces the response time compared to the previously proposed schemes.

In this paper, a new description of a separable-denominator (S-D) two-dimensional (2-D) transfer matrix is proposed, and its realization is considered. Some of this problem had been considered for the transfer matrices whose elements are two-variables rational functions. We shall propose a 2-D transfer matrix whose inputs-outputs relation is represented by a ratio of two-variables polynomial matrices, and present an algorithm to obtain a 2-D state-space model from it. Next, it is shown that the description proposed in this paper is always minimally realizable. And, we shall present a method of obtaining the description proposed in this paper from a S-D 2-D rational transfer matrix.

This paper describes a method of evaluating operations effort for fiber optic subscriber loops, such as the Central Terminal/Remote Terminal (CT/RT) system, which can economically provide a variety of telecommunication services. Four system configurations with different operation procedures are evaluated by simulation. By evaluating the operating costs associated with service provisioning, it is shown that automatic distributing frames are cost effective in subscriber loops with CT/RT systems. Moreover, the most economical operation strategies for installing and extending subscriber boards are discussed in terms of facility and operations cost.

Logarithmic number systems (LNS) provide a very fast computational method. Their exceptional speed has been demonstrated in signal processing and then in computer graphics. But the precision problem of LNS in computer graphics has not been fully examined. In this paper analysis is made for the problem of LNS in picture generation, in particular for circle drawing. Theoretical error analysis is made for the circle drawing. That is, some expressions are developed for the relative error variances. Then they are examined by simulation experiments. Some comparisons are also done with floating point arithmetic with equivalent word length and dynamic range. The results show that the theory and the experiments agree reasonably well and that the logarithmic arithmetic is superior to or at least comparable to the corresponding floating point arithmetic with equivalent word length and dynamic range. Those results are also verified by visual inspections of actually drawn circles. It also shows that the conversion error (from integer to LNS), which is inherent in computer graphics with LNS, does not make too much influence on the total computational error for circle drawing. But it shows that the square-rooting makes the larger influence.

The effects of changing system parameters on job scheduling policies are studied for load balancing of multi-class jobs in a distributed computer system that consists of heterogeneous host computers connected by a single-channel communications network. A job scheduling policy decides which host should process the arriving jobs. We consider two job scheduling policies. The one is the overall optimal policy whereby jobs are scheduled so as to minimize the overall mean job response time. Tantawi and Towsley obtained the algorithm that gives the solution of the policy in the single class job environment and Kim and Kameda extended it to the multiple job class environment. The other is the individually optimal policy whereby jobs are scheduled so that every job may feel that its own expected response time is minimized. We can consider three important system parameters in a distributed computer system: the communication time of the network, the processing capacity of each node, and the job arrival rate of each node. We examine the effects of these three parameters on the two load balancing policies by numerical experiment.

Optimal static load balancing problems in open BCMP queueing networks with state-independent arrival and service rates are studied. Their examples include optimal static load balancing in distributed computer systems and static routing in communication networks. We refer to the load balancing policy of minimizing the overall mean response (or sojourn) time of a job as the overall optimal policy. We show the conditions that the solutions of the overall optimal policy satisfy and show that the policy uniquely determines the utilization of each service center, the mean delay for each class and each path class, etc., although the solution, the utilization for each class, the mean delay for all classes at each service center, etc., may not be unique. Then we give tha linear relations that characterize the set whose elements are the optimal solutions, and discuss the condition wherein the overall optimal policy has a unique solution. In parametric analysis and numerical calculation of optimal values of performance variables we must ensure whether they can be uniquely determined.