For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Routing Domain Definition for Multiclass-of-Service Networks
IEICE TRANSACTIONS on Communications
Publication Date: 1995/06/25
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Communication Networks and Service
ISDN, dynamic routing, traffic control, optimization, adaptive control,
Full Text: PDF(953KB)>>
This paper proposes two algorithms for defining a routing domain in multiclass-of-service networks. One an off-line-based method, whose objective is to optimize dynamic routing performance by using precise knowledge on the traffic levels. The algorithm of the proposed method takes into account the random nature of the traffic flow, which is not considered in the network flow approach. The proposed method inherits the conceptual simplicity of the network flow approach and remains applicable to large and complex networks. In simulation experiments, the proposed off-line-based method performs better than the method based on the network flow approach, but has a similar the computation time requirement. The other method proposed here is an on-line-based method for application to B-ISDNs, where precise traffic data is not expected to be available. In this method, the routing domain is defined adaptively according to the network performance (call-blocking probability) measured in real-time. In simulation experiments, the performance of this method is comparable to that of the off-line-based method--especially when highly efficient dynamic routing is used. This paper also derives and describes methods for approximating the implied costs for multiclass-of-service networks. The approximations are very useful not only for off-line-based routing domain definition (RDD) methods but also for other kinds of network controls or optimal network dimensioning based on the concept of revenue optimization.