Seung-Seob PARK Norio SHIRATORI Shoichi NOGUCHI
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 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.
Masayuki KAWAMATA Yasushi IWATA Tatsuo HIGUCHI
This paper designs and evaluates highly parallel VLSI processors for real time 2-D state-space digital filters using hierarchical behavioral description language and synthesizer. The architecture of the 2-D state-space digital filtering system is a linear systolic array of homogeneous VLSI processors, each of which consists of eight processing elements (PEs) executing 1-D state-space digital filtering with multi-input and multi-output. Hierarchical behavioral description language and synthesizer are adopted to design and evaluate PE's and the VLSI processors. One 16 bit fixed-point PE executing a (4, 4)-th order 2-D state-space digital filtering is described on the basis of distributed arithmetic in about 1,200 steps by the description language and is composed of 15 K gates in terms of 2 input NAND gate. One VLSI processor which is a cascade connection of eight PEs is composed of 129 K gates and can be integrated into one 1515 [mm2] VLSI chip using 1 µm CMOS standard cell. The 2-D state-space digital filtering system composed of 128 VLSI processors at 25 MHz clock can execute a 1,0241,024 image in 1.47 [msec] and thus can be applied to real-time conventional video signal processing.
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.
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.
The optimal coding strategy for signal detection in the correlated gaussian noise is established for the distributed sensors system with essentially zero transmission rate constraint. Specifically, we are able to obtain the same performance as in the situation of no restriction on rate from each sensor terminal to the fusion center. This simple result contrasts with the previous ad hoc studies containing many unnatural assumptions such as the independence of noises contaminating received signal at each sensor. For the design of optimal coder, we can use the classical Levinson-Wiggins-Robinson fast algorithm for block Toeplitz matrix to evaluate the necessary weight vector for the maximum-likelihood detection.
Seoung Sup LEE Ha Ryoung OH June Hyoung KIM Won Ho CHUNG Myunghwan KIM
This paper presents a destributed algorithm that uses weak copy consistency to create mutual exclusion in a distributed computer system. The weak copy consistency is deduced from the uncertainty of state which occurs due to the finite and unpredictable communication delays in a distributed environment. Also the method correlates outdated state information to current state. The average number of messages to enter critical section in the algorithm is n/2 to n messages where n is the number of sites. We show that the algorithm achieves mutual exclusion and the fairness and liveness of the algorithm is proven. We study the performance of the algorithm by simulation technique.
According to the development of optical communication technologies, it is getting easier to handle new devices, such as optical fibers, semiconductor light sources, guided wave devices, and optical integrated circuits. These devices have recently given considerable impact on the optical sensing field. The optical sensing shares the optical devices and the concepts of signal processing or system configuration with the optical communication. In this paper, the advanced lightwave sensing technology is discussed, considering the relation to the advanced optical communication technology. Distributed fiber sensors and the application of coherence characteristics of semiconductor light sources are the topics to be mainly discussed. In the distributed fiber sensors, the fiber plays both a role of low-loss transmission line and a role of lengthwise deployed sensing element. According to the change of characteristics of light propagating in the fiber, distribution of various physical parameters can be measured, such as the fiber loss, temperature, and strain. Optical Time Domain Reflectometry is employed to determine the location. Another tendency in the lightwave sensing field is the use of coherence characteristics of various semiconductor light sources. Low coherent source provide a highly sensitive inertial rotation sensor, that is, interferometric fiber optic gyroscope. Another type of optical gyroscope, optical passive ring-resonator gyro, has been studied as an application of a high coherence source. Frequency tunability of the semiconductor laser, especially that of tunable DFB or DBR lasers, can provide new ways in signal processing in the sensors. Optical coherence function can be synthesized also by utilizing the tunability. In conjunction with the progress in optical communication, lightwave sensing fields are steadily increasing.
Dynamic behavior of a distributed parameter system described by the one-dimensional wave equation with a nonlinear boundary condition is examined in detail using a graphical method proposed by Witt on a digital computer. The bifurcation diagram, homoclinic orbit and one-dimensional map are obtained and examined. Results using an analog simulator are introduced and compared with that of the graphical method. The discrepancy between these results is considered, and from the comparison among the bifurcation diagrams obtained by the graphical method, it is denoted that the energy dissipation in the system considerably restrains the chaotic state in the bifurcation process.
Hyunkoo KANG Yoon UH Tasuku TAKAGI
We propose a new distributed signal (analog or digital) transmission system which has the immunity against the noisy channel. An information signal in transmitter is distributed by distributor and the distributed signal is transmitted. Received signal is reconstructed by the inverse distributor in receiver. In this system, an impulsive interference noise which disturbs the transmission signal in the channel passes decoder only, and this interference noise is distributed by the inverse distributor while the transmitted signal is reconstructed. Some appended signals make it possible to estimate the noise components which inversely distributed with the Fourier transformation as the distributor. Basing upon this principle, the transmission system will have an ability to suppress the impulsive interference, and the channel will have high noise immunity. The construction of receiver which can eliminate the impulsive noise is derived.
LOTOS is a language developed within ISO for the formal description of communication protocols and distributed systems. In LOTOS, requirements for a distributed system are called a "service specification". Each node exchanges synchronization messages to ensure the temporal ordering for the execution of events in a service specification. The actions of each node are described as a "protocol specification". This paper gives a survey for a method to derive protocol specifications from a service specification written in a LOTOS based language. In order to derive the protocol specifications, we make the syntax tree of a given service specification and give some attributes for each node in the tree. The protocol specifications are derived automatically by evaluating these attributes. The derived protocol specifications satisfy the given service specification. We also explain a LOTOS simulator for the execution of derived protocol specifications. The related works are also summarized.
Svante CARLSSON Yoshihide IGARASHI Kumiko KANAI Andrzej LINGAS Kinya MIURA Ola PETERSSON
We present schemes for disseminating information in the n-dimensional hypercube with some faulty nodes/edges. If each processor can send a message to t neighbors at each round, and if the number of faulty nodes/edges is k(kn), then this scheme will broadcast information from any source to all destinations within any consecutive n+[(k+l)/t] rounds. We also discuss the case where the number of faulty nodes is not less than n.
The groupware for new idea generation system, GUNGEN, has been developed. GUNGEN consists of a distributed and cooperative KJ method support system and an intelligent productive work card support system. The system was implemented on a network consisting of a number of personal computers. The distributed and cooperative KJ method is carried out on computers. The ideas proposed by participants are classified into several groups on the basis of similarity and then a conclusion is derived. The intelligent productive work card support system can be used as a multimedia database to refer to the previous data of the distributed and cooperative KJ method.
Koji NAKANO Toshimitsu MASUZAWA Nobuki TOKURA
A chordal ring network is a processor network on which n processors are arranged to a ring with additional chords. We study a distributed leader election algorithm on chordal ring networks and present trade-offs between the message complexity and the number of chords at each processor and between the message complexity and the length of chords as follows:For every d(1dlog* n1) there exists a chordal ring network with d chords at each processor on which the message complexity for leader election is O(n(log(d1)nlog* n)).For every d(1dlog* n1) there exists a chordal ring network with log(d1)nd1 chords at each processor on which the message complexity for leader election is O(dn).For every m(2mn/2) there exists a chordal ring network whose chords have at most length m such that the message complexity for leader election is O((n/m)log n).