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.
In this paper, we propose to extend the topology of Chord to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable broadcast search support. We consider routing algorithms for a bidirectional variant of Chord network and show how the resulting structure extends the search region and provides an efficient resource lookup service at a very little additional cost.
Peer-to-Peer overlays have become a popular paradigm for building distributed systems, aiming to provide resource localization and sharing in large-scale networks. To design an overlay network, the first step is to choose an overlay topology connecting all the overlay nodes. Many proposed distributed hash table schemes for peer-to-peer network are based on some traditional calculated interconnection...
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.