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.
Session initiation protocol has been widely deployed to enable multimedia communication. To guarantee service reliability and scalability, service providers usually deploy SIP server farms. In this paper, we present a reliable and scalable DHT-based SIP server farm. In the proposed server farm, one-hop DHT is adopted and a new SIP event package called SIEP (server information event package) is designed...
In this paper, we address the fundamental problem of forwarding table optimization in mobile ad hoc networks and we propose a new multicast tree aggregation mechanism based on the uniqueness property of prime numbers. Instead of creating, for any new session, a new entry in the routing table, our mechanism allocates a unique identity to each session in the multicast shared tree and ensures the delivery...
Grids are emerging as a novel approach of employing distributed computational and storage resources to solve large-scale problems in science, engineering, and commerce. Distributed hash table (DHT) middleware overlay has been applied to grids as a middleware for providing scalable multi-resource discovery. However, direct DHT overlay adoption breaks the physical locality relationship between nodes,...
The provision of innovating multimedia services is a high priority for service providers. Due to the the high traffic volume characteristics of multimedia content, decentralised services are a desired solution for multimedia scenarios. Based on the ongoing work of the IETF P2PSIP WG this paper defines a simple way to interconnect different domains using on peer-to-peer technology. The objective is...
In most DHTs proposed so far, all nodes are assumed to be homogeneous, and all messages are routed using a common algorithm. In practice, however, nodes in large-scale systems might be heterogeneous with respect to their capabilities, reputations, affiliations of administrative domains, and so on, which consequently makes it preferable to distinguish the heterogeneity of participant nodes. To achieve...
Peer-to-Peer (P2P) web caching has been a hot research topic in recent years as it can create scalable and robust designs for decentralized Internet-scale applications. However, many P2P web caching systems suffer expensive overheads such as lookup and publish messages, and lack of locality awareness. In this paper we present the development of a locality aware P2P cache system to overcome these limitations...
File consistency maintenance in P2P systems is a technique for maintaining consistency between files and their replicas. Most traditional consistency maintenance methods depend on either message spreading or structure for update propagation by pushing. Message spreading generates high overhead due to redundant messages, and cannot guarantee that every replica node receives an update. Structure-based...
In this paper, Wiki technology proved to be an appropriate tool for sharing global knowledge, as it provides an easy way to contribute and consume information. The way wikis are used, e.g. consuming and contributing information, naturally matches the peer-to-peer (p2p) paradigm, which inherently follows the structure of its distributed users. Compared to client-server solutions, it has significantly...
In peer-to-peer file sharing systems, file replication and consistency maintenance are widely used techniques for high system performance. Despite significant interdependencies between them, these two issues are typically addressed separately. Most file replication methods rigidly specify replica nodes, leading to low replica utilization, unnecessary replicas and hence extra consistency maintenance...
Distributed hash tables (DHTs) often maintain additional routing information regarding each node's surrounding neighbors within a network overlay. Sequential neighbors play a critical role in network recovery, providing alternative routes thus allowing more flexible and robust routing around a overlay. This paper details our analysis of a existing DHT routing protocol under continuously dynamic network...
We present a dynamic self-organizing design for a server cluster that dynamically allocates jobs to servers in a server cluster, while maintaining certain QoS objectives, mainly a guaranteed maximum response time. Our design is based upon providing autonomy for each node in the cluster by having the node maintain only partial information about the system and having a mechanism for each node to process...
Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to classical distributed hash tables (DHTs) in which neighbor replacement occurs not only when current users die, but also when new user arrive into the system, and where replacement choices are often restricted to the successor of...
Grid system has facilitated large scale, flexible, distributed, secure and coordinated resource sharing. It aims to make full use of the network resources and build a harmonious collaborative community. However, resource management and quick resource location are still urgent problems for grid systems, especially under large, dynamic environment. This paper presents SIKA a grid-based overlay network...
Excellent P2P network infrastructure should support scalability and efficient search simultaneity. The intelligent routing mechanisms have flexible query expression but hold low scalability and recall rate. Contrastively, DHTs are scalable but either difficult to organize or too expensive for maintenance. A new structured P2P model is proposed in which resource storages are organized by match path...
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.