Search results

The purpose of this study is to reduce internet traffic when performing collaborative Web search. Mobile terminals are now in widespread use and people are increasingly using them for collaborative Web search to achieve a common goal. When performing such searches, the authors want to reduce internet traffic as much as possible, for example, to avoid bandwidth throttling that occurs when data usage exceeds a certain quota.

To reduce internet traffic, the authors use a proxy system based on the peer cache mechanism. The proxy shares Web content stored on mobile terminals participating in an ad hoc Bluetooth network, focusing on content that is accessed multiple times from different terminals. Evaluation of the proxy’s effectiveness was measured using experiments designed to replicate realistic usage scenarios.

Experimental results show that the proxy reduces internet traffic by approximately 20 per cent when four people collaboratively search the Web to find good restaurants for a social event.

Unlike previous work on co-operative Web proxies, the authors study a form of collaborative Web caching between mobile devices within an ad hoc Bluetooth network created specifically for the purpose of sharing cached content, acting orthogonally to (and independently of) traditional hierarchical Web caching.

In any distributed application, the communication between the distributed processes/nodes of the distributed systems is essential for both reliability and efficiency matters. The purpose of this paper is to address this issue for distributed applications based on JXTA protocols aiming at extending and evaluating the protocols of the JXTA library for reliable P2P computing.

After a careful examination of the current version of JXTA protocols, the need was observed for improving the original JXTA protocols such as pipe services to ensure reliable communication between nodes of the grid platform and the discovery and presence service to increase the performance of the applications. Using a mixed P2P network based on broker peers and client peers architecture, which served as a basis to extend the JXTA protocols, was the basis of the approach.

The original JXTA protocols are extented/re‐implemented to support the development of reliable P2P distributed applications.

The proposed approach has been validated in practice by deploying a P2P network using nodes of PlanetLab platform and testing each of the re‐implemented protocols using this real P2P network. The extended JXTA protocols can be used to develop reliable P2P distributed applications.

Is of value by showing how to improve both efficiency reliability of JXTA protocols and services.

To provide mutual anonymity over traditionally un‐anonymous Distributed Hash Tables (DHT) based Peer‐to‐Peer overlay networks, while maintaining the desired scalability and guaranteed lookup properties of the DHTs.

Agyaat uses a novel hybrid‐overlay design, a fully decentralized topology without any trusted proxies. It anonymizes both the querying and responding peers through the use of unstructured topologies, called clouds, which are added onto the structured overlays. In addition, it regulates the cloud topologies to ensure the guaranteed location of data and scalability of routing. A unique characteristic of the design is the ability of users to tradeoff between desired anonymity and performance. The paper presents a thorough performance and anonymity analysis of the system, and also analyzes few anonymity compromising attacks and countermeasures.

The results indicate that Agyaat is able to provide mutual anonymity while maintaining the scalability of lookups, affecting the costs only by a constant factor.

While Agyaat is able to meet its mutual anonymity and performance goals, there exist other security vulnerabilities like possible Denial‐of‐Service (DoS) attacks, both due to its design and the underlying DHT overlay. This is fertile ground for future work.

Agyaat uses a novel topology architecture and associated protocols that are conducive to providing mutually anonymous services.

Matching relevant ontology data for integration is vitally important as the amount of ontology data increases along with the evolving Semantic web, in which data are published from different individuals or organizations in a decentralized environment. For any domain that has developed a suitable ontology, its ontology annotated data (or simply ontology data) from different sources often overlaps and needs to be integrated. The purpose of this paper is to develop intelligent web ontology data matching method and framework for data integration.

This paper develops an intelligent matching method to solve the issue of ontology data matching. Based on the matching method, it also proposes a flexible peer‐to‐peer framework to address the issue of ontology data integration in a distributed Semantic web environment.

The proposed matching method is different from existing data matching or merging methods applied to data warehouse in that it employs a machine learning approach and more similarity measurements by exploring ontology features.

The proposed method and framework will be further tested for some more complicated real cases in the future.

The experiments show that this proposed intelligent matching method increases ontology data matching accuracy.

Peer‐to‐peer (P2P) streaming quickly emerges as an important application over the internet. A lot of systems have been implemented to support peer‐to‐peer media streaming. However, some problems still exist. These problems include non‐guaranteed communication efficiency, limited upload capacity and dynamics of suppliers which are all related to the overlay topology design. The purpose of this paper is to propose a novel overlay construction framework for peer‐to‐peer streaming.

To exploit the bandwidth resource of neighboring peers with low communication delay, application of the grouping method was proposed to construct a flexible two‐layered locality‐aware overlay network. In the proposed overlay, peers are clustered into locality groups according to the communication delays of peers. These locality groups are interconnected with each other to form the top layer of the overlay. In each locality group, peers form an overlay mesh for transmitting stream to other peers of the same group. These overlay meshes form the bottom layer of the overlay.

Through simulations, the performance was compared in terms of communication efficiency, source‐to‐end delivery efficiency and reliability of the delivery paths of the proposed solution currently. Simulation results show that the proposed method can achieve the construction of a scalable, efficient and stable peer‐to‐peer streaming environment.

The new contributions in this paper are a novel framework which includes the adaptability, maintenance and optimization schemes to adjust the size of overlay dynamically according to the dynamics of peers; and considering the importance of locality of peers in the system.

This work is motivated by the need to develop decentralized peer‐to‐peer (P2P) approaches to support e‐learning and teaching activity in virtual universities. This paper aims to present the implementation of the JXTA‐based e‐learning P2P system.

The design and implementation of a smart box environment that will be used for stimulating the learners to increase the learning efficiency is shown. The smart box is integrated with the JXTA‐overlay by using efficient message sending between peers in the system.

The proposed e‐learning P2P system is a useful tool for monitoring and controlling learners' activity.

In the future, other effective stimulation for each learner using IC tag card will be added. Also, the Servo Motor has 12 control ports, so these will be used for implementing other stimulating functions. It is planned to extend the system with functionalities for presence mechanism of students in classrooms and activities.

The proposed system is evaluated by experimental results and it has a good performance.

This paper proposes and implements a novel e‐learning system, which is based on P2P, web and sensor technologies.

Resource discovery in peer‐to‐peer (P2P) systems have been extensively studied. Unfortunately, most of the systems studied are not designed to take advantage of the heterogeneity in peer nodes. In this paper, we propose a novel P2P overlay called RATTAN, which serves as an underlay of a Gnutella‐like network. RATTAN exploits the heterogeneity of peer nodes by structuring capable nodes as the core of the overlay. Using a tree‐like structure, RATTAN can maximize the search scope with a minimal number of query messages. We evaluate RATTAN with simulation. The experiments show the following interesting results. First, RATTAN is robust by exploiting redundant overlay links. Second, the maximum bandwidth demand for processing the protocol of a single RATTAN overlay is nearly 1M bits/sec. However, around 80% of the nodes merely take 66 bits/sec. One implication is that we can use a small number of relatively capable peers (e.g., stable machines with a 100M bits/sec network interface) to process the 1M bits/sec protocol overhead and serve other peers that only need to spend 66 bits/sec for processing protocol overhead.

The purpose of this paper is to identify and analyze the key uncertainties and to construct alternative future scenarios for Internet content delivery. The relative positions and roles of different actors and content delivery technologies in each scenario are then discussed. As traffic volume rapidly grows, the current Internet architecture faces scalability issues. To meet the demand, technical solutions utilizing caching and name-based routing are developed.

This work followed a scenario planning process, and two workshops were organized for identifying the key trends and uncertainties. Industry architecture notation was used to systematically illustrate and compare the constructed scenarios.

Of the 94 forces identified, the revenue model and Internet service provider's (ISP’s) role in content provision were singled out as the two most important uncertainties, upon which four scenarios were constructed. In-network caching technologies are strong candidates in ISP-dominated scenarios. Content delivery networks are more likely outcomes in scenarios, where content providers’ role is significant.

The paper focuses on qualitative analysis of scenarios. Utilizing, for instance, system dynamics to model interdependencies between the trends and uncertainties could provide a path toward quantitative analysis.

The paper increases understanding of relative positions and roles of different actors and technologies in possible future scenarios. The findings are important, especially for ISPs, content providers and technology vendors. The scenarios can be used to identify desirable futures and strategies to achieve them and to make informed choices in technology design to meet the demands of key actors.

The purpose of this paper is to describe a means to improve the accessibility of files across different delivery platforms, making it possible to use a single search modality. The paper shows that both peer‐to‐peer file sharing networks and the worldwide web provide extensive information resources, and either network may contain data that satisfy a searcher's information need.

The paper proposes a gateway between the worldwide web and peer‐to‐peer networks that permits searchers on one side to be able to seamlessly search and retrieve files on the other side of the gateway. The design and prototype implementation of such a gateway to Gnutella is detailed, along with access statistics from test deployments and lessons learned.

The prototype implementation was found to demonstrate the feasibility of a seamless gateway between the Gnutella network and the worldwide web. Gnutella users saw millions of web search results and initiated retrievals via the gateway without knowing the source of the information or having to leave their Gnutella applications. Analysis of file retrieval logs showed that Gnutella search results lose value (to the original searcher) if delayed by more than a few seconds.

The implementation is a prototype, fielded for only a few months within the Gnutella network. Future implementations need cooperation with a web search service, and ideally would connect to multiple services for different types of queries.

Deployment of the gateway architecture described would be of use to searchers and of value to content providers.

This paper's approach makes information in other networks seamlessly searchable and accessible.

This paper investigates query processing in MANETs. Cache techniques and multi‐join database operations are studied. For data caching, a group‐caching strategy is proposed. Using the cache and the index of the cached data, queries can be processed at a single node or within the group containing this single node. For multi‐join, a cost evaluation model and a query plan generation algorithm are presented. Query cost is evaluated based on the parameters including the size of the transmitted data, the transmission distance and the query cost at each single node. According to the evaluations, the nodes on which the query should be executed and the join order are determined. Theoretical analysis and experiment results show that the proposed group‐caching based query processing and the cost based join strategy are efficient in MANETs. It is suitable for the mobility, the disconnection and the multi‐hop features of MANETs. The communication cost between nodes is reduced and the efficiency of the query is improved greatly.