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.
Computational Grid is a distributed computing paradigm that provides huge computational power for the large scale distributed application. One of the challenging issues in Grid Scheduling is dynamically choosing the best resource, by exploiting the topology and load information present at the time of scheduling. Here topology represents the delay or elapse time to reach the resource. In the proposed...
To improve the efficiency and the topology mismatch problem of P2P overlay network, a new method of topology construction, CLSP2P, was introduced. The topology construction of CLSP2P not only consideration the physical location of nodes, but also consideration the semantic information of nodes: Nodes in CLSP2P were first organized as autonomous domain based on their physical location, then the nodes...
In this paper, we focus on the guarantee of inter-cell fairness in OFDM femtocell systems. To solve this problem, we formulate an optimization problem to maximize the summation of logarithmic cell capacity. Based on analytic results, we propose an enhanced modified iterative water-filling algorithm which improves inter-cell fairness compared to a modified iterative water-filling algorithm. The key...
Today's Internet is facing many problems which did not take into account in its initial design, such as routing scalability, mobility and security. No matter evolutional or revolutionary solutions that are proposed in recent years, a recognized promising direction is to separate customer network from core network and separate identification from location. In this paper, we sketch out an architecture...
As an infrastructure for data distribution, overlay networks have to feature efficient routing and adequate robustness to achieve fast and accurate data distribution in the environment with node churn. Considering that the existing overlay networks mostly focus on single optimization objective and fail to ensure routing efficiency and robustness simultaneously, a hybrid overlay network for content-based...
Many structured Peer-to-Peer-Systems (P2P) have been developed over the past years. However, most of them rely on hash-functions and thus put major restrictions on applications being implemented on top of them. In this paper we present a very detailed description of Papnet, a hash-free P2P overlay-network that supports range-queries and realizes an infinite alphanumeric address space that can be used...
This paper investigates and analyses the dynamics engendered by the engineering of self-organisation in a global Service Oriented Architecture. The effects are assessed via a resource allocation algorithm for load balancing, based on the observed behaviour of foraging honeybees. It is implemented at the application layer of a simulated server farm type system and its impact is investigated across...
Grids now-a-days comprise of individual resources. These types of grids are called dynamic grids. The centralized grid services are being gradually replaced by distributed and scalable algorithms. One such grid service is dissemination of resource information (DRI) state among the nodes. Every node in a dynamic grid has resource information associated with it. There are different methods proposed...
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.