A central problem for structured peer-to-peer networks is topology maintenance, that is, how to properly update neighbor variables when nodes join and leave the network, possibly concurrently. In this paper, we first present a protocol that maintains a ring, the basis of several structured peer-to-peer networks. We then present a protocol that maintains Ranch, a topology consisting of multiple rings. The protocols handle both joins and leaves concurrently and actively (i.e., neighbor variables are updated once a join or a leave occurs). We use an assertional method to prove the correctness of the protocols, that is, we first identify a global invariant for a protocol and then show that every action of the protocol preserves the invariant. The protocols are simple and the proofs are rigorous and explicit.

Active and concurrent topology maintenance

With the emergence of more and more personalized service requirements, service customization has become a compelling problem in ubiquitous computing. As a new paradigm for service customization, the Active Services reuses existing services and obtains the user-needed service evolved from them. In this paper, a novel service reuse approach is proposed for service evolution process in the active services paradigm. Besides the entire service reuse realized in existing works, our approach can also achieve partial reuse of existing services at functionality level. To generate a user-needed service, the reusable parts of each existing service are extracted with an index strategy and utilized directly, and then the missing functionalities to satisfy the service requirement are further implemented. As quality of service (QoS) is very important for ubiquitous services, in this paper, based on the general service evolution process, two types of QoS-aware service reuse methods are also introduced. The proposed methods have been implemented and extensive experiments were done to evaluate them. The experimental results demonstrate the superiority of our methods in several measurements of service reuse: computation cost, success rate, and the quality of generated services. Copyright © 2009 John Wiley & Sons, Ltd.

Services having functionality overlapping with user requirements are important reusable assets. This paper achieves both partial and entire reuse of them with the composition plans and based on a functionality index. Experimental results demonstrate the usability and superiority of the proposed approach in terms of computation cost, success rate and service quality. Copyright © 2009 John Wiley & Sons, Ltd.

A novel service evolution approach for active services in ubiquitous computing

Secure multicast is one of the majority services in the near future. The frameworks for IP multicast cannot be directly applied in wireless networks. To address the natural issues of wireless multicast and enhance the efficiency, an adaptive secure multicast framework based on a new primitive called multi-recipient generalized signcryption and a multi-recipient generalized signcryption scheme based on the gap Diffie–Hellman problem (MGSC-GDH) are proposed. The key technologies to construct a high-performance adaptive scheme including identification function, randomness reusing are investigated. The framework provides separate or joint encryption and signature functions according to users' identities and requirements transparently, and has the ability to aggregate multiple unicast besides the common multicast service. Therefore, overheads are reduced sharply for multiple functions which are provided with a single primitive. By the precise reduction, the gap-bridge between the security of a base scheme and the corresponding multi-recipient generalized signcryption scheme is built, which is a direct measure to quantify the security. Analysis shows that MGSC-GDH is a semantic secure multi-recipient generalized signcryption scheme and more efficient than other similar schemes in computational and communicational aspects. It is suitable for dynamic environment for rekeying is avoided when membership changes. Copyright © 2009 John Wiley & Sons, Ltd.

Proposed a framework of adaptive secure multicast framework for wireless networks based on the proposed primitive multi-recipient generalized signcryption firstly. The framework provides separate or joint privacy and authenticity according to users' identities and requirements transparently, and has the ability to aggregate multiple unicast besides the common multicast service. Then designed a practical scheme called MGSC-GDH, which is semantic secure and more efficient than other similar schemes in computational and communicational aspects. Copyright © 2009 John Wiley & Sons, Ltd.

Adaptive secure multicast in wireless networks

A central problem for structured peer-to-peer networks is topology maintenance, that is, how to properly update neighbor variables when nodes join or leave the network, possibly concurrently. In this paper, we consider the maintenance of the ring topology, the basisof several peer-to-peer networks, in the fault-free environment. We design, and prove the correctness of, protocols that maintain a bidirectional ring under both joins and leaves. Our protocols update neighbor variables once a membership change occurs. We prove the correctness of our protocols using an assertional proof method, that is, we first identify a global invariant for a protocol and then show that every action of the protocol preserves the invariant. Our protocols are simple and our proofs are rigorous and explicit.

Concurrent maintenance of rings

The dynamics of peers, namely Churn, is an inherent property of peer-to-peer (P2P) systems and is critical to their design and evaluation. Although every excellent P2P protocol has some solution to this issue, studies on Churn are still seldom. This paper studies various factors related to Churn, and uses them to analyze and evaluate P2P protocols. Prior researches on Churn are all based on the P2P network factors in Churn environment, and their difference is whether to use these factors as predecessor references to build Churn analytical models or as successor references to test the models. According to this difference, this paper first divides various factors into two categories: impacting Churn and affected by Churn. There is a causal relationship between these two categories. Factors impacting Churn are cause, and the factors affected by Churn are effect. In this paper, we use this causality to simulate and analyze P2P Churn. Cause is used as the input data and effect is used as the output result. Second, based on the classification of Churn factors, we present a performance evaluation framework and two comparing models. Based on the framework and models, we simulate and analyze three P2P protocols and get some useful results such as the performance of these protocols under Churn, the advantage of Chord over others, and the most important factors impacting Churn. Finally, we present a method to improve recent P2P Churn models by adding some influence factors. Copyright © 2009 John Wiley & Sons, Ltd.

Multi-factors oriented study of P2P Churn

Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of neighbor pointers. When a node passively leaves the overlay, subsequent lookups may fail silently. Active maintenance has been proven only for fault-free networks. We develop an active topology maintenance algorithm for practical, fault-prone networks. Unlike prior work, it a) maintains ring continuity during normal topology changes and b) guarantees consistency and progress in the presence of faults. The latter property is inherited by novel extension of the Paxos commit algorithm. The topology maintenance algorithm is formally developed using the B method and its event-driven extensions for dynamic systems. Messaging and storage overheads are quantified

Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

K. Robinson

Author Tools

Chat about Author

Papers

Fault Tolerant Active Rings for Structured Peer-to-Peer Overlays