1-9hit |
Boseob KWON Kaoru SEZAKI Young Man KIM Hyunsoo YOON
A Time-Division Multiplexed (TDM) Hierarchical Switching System (HSS), proposed by Eng and Acampora [5], provides any size of bandwidth for a number of subscribers by allocating proper number of time-slots in a frame. In this paper, we present a binary time-slot assignment (TSA) algorithm by which a proper size of time-slots in the frame are allocated to each subscriber so as to meet its bandwidth requests. The time complexity of the proposed algorithm is O(NLlog2 L) in which N is the number of input/output links of the central switch and L is the number of time-slots allotted to each link in the frame. As the authors know, the most efficient algorithm proposed in the literature has time complexity of O(min(L, M2)min(N, M)M2), in which M is the number of subscribers that is larger than N in TDM/HSS system. To give a clear idea of relative efficiency between two algorithms, let us give a typical situation of M = L = O(N2). In this configuration our algorithm makes a significant improvement in time complexity by the order of O(M2/log2M).
Toru HASEGAWA Takashi TAKIZUKA Shingo NOMURA
It has become more important to reduce the protocol implementation costs as the functions of protocols have become more abundant. The protocol implementation tools which automatically generate a protocol program from a specification described by an FDT (Formal Description Technique) are very promising. Selecting SDL as a target FDT, we have developed an SDL-based protocol implementation tool which consists of a process scheduler and a compiler. Since the efficient SDL process execution is a key to generating the high-speed program, the scheduler is introduced. It provides the mechanism which executes SDL processes concurrently as light-weight-processes. It optimizes so that as few context switches take places as possible. The compiler converts as many kinds of SDL functions whose behaviors can be determined at compile time into programming language statements as possible. These elaborations are so successful that the tool can generate an efficient program. The OSI Transport protocol class 0 program generated by the compiler can process more than 500 packets per second on a 6MIPS workstation.
Hiroshi TOHJO Ikuo YODA Tatsuyuki KIMURA Nobuo FUJII
This paper proposes a method for constructing an interface between an operations system and a workstation (OpS-WS interface) in a telecommunications management system based on TMN. To construct this interface, an appropriate communication protocol must be selected to perform management through efficient message exchange. The human machine interface provided by the WS should specify the managed objects. The interface also needs to be implemented so as to minimize the software revisions needed when the computer or its associated window system, or both, are changed. The proposed method addresses all these requirements. GUI components for realizing the HMI function are defined as Managed Objects as are communication network resources. Therefore, the communication protocol in TMN is defined as unique and it is possible to separate the HMI Interface from the OpS. CMIP is employed as the communication protocol to provide efficient message exchange. Software components that realize the human machine interface are selected so as to satisfy functional requirements specific to telecommunications management. The managed objects (MOs) and their relationships are investigated in order to represent these components appropriately. In the proposed method, the CMIP-based OpS-WS interface allows the OpS to take the manager role and the WS take the agent role. An implementation technique for MOs is also presented. The technique enables the software that implements MO behaviour to be coded easily. A prototype is built to confirm the correct operation of the proposed OpS-WS interface, and it is shown that CMIP requires fewer message exchanges to indicate alarms on the WS than other protocols. The proposed method is also advantageous because of its flexibility. That is, the WS software can be updated with little effort when the computer or its associated window system, or both, are changed.
Hiroshi NAKAMURA Kenichi KIMURA Akihisa NAKAJIMA
To provide personal, intelligent, and multimedia services through a mobile communications network, a Mobile Service Control Point (M-SCP) was developed, which performs both the location register and service control functions. The M-SCP was constructed on a common platform to allow quick introduction of new services. Software techniques to reduce the frequency of process-switching, assign the highest priority to real-time tasks, and operate a multiple-CPU structure provide faster real-time processing. This is confirmed by computer simulation and research in the field.
Kenji SHIBATA Yutaka HIRAKAWA Akira TAKURA Tadashi OHTA
Until now, in a communication system which deals with multiple processes, system behavior has been described by a fixed number of processes. The state reachability problem for specified processes was generally deliberated within a pre-defined number of processes, and was analyzed by essentially searching for all possible behaviors. However, in a system whose number of processes is arbitrary, a given state which is not reachable in some situations which consists of a small number of processes might be reachable in another situation which consists of a larger number of processes. This article discusses the above problem, assuming that the behavior of a system is described by an arbitrary number of processes. After discussing the relationship between our model and the Petri net model, we clarify the properties between the set of reachable states and the number of processes involved in the system, and show an algorithm to obtain a sufficient number of processes for resolving the reachability problem.
This paper describes a reduction algorithm for SW method which generates test sequences for communication systems. SW method is based upon the Finite State Machine (FSM). SW method uses a set of characterizing sequences and a state transition checking approach. This paper concentrates the characteristics of the SW sequences, and proposes the new derivation algorithm of characterizing sequences. Furthermore, Chinese Postman Tour and Extended Chinese Postman Tour is proposed to reduce redundancy of the SW sequences. This paper also presents an evaluation of this method in terms of an upper bound of the sequence length and generated test sequence length. The evaluation shows that the algorithm dramatically reduces the sequence length of the original method.
Yasushi WAKAHARA Atsushi ITO Eiji UTSUNOMIYA Fumio NITTA
The purpose of this paper is to propose a technique to simplify the communications software descriptions written in a procedural language in order to enhance their comprehensibility. Although such a technique was not much studied and discussed in the past, this technique is important to realize high productivity and high quality of the communications software by reducing the complexity of the software description. This paper firstly systematically presents various simplification methods with their principles for the descriptions of the communications software from the viewpoints of their layout, syntactical structures etc. Then, it describes a simplification support system based on these principles for the software specifications written in SDL. Lastly, this paper demonstrates the usefulness and effectiveness of the proposed simplification technique by analyzing the evaluation results of the simplification system.
An integrated platform INTEGRAL has been developed for developing large complex communication software systems. At the heart of INTEGRAL, a pair of graphical and textual specification languages, DISCOL (DIStributed Communication-Oriented Language), has been developed based on Petri nets. Around DISCOL, a wide variety of design and analysis tools have been integrated in coherent manner so that a seamless support from design to verification and testing are made available along with software life-cycle. The platform has been applied to the development of a PBX simulator named UICPBX. In the development, some real communication services have been fully specified with DISCOL. Such experiences have revealed the effectiveness of the proposed techniques.
Hikaru YAGI Masanobu FUJIOKA Yasushi WAKAHARA
In this paper, the software structure for telecommunication user support are discussed, and it is proposed to apply knowledge processing technology to the software. Capabilities of telecommunications networks are becoming quite complicated, and the number of service items and parameters which have to be selected and memorized will become too large for telecommunications end users to make full use of the network capabilities. As such, more effort should be focused on assisting telecommunications end users to use the network and providing user friendly human interfaces of the network. However, this kind of software has additional type of requirements other than those for protocol handling software and call control software, and the realization of such support software has not yet been fully studied. To realize such support software, this paper stressed the realization of the user-system interface. Especially identified in this paper are meaning-based interpretation of user inputs to permit the handling of synonyms and multivocations, and a method to access the database in the support system without consideration of its data schema. To satisfy these objectives, this paper has proposed that the application data should be represented in both a character string and a meaning representation, and that the thesauruses should have the attribute-value relation. In line with these studies, an experimental system called CAPRIS (CAlling PRocedure Instruction System) was developed. It is used to assist the calling party in a telecommunications network to find an appropriate contact point depending on the purpose of the communication. Implementation of CAPRIS is completed and it was confirmed that all the functions described in this paper were actually realized. Some functional experiments were performed on CAPRIS, and the system was concluded to realize satisfactory user-friendliness.