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 will discuss the problem of placing service replicas in the cloud network to fulfil customers' demand. Such a problem hass been well studied in "Facility Location" topic; however, in this area opening a new facility is costly and its migration is an expensive decision which makes the solution static. In cloud network infrastructures, services are pieces of software that...
Compact routing schemes address the fundamental tradeoff between the memory space required to store the routing table entries and the length of the routing paths that these schemes produce. This paper introduces the first known nameindependent, leaf-initiated dynamic compact routing scheme that allows the distribution of traffic from any source to any set of leaf nodes along a multicast routing path...
Most of the existing trust models don't perform well in preventing malicious nodes from profiteering by conspiracy attack or periodic attack, and pay little attention to incentive mechanisms in the environment of Virtual Organization (VO). This paper proposes a new distributed trust mechanism in Single-core VO, which chooses the new node by Group-Choose mechanism that aggregates direct trust (Direct...
In order to improve the search efficiency of unstructured P2P network, the paper presents a routing algorithm based on multi-information integrated decision-making guidance. In the algorithm, indexing mechanism of neighbors' resource information is used to improve search probability and dynamic TTL adjustment mechanism is used to improve search efficiency. Meanwhile, indexing mechanism of routing...
The present paper addresses the efficient management of avatar states in P2P virtual environments (VEs) by building on our previously proposed Relaxed Triangulation (RT) overlay, designed to accommodate the dynamic nature of VEs by drastically reducing the maintenance cost inherent to the well-known Delaunay construct. Given that our RT overlay no longer supports greedy routing, we propose in this...
Dynamic networks require adaptive strategies for information dissemination, as the topology constantly changes. This work presents an event-based bio-inspired dissemination approach that employs ants, which correspond to mobile agents, to spread information throughout the network. An event is defined as a state transition of a node or link. A node which detects an event in its neighborhood triggers...
The development of new technologies that use peer-to-peer networks grows every day, with the object to supply the need of sharing information, resources and services of databases around the world. Among them are the peer-to-peer databases that take advantage of peer-to-peer networks to manage distributed knowledge bases, allowing the sharing of information semantically related but syntactically heterogeneous...
Opportunistic networks are an evolution of MANETs, where highly mobile nodes that have no physical route connecting them might need to communicate. In this case routes are built dynamically, as nodes act according to a store-carry-and-forward paradigm. A natural continuation of forwarding in opportunistic networks is data dissemination, which is usually performed using the publish/subscribe model...
With the advancement of wireless technologies, seamless connectivity is near to becoming possible. In this paper, we propose a novel idea to attain seamless connectivity in the presence of intermittent bandwidth availability. Critical services/applications are required to deliver without any issues every time and throughout. Intermittent bandwidth availability is one of the many hindrances and a bottleneck...
In this paper, a Self-Recovering strategy, which is able to "re-map" dynamically application tasks on a multi-core system, is presented. Based on run-time failure aware techniques, this Self-Recovering strategy guarantees seamlessly termination and delivering the expected results despite multiple node and link failures in a 2D mesh topology. It has been demonstrated, based on a statistical...
3D (or stereo) video has been a visually appealing and costly affordable technology. More sophisticated multi-view videos have also been demonstrated. Yet their remarkably increased data volume poses greater challenges to the conventional client/server streaming systems, which has already suffered from supporting 2D videos. The stringent multi-stream synchronization further complicate the system design...
Nowadays there exist many networks with dynamic characteristics (e.g. MANETs, DTNs, opportunistic networks, etc.). Our aim is thus to determine the necessary and sufficient connectivity conditions which allow the correct execution of some distributed algorithms on top of them. To this end, we use a framework proposed by Casteigts et al. [1] that exploits the evolving graphs theory, which models the...
This paper presents Flexible Routing Tables (FRT), a method for designing routing algorithms for overlay networks. FRT facilitates extending routing algorithms to reflect factors other than node identifiers. An FRT-based algorithm defines a total order on the set of all patterns of a routing table, and performs identifier-based routing according to that order. The algorithm gradually refines its routing...
Peer-to-Peer (P2P) systems have brought two serious problems for Internet Services Providers (ISPs): traffic surges and network congestion. Proxy caching for P2P traffic is an effective means of easing the burden imposed by P2P traffic on ISPs. The deployment strategy of proxy caches has a significant impact on their effect on ISPs. It has two important components: one is cache operation that is what...
In order to compensate for the shortage of existing load balancing algorithm, aiming at the “hotspot” data accessed in P2P systems, a load balancing algorithm with traffic control for heterogeneous P2P systems using mobile agent is suggested. It can prevent the congestion phenomenon produced by the sudden increase in network traffic. Theory analysis and experiment results show that the algorithm greatly...
Peer-assisted content delivery systems can provide scalable download service for popular files. For mildly popular content, however, these systems are less helpful in offloading servers as the request rate for less popular files may not enable formation of self-sustaining torrents (where the entire content of the file is available among the peers themselves). As there typically is a long tail of mildly...
Based on the concept of the flooding algorithm and its improved algorithm the search algorithm in P2P networks is proposed based on the direction. This algorithm dynamically generates a search tree taken the source point to be its root which makes the search processing along the search tree. By this algorithm the production of redundant search packets can be effectively avoided in the search process,...
We present an algorithm to assign time slots to nodes in a TDMA network that minimizes the jitter in time slot assignments. By reducing the jitter in time slots around the TDMA frame, we can provide more consistent network access and reduce the overall delay seen by an application with time-varying traffic patterns, such as normal web traffic. Our algorithm can reduce the average delay seen by all...
We consider a P2P multicast network with time- varying topology and node upload capacities. By utilizing network coding, we design a dynamic and distributed algorithm that can achieve arbitrarily close to maximum network utility while maintaining network stability. In addition, we show this algorithm can provide incentives for nodes to stay in the network and relay traffic for others even when they...
Local knowledge routing schemes based on virtual coordinates taken from the hyperbolic plane have attracted considerable interest in recent years. In this paper, we propose a new approach for seizing the power of the hyperbolic geometry. We aim at building a scalable and reliable system for creating and managing overlay networks over the Internet. The system is implemented as a peer-to-peer infrastructure...
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.