Searched for: department:"Architecture"
(1 - 4 of 4)
document
Doerr, C. (author), Tang, S. (author), Blenn, N. (author), Van Mieghem, P. (author)
The key feature of online social networks is the ability of users to become active, make friends and interact with those around them. Such interaction is typically perceived as critical to these platforms; therefore, a significant share of research has investigated the characteristics of social links, friendship relations, community structure,...
conference paper 2011
document
Tang, S. (author), Lu, Y. (author), Martín Hernández, J. (author), Kuipers, F.A. (author), Van Mieghem, P. (author)
In recent years, a number of commercial peer-to-peer TV (P2PTV) applications have been launched. Yet, their mechanisms and characteristics are unknown. In this paper, we study SopCast, a typical proprietary P2PTV system. Treating SopCast as a black box, we perform a set of experiments that are suitable to analyze SopCast in depth. We attempt to...
conference paper 2009
document
Van Mieghem, P. (author), Tang, S. (author)
We model the weight (e.g. delay, distance or cost) from an arbitrary node to the nearest (in weight) peer in a peer-to-peer (P2P) network. The exact probability generating function and an asymptotic analysis is presented for a random graph with i.i.d. exponential link weights. The asymptotic distribution function is a Fermi-Dirac distribution...
journal article
document
Tang, S. (author), Wang, H. (author), Van Mieghem, P. (author)
We revisit the peer selection problem of finding the most nearby peer from an initiating peer. The metrics to assess the closeness between peers are hopcount and delay, respectively. Based on a dense graph model with i.i.d regular link weight, we calculate the probability density function to reach a peer with minimum hopcount and asymptotically...
report
Searched for: department:"Architecture"
(1 - 4 of 4)