Please use this identifier to cite or link to this item:
Title: Probabilistic models and efficient algorithms for certain large-scale distributed networks
Authors: Zeng, Jianyang
Keywords: DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
Issue Date: 2007
Source: Zeng, J. Y. (2007). Probabilistic models and efficient algorithms for certain large-scale distributed networks. Doctoral thesis, Nanyang Technological University, Singapore.
Abstract: Two common topological features have been empirically reported in real-world large-scale distributed networks, such as the Internet, Web and peer-to-peer networks. They are, namely, (a) the small-world phenomenon where any pair of nodes in the network can be connected by a short chain of intermediates, and (b) the scale-free connectivity pattern where the node degrees follow a power law distribution. Modelling these distributed networks can help understand their growth mechanisms and exploit other useful characteristics for applications. However, most existing models are far from being satisfactory in that they all depend on unrealistic assumptions, e.g., each node is supposed to know about the entire network. My research aims to develop effective models that are more suitable for constructing real-world distributed systems.
Description: 145 p.
DOI: 10.32657/10356/35731
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Theses

Files in This Item:
File Description SizeFormat 
SCE_THESES_18.pdf17.56 MBAdobe PDFThumbnail

Page view(s) 5

checked on Oct 30, 2020

Download(s) 5

checked on Oct 30, 2020

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.