DEVS simulation of peer-to-peer file-sharing

Davoust, Alan; Wainer, Gabriel; Esfandiari, Babak

doi:10.1109/hpcsim.2012.6266937

Cited by 2 publications

(2 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In (Chuan et al 2007) the authors present an event-driven intrusion detection architecture using the DEVS formalism and DEVS-Java for the implementation and the validation of the model. In (Davoust et al 2012), the authors introduced a DEVS framework for the simulation of peer-to-peer (P2P) file sharing that provides extensible and reusable models for the file sharing protocol and for the behavior of the peers. In (Ahmed et al 2005), a tool for the modeling and simulation of networks was presented.…”

Section: Related Workmentioning

confidence: 99%

Application of the DEVS and Cell-DEVS formalisms for modeling networking applications

Wainer¹,

Tavanpour²,

Broutin³

2013

2013 Winter Simulations Conference (WSC)

View full text Add to dashboard Cite

We present the use of DEVS and Cell-DEVS formalisms to model different approaches in networking applications. We discuss various applications of discrete event system specifications for modeling and simulation of Wireless networks and Wireless Sensor Networks (WSN). We discuss how to use the Cell-DEVS formalism to model a WSN for investigating on stochastic properties of malware propagation and the intrinsic characteristic of WSN. We also discuss the use of DEVS to model a cellular network including a wide geographical area, various Cells and varied User Equipment. Finally, we discuss how to use the cell DEVS formalism to model mobile networks, and how the Cell-DEVS formalism can be used to track mobile user movement in a covered area. The latter model tries to find out the number of Base Stations which cover a mobile user in different location of an area and how to improve QoS based on different configurations (in particular for the UEs near the cell borders).

show abstract

Section: Related Workmentioning

confidence: 99%

Application of the DEVS and Cell-DEVS formalisms for modeling networking applications

Wainer¹,

Tavanpour²,

Broutin³

2013

2013 Winter Simulations Conference (WSC)

View full text Add to dashboard Cite

show abstract

“…Following this approach would have nonetheless been feasible: we published [150] a preliminary study using data from another domain: it is detailed in appendix A.…”

Section: Approachmentioning

confidence: 99%

Decentralized Social Data Sharing

Davoust¹

Self Cite

View full text Add to dashboard Cite

Many data sharing systems are open to arbitrary users on the Internet, who are independent and self-interested agents. Therefore, in addition to traditional design goals such as technical performance, data sharing systems should be designed to best support the strategic interactions of these agents.Our research hypothesis is that designs that maximize the participants' autonomy can produce useful data sharing systems.We apply this design principle to both the system architecture and the functional design of a data sharing system, and study the resulting class of systems, which we call Decentralized Social Data Sharing ((DS) 2 ) systems.We formally define this class of systems and provide a reference implementation and an example application: a distributed wiki system called P2Pedia. P2Pedia implements a decentralized collaboration model, where the users are not required to reach a consensus, and instead benefit from being exposed to multiple viewpoints. We demonstrate the value of this collaboration model through an extensive user study.Allowing the users to autonomously control their data prevents the system architecture from being optimized for efficient query processing. We show that Regular Path Queries, a useful class of graph queries, can still be processed on the shared data:although in the worst case such queries are intractable, we propose a cost estimation technique to identify tractable queries from partial knowledge of the data.Through simulation, we also show that the users' control over network connections ii allows them to self-organize and interact with other users with whom their interests are best aligned. This may result in less data being available, and we study cases where this is in fact demonstrably beneficial to the users, as the available data to each user is the most relevant to them.This suggests that querying this reduced collection of shared data may lead to more tractable query processing without necessarily reducing the users' utility.

show abstract

DEVS simulation of peer-to-peer file-sharing

Cited by 2 publications

References 23 publications

Application of the DEVS and Cell-DEVS formalisms for modeling networking applications

Application of the DEVS and Cell-DEVS formalisms for modeling networking applications

Decentralized Social Data Sharing

Contact Info

Product

Resources

About