FINDING SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD

Bibliographic Details
Main Author:	Raina, Siddharth K.
Language:	English
Published:	Kent State University / OhioLINK 2006
Subjects:	Computer Science SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD
Online Access:	http://rave.ohiolink.edu/etdc/view?acc_num=kent1163803012

id	ndltd-OhioLink-oai-etd.ohiolink.edu-kent1163803012
record_format	oai_dc
spelling	ndltd-OhioLink-oai-etd.ohiolink.edu-kent11638030122021-08-03T05:36:13Z FINDING SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD Raina, Siddharth K. Computer Science SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD A communication network is often modeled as a graph and various algorithms are used to optimize its certain characteristics, solution to which bears a spanning tree. With different aspects, there are different measurements of the goodness of a spanning tree. MRCT though minimizes the average communication cost between all pair of nodes there may be large differences in the load on different links in the tree. In this thesis, our primary goal is to present and compare different heuristics for finding a spanning tree T=(V,U) such that largest edge load of T is minimized among all possible tree. In this thesis, we propose four heuristics based on well known algorithms. We run these heuristics on graphs based on well known topologies such as Waxman and Power-law. On comparing we find that Bi-partite semi matching heuristic outperforms other heuristics considered and Max-leaf tree heuristic on an average fetches worst result. 2006-11-20 English text Kent State University / OhioLINK http://rave.ohiolink.edu/etdc/view?acc_num=kent1163803012 http://rave.ohiolink.edu/etdc/view?acc_num=kent1163803012 unrestricted This thesis or dissertation is protected by copyright: all rights reserved. It may not be copied or redistributed beyond the terms of applicable copyright laws.
collection	NDLTD
language	English
sources	NDLTD
topic	Computer Science SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD
spellingShingle	Computer Science SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD Raina, Siddharth K. FINDING SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD
author	Raina, Siddharth K.
author_facet	Raina, Siddharth K.
author_sort	Raina, Siddharth K.
title	FINDING SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD
title_short	FINDING SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD
title_full	FINDING SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD
title_fullStr	FINDING SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD
title_full_unstemmed	FINDING SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD
title_sort	finding spanning tree minimizing the maximum edge load
publisher	Kent State University / OhioLINK
publishDate	2006
url	http://rave.ohiolink.edu/etdc/view?acc_num=kent1163803012
work_keys_str_mv	AT rainasiddharthk findingspanningtreeminimizingthemaximumedgeload
_version_	1719422364251324416

FINDING SPANNING TREE MINIMIZING THE MAXIMUM EDGE LOAD

Similar Items