Dissertations / Theses on the topic 'Réseau P2P'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research 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.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
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
Yeferny, Taoufik. "Proposition d'approches de routage de requêtes dans les systèmes pair-à-pair non structurés." Phd thesis, Institut National des Télécommunications, 2014. http://tel.archives-ouvertes.fr/tel-01048671.
Nguyen, Gia Hien. "Fiabilité des réponses fournies par un réseau logique pair-à-pair." Phd thesis, Grenoble 1, 2008. http://www.theses.fr/2008GRE10233.
This thesis improves the reliability of answers in semantic peer-to-peer networks in different ways. The first part of the thesis focuses on the problem of returning only well-founded answers of a query when the global network of such a system is inconsistent. Two algorithms have been proposed. The first one detects causes of inconsistencies. It terminates, is decentralized, complete and correct. The second algorithm uses the results of the first one in order to make only well-founded reasoning. It terminates, is decentralized and correct. Promising results have been obtained from experimentations. The second part of the thesis considers the problem of modeling and handling peers’ trust into returned answers. Based on a probabilistic setting, the proposed model of trust has a clear semantics and trust towards answers can be estimated by peers with a good precision using few observations
Nguyen, Gia Hien. "Fiabilité des réponses fournies par un réseau logique pair-à-pair." Phd thesis, Université Joseph Fourier (Grenoble), 2008. http://tel.archives-ouvertes.fr/tel-00342652.
Eisenbarth, Jean-Philippe. "Analyse, valorisation et protection des réseaux pair-à-pair de blockchains publiques." Electronic Thesis or Diss., Université de Lorraine, 2022. http://www.theses.fr/2022LORR0213.
Blockchains rely on P2P networks that are essential to their proper functioning, as they ensure the dissemination of transactions and blocks to all parties.While Bitcoin and Ethereum - the two main public blockchains - are now worth trillions of dollars, attracting new users every day, few studies focus on the network aspects, although the literature shows that many problems can reduce the reliability of public P2P networks.In this thesis, we first focused on the monitoring of the P2P networks of the Bitcoin and Ethereum blockchains.We implemented a crawler for each network able to discover all connected peers and analyzed data from several months of measurement campaigns.Different criteria that can affect the reliability of the network were studied, such as the number of peers, their geographical distribution, their distribution over the IP network, the churn, the proportion of clients with known vulnerabilities, the existence of daily connection patterns or the ability to infer topology. It appears that both networks show good properties on all these points.Starting from the observation that, on the one hand, the Ethereum P2P network based on a distributed hash table (DHT) is largely untapped, as no data is stored in the DHT, and on the other hand, thestorage of the blockchain data is only growing (which will eventually be problematic),we studied in a second time the data storage of the main client of Ethereum(Geth) and its way of synchronizing the state of the blockchain between the peers. We have designeda new distributed storage architecture for Ethereum taking advantage of the DHT, backward compatible with the current clients and able to reduce the disk space, used for long-term storage, by 95% (58% of the total storage) without impacting the guarantees or the performances of the Ethereum blockchain.However, storing data on the DHT makes it more prone to attacks, especially Sybil attacks.We therefore analyzed Ethereum peers for patterns that could reflect Sybil attacks and showed the existence of thousands of suspicious nodes grouping many identifiers for a single IP address (up to 10000/IP).We finally designed and implemented a protection architecture against Sybil attacks. It is based on a crawler detecting suspicious nodes in real time, a smart contract structuring the information and distributing it to all peers, and finally a fully-distributed revocation system, each peer noticing itself the attack and removing its connections.The deployment on an Ethereum test network has shown the effectiveness of the proposed architecture
Lu, Tianxiang. "Formal verification of the Pastry protocol." Electronic Thesis or Diss., Université de Lorraine, 2013. http://www.theses.fr/2013LORR0179.
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
Saddi, Oualid. "La métrologie dans les réseaux p2p." Paris 6, 2007. https://tel.archives-ouvertes.fr/tel-00803195.
Mnie, Filali Imane. "Distribution multi-contenus sur Internet." Thesis, Université Côte d'Azur (ComUE), 2016. http://www.theses.fr/2016AZUR4068/document.
In this study, we focused on peer-to-peer protocols (P2P), which represent a promising solution for data dissemination and content delivery at low-cost in the Internet. We performed, initially, a behavioral study of various P2P protocols for file sharing (content distribution without time constraint) and live streaming. Concerning file sharing, we have shown the impact of Hadopi on users’ behavior and discussed the effectiveness of protocols according to content type, based on users’ choice. BitTorrent appeared as the most efficient approach during our study, especially when it comes to large content. As for streaming, we studied the quality of service of Sopcast, a live distribution network that accounts for more than 60% of P2P broadcast live events. Our in-depth analysis of these two distributionmodes led us to focus on the BitTorrent protocol because of its proven efficiency in file sharing and the fact that it is open source. In the second part of the thesis, we proposed and implemented a new protocol based on BitTorrent, in a controlled environment. The modifications that we proposed allow to increase the efficiency of the protocol through improved dissemination of metadata (the rarest piece), both for live and file sharing. An enhanced version is introduced with a push method, where nodes that lag behind receive an extra service so as to improve the overall performance
Carlinet, Yannick. "Supervision de trac au niveau applicatif : application à la sécurit é et à l'ingénierie des réseaux." Phd thesis, Université Rennes 1, 2010. http://tel.archives-ouvertes.fr/tel-00536850.
Mathieu, Bertrand. "Potacco : noeud polymorphique transparent pour l'adaptation de contenu adapté au contexte." Phd thesis, Paris 6, 2008. https://tel.archives-ouvertes.fr/tel-00812520.
With the evolution of fixed and mobile networks, the increasing number of diversified devices, it is now possible to access any type of services, from any type of devices, being connected to any type of networks. By adding the wish of users to receive personalized contents, adapting content has become a major problem. To help to reach this goal, this thesis defines an intermediate flexible node, allowing dynamic adaptation of any type of content depending on the context of the users. This study resulted in the definition of a node architecture, called Potacco (for noeud POlymorphique Transparent pour l'Adaptation de Contenu adapté au COntexte, in French or Transparent Polymorphic node for content adaptation to the context in English) and its implementation and validation. This node: · collects and provides current context information to enable application modules to make adaptation based on such values · manages/coordinates the application modules and the context collectors (e. G. Context sensors) · enables the secured deployment of code in the node (the supplier code, but also the target node are authenticated) · may be transparent to the applications and may process data without no mean for the endpoints to detect it. Two demonstrators have been implemented as a proof of concept of this generic node being located in a physical network: as a wired/wireless gateway performing media content adaptation and as a node in an ADSL network inserting transparently the users’ context. Then, the use of that node in "overlay" networks has been the subject of a new proof of concept. Two cases were studied: the first one for the provisioning of services adapted to the user’s context in a service specific overlay network service, where a case of a personalized IPTV service is presented, and the second one related to the content adaptation of multimedia stream broadcasted on a P2P network where the Potacco node itself is a member of the P2P network. Validation by simulation and real experiments, permitted to evaluate these solutions
El, Dick Manal. "P2P Infrastruture for content distribution." Nantes, 2009. http://www.theses.fr/2009NANT2127.
Le Web connaît ces dernières années un essor important qui implique la mise en place de nouvelles solutions de distribution de contenu répondant aux exigences de performance, passage à l’échelle et robustesse. De plus, le Web 2. 0 a favorisé la participation et la collaboration entre les utilisateurs tout en mettant l’accent sur les systèmes P2P qui reposent sur un partage de ressources et une collaboration décentralisée. Nous avons visé, à travers cette thèse, la construction d’une infrastructure P2P pour la distribution de contenu. Toutefois, cette tâche est difficile étant donné le comportement dynamique et autonome des pairs ainsi que la nature des overlays P2P. Dans une première étape, nous nous intéressons au partage de fichiers en P2P. Nous abordons le problème de consommation de bande passante sous deux angles : l’inefficacité de la recherche et les transferts de fichiers longue distance. Notre solution Locaware consiste à mettre en cache des index de fichiers avec des informations sur leurs localités. Elle fournit également un support efficace pour les requêtes par mots clés qui sont courantes dans ce genre d’applications. Dans une deuxième étape, nous élaborons une infrastructure CDN P2P qui permet à tout site populaire et sous-provisionné de distribuer son contenu, par l’intermédiaire de sa communauté d’utilisateurs intéressés. Pour un routage efficace, l’infrastructure Flower-CDN combine intelligemment différents types d’overlays avec des protocoles épidémiques tout en exploitant les intérêts et les localités des pairs. PetalUp-CDN assure le passage à l’échelle alors que les protocoles de maintenance garantissent la robustesse face à la dynamicité des pairs. Nous évaluons nos solutions au travers de simulations intensives ; les résultats montrent des surcoûts acceptables et d’excellentes performances, en termes de taux de hit et de temps de réponse
Hayek, Rabab. "Summary management in P2P systems." Nantes, 2009. http://www.theses.fr/2009NANT2066.
The goal of this thesis is to contribute to the development of data localization and summarization techniques in P2P environments. At the application layer, we focus on exploiting the semantics that can be captured from the shared data. These semantics can improve the search efficiency, and allow for more query facilities. To this end, we introduce a novel data indexing technique into P2P systems that relies on linguistic summarization. Our summaries are synthetic, multidimensional views that support locating relevant data based on their content. More interestingly, they provide intelligible data representations which may return approximate answers for user queries. At the P2P network layer, we focus on exploiting the characteristics of the overlay topology, namely its clustering features, in order to reduce the traffic overhead generated by flooding-based mechanisms. This allows to improve the performance of P2P systems, irrespective of the employment of techniques relying on data semantics at the application layer. To this end, we define a cluster-based search technique which is implemented over a connectivity-based clustering protocol. A connectivity-based clustering protocol aims to discover the natural organization of nodes, based on their connectivity. Thus, it delimits the boundaries of non-overlapping subgraphs (i. E. Clusters) which are loosely connected, and in which nodes are highly connected. In this thesis, we first survey P2P data sharing systems. We focus on the evolution from simple file-sharing systems with limited functionalities, to Peer Data Management Systems (PDMSs) that support advanced applications with more sophisticated data management techniques. Second, we propose a solution for managing linguistic summaries in P2P systems. We define an appropriate summary model and efficient techniques for summary creation and maintenance. We also discuss query processing in the context of summaries. Third, we propose a cluster-based search technique on top of existing connectivity-based clustering protocols. We focus on reducing redundant query messages which unnecessarily overload the system. We validated our solutions through simulation and the results show good performance
Fayçal, Marguerite. "Routage efficace pour les réseaux pair-à-pair utilisant des tables de hachage distribuées." Phd thesis, Paris, Télécom ParisTech, 2010. https://pastel.hal.science/pastel-00521935.
This dissertation is a synthesis of our research at Orange Labs (formerly France Telecom R&D) to answer a problem identified by the aforesaid network operator and concerning peer-to-peer (P2P) streams. The rise of P2P requires new systems to meet the needs of users, but also those of ISPs and other network operators. The former seek permanently quite noticeable high QoS; the latter aim to optimize the use of network resources and to reduce various operations’ and management costs. Hence the interest of this thesis, that aims to let a P2P network be aware of its underlying IP network in order to achieve a system with an efficient routing mechanism that leads to a win-win situation. Our research focuses on systems based on distributed hash tables (DHT), that we study and analyze first. This dissertation begins with an analysis of the main protocols for discovery of dynamic resources in the different P2P architectures. The requirements for efficient P2P routing are then established. Afterwards, discovery techniques for generating and providing underlay network proximity information are presented, followed by techniques and main systems that exploit such information. Our research led to the definition, design, specification and both individual and comparative analysis of two systems: CAP (Context-Aware P2P system) and NETPOPPS (Network Provider Oriented P2P System). The former introduces semantics in the identifiers of peers and objects and is context-aware. The latter simplifies the management of the different identifiers and is network operator oriented: it enables cooperation between P2P traffic and the underlay’s network operator (its policies and network topology)
Fayçal, Marguerite. "Routage Efficace pour les Réseaux Pair-à-Pair utilisant des Tables de Hachage Distribuées." Phd thesis, Télécom ParisTech, 2010. http://pastel.archives-ouvertes.fr/pastel-00521935.
Rosas, Erika. "Services à base de communautés de confiance dans les réseaux P2P." Paris 6, 2011. http://www.theses.fr/2011PA066573.
Gonthier, François-Denis. "Étude de la conception d'un simulateur de réseaux P2P pour l'informatique diffuse." Mémoire, Université de Sherbrooke, 2008. http://savoirs.usherbrooke.ca/handle/11143/4783.
Valenti, Silvio. "La gestion du trafic P2P dans les réseaux modernes : mesure, identification et contrôle." Phd thesis, Paris, Télécom ParisTech, 2011. https://pastel.hal.science/pastel-00645263.
Due to the large diffusion of P2P applications and especially P2P live-streaming, P2P traffic occupies an extremely large portion of overall Internet traffic. In this context, this thesis proposes new instruments to measure, identify and control P2P traffic. Regarding traffic classification, since traditional techniques have a hard time identifying P2P traffic, we propose a new behavioral classifier, Abacus, tailored for P2P live-streaming. Our experiments prove that Abacus, though based on simple counts of packets and bytes exchanged by a host, represents a lightweight and accurate solution for identifying P2P applications. Second, since the huge volume of traffic obliges operators to employ either flow-level monitors (e. G. NetFlow) or packet sampling to cut down the amount of measurement data, we evaluate the impact of data reduction on traffic characterization and classification. We show that Abacus can be adapted to this kind of data, suffering only a minor loss in accuracy and statistical classification remains possible if training and validation data are sampled at the same rate, in spite of the distortion introduced by packet sampling. Finally, we study a new transport protocol for P2P traffic, LEDBAT (Low Extra Delay Background Transport Protocol), the congestion control algorithm of the official BitTorrent client. This delay-based algorithm aims to provide an efficient, lower-than-best-effort service. Though faithful to its goals, the original design of LEDBAT appears affected by a latecomer advantage: we identify the main cause of the unfairness and propose effectives correction that restore the fairness
Valenti, Silvio. "La gestion du trafic P2P dans les réseaux modernes : mesure, identification et contrôle." Phd thesis, Télécom ParisTech, 2011. http://pastel.archives-ouvertes.fr/pastel-00645263.
Martins, Vidal. "Data Replication in P2P Systems." Phd thesis, Université de Nantes, 2007. http://tel.archives-ouvertes.fr/tel-00481828.
Ngo, Hoang Giang. "De l'interconnexion à la coopération des systèmes pair-à-pair." Phd thesis, Université Nice Sophia Antipolis, 2013. http://tel.archives-ouvertes.fr/tel-00937695.
Saddi, Oualid. "Métrologie dans les réseaux Peer-To-Peer." Phd thesis, Université Pierre et Marie Curie - Paris VI, 2007. http://tel.archives-ouvertes.fr/tel-00803195.
Ullah, Ihsan. "Towards user-aware P2P live video streaming systems." Troyes, 2011. http://www.theses.fr/2011TROY0012.
Potential scalability and low deployment cost of the Peer-to-Peer (P2P) architecture makes it a favorable choice for video streaming services. P2P systems involve end-hosts, called peers, in the stream delivery task by turning them into relays. Since peers are controlled by users, their behavior directly impacts the performance of these systems. Current approaches lack a comprehensive consideration of user behavior, hence suffering from Quality-of-Service issues. In this thesis, we focus on user behavior for performance improvement of P2P live streaming systems. To precisely understand the user behavior, we perform a synthesis of its measurements and based on it, we propose both a non-contextual and a contextual model. The former model includes two statistical methods, one based on exponential moving average and the other on Bayesian inference. Both of them only rely on the history of past sessions. The later model consists in a Bayesian network model that takes into account all variables identified in user behavior measurements. We validate our model through simulations over synthetic traces of realistic user behaviors generated through a semi-Markovian model. Finally, we propose two strategies that make use of our models to make P2P live streaming systems user-aware. These mechanisms are aimed at the stabilization of the overlay. Experiments in a LAN environment and over PlanetLab show that our approaches significantly improve the performance of an existing system
Wongsaardsakul, Thirapon. "P2P SIP over mobile ad hoc networks." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2010. http://www.theses.fr/2010TELE0021.
This work presents a novel Peer to Peer (P2P) framework for Session Initiation Protocol (SIP) on Mobile Ad Hoc Network (MANET). SIP is a client-server model of computing which can introduce a single point of failure problem. P2P SIP addresses this problem by using a distributed implementation based on a P2P paradigm. However, both the traditional SIP and P2P SIP architectures are not suitable for MANETs because they are initially designed for infrastructured networks whose most nodes are static. We focus on distributed P2P resource lookup mechanisms for SIP which can tolerate failures resulting from the node mobility. Our target application is SIP-based multimedia communication in a rapidly deployable disaster emergency network. To achieve our goal, we provide four contributions as follows. The first contribution is a novel P2P lookup architecture based on a concept of P2P overlay network called a Structured Mesh Overlay Network (SMON). This overlay network enables P2P applications to perform fast resource lookups in the MANET environment. SMON utilizes a cross layer design based on the Distributed Hashing Table (DHT) and has direct access to OLSR routing information. Its cross layer design allows optimizing the overlay network performance during the change of network topology. The second contribution is a distributed SIP architecture on MANET providing SIP user location discovery in a P2P manner which tolerates single-point and multiple-point of failures. Our approach extends the traditional SIP user location discovery by utilizing DHT in SMON to distribute SIP object identifiers over SMON. It offers a constant time on SIP user discovery which results in a fast call setup time between two MANET users. From simulation and experiment results, we find that SIPMON provides the lowest call setup delay when compared to the existing broadcast-based approaches. The third contribution is an extended SIPMON supporting several participating MANETs connected to Internet. This extension (SIPMON+) provides seamless mobility support allowing a SIP user to roam from an ad hoc network to an infrastructured network such as Internet without interrupting an ongoing session. We propose a novel OLSR Overlay Network (OON), a single overlay network containing MANET nodes and some nodes on the Internet. These nodes can communicate using the same OLSR routing protocol. Therefore, SIPMON can be automatically extended without modifying SIPMON internal operations. Through our test-bed experiments, we prove that SIPMON+ has better performance in terms of call setup delay and handoff delay than MANET for Network Mobility (MANEMO). The fourth contribution is a proof-of-concept and a prototype of P2P multimedia communication based on SIPMON+ for post disaster recovery missions. We evaluate our prototype and MANEMO-based approaches through experimentation in real disaster situations (Vehicle to Infrastructure scenarios). We found that our prototype outperforms MANEMO-based approaches in terms of call setup delay, packet loss, and deployment time
Valero, Mathieu. "Enhancing performance and reliability of tree based P2P overlays." Paris 6, 2011. http://www.theses.fr/2011PA066600.
Sokhn, Maria. "Plateforme de recherche basée d'information multimédia guidée par une ontologie dans une architecture paire à paire." Phd thesis, Télécom ParisTech, 2011. http://pastel.archives-ouvertes.fr/pastel-00678039.
Ellouze, Selim. "Mécanismes de collaboration entre réseaux et services applicatifs pour l'optimisation des ressources et des services." Thesis, Rennes 1, 2013. http://www.theses.fr/2013REN1S050/document.
In this new digital world, driven by the dominance of a model based on the opportunities offered by global access to the Internet and its killer app: the World Wide Web, access to information is becoming a matter of a good experience and responsiveness. We are witnessing the Web services are of increasing popularity. New types of terminals are proposed. Communications technologies are improved. Users expectations are becoming higher. In such a context, network operators are facing serious challenges arising from the management of a massive traffic growth, largely driven by the increasing amount of video streams while internet services providers are also concerned by the issue of providing an adequate quality of experience to their end-users. For both actors, these dual trends present both challenges and opportunities. The challenges arise from the issues of managing the growing demand for traffic while maintaining appropriate quality of experience for users. Opportunities come from a smart management of the increasing demands of Web services in terms of quality of services and of the resources that will support the delivery of these services. It is then crucial for each actor to be well-positioned in the value chain to take part in this process. The role that will be played by the networks, as a basic set of oversized pipes, or as an intelligent network providing advanced management facilities, perfectly illustrates this issue. These two alternatives are respectively known as the "dumb-pipe" or "smart networks". In this thesis, we consider a new approach, which is simple, effective and adapted to meet these challenges. Network operators and service providers can mutually benefit from improving the data delivery in the networks while continuing to fully control their infrastructures. This collaborative approach is the starting bloc of our work aiming at defining a framework, an architecture and appropriate procedures to bring these actors to work together to manage this problem. This collaboration is particularly necessary because each actor, though prisoner of its constraints and capacities, can turn them into a contractual relation with the other in a client-supplier process for the optimization of traffic management
Mushtaq, Mubashar. "Transport Adaptatif et Contrôle de la Qualité des Services Vidéo sur les Réseaux Pair-à-Pair." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2008. http://tel.archives-ouvertes.fr/tel-00365818.
Ismail, Anis. "Communautés dans les réseaux sémantiques pairs-à-pairs." Thesis, Aix-Marseille 2, 2010. http://www.theses.fr/2010AIX22057/document.
The first part of this thesis is dedicated to the state of the art on the peer-to-peer networks, the information retrieval in such networks, and the problematic of data mining in the peer-to-peer context more particularly on clustering methods and decision trees.The second part deals with networks where peers have their own data schemas. We examine more particularlythe fundamentals and functioning of the system “SenPeer”. Then, we propose an architecture supporting acommunity organization of semantic peer-to-peer networks. This allows us to build peer-to-peer semantic structured communities called cSON (Communauty Semantic Overlay Network).This raises many questions concerning the explanation of communities and their operating to improve performances (response time, number of messages, precision and recall). To build communities, we study two different alternatives: (1) Semantic Mediation: the building of communities is based on semantic links between super-peers and the confidence that they have between them and (2) Clustering: a clustering algorithm, based onthe analysis of queries processed by the super-peers, is the base of community building. Then, we propose twomethods to calculate the characterizations of communities in the two research fields: (1) Data mining: we try to characterize each community using knowledge extracted from applications processed by his super-peers of the same community CK (Community Knowledge) and (2) Hypergraphs: Unlike the previous method, our goal nowis to characterize the communities collectively. We formalize this problem as the research of the MCS (minimalcovering shortcuts) which are shortcuts between the super-peers, minimum shortcuts covering all communities.Then, we develop two methods of queries routing CK-rooting and MCS-rooting respectively using community knowledge and MCS to identify the super-peers may process a given query.In the third section, we present the simulator developed to support the cSON approach. We present the empirical results representing the simulations and which show a significant improvement of performance of the approachonly based on semantic mediation.This part ends with a description of an application of information retrieval based on sharing enriched scientific documents
Palma, Munoz Wenceslao Enrique. "Traitement de requêtes de jointures continues dans les systèmes pair-à-pair (P2P) structurés." Nantes, 2010. http://www.theses.fr/2010NANT2024.
Recent years have witnessed the growth of a new class of data-intensive applications that do not fit the DBMS data model and querying paradigm. Instead, the data arrive at high speeds taking the form of an unbounded sequence of values (data streams) and queries run continuously returning new results as new data arrive. In these applications, data streams from external sources flow into a Data Stream Management System (DSMS) where they are processed by different operators. Many applications share the same need for processing data streams in a continuous fashion. For most distributed streaming applications, the centralized processing of continuous queries over distributed data is simply not viable. This research addresses the problem of computing continuous join queries over distributed data streams. We present a new method, called DHTJoin that exploits the power of a Distributed Hash Table (DHT) combining hash-based placement of tuples and dissemination of queries by exploiting the embedded trees in the underlying DHT, thereby incuring little overhead. Unlike state of the art solutions that index all data, DHTJoin identifies, using query predicates, a subset of tuples in order to index the data required by the user’s queries, thus reducing network traffic. DHTJoin tackles the dynamic behavior of DHT networks during query execution and dissemination of queries. We provide a performance evaluation of DHTJoin which shows that it can achieve significant performance gains in terms of network traffic
Mathieu, Fabien. "Autour du pair-à-pair : distribution de contenus, réseaux à préférences acycliques." Habilitation à diriger des recherches, Université Pierre et Marie Curie - Paris VI, 2009. http://tel.archives-ouvertes.fr/tel-00667414.
Ta, Tuan Anh. "Web sémantique et réseaux sociaux - Construction d'une mémoire collective par recommandations mutuelles et représentations." Phd thesis, Télécom ParisTech, 2005. http://pastel.archives-ouvertes.fr/pastel-00001312.
Daouda, Ahmat mahamat. "Définition d'une infrastructure de sécurité et de mobilité pour les réseaux pair-à-pair recouvrants." Thesis, Bordeaux, 2014. http://www.theses.fr/2014BORD0186/document.
Securing communications in distributed dynamic environments, that lack a central coordination point and whose topology changes constantly, is a major challenge.We tackle this challenge of today’s P2P systems. In this thesis, we propose to define a security infrastructure that is suitable to the constraints and issues of P2P systems. The first part of this document presents the design of SEMOS, our middleware solution for managing and securing mobile sessions. SEMOS ensures that communication sessions are secure and remain active despite the possible disconnections that can occur when network configurations change or a malfunction arises. This roaming capability is implemented via the definition of a new addressing space in order to split up addresses for network entities with their names ; the new naming space is then based on distributed hash tables(DHT). The second part of the document presents a generic and distributed mechanism for a key exchange method befitting to P2P architectures. Building on disjoint paths andend-to-end exchange, the proposed key management protocol consists of a combination of the Diffie-Hellman algorithm and the Shamir’s (k, n) threshold scheme. On the onehand, the use of disjoint paths to route subkeys offsets the absence of the third party’s certified consubstantial to Diffie-Hellman and reduces, at the same time, its vulnerability to interception attacks. On the other hand, the extension of the Diffie-Hellman algorithm by adding the threshold (k, n) scheme substantially increases its robustness, in particular in key splitting and / or in the case of accidental or intentional subkeys routing failures. Finally, we rely on a virtual mobile network to assess the setup of secure mobile sessions.The key management mechanism is then evaluated in an environment with randomly generated P2P topologies
Merle, Frédéric. "Proposition d'une grille d'analyse pour la composition de systèmes P2P adaptés aux contextes applicatifs." Troyes, 2012. http://www.theses.fr/2012TROY0028.
With the democratization of the Internet and the development of large scale distributed systems, the peer-to-peer, or P2P, has emerged as an alternative to the Client/Server model. Thus, since the early 2000s, numerous systems based on the P2P model have been developed, leading to the proposal of many different systems. But much of the optimizations proposed in these systems can hardly be reuse. The question that arises is to find a way to facilitate the reusability of the optimizations and concepts developed in the 2000s to compose P2P systems adapted to different application contexts. To do so, we analyzed the existing P2P systems to define functional blocks common to each system and the different kind of approaches that have been proposed for each of these blocks. From this information, we propose an analytical framework to link the needs of a given application context to existing approaches for each building blocks of a P2P system. To test our analytical framework, we use it to define P2P systems adapted to two application contexts: a provider of home services and scientific archives. With these two cases of studies we have shown that our analytical framework allows reuse approaches that have been developed in other applications contexts to elaborate original and efficient systems
Wongsaardsakul, Thirapon. "P2P SIP over mobile ad hoc networks." Phd thesis, Institut National des Télécommunications, 2010. http://tel.archives-ouvertes.fr/tel-00712171.
Rattanapoka, Choopan. "P2P-MPI : A fault-tolerant Message Passing Interface Implementation for Grids." Phd thesis, Université Louis Pasteur - Strasbourg I, 2008. http://tel.archives-ouvertes.fr/tel-00724132.
Jebbour, Benaissa. "La gouvernance des organisations en réseau a-t-elle un sens ? : Cas du PPP chez Vinci-SA." Phd thesis, Conservatoire national des arts et metiers - CNAM, 2012. http://tel.archives-ouvertes.fr/tel-00752097.
Dedzoe, Kokou. "Traitement de requêtes Top-k dans les communautés virtuelles P2P de partage de données." Nantes, 2011. http://www.theses.fr/2011NANT2084.
Top-k queries have two main advantages for peer-to-peer (P2P) data sharing virtual communities. First, they allow participants to rank the results for their queries based on the existing data in the system as well as on their own preferences. Second, they avoid overwhelming participants with too many results. However, existing top-k query processing techniques for P2P systems make users suffer from long waiting times. This becomes even more problematic in overloaded P2P systems. In this thesis, we first revisit the top-k query processing problem and introduce two new measures: the stabilization time and the cumulative quality gap. These two novel measures, in addition to existing measures, allow for better evaluating the behavior of top-k query processing techniques. We then propose a new family of top-k query processing techniques (ASAP) that allows to return high quality results as soon as possible. Finally, we study the problem of top-k query processing in overloaded systems. As a result, we propose a new approach, called QUAT, that relies on synthetic data descriptions of peers in order to allow peers to prioritize queries for which they can provide high quality results
Alshattnawi, Sawsan. "Concurrence et Conscience de Groupe dans l'Édition Collaborative sur Réseaux Pair-à-Pair." Phd thesis, Université Henri Poincaré - Nancy I, 2008. http://tel.archives-ouvertes.fr/tel-00349074.
Cholez, Thibault. "Supervision des réseaux pair à pair structurés appliquée à la sécurité des contenus." Phd thesis, Université Henri Poincaré - Nancy I, 2011. http://tel.archives-ouvertes.fr/tel-00608907.
Mazyad, Hanaa. "Une approche Multi-agents à Architecture P2P pour l'apprentissage collaboratif." Phd thesis, Université du Littoral Côte d'Opale, 2013. http://tel.archives-ouvertes.fr/tel-00845225.
Rohmer, Thibaud. "Analysis, modelling, and optimisation of a peer-to- peer-based video-on-demand streaming system." Thesis, Paris Est, 2014. http://www.theses.fr/2014PEST1184/document.
Due to its growing success with consumers as a preferred way to access video content, VoD (Video On Demand) services streaming is gaining unprecedented interest from the IPTV and the Internet video streaming industries alike. Unlike the rigid linear video services programming that is the norm in broadcast TV, the on-demand content access provides a great flexibility allowing end-users to browse and consume video content in a non-scheduled way. Besides providing a VoD offering to meet evolving end-users expectations for flexibility and differed-time access, it is today very important for a service provider to offer a very large content library (popular and niche content) to capture the broadest audience possible. Targeting a very large audience with a large video content library puts a very heavy burden on service providers with scalability being the chief design issue