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 two algorithms for broadcasting a large data set with limited loads of all nodes on a DHT-based P2P network using a de Bruijn graph. One of the broadcast algorithms is applied to de Bruijn graphs with the restricted number of nodes. We prove that this algorithm broadcasts a data set along a degree-constrained spanning tree without global knowledge of a P2P network and that...
In this paper, we propose a control method of a P2P network based on a DHT with its maximum degree 4 for routing and its diameter lceillog2 nrceil where n is the number of nodes. In previous methods, the maximum degree or the diameter is only probabilistically bounded. As the degree of a vertex is the number of the neighbor nodes, a node with a large degree suffers high load to transfer many queries...
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.