Relevant bibliographies by topics / Peer to peer architecture

Academic literature on the topic 'Peer to peer architecture'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Peer to peer architecture.'

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 "Peer to peer architecture"

1

K, Hareesh, and Manjaiah D. H. "Peer to Peer Video on Demand Architecture using V-Chaining." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 3, no. 2 (October 30, 2012): 242–48. http://dx.doi.org/10.24297/ijct.v3i2a.2814.

Full text
Abstract:
In the Internet, video streaming requires greater amount of network bandwidth and other resources as the number of user requests increases. In case of traditional centralized directory server approach all the users requests are directly handled by the centralized server and each user request will send dedicated stream by the server, which requires higher end server, server cost will become more and greater amount of network bandwidth utilized by this server. To solve these problems peer to peer technology as emerged for the distribution of video streams to the larger requests over the network. In P2P VoD architecture adopted both the peer to peer and proxy based architectural design of a VOD system for larger community of users over the network. Hence our proposed Peer to Peer Video on Demand Architecture using V-Chaining improves the overall performance of the system by efficient utilization of uplink bandwidth and smaller amount of buffer space among the peers. In this paper we have introduce architecture for handle the large number of user requests over the communication network and ease of implementation.
APA, Harvard, Vancouver, ISO, and other styles
2

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

Full text
Abstract:
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.
APA, Harvard, Vancouver, ISO, and other styles
3

YANG DengQi, CHEN XingShu, and WANG Jian. "Security Architecture for Peer to Peer Applications." International Journal of Digital Content Technology and its Applications 5, no. 11 (November 30, 2011): 351–58. http://dx.doi.org/10.4156/jdcta.vol5.issue11.44.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wong, William Hak-Lim, and Joseph Kee-Yin Ng. "Scalable peer-to-peer networking architecture: DIVINE." Software: Practice and Experience 36, no. 13 (2006): 1467–87. http://dx.doi.org/10.1002/spe.730.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ismail, Anis, and Aziz Barbar. "A Simulation Framework for P2P Queries Routing for E-Business." International Journal of E-Entrepreneurship and Innovation 3, no. 2 (April 2012): 29–50. http://dx.doi.org/10.4018/jeei.2012040103.

Full text
Abstract:
On-line business transaction processing systems have so far been based on centralized or client-server architectures. The growing interest in Peer-to-Peer centralized or decentralized systems has inspired numerous research activities, though in a schema-based Peer-to-Peer (P2P) system, locating Peers (services) relevant to a given query is a basic problem for which different routing strategies of queries have been proposed. In this paper, the architecture, based on (Super-) Peers, is proposed, with a special focus on query routing. For an efficient query routing, (Super-) Peers having similar interests are grouped together and called Super-Super-Peers (SSP). Super-Peers submit queries that are often processed by members of this group. A SSP is a specific Super-Peer that contains knowledge about 1) its Super-Peers, and 2) the other SSP. Using data mining techniques knowledge is extracted by processing queries of Peers that transit on the network. The advantage of this distributed knowledge is that it avoids making semantic mapping between heterogeneous data sources owned by (Super-) Peers each time the system decides to route query to other (Super-) Peers.
APA, Harvard, Vancouver, ISO, and other styles
6

LI, JUAN, and SON VUONG. "AN EFFICIENT CLUSTERED ARCHITECTURE FOR P2P NETWORKS." Journal of Interconnection Networks 05, no. 03 (September 2004): 279–98. http://dx.doi.org/10.1142/s0219265904001179.

Full text
Abstract:
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some serious challenges. In this paper, we propose an Efficient Clustered Super-Peer P2P architecture (ECSP) to overcome the scalability and efficiency problems of existing unstructured P2P system. With ECSP, peers are grouped into clusters according to their topological proximity, and super-peers are selected from regular peers to act as cluster leaders and service providers. These super-peers are also connected to each other, forming a backbone overlay network operating as a distinct, yet integrated, application. To maintain the dynamically adaptive overlay network and to manage the routing on it, we propose an application level broadcasting protocol: Efa. Applying only a small amount of information about the topology of a network, Efa is as simple as flooding, a conventional method used in unstructured P2P systems. By eliminating many duplicated messages, Efa is much more efficient and scalable than flooding, and furthermore, it is completely decentralized and self-organized. Our experimental results prove that ESCP architecture, combined with the super-peer backbone protocol, can generate impressive levels of performance and scalability.
APA, Harvard, Vancouver, ISO, and other styles
7

Tran, D. A., K. A. Hua, and T. T. Do. "A Peer-to-Peer Architecture for Media Streaming." IEEE Journal on Selected Areas in Communications 22, no. 1 (January 2004): 121–33. http://dx.doi.org/10.1109/jsac.2003.818803.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rooney, S., D. Bauer, and R. Deydier. "A federated peer-to-peer network game architecture." IEEE Communications Magazine 42, no. 5 (May 2004): 114–22. http://dx.doi.org/10.1109/mcom.2004.1299353.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Soliman, Amira, Amr Kamel, Walaa Sheta, and Reem Bahgat. "PSG: Peer-to-Peer semantic grid framework architecture." Egyptian Informatics Journal 12, no. 2 (July 2011): 125–38. http://dx.doi.org/10.1016/j.eij.2011.06.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Nourah Fahad Janbi, Nourah Fahad Janbi. "Peer to Peer Cloud Providers Federation." journal of king abdulaziz university computing and information technology sciences 8, no. 1 (April 3, 2019): 59–69. http://dx.doi.org/10.4197/comp.8-1.6.

Full text
Abstract:
The increasing demand of the cloud services and with the emergence of many could service providers, the need for cloud federation is inevitable. In cloud federation, many could services providers are collaborating with each other to improve the resources usage, cost, quality of service they provide. To form this federation a management framework is required to facilitate the communication between these providers. This framework can be centralized or distributed, distributed Peer to Peer cloud federation improve extensibility, scalability and fault-tolerant. On the other hand, it is challenging in term of complexity, security and manageability of the federation. In this paper we propose a fully distributed P2P Cloud Federation (PPCF) architecture. PPCF provide a way to connect heterogenous cloud providers to share resources and improve the cloud elasticity. The architecture combines different software technologies to fulfil the cloud federation requirements.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Peer to peer architecture"

1

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

Full text
Abstract:
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
APA, Harvard, Vancouver, ISO, and other styles
2

Gerke, Jan. "A generic Peer-to-Peer architecture for internet services /." Zürich : TIK Institut für Technische Informatik und Kommunikationsnetze, ETH Zürich, 2006. http://e-collection.ethbib.ethz.ch/show?type=diss&nr=16673.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tang, Jia. "An agent-based peer-to-peer grid computing architecture." Access electronically, 2005. http://www.library.uow.edu.au/adt-NWU/public/adt-NWU20060508.151716/index.html.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ou, Z. (Zhonghong). "Structured peer-to-peer networks:hierarchical architecture and performance evaluation." Doctoral thesis, University of Oulu, 2010. http://urn.fi/urn:isbn:9789514262487.

Full text
Abstract:
Abstract Peer-to-Peer (P2P) networking changes the way of people utilizing Internet, for example, sharing and consuming digital content, from the ground up. It continues to show its power and strength when it is combined with other emerging technologies, such as Web Services. This thesis contributes to the research and development of P2P networks from four aspects. Firstly, a P2P and Web Services converged multiple-tier system architecture is proposed. The architecture proposed enables providing Web Services in the context of heterogeneous access networks in an efficient way by utilizing P2P paradigm. A lightweight middleware architecture is introduced to fit the diversified mobile terminals. A theoretical analysis is given to provide a comparative study with the conventional centralized architecture. Secondly, a General Truncated Pyramid Peer-to-Peer (GTPP) architecture is presented to analyze the performance of hierarchical architecture compared with flat architecture. The motivation behind the GTPP architecture is to see whether an added tier can bring with it added value and functionality. A detailed mathematical analysis is provided which takes into consideration various performance metrics, including the lookup hopcount, lookup latency, maintenance traffic from a single peer point of view, and maintenance traffic from the whole system point of view. Furthermore, simulation results with respect to the lookup hopcount are also provided. Through mathematical analysis and simulation results, an optimal value regarding the number of tiers of the GTPP architecture is found, showing that 2~3 tiers are appropriate for most of situations. A specialized model is also proposed to improve the performance of hierarchical architecture. Thirdly, the performance evaluation of a communication-oriented Kademlia-based P2P system is provided in detail. NetHawk EAST-based simulation models and a prototype are both utilized to evaluate the performance. Simulation results from NetHawk EAST-based simulation models demonstrate the optimal design choices regarding the resource lookup parallelism degree and resource replication degree, and show the unnecessary existence of the messages used to detect the liveness of peers in a DHT overlay. Measurements from the prototype show the feasibility of mobile nodes acting as fully fledged overlay nodes from three different perspectives, namely CPU processing load, network traffic load, and battery consumption. The optimal size of packets which consumes battery in the most efficient way is also found through battery consumption measurements. Fourthly, the effects of different churn models on the performance of structured P2P networks are analyzed. Specifically, three typical churn models are analyzed to provide a comparative result. The simulation results show that the difference among the effects of different churn models on the performance of structured P2P networks is quantitative rather than qualitative. This provides some guidance for the selection of different churn models for the contemporary researchers.
APA, Harvard, Vancouver, ISO, and other styles
5

Ieong, Sze-chung Ricci, and 楊思聰. "Analysis of peer-to-peer investigation model." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B50662247.

Full text
Abstract:
 Peer-to-Peer (P2P) file sharing is one of the most commonly used methods for sharing files over a network, especially large files such as videos or music recordings. In North America, P2P file-sharing networks occupied approximately 50% of the network traffic in 2011 [3]. Many files shared through P2P networks are related to Internet piracy or unintentional file sharing. Foxy P2P network, a typical search-based P2P network, is in the spotlight for sensitive file sharing. Peers download the files by using keywords instead of resource links. Therefore, the investigation mechanisms developed to identify the first seeder in Bit-Torrent network – another type of P2P network [54], cannot be applied to this scenario. Identifying the first seeder is the critical step in P2P investigation. The investigator cannot collect necessary evidence without locating the first seeder. Therefore, conducting forensic analysis is impossible. Moreover, validating the actual first seeder will be challenging when more than one uploader is identified. This study started by analyzing different P2P networks and comparing their underlying features. Categorizing the P2P file-sharing networks resulted in the identification of the key functions for file sharing. Two difficulties in Foxy network investigation, namely, unknown file publication time and uncertainty of network coverage by uploaders and downloaders, were also highlighted. To further examine the Foxy P2P network, a controlled testing environment for the P2P network was developed in a network simulation environment (i.e., NS-3). Tests were conducted in the simulation environment, and the effects of various attributes (file size, file transfer rate, file popularity) on the growth of the number of uploaders (represented by the seeder curve) were analyzed. Results demonstrated that the shape of the seeder curve was affected by the file propagation feature of the file-sharing activity. The slow-rising period, which represented the competition for the file content being shared among peers, was recorded at the initial stage of file sharing in the P2P network. Competition for file content is one of the key factors related to the success or failure in performing P2P investigation through the simulation environment. An investigation algorithm and four validation rules were proposed based on the above key factor to perform P2P investigation. Through controlled and randomly selected experiments, the investigation could be applied to the search-based P2P file-sharing environment as long as the required slow-rising period in other P2P networks was followed [68]. Analysis of the experimental results demonstrated the ability of the proposed investigation model and the validation rules. The results verified and confirmed the observed seeder in the P2P file-sharing scenario if competitions among downloaders for the shared file content existed. The limitations of the P2P investigation and validation model were also discussed.
published_or_final_version
Computer Science
Doctoral
Doctor of Philosophy
APA, Harvard, Vancouver, ISO, and other styles
6

Jayanthi, Praveena. "Scalable Proxy Architecture for Mobile and Peer-to-Peer Networks." Digital Archive @ GSU, 2006. http://digitalarchive.gsu.edu/cs_theses/34.

Full text
Abstract:
The growth of wireless telecommunications has stipulated the interest for anywhere-anytime computing. The synergy between networking and mobility will engender new collaborative applications with mobile devices on heterogeneous platforms. One such middleware is “SYSTEM ON MOBILE DEVICES”, SYD developed by the Yamacraw Embedded Systems research team. This type of middleware is an opening step towards Peer-to-Peer mobile networks. This project envisioned collaborative applications among mobile devices and PDAs were used as servers. This thesis studies various existing architectures in mobile computing and their scalability issues. We also proposed new scalable flexible thick client proxy system FTCPS, an architecture suitable for mobile Peer-to-Peer networks. Our empirical study showed that FTCPS has low response time compared to other architectures.
APA, Harvard, Vancouver, ISO, and other styles
7

Klampanos, Iraklis Angelos. "A cluster-based architecture for peer-to-peer information retrieval." Thesis, University of Glasgow, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433270.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Veiga, Hélder Manuel Lima. "Distributed traffic measurement system with a peer-to-peer architecture." Master's thesis, Universidade de Aveiro, 2008. http://hdl.handle.net/10773/1916.

Full text
Abstract:
Mestrado em Engenharia Electrónica
As características do tráfego na Internet são cada vez mais complexas devido à crescente diversidade de aplicações, à existência de diferenças drásticas no comportamento de utilizadores, à mobilidade de utilizadores e equipamentos, à complexidade dos mecanismos de geração e controlo de tráfego, e à crescente diversidade dos tipos de acesso e respectivas capacidades. Neste cenário é inevitável que a gestão da rede seja cada vez mais baseada em medições de tráfego em tempo real. Devido à elevada quantidade de informação que é necessário processar e armazenar, é também cada vez maior a necessidade das plataformas de medição de tráfego assumirem uma arquitectura distribuída, permitindo o armazenamento distribuído, replicação e pesquisa dos dados medidos de forma eficiente, possivelmente imitando o paradigma Peer-to-Peer (P2P). Esta dissertação descreve a especificação, implementação e teste de um sistema de medição de tráfego com uma arquitectura distribuída do tipo P2P, que fornece aos gestores de rede uma ferramenta para configurar remotamente sistemas de monitorização instalados em diversos pontos da rede para a realização de medições de tráfego. O sistema pode também ser usado em redes orientadas à comunidade onde os utilizadores podem partilhar recursos das suas máquinas para permitir que outros realizem medições e partilhem os dados obtidos. O sistema é baseado numa rede de overlay com uma estrutura hierárquica organizada em áreas de medição. A rede de overlay é composta por dois tipos de nós, denominados de probes e super-probes, que realizam as medições e armazenam os resultados das mesmas. As superprobes têm ainda a função de garantir a ligação entre áreas de medição e gerir a troca de mensagens entre a rede e as probes a elas conectadas. A topologia da rede de overlay pode mudar dinamicamente, com a inserção de novos nós e a remoção de outros, e com a promoção de probes a super-probes e viceversa, em resposta a alterações dos recursos disponíveis. Os nós armazenam dois tipos de resultados de medições: Light Data Files (LDFs) e Heavy Data Files (HDFs). Os LDFs guardam informação relativa ao atraso médio de ida-evolta de cada super-probe para todos os elementos a ela ligados e são replicados em todas as super-probes, fornecendo uma visão simples mas facilmente acessível do estado da rede. Os HDFs guardam os resultados detalhados das medições efectuadas a nível do pacote ou do fluxo e podem ser replicados em alguns nós da rede. As réplicas são distribuídas pela rede tendo em consideração os recursos disponíveis nos nós, de forma a garantir resistência a falhas. Os utilizadores podem configurar medições e pesquisar os resultados através do elemento denominado de cliente. Foram realizados diversos testes de avaliação do sistema que demonstraram estar o mesmo a operar correctamente e de forma eficiente. ABSTRACT: The characteristics of Internet traffic are becoming more and more complex due to the large and growing diversity of applications, the drastic differences in user behaviours and the mobility of users and devices, the complexity of traffic generation and control mechanisms, and the increasing diversity of the link type and quality. In such an environment, it is inevitable that network management tasks will rely heavily on (real-time) traffic measurements. Due to the large amounts of data that need to be processed and stored, measurement platforms have to become more distributed, allowing for scattered storage, replication and efficient retrieval of measurement data, possibly mimicking the peer-to-peer (P2P) paradigm. In this dissertation we describe the specification, development and evaluation of a distributed traffic measurement system with a P2P architecture, which provide network managers with a tool to remotely configure third-party monitoring modules installed at different points of the network in order to perform test measurements. The system can also be used as a large-scale measurement infrastructure in a community-oriented network where Internet users may share some processing power and storage space of their machines to allow other Internet users (e.g. researchers) to perform measurements, to retrieve and share the obtained results. The system is based on a hierarchical overlay network organized in measurement areas. The overlay network is formed by two types of nodes, called probes and super-probes, which perform the measurements and store the measurement results. Super-probes have the specific role of providing connection among measurement areas and manage the exchange of messages between the network and the probes connected to them. The topology of the overlay network can change dynamically, with nodes being inserted and removed on-the-fly, and probes being transformed in superprobes and vice-versa, in response to changes in the available resources. The nodes collect two types of measured data: Light Data Files (LDFs) and Heavy Data Files (HDFs). LDFs store the average round-trip time from each superprobe to every element it is connected to and are replicated in all super-probes, providing a coarse but widely available view of the network status. HDFs contain the results of detailed measurements carried out at the packet or flow level and can be replicated at some nodes of the overlay network. Replications are spread over the overlay network taking into account the resources available at nodes, so as to provide high resilience to failures. Users can configure traffic measurements and search the overlay network for measurement data through the so-called client element. The various tests carried out in the system have shown that it performs correctly and efficiently.
APA, Harvard, Vancouver, ISO, and other styles
9

Luan, Hao. "Peer-to-peer content distribution network design /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECED%202007%20LUAN.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tsang, Pui-sze, and 曾倍思. "Performance analysis on peer-to-peer file distribution." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B45160107.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Peer to peer architecture"

1

Oualha, Nouha. Peer-to-peer storage: Security and protocols. New York: Nova Science Publishers, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

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

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Peer-to-peer computing: Applications, architecture, protocols, and challenges. Boca Raton, FL: Taylor & Francis, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

MacDonald, Matthew. Peer-to-peer with VB.Net. Berkley, CA: Apress, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Verma, Dinesh C. Legitimate Applications of Peer-to-Peer Networks. New York: John Wiley & Sons, Ltd., 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Peer-to-peer query processing over multidimensional data. New York: Springer, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Breakcore: Identity and interaction on peer-to-peer. Newcastle: Cambridge Scholars Pub., 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Peer to peer: Collaboration and sharing over the Internet. Boston, Mass: Addison-Wesley, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Madron, Thomas William. Peer-to-peer LANs: Networking two to ten PCs. Chichester: Wiley, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Peer-to-peer LANs: Networking two to ten PCs. New York: Wiley, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Peer to peer architecture"

1

Macdonald, Matthew. "Peer-to-Peer Architecture." In Peer-to-Peer with VB .NET, 23–31. Berkeley, CA: Apress, 2003. http://dx.doi.org/10.1007/978-1-4302-0817-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Vu, Quang Hieu, Mihai Lupu, and Beng Chin Ooi. "Architecture of Peer-to-Peer Systems." In Peer-to-Peer Computing, 11–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03514-2_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wu, Jing, and Michel Savoie. "Peer-to-Peer Network Architecture." In Handbook of Computer Networks, 131–51. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2012. http://dx.doi.org/10.1002/9781118256107.ch9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cirani, Simone, Riccardo Pecori, and Luca Veltri. "A Peer-to-Peer Secure VoIP Architecture." In Trustworthy Internet, 105–15. Milano: Springer Milan, 2011. http://dx.doi.org/10.1007/978-88-470-1818-1_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Korzun, Dmitry, and Andrei Gurtov. "Hierarchical DHT Architectures." In Structured Peer-to-Peer Systems, 171–226. New York, NY: Springer New York, 2012. http://dx.doi.org/10.1007/978-1-4614-5483-0_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Fernando, Harinda, and Hairulnizam Mahdin. "A Web Based Peer-to-Peer RFID Architecture." In Advances in Intelligent Systems and Computing, 549–59. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-51281-5_55.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Sheng-De, Hsuen-Ling Ko, and Yung-Yu Zhuang. "Japster: An Improved Peer-to-Peer Network Architecture." In Embedded and Ubiquitous Computing, 1044–54. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30121-9_100.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jin, Xing, and S. H. Gary Chan. "Unstructured Peer-to-Peer Network Architectures." In Handbook of Peer-to-Peer Networking, 117–42. Boston, MA: Springer US, 2009. http://dx.doi.org/10.1007/978-0-387-09751-0_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kang, Brent ByungHoon, and Chris Nunnery. "Decentralized Peer-to-Peer Botnet Architectures." In Advances in Information and Intelligent Systems, 251–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-04141-9_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Misra, Jaydev, Pinakpani Pal, and Aditya Bagchi. "SPEAR: Design of a Secured Peer-to-Peer Architecture." In Information Systems Security, 322–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11593980_25.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Peer to peer architecture"

1

Campos, Filipe, Miguel Matos, Jose Pereira, and David Rua. "A peer-to-peer service architecture for the Smart Grid." In 2014 IEEE Thirteenth International Conference on Peer-to-Peer Computing (P2P). IEEE, 2014. http://dx.doi.org/10.1109/p2p.2014.6934315.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Heer, Tobias, Shaohui Li, and Klaus Wehrle. "PISA: P2P Wi-Fi Internet Sharing Architecture." In Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007). IEEE, 2007. http://dx.doi.org/10.1109/p2p.2007.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Heer, Tobias, Shaohui Li, and Klaus Wehrle. "PISA: P2P Wi-Fi Internet Sharing Architecture." In Seventh IEEE International Conference on Peer-to-Peer Computing (P2P 2007). IEEE, 2007. http://dx.doi.org/10.1109/p2p.2007.4343494.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Pâris, Jehan-François, Jeffrey Morgan, John Schettino, and Chandrasekar Venkatraman. "A P2P-Based Architecture for Secure Software Delivery Using Volunteer Assistance." In 2008 Eighth International Conference on Peer-to-Peer Computing (P2P). IEEE, 2008. http://dx.doi.org/10.1109/p2p.2008.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wa, Larry, and Weiyong Zhu. "A carrier grade Peer-to-peer network architecture." In 2008 Innovations in NGN - Future Network and Services, An ITU-T Kaleidoscope Conference (K-INGN). IEEE, 2008. http://dx.doi.org/10.1109/kingn.2008.4542277.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Lichun, Juwei Shi, Wenjie Lin, Yao Wang, Yinong Liz, and Yang Ji. "Transit-Stub Architecture for Peer-to-Peer SIP." In 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (EUROMICRO 2007). IEEE, 2007. http://dx.doi.org/10.1109/euromicro.2007.57.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Klampanos, Iraklis A., and Joemon M. Jose. "An architecture for peer-to-peer information retrieval." In the 26th annual international ACM SIGIR conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/860435.860521.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gu, T., E. Tan, H. K. Pung, and D. Zhang. "A peer-to-peer architecture for context lookup." In The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services. IEEE, 2005. http://dx.doi.org/10.1109/mobiquitous.2005.5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Liu, Lu, Stephen Mackin, and Nick Antonopoulos. "Small World Architecture for Peer-to-Peer Networks." In 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops. IEEE, 2006. http://dx.doi.org/10.1109/wi-iatw.2006.123.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bi, Hui, Tao Guo, and Baosheng Qu. "Peer-to-Peer Simulators Architecture and Design Methodology." In 2011 International Conference on Control, Automation and Systems Engineering (CASE). IEEE, 2011. http://dx.doi.org/10.1109/iccase.2011.5997757.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Peer to peer architecture"

1

Camarillo, G., ed. Peer-to-Peer (P2P) Architecture: Definition, Taxonomies, Examples, and Applicability. RFC Editor, November 2009. http://dx.doi.org/10.17487/rfc5694.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gaver, Donald P., and Patricia A. Jacobs. Stochastic Properties of Peer-to-Peer Communication Architecture in a Military Setting. Fort Belvoir, VA: Defense Technical Information Center, August 2005. http://dx.doi.org/10.21236/ada437857.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Vorobeychik, Yevgeniy, Jackson R. Mayo, Ronald G. Minnich, Robert C. Armstrong, and Donald W. Rudish. Peer-to-peer architectures for exascale computing : LDRD final report. Office of Scientific and Technical Information (OSTI), September 2010. http://dx.doi.org/10.2172/991537.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

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

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Peer to peer architecture' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography