東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Network clustering: Algorithms, mode...

Li, Yan.

FindBook

Google Book

Amazon

博客來

Network clustering: Algorithms, modeling, and applications.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Network clustering: Algorithms, modeling, and applications./
作者:	Li, Yan.
面頁冊數:	163 p.
附註:	Source: Dissertation Abstracts International, Volume: 71-06, Section: B, page: 3766.
Contained By:	Dissertation Abstracts International71-06B.
標題:	Engineering, Computer. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3411462
ISBN:	9781124042695

Network clustering: Algorithms, modeling, and applications.
Li, Yan.

Network clustering: Algorithms, modeling, and applications. - 163 p.

Source: Dissertation Abstracts International, Volume: 71-06, Section: B, page: 3766.

Thesis (Ph.D.)--University of Connecticut, 2010.

Recent research has shown that spatial clustering features have presented in many large scale distributed networks, such as the Internet, peer-to-peer networks, and wireless sensor networks. Topologies of such networks can be partitioned into "densely" intra-connected clusters which are "sparsely" inter-connected. Understanding these clustering features could greatly facilitate various networking research areas. However, they are far from being well studied, mainly due to the lack of good network clustering algorithms. In this dissertation, we tackle the challenge of network clustering algorithm design by introducing a new clustering algorithm, SAGA, and its distributed version, SDC. We then further apply network clustering into different research areas.

ISBN: 9781124042695Subjects--Topical Terms:

1669061
Engineering, Computer.

Network clustering: Algorithms, modeling, and applications.
LDR:03734nam 2200301 4500 001 1405109
005 20111206130404.5
008 130515s2010 ||||||||||||||||| ||eng d
020 $a 9781124042695
035 $a (UMI)AAI3411462
035 $a AAI3411462
040 $a UMI $c UMI
100 1 $a Li, Yan. $3 1028952
245 1 0 $a Network clustering: Algorithms, modeling, and applications.
300 $a 163 p.
500 $a Source: Dissertation Abstracts International, Volume: 71-06, Section: B, page: 3766.
500 $a Adviser: Jun-Hong Cui.
502 $a Thesis (Ph.D.)--University of Connecticut, 2010.
520 $a Recent research has shown that spatial clustering features have presented in many large scale distributed networks, such as the Internet, peer-to-peer networks, and wireless sensor networks. Topologies of such networks can be partitioned into "densely" intra-connected clusters which are "sparsely" inter-connected. Understanding these clustering features could greatly facilitate various networking research areas. However, they are far from being well studied, mainly due to the lack of good network clustering algorithms. In this dissertation, we tackle the challenge of network clustering algorithm design by introducing a new clustering algorithm, SAGA, and its distributed version, SDC. We then further apply network clustering into different research areas.
520 $a Our work consists of three research thrusts: (1) Effective clustering algorithm design; (2) Clustering-based Internet topology modeling; (3) Scalable and efficient hierarchical p2p file sharing. In the first thrust, we address the fundamental problem of network clustering. We present a novel centralized clustering algorithm, called SACA, and prove that it can satisfy all the desired design goals. One advantage of SACA over other centralized algorithms is that it does not require global topology information. Inspired by this decentralized nature of SAGA, we develop a fully distributed algorithm, called SDC, which can be readily deployed into large-scale distributed systems. In the second thrust of this dissertation, we apply network clustering into Internet topology modeling. Clustering features are significant properties of the Internet topology, but very little research effort is devoted into the large scale clustering features, which results in the lack of realistic topology generation model. In our work, we provide comprehensive characterizations on the clustering features in the AS-level Internet topology and present a realistic topology generation model based on the characterized clustering features. We prove that our model can reproduce all the existing properties of the AS-level Internet topology. In the third thrust of our work, we utilize our distributed clustering method SDC to enhance the performance of hierarchical p2p file sharing systems. Network clustering is a common technique in hierarchical p2p systems. We develop a network clustering protocol PPDC based on SDC for PSON, a powerful p2p file sharing system proposed in our previous work. We show that a good network clustering protocol can significantly improve the scalability and efficiency of PSON. Besides network clustering, we further improve the performance of PSON with an effective load balancing mechanism.
520 $a In this dissertation, we will present these three thrusts of work in detail. We will also discuss some future directions that are closely related to our work.
590 $a School code: 0056.
650 4 $a Engineering, Computer. $3 1669061
650 4 $a Computer Science. $3 626642
690 $a 0464
690 $a 0984
710 2 $a University of Connecticut. $3 1017435
773 0 $t Dissertation Abstracts International $g 71-06B.
790 1 0 $a Cui, Jun-Hong, $e advisor
790 $a 0056
791 $a Ph.D.
792 $a 2010
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3411462