Academic literature on the topic 'Réseau P2P'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Réseau P2P.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Journal articles on the topic "Réseau P2P":
Blondeau-Coulet, Olivier. "P2P, videos, « mediascape »." MédiaMorphoses 21, no. 1 (2007): 49–53. http://dx.doi.org/10.3406/memor.2007.2276.
Buttard, Anne. "L’évaluation du réseau en santé." Politiques et Management Public, Vol. 26/4 (October 25, 2011): 87–110. http://dx.doi.org/10.4000/pmp.1666.
Hamzaoui, S., C. Mattei, C. Atlan, V. Lubin, R. Reynaud, J. Khoury, J. Cohen, et al. "P27 Incidents liés aux pompes à insuline au sein du Réseau Diabète-Provence." Diabetes & Metabolism 36 (March 2010): A46. http://dx.doi.org/10.1016/s1262-3636(10)70175-0.
Cuyvers, Guido, and Nicole De Keyser. "Travail social : le développement dans un réseau de pratiques relationnelles." Pensée plurielle 25, no. 3 (2010): 107. http://dx.doi.org/10.3917/pp.025.0107.
Lamarque, Danielle. "Note de lecture. Le réseau des écoles de service public : une expérience originale des échanges interprofessionnels." Politiques et management public 29, no. 1 (March 30, 2012): 135–36. http://dx.doi.org/10.3166/pmp.29.135-136.
De Filippi, Primavera, and Danièle Bourcier. "Réseaux et gouvernance. Le cas des architectures distribuées sur internet." Pensée plurielle 36, no. 2 (2014): 37. http://dx.doi.org/10.3917/pp.036.0037.
Lafont, Pascal. "La coopération au sein d’un réseau international interuniversitaire revisitée à l’aune des processus de transaction et de transition." Pensée plurielle 41, no. 1 (2016): 41. http://dx.doi.org/10.3917/pp.041.0041.
Boukamel, Owen. "Le rôle des réseaux d’acteurs dans l’innovation publique complexe : le cas du vote électronique dans le canton de Genève." Politiques et management public 34, no. 3-4 (December 30, 2017): 267–86. http://dx.doi.org/10.3166/pmp.34.2017.0010.
N'Dione Mbinky, Madeleine. "Le réseau d’entreprises de l’Économie sociale et solidaire Le Relais : les transactions dans la transposition de la France au Sénégal." Pensée plurielle 45, no. 2 (2017): 47. http://dx.doi.org/10.3917/pp.045.0047.
Foucart, Jean. "Réseaux fluides et pratiques sociales?: vers un nouveau paradigme. Une méthodologie floue?: la recherche participative." Pensée plurielle 28, no. 3 (2011): 11. http://dx.doi.org/10.3917/pp.028.0011.
Dissertations / Theses on the topic "Réseau P2P":
Garcés-Erice, Luis. "Un réseau P2P hiérarchique : design et applications." Paris, ENST, 2004. http://www.theses.fr/2004ENST0016.
In this work we focus on structured P2P systems. We start consideringDHT design issues, presenting a hierarchical P2P system framework weelaborate upon. We enumerate the hierarchical organization maincharacteristics and advantages: specifically, the capacity of thesesystems to improve networked communication performance by adapting tothe Internet topology, and to increase the robustness of flat P2Psystems by differentiating peer roles according to theircapabilities. We develop a hierarchical DHT named TOPLUS, which isbuilt by grouping peers in the same IP Network Prefix, and arrangingthese groups following the Internet hierarchical topology: Its look-upis able to find the peer responsible for a resource in time comparableto the level-3 routing of the resource request from the peeroriginating the query to the destination peer where the resource islocated. Because the structure of TOPLUS follows that of the Internet,we say that TOPLUS is topology-aware. For Content Distribution wepresent MULTI+, an application-level multicast P2P network that workson top of TOPLUS. MULTI+ builds multicast trees that attempt shortestpossible average delay from the multicast information source to therecipients in the multicast group, while trying to use bandwidthefficiently. We also test how robust these delay and bandwidthproperties are when massive peer failure occurs. Finally, we useindexing of resources using predefined indexing schemes for ContentLocation. Each index is used as the key to find other indexes withmore precise information about a given resource, and the indexcompletely describing the item is the key corresponding to theresource
Tout, Rabih. "Sauvegarde des données dans les réseaux P2P." Phd thesis, Université Claude Bernard - Lyon I, 2010. http://tel.archives-ouvertes.fr/tel-00731829.
Bonnel, Nicolas. "Adapnet : Stratégies adaptatives pour la gestion de données distribuées sur un réseau P2P." Phd thesis, Université de Bretagne Sud, 2008. http://tel.archives-ouvertes.fr/tel-00497553.
Guéret, Christophe. "Navigateurs Internet Intelligents : Algorithmes de Fourmis Artificielles pour la diffusion d'informations dans un réseau P2P." Phd thesis, Université François Rabelais - Tours, 2006. http://tel.archives-ouvertes.fr/tel-00141933.
Gueret, Christophe. "Navigateurs internet intelligents : algorithmes de fourmis artificielles pour la diffusion d'informations dans un réseau P2P." Tours, 2006. http://www.theses.fr/2006TOUR4020.
In this thesis, we propose the architecture PIAF (Personnal Intelligent Framework Agent) whose objective is to provide users with an environment of nonintrusive, autonomous and general-purpose exchange of information. The problems of diffusion of information between users and optimization of the network's topology are approached with an algorithm using artificial ants. The use of artificial pheromones deposited on connections between peers at the time of the transfers authorizes the constitution of a global memory of the exchanges and the detection of centers of shared centers of interests. Comparatively with the existing solutions, the advantage of our algorithm is to free the user from the definition of profiles. This last needs neither to subscribe with diffusion channel nor to define its centers of interests to be able to exchange information
Veglia, Paolo. "Applications TV pair-à-pair conscientes du réseau." Phd thesis, Télécom ParisTech, 2011. http://pastel.archives-ouvertes.fr/pastel-00647980.
Hayek, Rabab. "Techniques de localisation et de résumé des données dans les systèmes P2P." Phd thesis, Université de Nantes, 2009. http://tel.archives-ouvertes.fr/tel-00475913.
Lu, Tianxiang. "Formal verification of the Pastry protocol." Thesis, Université de Lorraine, 2013. http://www.theses.fr/2013LORR0179/document.
Pastry is a structured P2P algorithm realizing a Distributed Hash Table over an underlying virtual ring of nodes. Several implementations of Pastry are available, but no attempt has so far been made to formally describe the algorithm or to verify its properties. Since Pastry combines complex data structures, asynchronous communication, and concurrency in the presence of spontaneous join and departure of nodes, it makes an interesting target for verification. This thesis focuses on the Join protocol of Pastry that integrates new nodes into the ring. All member nodes must have a consistent key mapping among each other. The main correctness property, named CorrectDelivery, states that there is always at most one node that can deliver an answer to a lookup request for a key and this node is the numerically closest member node to that key. This property is non-trivial to preserve in the presence of churn. In this thesis, unexpected violations of CorrectDelivery in the published versions of Pastry are discovered and analyzed using the TLA+ model checker TLC. Based on the analysis, the protocol IdealPastry is designed and verified using the interactive theorem prover TLAPS for TLA+. By relaxing certain hypotheses, IdealPastry is further improved to LuPastry, which is again formally proved correct under the assumption that no nodes leave the network. This hypothesis cannot be relaxed in general due to possible network separation when particular nodes simultaneously leave the network
Ayoub, Simon. "Technique distribuée de gestion de la charge sur le réseau électrique et Ring-Tree : un nouveau système de communication P2P." Thèse, Université de Sherbrooke, 2013. http://hdl.handle.net/11143/6114.
Bonnel, Nicolas Achille Jacques. "Adapnet : stratégies adaptatives pour la gestion de données distribuées sur un réseau pair-a pair." Lorient, 2008. http://www.theses.fr/2008LORIS134.
In the last few years, the amount of digital information produced has exponentially increased. This raises problems regarding the storage, the access and the availability of this data. Software and hardware architectures based on the peer-to-peer (p2p) paradigm seem to satisfy the needs of data storage but cannot handle efficiently both data accessibility and availability. We present ,in this thesis various contributions on p2p architectures for managing large volumes of information. We propose various strategies that operate on dedicated virtual topologies that can be maintained at low cost. More precisely, these topologies scale well because the cost for node arrival and node departure is on average constant, whatever the size of the network. We analyze the main paradigms of information sharing on a p2p network, considering successively the problem of access to typed information (semi-structured) and the general case that completely separates the nature of the queries and data location. We propose a routing strategy using structure and content of semi-structured information. We also propose strategies that efficiently explore the network when there is no assumption on the nature of data or queries. In order to manage a quality of service (which is expressed ln terms of speed and reliability), we, also investigate the problem of information availability, more precisely we replicate data stored ln the network. We propose a novel approach exploiting an estimation of local density of data
Books on the topic "Réseau P2P":
Gilster, Paul. The SLIP/PPP connection: The essential guide to graphical Internet access. New York: Wiley, 1995.
Peacock, Michael. PHP 5 social networking: Create a powerful and dynamic social networking website in PHP by building a flexible framework. Birmingham [U.K.]: Packt Pub., 2010.
Kwok, Yu-Kwong Ricky. Peer-to-peer computing: Applications, architecture, protocols, and challenges. Boca Raton, FL: Taylor & Francis, 2012.
Martin, Alban. L'âge de Peer: Quand le choix du gratuit rapporte gros. Paris: Village mondial, 2006.
DBISP2P 2003 (2003 Berlin, Germany). Databases, information systems, and peer-to-peer computing: First international workshop, DBISP2P 2003 : Berlin, Germany, September 7-8, 2003 : revised papers. New York: Springer, 2004.
(Editor), Can Türker, Maristella Agosti (Editor), and Hans-Jörg Schek (Editor), eds. Peer-to-Peer, Grid, and Service-Orientation in Digital Library Architectures: 6th Thematic Workshop of the EU Network of Excellence DELOS, Cagliari, Italy, ... Papers (Lecture Notes in Computer Science). Springer, 2005.
Keith W.; Kurose, James Ross. Computer Networking: A Top-down Approach Featuring the Internet. Addison-Wesley Educational Publishers Inc.,U.S., 2004.
Brooks, R. R. Disruptive Security Technologies with Mobile Code and Peer-To-Peer Networks. Taylor & Francis Group, 2004.
Kwok, Yu-Kwong Ricky. Peer-To-Peer Computing: Applications, Architecture, Protocols, and Challenges. Taylor & Francis Group, 2011.
Kwok, Yu-Kwong Ricky. Peer-To-Peer Computing: Applications, Architecture, Protocols, and Challenges. Taylor & Francis Group, 2011.
Conference papers on the topic "Réseau P2P":
GOUDEDRANCHE, Luce, and Jean-Louis GAIGNON. "De l'incertaine rencontre entre scientifiques et gestionnaires et de l'importance des réseaux." In SANNIER L., LEVACHER D., JOURDAN M. (2009). Approche économique et validation de méthodes de traitements aux liants hydrauliques de sédiments marins contaminés. Revue Paralia, n° 2, pp s2.1– s2.15. Editions Paralia, 2009. http://dx.doi.org/10.5150/cmcm.2009.049-7.