A Simulation Framework for Schema-Based Query Routing in P2P-Networks

Siberski, Wolf; Thaden, Uwe

doi:10.1007/978-3-540-30192-9_43

Cited by 9 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its effect on our experimental results presented in Section 5 would clearly depend on the complexity and scalability of the query processing algorithms employed. For example, [20] discusses query routing in P2P networks that use the HyperCup topology and shows that schema-based clustering of peers significantly improves query performance. In order to not confuse the performance of global P2P query processing with the ECA rule processing functionality that is the focus of this paper, we make the assumption, both in our analytical model and our simulator, that rule conditions are evaluated within a single peergroup.…”

Section: P2p Rule Executionmentioning

confidence: 99%

“…p annot action = p n steps s (20) where, similarly to rule conditions, p s expresses the probability that a given update can be evaluated at a given peer (for simplicity, we assume the same number of updates, n steps , in a rule's action part as there are steps in its condition part -the model could easily be refined to capture two different quantities). Let λ ext be the arrival rate of top-level updates submitted from outside the rule processing system.…”

Section: Proposition 2 Let N Cond Be the Mean Number Of Instances Gementioning

confidence: 99%

See 1 more Smart Citation

Performance modelling of Event-Condition-Action rules in P2P networks

Papamarkos

Poulovassilis

Wood

2011

Journal of Computer and System Sciences

View full text Add to dashboard Cite

This paper develops an analytical model for exploring the performance of processing EventCondition-Action (ECA) rules in P2P environments, adopting as the main performance criterion the mean time required to complete all rule processing resulting from a top-level update submitted to one of the peers in the network. We examine the analytical model's predictions of how this time varies with the network topology, number of peers, number of rules and degree of data replication between peers. We also describe a simulation of such a P2P ECA rule processing system, and the experiments with this show good agreement with the analytical predictions. The main contributions of this paper are the analytical model itself, and the results of the performance study undertaken using the model, which have been confirmed by the results from the simulator.

show abstract

Section: P2p Rule Executionmentioning

confidence: 99%

Section: Proposition 2 Let N Cond Be the Mean Number Of Instances Gementioning

confidence: 99%

Performance modelling of Event-Condition-Action rules in P2P networks

Papamarkos

Poulovassilis

Wood

2011

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…We can assume certain similarities, but the exact distribution parameters are unlikely to generalize across domains. This problem was faced by Siberski et al for the simulation of their system Edutella [18], and we are exploring entirely new applications, e.g. a P2P wiki [5].…”

Section: A Measurement Studiesmentioning

confidence: 99%

DEVS simulation of peer-to-peer file-sharing

Davoust

Wainer

Esfandiari

2012

2012 International Conference on High Performance Computing &Amp; Simulation (HPCS)

View full text Add to dashboard Cite

Abstract-We present a framework to simulate a peer-topeer (P2P) file-sharing network, based on the Discrete Event Systems Specification (DEVS) formalism. Our framework models a file-sharing network as a coupled model, comprising a network model and a large number of peer models. While most available network simulation tools focus on transportlevel dynamics, we provide extensible and reusable models for the file-sharing protocol and for the behavior of peers. These models, implemented using the CD++ toolkit, can readily be used on existing simulators, including parallel and real-time simulators.As a case study, we apply our framework to simulate a P2P web, and show the emergence of an interesting page distribution.

show abstract

“…Additionally, a significant effort has been dedicated not only to produce analytical models to describe P2P systems [25], but also on designing P2P simulation tools (such as [26] or [27]). …”

Section: Introductionmentioning

confidence: 99%

PBoT: An analytical model of P2P traffic based on transactions

Salguero

Blas

Osma

et al. 2008

Networks 2008 - The 13th International Telecommunications Network Strategy and Planning Symposium

View full text Add to dashboard Cite

Nowadays Peer-to-Peer (P2P) file-sharing has not only become the dominant source of traffic in the Internet but also an increasingly common way of distributing contents commercially over IP networks, revealing the need of reaching a level of understanding of the behaviour and performance of the different P2P applications similar to that already achieved for other Internet services such as web browsing. This paper contributes to fUlfil this task by introducing a simple analytical model that enables the study of P2P file-sharing systems in terms of performance, global behaviour, and the impact of their traffic on the networks. This paper also presents simulation results that will show the accuracy of the presented analytical model and will provide some practical insights on the behaviour of P2P systems, which can be of interest for P2P application designers and network engineers.I As of July 2008, there are about 3.5 million users connected simultaneously to the eMule network [28]. Besides, eMule has been the main source of P2P tratTic in most European countries for years [29]. A recent Internet study including data about P2P networks shows that BitTorrent and eDonkey are the most popular P2P networks by a wide margin [30].

show abstract

A Simulation Framework for Schema-Based Query Routing in P2P-Networks

Cited by 9 publications

References 10 publications

Performance modelling of Event-Condition-Action rules in P2P networks

Performance modelling of Event-Condition-Action rules in P2P networks

DEVS simulation of peer-to-peer file-sharing

PBoT: An analytical model of P2P traffic based on transactions

Contact Info

Product

Resources

About