路由是網路上非常基本且重要的功能，藉由最短路徑路由演算法可在鏈結值為正值的網路環境中找出一組最短路徑。在本篇論文中，我們提出一分散式演算法，可在網路拓撲為任意鏈結值之動態網路環境中找到一組較佳路徑；在此種通訊環境中，鏈結及節點可能毀損或修復，而傳輸資料所造成的壅塞現象或是傳輸資料所花費的成本，也會使得鏈結值經常的變動。至目前為止，所有針對動態網路而提出之分散式路由演算法其網路拓樸之鏈結值均需為正值，這是第一個分散式演算法能適用於具有任意鏈結值的網路環境。除此之外，它能防止Bellman-Ford演算法所引發的震盪效應和迴路問題及Extended Bellman-Ford演算法無法終止的問題。

Routing is an important and basic function of a communication network. An important way to accomplish routing is via shortest-path techniques. In this thesis, we present a distributed algorithm that maintains a set of routes in a dynamic network with arbitrary link weights. In this communication environment, links and nodes can fail and recover, and link weights, representing traffic loads or link delays or communication costs, can change at arbitrary times. This is a first known distributed algorithm that operates with links of arbitrary weights (both positive and negative). In addition, it avoids the bouncing effect and the looping problem that occur in the distributed implementation of the Bellman-Ford algorithm and the terminative problem that occurs in the Extended Bellman-Ford algorithm.