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.
One way to conserve energy in cloud data centers is to transition idle servers into a power saving state during periods of low utilization. Dynamic virtual machine (VM) consolidation (VMC) algorithms are proposed to create idle times by periodically repacking VMs on the least number of physical machines (PMs). Existing works mostly apply VMC on top of centralized, hierarchical, or ring-based system...
To reduce monitoring cost, the number of monitors to be deployed have to be minimized and the overhead of monitoring flows on the underlying network have to be reduced. In a recent work, we demonstrated, using ILP formulations, that there is a trade-off between theses two minimization objectives. However, we have shown that the trade-off could be efficiently balanced by jointly optimizing monitor...
The distributed hash tables (DHTs) exhibit several interesting properties, such as self-configuration, self-maintenance, scalability and robustness that are clearly desirable for many kinds of applications in the Internet. However, Most of DHT approaches have high resolution latency because each lookup need contact several servers in sequence, typically O(log n) hops (n is the number of peers in the...
In this paper, we explore resource discovery and scheduling issues that arise in unstructured peer-to-peer (P2P) desktop grids. We examine the use of a super-peer based approach to address these issues. The super-peers form a resource information tracking and exchange overlay to enable users to rapidly locate resources for remote execution of jobs. Resource availability information is exchanged among...
Risk is associated with almost every activity that is done in trust computing. Analyzing the Risk involved in a trust computing is important to decide whether to proceed with the transaction or not. In this paper, SMT, a trust computing mechanism is proposed for large-scale P2P systems based on risk evaluating properties. SMT incorporates two risk evaluating properties to reflect the dynamic trust...
In order to improve the dynamic and scalability of grid, the paper adopts the way fusing P2P and Grid organically, which resolves the issue that the node can join randomly and the resource-sharing can be dynamic in gird. This paper builds a resource architecture model based on P2PGrid and proposes a resource discovery algorithm fusing DHT and ant colony algorithm. This algorithm can accurately and...
The searching mechanism of Gnutella in unstructured peer-to-peer network and its working principle are introduced. By analyzing its poor scalability problem, this paper proposes an improvement strategy based on dynamic topology regularization. The simulation results show that the strategy can effectively reduce the resource consumption of network and optimize the load-balancing among peers, and then...
The notion of "superpeer" has been shown to be very effective to increase the scalability of P2P applications. For superpeer systems to work, it is critical to preserve the optimal ratio between the number of superpeers and normal peers participating in the overlay. This requires that peers change dynamically their role (i.e., from su-perpeer to normal peer and vice versa) in the presence...
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.