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.
Effectiveness and Issues of Rerouting Algorithms for QoS Networks
Takeshi IKENAGA Kenji KAWAHARA Yuji OIE
IEICE TRANSACTIONS on Communications
Publication Date: 2001/06/01
Print ISSN: 0916-8516
Type of Manuscript: Special Section PAPER (Special Issue on New Developments on QoS Technologies for Information Networks)
routing, QoS guarantee, rerouting, performance evaluation,
Full Text: PDF(488.3KB)>>
In QoS networks, routing algorithms for QoS traffic have to provide the transmission path satisfying its QoS requirement while achieving high utilization of network resources. Therefore, server-based QoS routing algorithms would be more effective than distributed routing ones which are very common on the Internet. Furthermore, we believe that rerouting function enhances the advantage of their algorithms in which an already accepted flow with established path is replaced on some other path in order to accept newly arriving transmission request if it can not be accepted without doing so. Thus in this paper, we will propose a rerouting algorithm with the server-based QoS routing and evaluate its performance in terms of the blocking probability by computer simulation. In addition, we will investigate the impact of the amount of traffic with high-priority on the performance in some network topologies. Through some simulation results, we also discuss some issues arising in improving the effectiveness of rerouting.