@inproceedings{79e5172879f84c4a89a02d3917aa9a9d,
title = "Efficient Update of Shortest Path Algorithms for Network Routing",
abstract = "In this paper, we present a new efficient update of shortest path algorithms for network routing, which make use of the information of the previously computed SPT. Besides efficiency, our algorithm maintain the most routing stability by making minimum changes to the topology of an existing SPT. In order to get the new SPT in the basic algorithm, we introduce a weight-change graph G∗according to original graph G. Because of the nonnegative edge in G∗, we can extend our idea about dynamic update of shortest path tree to a graph with negative edges. To the authors' knowledge, our algorithms are the most efficient algorithms known in the literature.",
keywords = "OSPF, Routing, shortest path tree",
author = "Bin Xiao and Qingfeng ZhuGe and Sha, \{Edwin H.M.\}",
note = "Publisher Copyright: {\textcopyright} (2001) by the International Society for Computers and Their Applications All rights reserved.; 14th International Conference on Parallel and Distributed Computing Systems, PDCS 2001 ; Conference date: 08-08-2001 Through 10-08-2001",
year = "2001",
language = "英语",
series = "14th International Conference on Parallel and Distributed Computing Systems 2001, PDCS 2001",
publisher = "International Society for Computers and Their Applications (ISCA)",
pages = "315--320",
editor = "Edwin Sha",
booktitle = "14th International Conference on Parallel and Distributed Computing Systems 2001, PDCS 2001",
address = "美国",
}