A Performance Evaluation of an Integrated Control and OAM Information Transport Network with Distributed Database Architectures

Laurence DEMOUNEM  Hideaki ARAI  

Publication
IEICE TRANSACTIONS on Communications   Vol.E75-B   No.12   pp.1315-1326
Publication Date: 1992/12/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on Teletraffic)
Category: 
Keyword: 
control and OAM transport network,  UPT,  distributed databases,  ATM,  

Full Text: PDF(854.8KB)
>>Buy this Article


Summary: 
The intelligent network services will considerably increase the amount of Control and OAM (Operation, Administration and Maintenance) Information (Ic&o) which will be stored in a huge number of distributed databases. Therefore, the management and the organization of databases have become critical issues for securing network performance. This paper studies one of the IN applications that is likely to be an important user of the Ic&o network, namely the Universal Personal Telecommunication (UPT). UPT enables the personal mobility, based on a UPT number related to the user and not a terminal equipment. The Ic&o information of UPT is carried through an ATM based transport network. Taking two fundamental parameters into consideration, namely delay time and the number of users, and two kinds of data location probabilities, this paper studies two basic procedures for finding target data in UPT databases, i.e., chaining and broadcasting. Results show that, when the data location probability is uniform, the broad-casting mode is the faster mode but, on the other hand, the chaining mode allows a larger number of users because the disk access time is less restrictive than in the broadcasting mode. Moreover, this study shows that increasing the number of databases also increases the allowed number of users up to a specific threshold. With a Broadcast Chaining mode, a better compromise between the delay time and the number of allowed users is obtained. If the probability depends on the location of databases (the probability is conversely proportional to the square of the number of searched databases), the results show that the chaining mode is preferable from both the number of users allowed and the delay time viewpoints. Finally, the implementation aspect is discussed.