Bibliografie tematiche / Peer to peer

Indice

Articoli di riviste
Tesi
Libri
Capitoli di libri
Atti di convegni
Rapporti di organizzazioni

Letteratura scientifica selezionata sul tema "Peer to peer"

Autore: Grafiati

Pubblicato: 4 giugno 2021

Ultima modifica: 8 giugno 2024

Cita una fonte nei formati APA, MLA, Chicago, Harvard e in molti altri stili

Scegli il tipo di fonte:

Consulta la lista di attuali articoli, libri, tesi, atti di convegni e altre fonti scientifiche attinenti al tema "Peer to peer".

Accanto a ogni fonte nell'elenco di riferimenti c'è un pulsante "Aggiungi alla bibliografia". Premilo e genereremo automaticamente la citazione bibliografica dell'opera scelta nello stile citazionale di cui hai bisogno: APA, MLA, Harvard, Chicago, Vancouver ecc.

Puoi anche scaricare il testo completo della pubblicazione scientifica nel formato .pdf e leggere online l'abstract (il sommario) dell'opera se è presente nei metadati.

Articoli di riviste sul tema "Peer to peer"

Coggans, Niall, e Susan McKellar. "Drug Use Amongst Peers: peer pressure or peer preference?" Drugs: Education, Prevention and Policy 1, n. 1 (gennaio 1994): 15–26. http://dx.doi.org/10.3109/09687639409028532.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Jin, Xin, Yu-Kwong Kwok e Jian Deng. "Variegated competing peer-to-peer systems with selfish peers". Computer Networks 75 (dicembre 2014): 313–30. http://dx.doi.org/10.1016/j.comnet.2014.10.017.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Gee, Henry. "Peers slam peer review". Nature 355, n. 6360 (febbraio 1992): 488. http://dx.doi.org/10.1038/355488a0.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Vassilakis, Dimitrios K., e Vasilis Vassalos. "An analysis of peer-to-peer networks with altruistic peers". Peer-to-Peer Networking and Applications 2, n. 2 (16 gennaio 2009): 109–27. http://dx.doi.org/10.1007/s12083-008-0024-4.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

WATANABE, KENICHI, e MAKOTO TAKIZAWA. "SERVICE ORIENTED COOPERATION AMONG TRUSTWORTHY PEERS". Journal of Interconnection Networks 07, n. 04 (dicembre 2006): 507–33. http://dx.doi.org/10.1142/s0219265906001831.

Testo completo

Abstract (sommario):

Various types of applications make access to objects distributed in peer-to-peer (P2P) overlay networks. Even if the locations of target objects are discovered by some look-up algorithm such as flooding and distributed hash table (DHT), applications cannot manipulate the target objects without access rights. It is critical to perceive which peer can manipulate an object in which method, i.e. only a peer authorized with an access right is allowed to manipulate an object. Hence, an application has to find peers which can manipulate a target object rather than detect the location of the target object. Due to the scalability, variety, and autonomy of peers, it is difficult, may be impossible to maintain a centralized directory showing in which peer each object is distributed. An acquaintance peer of a peer p is a peer whose service the peer p knows and with which the peer p can directly communicate. We discuss types of acquaintance relations of peers with respect to what objects each peer holds, is allowed to manipulate, and can grant access rights on. Acquaintance peers of a peer may notify the peer of different information on target peers due to communication and propagation delay. Here, it is critical to discuss how much a peer trusts each acquaintance peer. We first define the satisfiability of an acquaintance peer, i.e. how much a peer is satisfied by issuing an access request to the acquaintance peer. For example, if a peer p locally manipulates a target object o and obtains a response, p is mostly satisfied. On the other hand, if the peer p has to ask another peer to manipulate the object o, the peer p is less satisfied. We define the trustworthiness and ranking factor of an acquaintance peer obtained by accumulating the satisfiability of each interaction with the acquaintance peer. Differently from traditional reputation concepts, trustworthiness information only from trustworthy acquaintance peers can be used to obtain the ranking factor. The trustworthiness of an acquaintance peer shows how much a peer can trusts the acquaintance peer while the ranking factor of an acquaintance peer shows how much the acquaintance peer is trusted by other trustworthy acquaintance peers. Then, we evaluate the trustworthiness and ranking factor in presence of faulty peers.

Gli stili APA, Harvard, Vancouver, ISO e altri

Brack, Amy Badura, Michele Millard e Kinjal Shah. "Are Peer Educators Really Peers?" Journal of American College Health 56, n. 5 (1 marzo 2008): 566–68. http://dx.doi.org/10.3200/jach.56.5.566-568.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Mitchell, Ojmarrh. "Peers and police peer misconduct". Nature Human Behaviour 3, n. 8 (27 maggio 2019): 774–75. http://dx.doi.org/10.1038/s41562-019-0613-7.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Abinaya, I., e S. Faizal Mukthar Hussian. "Efficient Equalization Work in Peer-to-Peer System". Asian Journal of Computer Science and Technology 1, n. 1 (5 maggio 2012): 65–68. http://dx.doi.org/10.51983/ajcst-2012.1.1.1667.

Testo completo

Abstract (sommario):

Peer-to-peer (P2P) architectures present benefits like scalability, load balancing and fault tolerance when compared to Client/Server architectures. Structured P2P systems furthermore feature efficient lookup mechanisms: an exact search is usually performed with logarithmic complexity relative to the number of peers in the system. The notion of virtual servers, peers participating in a heterogeneous, structured peer-to-peer (P2P) network may host different numbers of virtual servers, and by migrating virtual servers, peers can balance their loads proportional to their capacities close by in the address space. Load balancing is a critical issue for the efficient operation of peer-to-peer networks.This project include a simple protocol that balances load by moving nodes to arbitrary locations “where they are needed.”

Gli stili APA, Harvard, Vancouver, ISO e altri

Ed-daoui, Ilyas, Abdelkhalak El Hami, Mhamed Itmi, Nabil Hmina e Tomader Mazri. "Unstructured Peer-to-Peer Systems: Towards Swift Routing". International Journal of Engineering & Technology 7, n. 2.3 (8 marzo 2018): 33. http://dx.doi.org/10.14419/ijet.v7i2.3.9963.

Testo completo

Abstract (sommario):

In this paper, we contribute to the enhancement of routing in unstructured Peer-to-Peer (P2P) systems. Our contribution aims to propose an alternative to the repetitive interactions between peers in discovery which waste considerable time. We propose a methodology that seeks effectiveness and swiftness. Contrary to classic and heuristic-based routing strategies, the main goal of our proposition is that every peer prepares a database at the integration phase. The database includes information about peers, locations, routes to every destination, etc. Every peer possesses its own database and is able to update it whenever a change occurs in the system. Changes refer to the integration of new peers and the dissociation of existing ones. Theoretically, the communication between peers will become significantly quicker since every peer knows enough information about the other peers forming the system. The application of our strategy demonstrates its fitness to the proposed system model in addition to its celerity and relevance.

Gli stili APA, Harvard, Vancouver, ISO e altri

GARCÉS-ERICE, L., E. W. BIERSACK, K. W. ROSS, P. A. FELBER e G. URVOY-KELLER. "HIERARCHICAL PEER-TO-PEER SYSTEMS". Parallel Processing Letters 13, n. 04 (dicembre 2003): 643–57. http://dx.doi.org/10.1142/s0129626403001574.

Testo completo

Abstract (sommario):

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Tesi sul tema "Peer to peer"

Brasini, Nicholas. "Confronto tra meccanismi di anonimizzazione per il cloud peer-to-peer". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/19422/.

Testo completo

Abstract (sommario):

Lo scopo principale di questa tesi è quello di implementare la rete di anonimizzazione Invisible Internet Project (I2P) all'interno di un prototipo esistente basato su un'architettura cloud peer-to-peer (P2P). Tale prototipo implementa al proprio interno la rete di anonimizzazione The Onion Router (Tor) e il secondo obiettivo di questa tesi è quello di analizzare e valutare le performance offerte da queste due tipologie di reti. Il prototipo, basandosi su un sistema decentralizzato P2P che, rispetto a quello centralizzato non ha il problema di rappresentare un single point of failure, permette la scoperta di peer all'interno della rete mediante algoritmi di gossip, abili a riconoscere i churn, ovvero quei nodi appartenenti alla rete che si sono disconnessi non facendone più parte. In questo modo ogni peer sarà aggiornato sullo stato dei peer conosciuti e riuscirà ad eliminare dal proprio elenco i peer disconnessi dalla rete evitando di contattarli inutilmente. Oltre alla funzionalità di ricerca di altri peer all'interno della rete, il prototipo mette a disposizione algoritmi e script utili per poter monitorare la rete stessa ed il suo comportamento e per poter costruire overlay tra alcuni dei peer appartenenti alla rete.

Gli stili APA, Harvard, Vancouver, ISO e altri

Liu, Nianwang, e 刘年旺. "Request peer selection for peer-to-peer streaming". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/206752.

Testo completo

Abstract (sommario):

As the Internet develops and technology evolves, multimedia traffic dominates the Internet. Traditional client-server based video streaming solutions are expensive and suffering from the scalability issue. Inspired by the immense success and efficiency of BitTorrent in distributing file contents to large groups of users, the peer-to-peer (P2P) paradigm has been adopted to provide streaming services including both P2P video-on-demand (VoD) and P2P live streaming. Among the design challenges, one open yet fundamental question is, how to identify the most suitable neighbor for a peer to make a piece request. We refer this problem as the request peer selection problem. Properly allocating the piece request to potential providers is essential to the system and would help to balance the load at each peer. A well designed request peer selection algorithm increases the requestor’s probability to download the desired piece timely which leads to enhanced video quality and improved playback continuity. This thesis aims to enhance the overall system performance by proposing optimized request peer selection algorithms for both P2P VoD and P2P live streaming systems. In P2P VoD, participating peers start playback from the very beginning of a stored video. The playback-points of peers, as well as the amount of video contents/pieces the peers cached, depend on when they join the video session, or their viewing ages. The content buffered by younger peers is a subset of older peers, thus collaborative piece exchange among peers is undermined due to the unbalanced supply and demand. To address this issue, a playback-point based request peer selection algorithm: closest playback-point first (CPF) is proposed. Specifically, when a peer requests a particular video piece, among the set of potential providers, a request is sent to the peer that has the smallest playback-point difference with itself. With CPF, peers with similar content availability are loosely grouped into clusters to maximize the utilization of individual peer’s upload capacity. Extensive packet level simulations show that with CPF, the video playback quality is enhanced and the VoD server load is significantly reduced. Unlike P2P VoD, P2P live streaming systems have to meet real-time playback constraints, which makes it even more challenging. To better regulate the network traffic and to balance the load among peers, a service response time (SRT) based request peer selection algorithm is proposed. In particular, a peer in the network estimates the service response time (SRT) between itself and each neighboring peer. SRT is measured from when a data piece request is sent until the requested piece arrives. When a peer makes a piece request, the neighbor with smaller SRT and fewer data pieces would be favored. The rationale is: smaller SRT implies excess serving capacity and fewer data pieces suggests fewer potential piece requests received. Extensive packet level simulations show that the traffic load in the network is better balanced, the streaming server load is reduced, and the overall quality of service, measured by playback continuity, startup delay etc., is improved.
published_or_final_version
Electrical and Electronic Engineering
Master
Master of Philosophy

Gli stili APA, Harvard, Vancouver, ISO e altri

Schreiber, Daniel. "Peer-To-Peer-Videostreaming". Master's thesis, Universitätsbibliothek Chemnitz, 2005. http://nbn-resolving.de/urn:nbn:de:swb:ch1-200501398.

Testo completo

Abstract (sommario):

Für Übertragung von Live-Videodaten an mehrere Empfänger gibt es als etablierte Technologien die Übertragung per Multicast an mehrere Empfänger sowie die Unicast-Übertragung an jeden Empfänger von einem Verteilpunkt aus. Nachteilig ist im ersten Fall, dass viele ISPs kein Multicast unterstützen, im zweiten Fall der hohe Bandbreitenbedarf am Verteilpunkt. Die Unterschiede in der verfügbaren Bandbreite von ISP-Zugängen (DSL, ISDN) und Campusnetzwerken (z.B. Studentennetzen) erfordern es, das Videomaterial in mehreren Qualitätsstufen anzubieten. Im Team wurde ein System entworfen und realisiert, das aus einer Quelle effizient verschiedene Qualitätsstufen des Videomaterials erzeugt ("Videoteil") und dieses mittels Peer-To-Peer-Technologie verteilt ("Netzwerkteil"). Diese Arbeit enthält den den Netzwerkteil.

Gli stili APA, Harvard, Vancouver, ISO e altri

Magnani, Marco. "Progettazione e implementazione di un protocollo Peer-to-Peer per il sensing partecipativo". Master's thesis, Alma Mater Studiorum - Università di Bologna, 2011. http://amslaurea.unibo.it/2686/.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Ehrig, Matthias. "Workshop Peer-to-Peer-Computing". Universitätsbibliothek Chemnitz, 2002. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-200201175.

Testo completo

Abstract (sommario):

Gemeinsamer Workshop von Universitaetsrechenzentrum und Professur Rechnernetze und verteilte Systeme der Fakultaet fuer Informatik der TU Chemnitz. Vortraege zu verschiedenen Themen der Entwicklung der Informatik und zu Technologien im Rechenzentrum einer Universitaet

Gli stili APA, Harvard, Vancouver, ISO e altri

Babbar, Abhimanyu. "Peer to Peer Search Protocol". Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-186713.

Testo completo

Abstract (sommario):

Decentralized full-text search is still an unsolved problem in peer-to-peer research. As part of this thesis, we introduce Sweep, a fully decentralized full-text search engine built on Apache Lucene, that takes significant steps towards providing reliable, low-latency, and accurate search results. Our main contributions include a novel gossip-based protocol for fast and efficient replication of the search index and a protocol for the automated sharding of the search index. Therefore, each peer maintains a replica of a bounded-size subset of the whole search index also known as shard. Our approach is based on a low overhead gossip-based leader selection algorithm within each shard, whose cost is independent of the number of peers. For each shard, peers add new index entries to the leader group, and peers securely pull updates within their shard using a Gradient topology that ensures efficient dissemination of updates in log(N) hops within the shard. The full-text search involves a fanout search to each shard, with latency variance reduction techniques to help achieve low response times. We show in simulation the viability of our approach and its robustness to failures and flash crowds.

Gli stili APA, Harvard, Vancouver, ISO e altri

Waller, Michael, e Emelie Salleke. "Peer-to-peer som företagslösning". Thesis, Blekinge Tekniska Högskola, Institutionen för programvaruteknik och datavetenskap, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-2378.

Testo completo

Abstract (sommario):

Problemområde: Idag är användandet av peer-to-peer (P2P) - applikationer såsom KaZaa, ICQ och Seti@home utbrett bland privatpersoner. Användningen inom företag är dock ännu i sin linda. Vi kommer därför i den här uppsatsen utreda om ett eventuellt införande av P2P- teknik i ett företagsnätverk ger några fördelar jämfört med en klassisk Client/Server-lösning. Hypotes: Arbetet bygger på hypotesen: ?En P2P-lösning ger fördelar för företaget jämfört med en Client/Server-lösning? Genomförande: För jämförelsen mellan P2P och Client/Server definierades och jämfördes fem områden: Säkerhet, Användbarhet, Tillgänglighet, Bandbredd samt Utrustningskrav. Slutsats: Inom områdena Användbarhet och Tillgänglighet ger en P2P-lösning klara fördelar, däremot inom områdena Säkerhet och Bandbredd visar Client/Server- lösningen istället klara fördelar. Området Utrustningskrav är oavgjort då det inte finns någon märkbar skillnad på lösningarna. Säkerhetsproblemen är P2P-teknologins akilleshäl och det problem som är mest troligt att stoppa stora investeringar i framtiden om det inte löses. Slutsatsen av vår jämförelse blir sålunda: För ett företag som redan har ett existerande Client/Server-nätverk är det inte någon idé att helt byta system, däremot kan det vara av intresse att introducera en applikation som möjliggör skapandet av så kallade Virtuella Nätverk. För ett helt nytt företag kan skapandet av ett P2P-nätverk vara ett väl så intressant alternativ till Client/Server. Detta förutsätter dock att säkerheten inte är så viktig för företaget eller att säkerhetsproblemen lösts.

Gli stili APA, Harvard, Vancouver, ISO e altri

Hu, Tim Hsin-ting Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Restructuring peer-to-peer networks". Awarded by:University of New South Wales. School of Electrical Engineering and Telecommunications, 2006. http://handle.unsw.edu.au/1959.4/25171.

Testo completo

Abstract (sommario):

The popularity of peer-to-peer networks has grown tremendously in recent times as a result of the ever-improving capabilities of host entities at the edge and the ubiquitous reach of the Internet. The growth has fueled the realization of many peer-to-peer networks in both academia and the commercial arena. Peer-to-peer networks generally fall into one of these categories ??? centralized systems with server-like entities in the network; unstructured systems with random topology and message routing, and structured systems with deterministic topology and routing behavior. Surveying the major peer-to-peer networks in each category, one can conclude that the each of the categories exhibit very different characteristics and properties from one another. This thesis addresses the problems in the peer-to-peer networking space by employing two overarching principles. Firstly, desirable properties of systems in one category can be adopted by another to achieve restructuring. In short, restructuring involves the injection of structure into unstructured networks and conversely loosening the rigidity in structured systems. Secondly, as much as possible, participating peers in the network are designed to be homogeneous in functionality recognizing that they are heterogeneous in capabilities. True to the concept of the peer-to-peer paradigm, this principle keeps participants functioning as fellow peers rather than imposing hierarchical differences in the roles within the network. We describe three contexts in which the issues pertaining to the peer-to-peer networks in view can be addressed by applying the principle of restructuring. For the Mobile Agent Peer-to-Peer architecture, we adopt centralized concepts into the unstructured peer-to-peer network while maintaining homogeneity in functionality through the use of mobile agents. The architecture shields excessive traffic from peers with limited resources and allows more capable peers to share others??? burden. Through the use of mobile agents, logical hierarchy is avoided and thus the second overarching principle of homogeneity is preserved. For Gnutella Clusters, concepts from the structured systems are adopted to facilitate the formation and maintenance of clustering in unstructured networks. Clustering limits the amount of flooding in the network and thus conserves bandwith. The clustering algorithm is decentralized to all peers, and does not need a set of participants to have special functionality ??? thus preserving the generic nature of all peers. In Autonomic Decentralized Service Directory platform, structure is released from the underlying Chord network to provide better support for service registration and searching. The strict requirements for deterministic routing and lookup which characterize structured systems are granted some leniency for the ability to avoid misbehaving nodes and provide incentives for peers to behave properly.

Gli stili APA, Harvard, Vancouver, ISO e altri

Blomqvist, Ulf. "Mediated peer (to peer) learning". Licentiate thesis, Stockholm, 2006. http://www.diva-portal.org/kth/theses/abstract.xsql?dbid=3989.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

BRACCIALE, LORENZO. "Peer-to-peer multimedia communication". Doctoral thesis, Università degli Studi di Roma "Tor Vergata", 2010. http://hdl.handle.net/2108/1308.

Testo completo

Abstract (sommario):

I sistemi Peer-to-Peer (P2P) sono stati inventi, messi in campo e studiati da più di dieci anni, andando al di là della semplice applicazione per scambio di file. Nelle reti P2P i partecipanti si organizzano in una rete "overlay" che è astratta rispetto alle caratteristiche della sottostante rete fisica. Scopo di questi sistemi è la distribuzione di risorse quali contenuti, spazio di memorizzazione o cicli macchina. Gli utenti quindi giocano un ruolo attivo e possono essere considerati come sia clienti che serventi allo stesso tempo per il particolare servizio che la rete P2P offre. Lo scopo di questa tesi di dottorato è lo studio di questi sistemi ed il dare un contributo nella loro analisi prestazionale. L'analisi mira a valutare le prestazioni raggiunte dai sistemi e/o i limiti teorici raggiungibili. Infatti, nonostante esistano diversi meccanismi per il peer-to-peer streaming, l'analisi prestazionale di questo tipo di sistemi può essere considerata ancora nella sua infanzia. A questo scopo, i contributi principali di questa tesi di dottorato sono: i)la derivazione di un limite teorico per il ritardo nei sistemi di P2P streaming, ii) la creazione di un algoritmo che sfrutti le conoscenze acquisite attraverso il lavoro teorico, iii) l'analisi prestazionale dell'algoritmo utilizzando un simulatore espressamente progettato per riprodurre le caratteristiche delle reti P2P reali composte da centinaia di migliaia di nodi che si connettono e disconnettono in continuazione.
Peer-to-Peer (P2P) systems have been invented, deployed and researched for more than ten years and went far beyond the simple ﬁle sharing applications. In P2P networks, participants organize themselves in an overlay network that abstracts from the topological characteristics of the underlying physical network. Aim of these systems is the distribution of some kind of resources like contents, storage, or CPU cycles. Users, therefore, play an active role so that they can be considered as client and server at the same time, for the particular service that is provided through the P2P paradigm. Goal of this dissertation thesis is to study these systems, and give contributes in their performance evaluation. The analysis will aim to evaluate the achieved performance of a system and/or the performance bounds that could be achievable. In fact, even if there are several proposals of diﬀerent systems, peer-to-peer streaming performance analysis can be considered still in its infancy and there is still a lot of work to do. To this aim, the main contributes of this dissertation thesis are i) the derivation of a theoretical delay bounds for P2P streaming system ii) II the creation of an algorithm that exploits the new insights that come out from the theoretical study iii) the performance evaluation of this algorithm using an ad-hoc simulator, expressly tailored to reproduce the characteristics of the real-world P2P streaming systems, composed by hundred thousands of intermittently connected users.

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Libri sul tema "Peer to peer"

Schoder, Detlef, Kai Fischbach e René Teichmann, a cura di. Peer-to-Peer. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-642-56176-4.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Costello, Barbara J. Peer Pressure, Peer Prevention. New York : Routledge, 2016.: Routledge, 2016. http://dx.doi.org/10.4324/9781315668055.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Druschel, Peter, Frans Kaashoek e Antony Rowstron, a cura di. Peer-to-Peer Systems. Berlin, Heidelberg: Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45748-8.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Vu, Quang Hieu, Mihai Lupu e Beng Chin Ooi. Peer-to-Peer Computing. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-03514-2.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Noam, Eli M., e Lorenzo Maria Pupillo, a cura di. Peer-to-Peer Video. New York, NY: Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-76450-4.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Peers, pirates, and persuasion: Rhetoric in the peer-to-peer debates. West Lafayette, Ind: Parlor Press, 2006.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

United Nations Office on Drugs and Crime e Global Youth Network, a cura di. Peer to peer: Using peer to peer strategies for drug abuse prevention. New York: United Nations, 2003.

Cerca il testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Aberer, Karl. Peer-to-Peer Data Management. Cham: Springer International Publishing, 2011. http://dx.doi.org/10.1007/978-3-031-01847-3.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Fitzek, Frank H. P., e Hassan Charaf, a cura di. Mobile Peer to Peer (P2P). Chichester, UK: John Wiley & Sons, Ltd, 2009. http://dx.doi.org/10.1002/9780470747889.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Castro, Miguel, e Robbert van Renesse, a cura di. Peer-to-Peer Systems IV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11558989.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Più fonti

Capitoli di libri sul tema "Peer to peer"

Shekhar, Shashi, e Hui Xiong. "Peer to Peer". In Encyclopedia of GIS, 854. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_969.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Kao, Ming-Yang. "Peer to Peer". In Encyclopedia of Algorithms, 640. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_285.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Gassmann, Oliver, Karolin Frankenberger e Michaela Csik. "Peer-to-Peer". In Geschäftsmodelle entwickeln, 196–98. München: Carl Hanser Verlag GmbH & Co. KG, 2013. http://dx.doi.org/10.3139/9783446437654.040.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Gassmann, Oliver, Karolin Frankenberger e Michaela Choudury. "Peer-to-Peer". In Geschäftsmodelle entwickeln, 282–87. München: Carl Hanser Verlag GmbH & Co. KG, 2020. http://dx.doi.org/10.3139/9783446467620.040.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Leasure, Bruce, David J. Kuck, Sergei Gorlatch, Murray Cole, Gregory R. Watson, Alain Darte, David Padua et al. "Peer-to-Peer". In Encyclopedia of Parallel Computing, 1498–506. Boston, MA: Springer US, 2011. http://dx.doi.org/10.1007/978-0-387-09766-4_278.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Gassmann, Oliver, Karolin Frankenberger e Michaela Csik. "Peer-to-Peer". In Geschäftsmodelle entwickeln, 263–67. München: Carl Hanser Verlag GmbH & Co. KG, 2017. http://dx.doi.org/10.3139/9783446452848.040.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Rennie, Frank, e Keith Smyth. "Peer-to-peer". In Digital Learning: The Key Concepts, 114. 2^a ed. London: Routledge, 2019. http://dx.doi.org/10.4324/9780429425240-152.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Kiisel, Ty. "Peer-to-Peer Loans". In Getting a Business Loan, 129–38. Berkeley, CA: Apress, 2013. http://dx.doi.org/10.1007/978-1-4302-4999-3_13.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Datta, Anwitaman. "Peer-to-Peer Storage". In Encyclopedia of Database Systems, 1–8. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_1216-2.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Galuba, Wojciech, e Sarunas Girdzijauskas. "Peer-to-Peer System". In Encyclopedia of Database Systems, 1–2. New York, NY: Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4899-7993-3_1230-2.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Atti di convegni sul tema "Peer to peer"

Wählisch, Matthias, e Thomas C. Schmidt. "Peer the peers". In the 5th international student workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1658997.1659022.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Krishna Ramanathan, M., V. Kalogeraki e J. Pruyne. "Finding good peers in peer-to-peer networks". In Proceedings 16th International Parallel and Distributed Processing Symposium. IPDPS 2002. IEEE, 2002. http://dx.doi.org/10.1109/ipdps.2002.1015499.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Wahjuni, Sri, Anak Agung Putri Ratna e Kalamullah Ramli. "Efficient normal peers group recovery in hierarchical peer-to-peer". In 2012 IEEE International Conference on Communication, Networks and Satellite (ComNetSat). IEEE, 2012. http://dx.doi.org/10.1109/comnetsat.2012.6380766.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Amft, Tobias, e Kalman Graffi. "Moving peers in distributed, location-based peer-to-peer overlays". In 2017 International Conference on Computing, Networking and Communications (ICNC). IEEE, 2017. http://dx.doi.org/10.1109/iccnc.2017.7876253.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Nakayama, Hiroki, Dilawaer Duolikun, Tomoya Enokido e Makoto Takizawa. "Synchronization of Peers in Peer-to-Peer Publish/Subscribe Systems". In 2015 9th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS). IEEE, 2015. http://dx.doi.org/10.1109/imis.2015.39.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Nakajima, Yoshio, Alireza Goudarzi Nemati, Tomoya Enokido e Makoto Takizawa. "Trustworthiness and Confidence of Peers in Peer-to-Peer (P2P) Network". In 22nd International Conference on Advanced Information Networking and Applications - Workshops (aina workshops 2008). IEEE, 2008. http://dx.doi.org/10.1109/waina.2008.229.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Zeng, Shuai, Guo-feng Zhao e Chuan Xu. "Hybrid Peer-to-peer Streaming System for Mobile Peers with Transcoding". In 8th International Conference on Mobile Multimedia Communications. ACM, 2015. http://dx.doi.org/10.4108/icst.mobimedia.2015.258988.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Bilgen, Omer, e Aaron B. Wagner. "A new stable peer-to-peer protocol with non-persistent peers". In IEEE INFOCOM 2017 - IEEE Conference on Computer Communications. IEEE, 2017. http://dx.doi.org/10.1109/infocom.2017.8057141.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Sipos, Marton Akos, e Peter Ekler. "Predicting Availability of Mobile Peers in Large Peer-to-Peer Networks". In 2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems (ECBS-EERC). IEEE, 2013. http://dx.doi.org/10.1109/ecbs-eerc.2013.18.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Nakajima, Y., K. Watanabe, N. Hayashibara, T. Enokido, M. Takizawa e S. M. Deen. "Satisfiability and trustworthiness of peers in peer-to-peer overlay networks". In First International Conference on Availability, Reliability and Security (ARES'06). IEEE, 2006. http://dx.doi.org/10.1109/ares.2006.116.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Rapporti di organizzazioni sul tema "Peer to peer"

Bakker, A., R. Petrocco e V. Grishchenko. Peer-to-Peer Streaming Peer Protocol (PPSPP). RFC Editor, luglio 2015. http://dx.doi.org/10.17487/rfc7574.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Einav, Liran, Chiara Farronato e Jonathan Levin. Peer-to-Peer Markets. Cambridge, MA: National Bureau of Economic Research, agosto 2015. http://dx.doi.org/10.3386/w21496.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Marshak, Ronni. Peer-to-Peer Business Models. Boston, MA: Patricia Seybold Group, luglio 2013. http://dx.doi.org/10.1571/bs07-12-13cc.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Marshak, Ronni. Peer-to-Peer Business Models. Boston, MA: Patricia Seybold Group, luglio 2013. http://dx.doi.org/10.1571/ce07-12-13cc.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Brouwer, Bastiaan, Frank van de Geijn, Jan Verschoor, Edo Wissink e Esther Hogeveen. Humistatus peer : Eindrapportage Werkgroep Peer. Wageningen: Wageningen Food & Biobased Research, 2020. http://dx.doi.org/10.18174/537206.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Coulter, Robert, Irvin Schick e Linsey O'Brien. Peer to Peer Information System Management. Fort Belvoir, VA: Defense Technical Information Center, febbraio 2002. http://dx.doi.org/10.21236/ada400514.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Costanza, Michele N., Bruce C. Leibrecht, William Cooper e William R. Sanders. Peer-to-Peer Training Facilitator's Guide. Fort Belvoir, VA: Defense Technical Information Center, gennaio 2009. http://dx.doi.org/10.21236/ada502277.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Seybold, Patricia. BuzzCar—Peer-to-Peer Car Rental. Boston, MA: Patricia Seybold Group, ottobre 2012. http://dx.doi.org/10.1571/cs10-11-12cc.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Song, H., X. Jiang, R. Even, D. Bryan e Y. Sun. Peer-to-Peer (P2P) Overlay Diagnostics. RFC Editor, maggio 2016. http://dx.doi.org/10.17487/rfc7851.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Marocco, E., A. Fusco, I. Rimac e V. Gurbani. Improving Peer Selection in Peer-to-peer Applications: Myths vs. Reality. RFC Editor, dicembre 2012. http://dx.doi.org/10.17487/rfc6821.

Testo completo

Gli stili APA, Harvard, Vancouver, ISO e altri

Offriamo sconti su tutti i piani premium per gli autori le cui opere sono incluse in raccolte letterarie tematiche. Contattaci per ottenere un codice promozionale unico!