Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Communications Society (2)
- Computer science (2)
- Peer-to-peer computing (2)
- Age-independent neighbor replacement (1)
- Age-weighted graph partitioning (1)
-
- Bandwidth (1)
- Computational modeling (1)
- Computer network reliability (1)
- Crawlers (1)
- Create-based method (1)
- Delay effects (1)
- Event detection (1)
- Gnutella networks (1)
- Graph theory (1)
- H infinity control (1)
- Infinite variance (1)
- Lifetime distributions (1)
- Link lifetimes (1)
- Node-isolation model (1)
- P2P systems (1)
- Partitioning algorithms (1)
- Peer lifetimes (1)
- Peer to peer computing (1)
- Probability (1)
- Renewal-process model (1)
- Residual-based measurement (1)
- Resilience (1)
- Routing (1)
- Sampling method (1)
- Sampling methods (1)
Articles 1 - 3 of 3
Full-Text Articles in OS and Networks
Mining Web-Functional Dependencies For Flexible Information Access, Saverio Perugini, Naren Ramakrishnan
Mining Web-Functional Dependencies For Flexible Information Access, Saverio Perugini, Naren Ramakrishnan
Computer Science Faculty Publications
We present an approach to enhancing information access through Web structure mining in contrast to traditional approaches involving usage mining. Specifically, we mine the hardwired hierarchical hyperlink structure of Web sites to identify patterns of term-term co-occurrences we call Web functional dependencies (FDs). Intuitively, a Web FD ‘x y’ declares that all paths through a site involving a hyperlink labeled x also contain a hyperlink labeled y. The complete set of FDs satisfied by a site help characterize (flexible and expressive) interaction paradigms supported by a site, where a paradigm is the set of explorable sequences therein. …
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Residual-Based Measurement Of Peer And Link Lifetimes In Gnutella Networks, Xiaoming Wang, Zhongmei Yao, Dmitri Loguinov
Computer Science Faculty Publications
Existing methods of measuring lifetimes in P2P systems usually rely on the so-called create-based method (CBM), which divides a given observation window into two halves and samples users "created" in the first half every Delta time units until they die or the observation period ends. Despite its frequent use, this approach has no rigorous accuracy or overhead analysis in the literature. To shed more light on its performance, we flrst derive a model for CBM and show that small window size or large Delta may lead to highly inaccurate lifetime distributions. We then show that create-based sampling exhibits an inherent …
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
On Node Isolation Under Churn In Unstructured P2p Networks With Heavy-Tailed Lifetimes, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
Previous analytical studies [12], [18] of unstructured P2P resilience have assumed exponential user lifetimes and only considered age-independent neighbor replacement. In this paper, we overcome these limitations by introducing a general node-isolation model for heavy-tailed user lifetimes and arbitrary neighbor-selection algorithms. Using this model, we analyze two age-biased neighbor-selection strategies and show that they significantly improve the residual lifetimes of chosen users, which dramatically reduces the probability of user isolation and graph partitioning compared to uniform selection of neighbors. In fact, the second strategy based on random walks on age-weighted graphs demonstrates that for lifetimes with infinite variance, the system …