Spelling suggestions: "subject:"eomputer networks"" "subject:"aomputer networks""
271 |
A performance evaluation of peer-to-peer storage systemsMutombo, Deya Mwembya 14 February 2013 (has links)
This work evaluates the performance of Peer-to-Peer storage systems in structured
Peer-to-Peer (P2P) networks under the impacts of a continuous process of nodes
joining and leaving the network (Churn). Based on the Distributed Hash Tables
(DHT), the peer-to-peer systems provide the means to store data among a large and
dynamic set of participating host nodes. We consider the fact that existing solutions
do not tolerate a high Churn rate or are not really scalable in terms of number of
stored data blocks. The considered performance metrics include number of data
blocks lost, bandwidth consumption, latencies and distance of matched lookups.
We have selected Pastry, Chord and Kademlia to evaluate the e ect of inopportune
connections/disconnections in Peer-to-Peer storage systems, because these selected
P2P networks possess distinctive characteristics.
Chord is one of the rst structured P2P networks that implements Distributed
Hash Tables (DHTs). Similar to Chord, Pastry is based on a ring structure, with the
identi er space forming the ring. However, Pastry uses a di erent algorithm than
Chord to select the overlay neighbors of a peer. Kademlia is a more recent structured
P2P network, with the XOR mechanism for improving distance calculation. DHT
deployments are characterized by Churn. But if the frequency of Churn is too high,
data blocks can be lost and lookup mechanism begin to incur delays. In architectures
that employ DHTs, the choice of algorithm for data replication and maintenance can
have a signi cant impact on the performance and reliability. PAST is a persistent
Peer-to-Peer storage utility, which replicates complete les on multiple nodes, and
uses Pastry for message routing and content location.
The hypothesis is that by enhancing the Churn tolerance through building a
really e cient replication and maintenance mechanisms, it will:
i) Operate better than a peer-to-peer storage system such as PAST especially in
replica placement strategy with a fewer data transfers.
ii) Resolve le lookups with a match that is closer to the source peer, thus con-
serving bandwidth.
Our research will involve a series of simulation studies using two network simulators
OverSim and OMNeT++. The main results are:
Our approach achieves a higher data availability in presence of Churn, than
the original PAST replication strategy;
For a Churn occuring every minute our strategy loses two times less blocks
than PAST;
Our replication strategy induces an average of twice less block transfers than
PAST.
|
272 |
A multichannel computer network with local and global transceiving media.January 1985 (has links)
by Wong Po Choi. / Bibliography: leaves 47-50 / Thesis (M.Ph.)--Chinese University of Hong Kong, 1985
|
273 |
An extensible design of a load-aware virtual router monitor in user space.January 2011 (has links)
Choi, Fu Wing. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (p. 54-57). / Abstracts in English and Chinese. / Chapter 1 --- Introduction --- p.2 / Chapter 2 --- Overview --- p.5 / Chapter 2.1 --- Summary of our Router Virtualization Architecture --- p.6 / Chapter 3 --- LVRM Design --- p.9 / Chapter 3.1 --- Socket Adapter --- p.9 / Chapter 3.2 --- VR Monitor --- p.11 / Chapter 3.3 --- VRI Monitor --- p.14 / Chapter 3.4 --- VRI Adapter --- p.16 / Chapter 3.5 --- Inter-Process Communication (IPC) Queue --- p.17 / Chapter 3.6 --- LVRM Adapter for VRI --- p.17 / Chapter 3.7 --- VRI --- p.18 / Chapter 3.8 --- Interfacing Between LVRM and VRs --- p.18 / Chapter 4 --- Experiments --- p.20 / Chapter 4.1 --- Experimental Setup --- p.20 / Chapter 4.2 --- Performance Overhead of LVRM --- p.23 / Chapter 4.3 --- Core Allocation --- p.31 / Chapter 4.4 --- Load Balancing --- p.38 / Chapter 4.5 --- Scalability --- p.43 / Chapter 4.6 --- Lessons Learned --- p.47 / Chapter 5 --- Related Work --- p.50 / Chapter 6 --- Conclusions --- p.52
|
274 |
Resource allocation and throughput analysis for multi-radio multi-channel networks.January 2007 (has links)
Xu, Ceng. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2007. / Includes bibliographical references (p. 68-71). / Abstracts in English and Chinese. / Abstract --- p.i / Acknowledgement --- p.iii / Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Motivation --- p.3 / Chapter 1.2 --- Contributions --- p.5 / Chapter 1.3 --- Thesis Scope --- p.5 / Chapter 2 --- Background Study --- p.6 / Chapter 2.1 --- Wireless Mesh Networks --- p.6 / Chapter 2.1.1 --- Overview of Wireless Mesh Networks --- p.6 / Chapter 2.1.2 --- Challenges of Wireless Mesh Networks --- p.9 / Chapter 2.1.3 --- Capacity Analysis of Wireless Mesh Net- works --- p.11 / Chapter 2.2 --- Network Coding --- p.13 / Chapter 2.2.1 --- Overview of Network Coding --- p.13 / Chapter 2.2.2 --- Network Coding in Wireless Networks --- p.17 / Chapter 3 --- Throughput Analysis --- p.19 / Chapter 3.1 --- Introduction --- p.19 / Chapter 3.2 --- Preliminaries --- p.20 / Chapter 3.3 --- Proof of Theorem 3.2.1 when n = m --- p.23 / Chapter 3.4 --- Proof of Theorem 3.2.1 when n≠ m --- p.36 / Chapter 3.4.1 --- Proof of Theorem 3.2.1 when m <n --- p.36 / Chapter 3.4.2 --- Proof of Theorem 3.2.1 when m > n --- p.37 / Chapter 3.5 --- Applying network coding into multi-radio multichannel networks --- p.37 / Chapter 3.6 --- Some simulation results --- p.40 / Chapter 3.6.1 --- String Topology --- p.40 / Chapter 3.6.2 --- Grid Topology --- p.41 / Chapter 3.6.3 --- Random Topology --- p.42 / Chapter 4 --- Interface Reduction in Wireless Mesh Networks --- p.43 / Chapter 4.1 --- Introduction --- p.43 / Chapter 4.2 --- Preliminaries --- p.44 / Chapter 4.2.1 --- Assumptions and Objectives of the Algorithm --- p.44 / Chapter 4.2.2 --- Definitions --- p.45 / Chapter 4.3 --- Steps of the Algorithm and an Example --- p.49 / Chapter 4.4 --- Simulation Results and Discussions --- p.53 / Chapter 4.5 --- Generalization --- p.54 / Chapter 5 --- Conclusion --- p.66 / Bibliography --- p.68
|
275 |
Scalable content distribution in overlay networksKwan, Tin-man, Tony. January 2007 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2007. / Title proper from title frame. Also available in printed format.
|
276 |
Resource optimization and QoS for WDM optical networksWang, Kefei. January 1900 (has links)
Thesis (Ph.D.)--University of Nebraska-Lincoln, 2006. / Title from title screen (viewed Mar. 30, 2007). PDF text: vii, 83 p. : ill. (some col.) ; 0.44 Mb. UMI publication number: AAT 3225887. Includes bibliographical references. Also available in microfilm and microfiche formats.
|
277 |
Quality of service routing with path information aggregationTam, Wing-yan. January 2006 (has links)
Thesis (M. Phil.)--University of Hong Kong, 2006. / Title proper from title frame. Also available in printed format.
|
278 |
Evaluation and application of bloom filters in computer network security /Agbeko, Joseph. January 2009 (has links)
Thesis (M.S.)--Youngstown State University, 2009. / Includes bibliographical references (leaf 42). Also available via the World Wide Web in PDF format.
|
279 |
Resource discovery in large resource-sharing environments /Iamnitchi, Adriana Ioana. January 2003 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Computer Science, December 2003. / Includes bibliographical references. Also available on the Internet.
|
280 |
Traffic sensitive quality of service controllerKumar, Abhishek Anand. January 2004 (has links)
Thesis (M.S.)--Worcester Polytechnic Institute. / Keywords: delay hints; AQM; QoS Controller. Includes bibliographical references (p. 49-52).
|
Page generated in 0.0697 seconds