Searched for: department:"Architecture"
(641 - 653 of 653)

Pages

document
Fallica, B. (author), Lu, Y. (author), Kuipers, F.A. (author), Kooij, R. (author), Van Mieghem, P. (author)
Peer-to-Peer (P2P) file sharing has become immensely popular in the Internet. Recently, there has been a growing interest in academic and commercial enviornments for live streaming using P2P technology. A number of new P2P digital television (P2PTV) applications have emerged. Such P2PTV applications are developed with proprietary technologies...
conference paper
document
Lu, Y. (author), Mol, J.D.D. (author), Kuipers, F.A. (author), Van Mieghem, P. (author)
Recently, there has been a growing interest in academic and commercial environments for Video-on-Demand (VoD) using Peer-to-Peer (P2P) technology. Unlike centralized solutions for VoD services, P2P technology lets the clients distribute video content among themselves. In this paper, we propose an analytical model for P2PVoD and we compare that...
conference paper
document
Li, C. (author), Wang, H. (author), Van Mieghem, P. (author)
The largest eigenvalue ? 1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the...
conference paper
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
Van Mieghem, P (author)
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generating function and the asymptotic law are derived. As a remarkable coincidence, this asymptotic law is precisely the same as the distribution of the cost of one “job” in...
journal article
document
Konstantinou, T. (author), Knaack, U. (author)
Refurbishing the existing building stock is an acknowledged issue in the building industry. Even though awareness has been raised, the design phase of refurbishment projects is often problematic. The decisions taken in the early stages of the design determine the final result; however, the assessment of the environmental performance only happens...
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
document
Haddadi, H. (author), Uhlig, S. (author), Moore, A. (author), Mortier, R. (author), Rio, M. (author)
Despite the large number of papers on network topology modeling and inference, there still exists ambiguity about the real nature of the Internet AS and router level topology. While recent findings have illustrated the inaccuracies in maps inferred from BGP peering and traceroute measurements, existing topology models still produce static...
journal article
document
Buob, M.O. (author), Uhlig, S. (author), Meulle, M. (author)
BGP is used today by all Autonomous Systems (AS) in the Internet. Inside each AS, iBGP sessions distribute the external routes among the routers. In large ASs, relying on a fullmesh of iBGP sessions between routers is not scalable, so route-reflection is commonly used. The scalability of route-reflection compared to an iBGP full-mesh comes at...
conference paper
document
Stuhlmacher, M. (author)
journal article
document
Fu, B. (author), Uhlig, S.P.W.G. (author)
The evaluation of dynamic Traffic Engineering (TE) algorithms is usually carried out using some specific network(s), traffic pattern(s) and traffic engineering objective(s). As the behavior of a TE algorithm is a consequence of the interactions between the network, the traffic demand and the algorithm itself, the relevance of TE may depend on...
conference paper
document
Eeekhout, M. (author)
public lecture
document
Blenn, N. (author), Doerr, C. (author), Van Kester, B. (author), Van Mieghem, P. (author)
As Online Social Networks (OSNs) become an intensive sub- ject of research for example in computer science, networking, social sci- ences etc., a growing need for valid and useful datasets is present. The time taken to crawl the network is however introducing a bias which should be minimized. Usual ways of addressing this problem are sampling...
conference paper
Searched for: department:"Architecture"
(641 - 653 of 653)

Pages