The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The aggregation of multiple carriers and even heterogeneous links is a well established method to boost data rates in wireless networks. At the same time, Network Coding has been proven as an efficient and robust mechanism to distribute content in mesh networks or cloud storages. In this paper, we introduce with ScalaNC a new method of heterogeneous link aggregation, which requires no changes in the...
We present a self-organizing super-peer overlay that suits the communication requirements of a Peer-to-Peer Desktop Grid system well. This overlay combines favorable properties of Chord rings and fully meshed super-peer networks, yielding benefits that include an efficient broadcast scheme and a reduced average message hop count compared to pure Chord. To this end, we introduce a distributed algorithm...
Chord has proved to be a robust and efficient self-organizing structured Peer-to-Peer overlay. In this paper, we show that with the addition of super-peers, bidirectional communications, and two novel routing improvements, Chord can safely operate in environments with firewall-protected peers at a considerably reduced end-to-end message delay. Our concept, ChordNet, is suitable for high-traffic applications...
Ring topologies are peer to peer network structures that organize the nodes in a ring. Each node knows its direct neighbors and a few other nodes but has no global view of the network. In such a network it is complicated to measure or estimate the number of participating nodes. We provide a lightweight, distributed algorithm to estimate the size of the node population. We also show how correct the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.