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.
This paper presents a speculative Byzantine algorithm base on Zyzzyva which has high performance for applying to peer to peer (P2P). We adopt a hybrid P2P system with monitor node to improve the performance of pure P2P system.
Peer to peer (P2P) online game systems have garnered attention recently. This paper presents an online game protocol based on the lockstep protocol and the Byzantine agreement algorithm. The former prevents dishonest actions called time-cheats in a peer to peer (P2P) network. The latter disables Byzantine cheats, with actions resembling the Byzantine fault. Using this protocol, a game can be continued...
Large scale volunteer computing has been proved to be an efficient mechanism to solve the complicated problems. Specifically, in such a system, thousands of idle computers on the network are organized to finish a series of tasks dispatched by a central server. However, this computing model is vulnerable to attack from malicious peers returning incorrect results, since it is impossible to check each...
This paper proposes a P2P-based dynamic load balancing mechanism to increase the dependability of volunteer computing. The proposed mechanism is incorporated into a volunteer computing middleware, called the Berkeley Open Infrastructure for Network Computing (BOINC). The proposed mechanism provides two additional features: decentralized load balancing and proxy download. The former feature reduces...
This paper proposes a distributed and cooperative scheduling mechanism for dynamic load-balancing on a large-scale distributed computing environment. In the proposed mechanism, the scheduling processes are performed by independent distributed schedulers on individual computing resources. Decentralized mechanisms are more suitable for dynamic load-balancing of a large-scale distributed computing environment...
To realize ubiquitous computing using quite a huge number of computing resources on the Internet, this paper presents an effective computing resource search mechanism based on peer-to-peer (P2P) ad-hoc networking that finds appropriate resource providers for each resource user. The main idea of the proposed mechanism is to classify the attributes of computing resources into two groups: a static attribute...
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.