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 present a new routing theory simulating ant algorithm routing and put forward a new mobile agent (MA) migration algorithm based on probability. According to the algorithm, MA will migrate not only along the best road but also along other possible roads. In order to update the routing table, the new algorithm makes MA feed back the time of finishing the task and change the routing...
As the core of current telecommunication Networks, Softswitch system plays an important role in communication networks. However, current Softswitch system still faces some challenges. Firstly its subscriber database, i.e., HLR, is a centralized network entity which may have the problem of the single point of failure and poor scalability; Secondly, current MSC Pool strategy cannot achieve the load...
The existing load balancing technology in the content distribution network (CDN) only emphasizes even load distribution among servers, and it does not make the best of network topological information and the historical information of file accessed, so user request can not get timely response. To solve the above problem, this paper presents a load balancing a algorithm based on the Distributed binning...
In this paper, a location service algorithm using swarm intelligence techniques, called SLS has been developed to provide location service to all MANET (Mobile Ad Hoc Network) routing protocols. MANET is a network with mobile nodes without Internet like infrastructure where every mobile node acts as a router. The location service is intended to solve the existing problems in MANET due to frequent...
Load balancing is a critical issue of the efficient operation of peer-to-peer (P2P) networks. Numerous proposals exist for load balancing in P2P networks. We propose an adaptive load-balancing solution for structured P2P systems. The approach aims to balance the request and routing load of the peers under biased request workloads, We balance the routing load through item balancing and the request...
Cagra is a distributed storage system optimized for distributed rendering. Enterprise-class distributed rendering requires computers with considerable storage space and computational power. An single frame in an average 3D CG movie requires approximately 1 GB to 20 GB of input data and takes 3 to 10h to render. The large-scale computations in rendering are carried out by specialized clusters, or render...
Massive Multiuser Virtual Environments (MMVEs) and especially the idea of a ''3D Web'' as a combination of a MMVE and today's WWW currently attracts a lot of attention. The realization of such a vision on a global scale though poses severe technical challenges to the underlying network infrastructure. It is generally accepted that such a global scale scenario can only be realized in a distributed...
The publish/subscribe message-driven model is discussed in distributed compute, the existing communication model being limit using. The distributed multi-message services provider publish/subscribe system is proposed. The designed system is semantic Web-based, which matches messages in content-based. Discussed in the framework of the new system, message routing problems, message matching, and other...
Server-client mapping is one of the most frequently encountered problems in nearly all the distributed systems, but is usually solved in ad-hoc manner in favor of quick implementation. To facilitate improved design of distributed applications, this paper addresses the issue of many-to-many node mapping in the hypercube. One can imagine that there exists a set of servers containing the data and a large...
Resource retrieval is a key element for P2P networks. In this paper we focus on unstructured peer-to-peer networks and present an approach for resources retrieval called DV-Flood. This approach aims to minimize lookup and get delay. The architecture of our proposed model is organized as a several clusters connected through gateways (leader node). Each cluster is represented by a super node (leader)...
The navigation system has become one of the essential IT gadgets, especially to the drivers. In addition to the basic functionality of finding a shortest path between two nodes, recent navigation systems are required to provide extra intelligent services to the users. In this paper, we propose a Voronoi-based hybrid navigation system based on 3G wireless communication that has been commercially deployed...
Distributed hash table (DHT) based algorithms have been proposed to solve the routing issues in large-scale peer-to-peer (P2P) applications. DHT systems create an elegant peer-to-peer service model and work perfect in a homogeneous environment. Workload are evenly distributed on every participating peer and system is supposed to achieve the optimal performance. However, in the real world, the complicated...
Most research results of location services have been focused on nodes whose motions follow patterns of random waypoints. For inter-vehicular communications that happen in metropolitan areas, moving cars obviously travel on restricted directions along streets and make frequent stops over intersections. In this paper, we present intersection location service (ILS), a distributed hashing-based location...
Effective job scheduling in optical grids requires concurrent optimisation of resource and network path selection. To enable this functionality, practical anycast routing algorithms are proposed, and simulation analysis is used to compare their performance to a pseudo-optimal bound and to several heuristics.
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.