iTrust: Trustworthy Information Publication, Search and Retrieval

Melliar-Smith, P. M.; Moser, Louise E.; Lombera, Isai Michel; Chuang, Yung-Ting

doi:10.1007/978-3-642-25959-3_26

Cited by 15 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, we plan to investigate the time to reach a certain number of nodes, given a particular probability density function for the time that a node takes to forward messages. We also plan to apply the results of this probabilistic analysis of message forwarding to our existing iTrust information publication, search and retrieval network [26].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Probabilistic Analysis of Message Forwarding

Moser

Melliar-Smith

2013

2013 22nd International Conference on Computer Communication and Networks (ICCCN)

Self Cite

View full text Add to dashboard Cite

In this paper, we present a novel algorithm that finds the probability density function for the number of distinct nodes reached, within a specific number of levels of message forwarding, for a fixed size network. The algorithm also finds the expected number of distinct nodes to which a message is forwarded, within a specific number of levels of message forwarding, as the sum of the number of nodes, weighted by the probability of reaching that number of nodes. In addition, the algorithm finds the probability density function for the number of distinct nodes at a given level of message forwarding, and the expected number of distinct nodes at that level. Using the algorithm, we calculate these probability density functions and expected values for various size networks, degrees of message forwarding, probabilities of message forwarding, and levels of message forwarding. The algorithm has application to the Internet, peer-to-peer networks, ad-hoc networks, and social networks, and to multicasting, gossiping, and rumor and epidemic protocols.Keywords-message forwarding; probabilistic analysis; multicasting and gossiping; rumor and epidemic protocols; peer-to-peer networks; ad-hoc and sensor networks; social networks

show abstract

Section: Discussionmentioning

confidence: 99%

“…Forwarding has been applied to replication and data consistency [9], failure detection [30], and buffer management and message filtering [12]. Forwarding has also been applied to data aggregation [22] and decentralized search [26]. In each of these cases, messages are communicated to multiple nodes in the network.…”

Section: Introductionmentioning

confidence: 99%

Probabilistic Analysis of Message Forwarding

Moser

Melliar-Smith

2013

2013 22nd International Conference on Computer Communication and Networks (ICCCN)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The drawbacks come from the fact that Gossiping based search methods are more concentrated on the load balanced query/information dissemination and they do not provide approaches in other aspects, such as the way to route queries, or mechanisms to match a query to a resource description. The works in [229,[255][256][257][258] are some examples of gossip based resource discovery protocols.…”

Section: Gossiping-based Approachesmentioning

confidence: 99%

Resource discovery for distributed computing systems: A comprehensive survey

Zarrin

Aguiar

Barraca

2018

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

“…iTrust is just such a system. iTrust is designed to impede attempts to censor or filter information accessed over the Internet.…”

Section: Introductionmentioning

confidence: 99%

“…I had previously described the design of iTrust, which is a novel information distribution and retrieval system without centralized mechanisms and no centralized control in . In , I presented basic guiding principles of iTrust, the basic design of iTrust, the implementation of iTrust, the iTrust user interface, and the performance evaluation of iTrust. In addition, I also demonstrated that the probability of matching a query is high, even if some of the participating nodes are subverted or non‐operational.…”

Section: Introductionmentioning

confidence: 99%

An adaptable and scalable membership management for the iTrust information search and retrieval system

Chuang

2015

Security Comm Networks

Self Cite

View full text Add to dashboard Cite

The iTrust search and retrieval network is designed to impede attempts to censor or filter information accessed over the Internet, providing trustworthy access to information on the Web. In iTrust, a fully distributed membership algorithm and a detection/defensive adaptation algorithm act in concert to protect against malicious nodes in membership. By applying statistical inference for both detection and defensive algorithms, I was able to measure information that cannot be observed directly, such as the current size of the membership and the current proportion of malicious nodes in the network. Experimentation demonstrates that both algorithms are able to estimate these metrics quickly and accurately, to the point that the nodes can use them to manage the iTrust system, despite a high rate of membership churn, a large number of malicious nodes, and a mere partial view of network membership.

show abstract

iTrust: Trustworthy Information Publication, Search and Retrieval

Cited by 15 publications

References 9 publications

Probabilistic Analysis of Message Forwarding

Probabilistic Analysis of Message Forwarding

Resource discovery for distributed computing systems: A comprehensive survey

An adaptable and scalable membership management for the iTrust information search and retrieval system

Contact Info

Product

Resources

About