Sciweavers

365 search results - page 28 / 73
» Fast construction of overlay networks
Sort
View
INFOCOM
2005
IEEE
15 years 5 months ago
A fair resource allocation algorithm for peer-to-peer overlays
— Over the past few years, Peer-to-Peer (P2P) systems have become very popular for constructing overlay networks of many nodes (peers) that allow users geographically distributed...
Yannis Drougas, Vana Kalogeraki
INFOCOM
2006
IEEE
15 years 5 months ago
A Locating-First Approach for Scalable Overlay Multicast
— Recent proposals in multicast overlay construction have demonstrated the importance of exploiting underlying network topology. However, these topology-aware proposals often rel...
Mohamed Ali Kâafar, Thierry Turletti, Walid ...
ICC
2007
IEEE
123views Communications» more  ICC 2007»
15 years 6 months ago
A New ILP-Based p-Cycle Construction Algorithm without Candidate Cycle Enumeration
—The notion of p-cycle (Preconfigured Protection Cycle) allows capacity efficient schemes to be designed for fast span protection in WDM mesh networks. Conventional p-cycle const...
Bin Wu, Kwan Lawrence Yeung, King-Shan Lui, Shizho...
CCGRID
2010
IEEE
14 years 9 months ago
Dynamic Load-Balanced Multicast for Data-Intensive Applications on Clouds
Data-intensive parallel applications on clouds need to deploy large data sets from the cloud's storage facility to all compute nodes as fast as possible. Many multicast algori...
Tatsuhiro Chiba, Mathijs den Burger, Thilo Kielman...
SASO
2009
IEEE
15 years 6 months ago
Self-organized Fault-tolerant Routing in Peer-to-Peer Overlays
—In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The exi...
Wojciech Galuba, Karl Aberer, Zoran Despotovic, Wo...