An adaptive distributed algorithm for path aggregation.

Zhang, Zhenyi.Thesis (M.Phil.)--Chinese University of Hong Kong, 2008.Includes bibliographical references (leaves 55-[58]).Abstracts in Chinese and English.Chapter 1 --- Introduction --- p.1Chapter 2 --- Problem Formulation --- p.4Chapter 3 --- Examples --- p.7Chapter 3.1 --- Examples of Undirected Graph --- p.7Chapter 3.1.1 --- Example 1: SPF Routing --- p.7Chapter 3.1.2 --- Example 2: rings --- p.7Chapter 3.1.3 --- Example 3: grid --- p.8Chapter 3.1.4 --- Example 4: cube --- p.9Chapter 3.1.5 --- Example 5: random graph X --- p.10Chapter 3.1.6 --- Example 6: random graph Y --- p.10Chapter 3.2 --- An Example for Directive Graph --- p.11Chapter 4 --- The Framework --- p.13Chapter 4.1 --- The distributed algorithm --- p.13Chapter 4.2 --- The modules --- p.14Chapter 4.3 --- Path control --- p.15Chapter 4.4 --- The forwarding module --- p.18Chapter 4.5 --- The routing module --- p.19Chapter 4.5.1 --- Non-weighted Routing (NWR) --- p.19Chapter 4.5.2 --- Weighted Routing (WR) --- p.20Chapter 4.6 --- Packet Aggregation (PKA) --- p.21Chapter 5 --- Experiments of Path Aggregation --- p.23Chapter 5.1 --- System Setup --- p.24Chapter 5.2 --- Experiment Results --- p.25Chapter 6 --- Convergence --- p.28Chapter 6.1 --- Simulation study --- p.34Chapter 6.2 --- Optimality --- p.34Chapter 6.3 --- Speed of Convergence --- p.37Chapter 7 --- The adaptive property --- p.41Chapter 7.1 --- Adapting to new links --- p.42Chapter 7.2 --- Adapting to topology changing --- p.43Chapter 7.3 --- Adapting to interference and congestion --- p.45Chapter 7.4 --- Adapting to traffic flows --- p.45Chapter 7.5 --- Adapting to capacity --- p.46Chapter 8 --- Related works --- p.48Chapter 8.1 --- Spanning Tree --- p.48Chapter 8.2 --- Minimum Equivalent Directed Graph Problem --- p.49Chapter 8.3 --- Topology Control --- p.50Chapter 8.4 --- The Relationship with our problem --- p.53Chapter 9 --- Conclusion --- p.5