Please use this identifier to cite or link to this item:
|Title:||Dynamic shortest path tree update for multiple link state decrements|
|Authors:||Xiao, B |
|Source:||GLOBECOM '04 : IEEE Global Telecommunications Conference : 29 November-3 December 2004, Dallas, Texas, p. 1163-1167 How to cite?|
|Abstract:||Previous approaches for the Shortest Path Tree (SPT) dynamic update are mainly focused on the case of one link state change. Little work has been done to the problem of deriving a new SPT based on its old one for multiple link state decrements in a network that applies link-state routing protocols. The complexity of this problem comes from that there is no accurate boundary of nodes to be updated in an updating process and that multiple decrements can be accumulated. In this paper, two dynamic algorithms (MaxR, MinD) are proposed to reduce the times for node updating. Compared with other algorithms for the SPT update of multiple edge weight decrements, our algorithms yield less number of times for node updated during the dynamic update process. Such achievement is attained by the mechanism of part nodes updating in a branch on the SPT after a particular node selection from a built node list. Simulation results are given to show our improvements.|
|Rights:||© 2004 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Appears in Collections:||Conference Paper|
Show full item record
Citations as of Apr 30, 2016
Checked on Dec 4, 2016
Checked on Dec 4, 2016
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.