Relevant bibliographies by topics / Peer-to-peer architecture (Computer networks)

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers

Academic literature on the topic 'Peer-to-peer architecture (Computer networks)'

Author: Grafiati
Published: 4 June 2021
Last updated: 30 July 2024

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

Select a source type:

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

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 (Computer networks)"

1

Bhisikar, Swati, Simran Taneja, Omkar Yadav, and Swarnika Srivastava. "Peer-to-Peer File Sharing WebApp." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 8 (September 20, 2023): 21–35. http://dx.doi.org/10.17762/ijritcc.v11i8.7920.

Full text
Abstract:
Peer-to-peer (P2P) networking has emerged as a promising technology that enables distributed systems to operate in a decentralized manner. P2P networks are based on a model where each node in the network can act as both a client and a server, thereby enabling data and resource sharing without relying on centralized servers. The P2P model has gained considerable attention in recent years due to its potential to provide a scalable, fault-tolerant, and resilient architecture for various applications such as file sharing, content distribution, and social networks.In recent years, researchers have also proposed hybrid architectures that combine the benefits of both structured and unstructured P2P networks. For example, the Distributed Hash Table (DHT) is a popular hybrid architecture that provides efficient lookup and search algorithms while maintaining the flexibility and adaptability of the unstructured network.To demonstrate the feasibility of P2P systems, several prototypes have been developed, such as the BitTorrent file-sharing protocol and the Skype voice-over-IP (VoIP) service. These prototypes have demonstrated the potential of P2P systems for large-scale applications and have paved the way for the development of new P2P-based systems.
APA, Harvard, Vancouver, ISO, and other styles
2

Tang, Weizhao, Lucianna Kiffer, Giulia Fanti, and Ari Juels. "Strategic Latency Reduction in Blockchain Peer-to-Peer Networks." ACM SIGMETRICS Performance Evaluation Review 51, no. 1 (June 26, 2023): 93–94. http://dx.doi.org/10.1145/3606376.3593572.

Full text
Abstract:
Most permissionless blockchain networks run on peer-to-peer (P2P) networks, which offer flexibility and decentralization at the expense of performance (e.g., network latency). Historically, this tradeoff has not been a bottleneck for most blockchains. However, an emerging host of blockchain-based applications (e.g., decentralized finance) are increasingly sensitive to latency; users who can reduce their network latency relative to other users can accrue (sometimes significant) financial gains. In this work, we initiate the study of strategic latency reduction in blockchain P2P networks. We first define two classes of latency that are of interest in blockchain applications. We then show empirically that a strategic agent who controls only their local peering decisions can manipulate both types of latency, achieving 60% of the global latency gains provided by the centralized, paid service bloXroute, or, in targeted scenarios, comparable gains. Finally, we show that our results are not due to the poor design of existing P2P networks. Under a simple network model, we theoretically prove that an adversary can always manipulate the P2P network's latency to their advantage, provided the network experiences sufficient peer churn and transaction activity.
APA, Harvard, Vancouver, ISO, and other styles
3

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
4

Tang, Weizhao, Lucianna Kiffer, Giulia Fanti, and Ari Juels. "Strategic Latency Reduction in Blockchain Peer-to-Peer Networks." Proceedings of the ACM on Measurement and Analysis of Computing Systems 7, no. 2 (May 19, 2023): 1–33. http://dx.doi.org/10.1145/3589976.

Full text
Abstract:
Most permissionless blockchain networks run on peer-to-peer (P2P) networks, which offer flexibility and decentralization at the expense of performance (e.g., network latency). Historically, this tradeoff has not been a bottleneck for most blockchains. However, an emerging host of blockchain-based applications (e.g., decentralized finance) are increasingly sensitive to latency; users who can reduce their network latency relative to other users can accrue (sometimes significant) financial gains. In this work, we initiate the study of strategic latency reduction in blockchain P2P networks. We first define two classes of latency that are of interest in blockchain applications. We then show empirically that a strategic agent who controls only their local peering decisions can manipulate both types of latency, achieving 60% of the global latency gains provided by the centralized, paid service bloXroute, or, in targeted scenarios, comparable gains. Finally, we show that our results are not due to the poor design of existing P2P networks. Under a simple network model, we theoretically prove that an adversary can always manipulate the P2P network's latency to their advantage, provided the network experiences sufficient peer churn and transaction activity.
APA, Harvard, Vancouver, ISO, and other styles
5

MAIER, RONALD, and JOHANNES SAMETINGER. "PEER-TO-PEER INFORMATION WORKSPACES IN INFOTOP." International Journal of Software Engineering and Knowledge Engineering 14, no. 01 (February 2004): 79–102. http://dx.doi.org/10.1142/s0218194004001531.

Full text
Abstract:
Knowledge workers collaborate in teams, networks and communities in order to accomplish knowledge processes. They have to be supported with adequate organizational as well as information and communication technological (ICT) infrastructures. From an ICT perspective, requirements have changed when compared to more traditional (office) work due to the considerably higher complexity of data, the focus on communication across the boundaries of corporate ICT infrastructures and the mobility of knowledge workers. This requires the systematic handling of context and substantially extended functionality for collaboration in the knowledge workers' personal workspaces. In this paper, we outline typical knowledge processes and discuss ICT support for the personal management of information, of web content, of collaboration and of knowledge. We present Infotop, a tool that supports the creation and management of shared-context information workspaces and organizes knowledge resources in a peer-to-peer (p2p) architecture. We show how Infotop can be used to support typical knowledge work processes and discuss its dimensions, its user interface, its shared context workspaces, its architecture, and some thoughts on a prototype implementation currently under development.
APA, Harvard, Vancouver, ISO, and other styles
6

Haase, Peter, Ronny Siebes, and Frank van Harmelen. "Expertise-based peer selection in Peer-to-Peer networks." Knowledge and Information Systems 15, no. 1 (January 24, 2007): 75–107. http://dx.doi.org/10.1007/s10115-006-0055-1.

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

Ferreira, Ronaldo A., Suresh Jagannathan, and Ananth Grama. "Locality in structured peer-to-peer networks." Journal of Parallel and Distributed Computing 66, no. 2 (February 2006): 257–73. http://dx.doi.org/10.1016/j.jpdc.2005.09.002.

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

Lehikoinen, Juha, Ilkka Salminen, Antti Aaltonen, Pertti Huuskonen, and Juha Kaario. "Meta-searches in peer-to-peer networks." Personal and Ubiquitous Computing 10, no. 6 (December 7, 2005): 357–67. http://dx.doi.org/10.1007/s00779-005-0054-3.

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

Mickens, James W., and Brian D. Noble. "Predicting node availability in peer-to-peer networks." ACM SIGMETRICS Performance Evaluation Review 33, no. 1 (June 6, 2005): 378–79. http://dx.doi.org/10.1145/1071690.1064263.

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

Wang, Xiaoming, Yueping Zhang, Xiafeng Li, and Dmitri Loguinov. "On zone-balancing of peer-to-peer networks." ACM SIGMETRICS Performance Evaluation Review 32, no. 1 (June 2004): 211–22. http://dx.doi.org/10.1145/1012888.1005713.

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

Dissertations / Theses on the topic "Peer-to-peer architecture (Computer networks)"

1

Fan, Bo Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Sharing network measurements on peer-to-peer networks." Publisher:University of New South Wales. Electrical Engineering & Telecommunications, 2007. http://handle.unsw.edu.au/1959.4/40762.

Full text
Abstract:
With the extremely rapid development of the Internet in recent years, emerging peer-to-peer network overlays are meeting the requirements of a more sophisticated communications environment, providing a useful substrate for applications such as scalable file sharing, data storage, large-scale multicast, web-cache, and publish-subscribe services. Due to its design flexibility, peer-to-peer networks can offer features including self-organization, fault-tolerance, scalability, load-balancing, locality and anonymity. As the Internet grows, there is an urgent requirement to understand real-time network performance degradation. Measurement tools currently used are ping, traceroute and variations of these. SNMP (Simple Network Management Protocol) is also used by network administrators to monitor local networks. However, ping and traceroute can only be used temporarily, SNMP can only be deployed at certain points in networks and these tools are incapable of sharing network measurements among end-users. Due to the distributed nature of networking performance data, peer-to-peer overlay networks present an attractive platform to distribute this information among Internet users. This thesis aims at investigating the desirable locality property of peer-to-peer overlays to create an application to share Internet measurement performance. When measurement data are distributed amongst users, it needs to be localized in the network allowing users to retrieve it when external Internet links fail. Thus, network locality and robustness are the most desirable properties. Although some unstructured overlays also integrate locality in design, they fail to reach rarely located data items. Consequently, structured overlays are chosen because they can locate a rare data item deterministically and they can perform well during network failures. In structured peer-to-peer overlays, Tapestry, Pastry and Chord with proximity neighbour selection, were studied due to their explicit notion of locality. To differentiate the level of locality and resiliency in these protocols, P2Psim simulations were performed. The results show that Tapestry is the more suitable peer-to-peer substrate to build such an application due to its superior localizing data performance. Furthermore, due to the routing similarity between Tapestry and Pastry, an implementation that shares network measurement information was developed on freepastry, verifying the application feasibility. This project also contributes to the extension of P2Psim to integrate with GT-ITM and link failures.
APA, Harvard, Vancouver, ISO, and other styles
2

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
3

Tsietsi, Mosiuoa. "Prototyping a peer-to-peer session initiation protocol user agent /." [S.l. : s.n.], 2008. http://eprints.ru.ac.za/1115/.

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

Hei, Xiaojun. "End-to-end network measurement and its applications in peer-to-peer networks /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?ECED%202008%20HEI.

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

Tsietsi, Mosiuoa Jeremia. "Prototyping a peer-to-peer session initiation protocol user agent." Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1006603.

Full text
Abstract:
The Session Initiation Protocol (SIP) has in recent years become a popular protocol for the exchange of text, voice and video over IP networks. This thesis proposes the use of a class of structured peer to peer protocols - commonly known as Distributed Hash Tables (DHTs) - to provide a SIP overlay with services such as end-point location management and message relay, in the absence of traditional, centralised resources such as SIP proxies and registrars. A peer-to-peer layer named OverCord, which allows the interaction with any specific DHT protocol via the use of appropriate plug-ins, was designed, implemented and tested. This layer was then incorporated into a SIP user agent distributed by NIST (National Institute of Standards and Technology, USA). The modified user agent is capable of reliably establishing text, audio and video communication with similarly modified agents (peers) as well as conventional, centralized SIP overlays.
APA, Harvard, Vancouver, ISO, and other styles
6

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
7

Han, Jinsong. "Anonymous and trustworthy computing in peer-to-peer systems /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?CSED%202007%20HAN.

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

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
9

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
10

Valiveti, Kalyan. "Agent Extensions for Peer-to-Peer Networks." Thesis, University of North Texas, 2003. https://digital.library.unt.edu/ark:/67531/metadc4382/.

Full text
Abstract:
Peer-to-Peer (P2P) networks have seen tremendous growth in development and usage in recent times. This attention has brought many developments as well as new challenges to these networks. We will show that agent extensions to P2P networks offer solutions to many problems faced by P2P networks. In this research, an attempt is made to bring together JXTA P2P infrastructure and Jinni, a Prolog based agent engine to form an agent based P2P network. On top of the JXTA, we define simple Java API providing P2P services for agent programming constructs. Jinni is deployed on this JXTA network using an automated code update mechanism. Experiments are conducted on this Jinni/JXTA platform to implement a simple agent communication and data exchange protocol.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Peer-to-peer architecture (Computer networks)"

1

Aberer, Karl. Peer-to-peer data management. [San Rafael, Calif.]: Morgan & Claypool Publishers, 2011.

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

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
3

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
4

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
5

Ramesh, Subramanian, and Goodman Brian D, eds. Peer to peer computing: The evolution of a disruptive technology. Hershey, PA: Idea Group Pub., 2004.

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

Kesidis, George. An introduction to models of online peer-to-peer social networking. San Rafael, Calif. (1537 Fourth Street, San Rafael, CA 94901 USA): Morgan & Claypool, 2011.

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

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

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

Moore, Dana. Peer-to-peer: Building secure, scalable, and manageable networks. Berkeley, Calif: Osborne, 2002.

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

Ding, Wei. Topology construction for bootstrapping peer-to-peer systems over ad-hoc networks. Hauppauge, NY, USA: Nova Science, 2009.

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

Andrew, Oram, ed. Peer-to-peer: Harnessing the benefits of a disruptive technology. Beijing: O'Reilly, 2001.

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

Book chapters on the topic "Peer-to-peer architecture (Computer networks)"

1

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
2

Nottelmann, Henrik, and Norbert Fuhr. "Comparing Different Architectures for Query Routing in Peer-to-Peer Networks." In Lecture Notes in Computer Science, 253–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11735106_23.

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

Ingram, David. "An Evidence Based Architecture for Efficient, Attack-Resistant Computational Trust Dissemination in Peer-to-Peer Networks." In Lecture Notes in Computer Science, 273–88. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11429760_19.

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

Patidar, Kriti, and Swapnil Jain. "Implementation of Blockchain Based Distributed Architecture for Enhancing Security and Privacy in Peer-To-Peer Networks." In Communications in Computer and Information Science, 94–105. Singapore: Springer Singapore, 2021. http://dx.doi.org/10.1007/978-981-16-0404-1_8.

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

Raj P. M., Krishna, Ankith Mohan, and K. G. Srinivasa. "Peer-To-Peer Networks." In Computer Communications and Networks, 101–8. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96746-2_6.

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

Kurkovsky, Stan. "Peer-to-Peer Network Applications." In Handbook of Computer Networks, 152–67. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2012. http://dx.doi.org/10.1002/9781118256107.ch10.

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

Touceda, Diego Suárez, José María Sierra Cámara, and Jesús Téllez Isaac. "Privacy in Peer-to-Peer Networks." In Computer Communications and Networks, 111–39. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-08470-1_6.

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

Raj, Pethuru, Anupama Raman, Dhivya Nagaraj, and Siddhartha Duggirala. "High-Performance Peer-to-Peer Systems." In Computer Communications and Networks, 317–37. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-20744-5_11.

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

Kwok, Yu-Kwong. "Incentive Issues in Peer-to-Peer Systems." In Handbook of Computer Networks, 168–88. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2012. http://dx.doi.org/10.1002/9781118256107.ch11.

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

Groba, Christin, and Alexander Schill. "Peer-to-Peer Transfers for Crowd Monitoring - A Reality Check." In Computer Networks, 64–76. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-50719-0_6.

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

Conference papers on the topic "Peer-to-peer architecture (Computer networks)"

1

Saad, Radwane, Farid Nait-Abdesselam, and Ahmed Serhrouchni. "A collaborative peer-to-peer architecture to defend against DDoS attacks." In 2008 33rd IEEE Conference on Local Computer Networks (LCN 2008). IEEE, 2008. http://dx.doi.org/10.1109/lcn.2008.4664200.

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

Shangzhou Li, Pin Lv, Haibo Wang, and Junping Song. "Load-modifiable content-based Publish/Subscribe Architecture over structured peer-to-peer networks." In 2014 9th International Conference on Computer Science & Education (ICCSE). IEEE, 2014. http://dx.doi.org/10.1109/iccse.2014.6926538.

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

Kim, Jihoon, and Younghan Kim. "A Design of Generalized Peer-to-Peer Based IPTV System Using Multiple Chain Architecture." In 2009 Proceedings of 18th International Conference on Computer Communications and Networks - ICCCN 2009. IEEE, 2009. http://dx.doi.org/10.1109/icccn.2009.5235339.

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

Lallas, Efthimios N., Apostolos Xenakis, and Georgios Stamoulis. "A generic framework for a Peer to Peer Blockchain based Fog Architecture in Industrial Automation." In 2019 4th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM). IEEE, 2019. http://dx.doi.org/10.1109/seeda-cecnsm.2019.8908360.

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

Amponis, George, Thomas Lagkas, Dimitris Karampatzakis, Panagiotis Radoglou-Grammatikis, Vasileios Argyriou, Ioannis Moscholios, Sotirios Goudos, and Panagiotis Sarigiannidis. "Efficient Peer-to-Peer Unicasting for VANET Architectures via Enhanced Monolithic Protocols." In 2022 7th South-East Europe Design Automation, Computer Engineering, Computer Networks and Social Media Conference (SEEDA-CECNSM). IEEE, 2022. http://dx.doi.org/10.1109/seeda-cecnsm57760.2022.9932897.

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

Bellavista, Paolo, Antonio Corradi, and Andrea Reale. "Effective epidemic dissemination of multimedia metadata in Peer-to-Peer overlay networks: The Metis architecture and prototype." In 2011 IEEE Symposium on Computers and Communications (ISCC). IEEE, 2011. http://dx.doi.org/10.1109/iscc.2011.5983985.

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

Sen, Jaydip. "Peer-to-peer networks." In 2012 3rd National Conference on Emerging Trends and Applications in Computer Science (NCETACS). IEEE, 2012. http://dx.doi.org/10.1109/ncetacs.2012.6203284.

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

Dhurandher, Sanjay K., Sudip Misra, Mohammad S. Obaidat, Inderpreet Singh, Raghu Agarwal, and Bhuvnesh Bhambhani. "Simulating Peer-to-Peer networks." In 2009 IEEE/ACS International Conference on Computer Systems and Applications. IEEE, 2009. http://dx.doi.org/10.1109/aiccsa.2009.5069345.

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

Singh, Rajendra G., and Margaret A. Bernard. "Peer-Review of Reusable Learning Objects for eBooks in a Peer-To-Peer Network Architecture." In Computers and Advanced Technology in Education. Calgary,AB,Canada: ACTAPRESS, 2012. http://dx.doi.org/10.2316/p.2012.774-065.

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 (Computer networks)' 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