Type of Document	Thesis
Author	Ansari, Almas
Author's Email Address	almas_a@yahoo.com
URN	etd-07122004-144319
Title	Topology Aggregation for Networks with Two Additive Metrics
Degree	Master of Science
Department	Computer Science, Department of
Advisory Committee	Advisor Name Title Xin Yuan Committee Chair Lois Hawkes Committee Member Sudhir Aggarwal Committee Member
Keywords	Topology Aggregation Multiple Additive Metrics
Date of Defense	2004-07-09
Availability	unrestricted
Abstract Topology Aggregation is concerned about summarizing a network domain in a concise manner. This thesis deals with topology aggregation for networks with two additive metrics. Summarizing such a network domain is difficult for a number of reasons. First, computing paths between two nodes with two additive metrics is NP-Hard. Second, it is unclear how the quality of two paths with two additive metrics can be compared, which leads to the difficulty in determining the quality of topology aggregation schemes. In this thesis, we develop a method to evaluate the quality of aggregation schemes for networks with two additive metrics, propose to compute the full mesh representation of a domain using the limited path heuristic and demonstrate that the information carried in the full mesh representation is very close to that in the original network representation. We also develop and study a number of schemes to reduce the full mesh representation to the spanning tree based representation. The performance of the proposed schemes is studied through simulation. The results show that minimum spanning tree based schemes yield reasonable performance.
Files	Filename       Size       Approximate Download Time (Hours:Minutes:Seconds)     28.8 Modem   56K Modem   ISDN (64 Kb)   ISDN (128 Kb)   Higher-speed Access    AnsariAThesis.pdf 366.78 Kb 00:01:41 00:00:52 00:00:45 00:00:22 00:00:01