Gotowa bibliografia na temat „Peer-to-peer architecture (Computer networks) – Reliability”

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Peer-to-peer architecture (Computer networks) – Reliability”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Peer-to-peer architecture (Computer networks) – Reliability"

1

Yu, Zhen, William Sears i Yong Guan. "PeerCredential: a reputation-based trust framework for Peer-to-Peer applications". International Journal of Information and Computer Security 1, nr 3 (2007): 256. http://dx.doi.org/10.1504/ijics.2007.013955.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Alaya, Bechir, i Rehanullah Khan. "QoS Enhancement In VoD Systems: Load Management And Replication Policy Optimization Perspectives". Computer Journal 63, nr 10 (1.07.2020): 1547–63. http://dx.doi.org/10.1093/comjnl/bxaa060.

Pełny tekst źródła
Streszczenie:
Abstract The amount of online video content is exponentially increasing, which spurs its access demands. Providing optimal quality of service (QoS) for this ever-increasing video data is a challenging task due to the number of QoS constraints. The system resources, the distributed system platform and the transport protocol thus all need to collaborate to guarantee an acceptable level of QoS for the optimal video streaming process. In this paper, we present a comprehensive survey on QoS management for the video-on-demand systems. First, we focus on load management and replication algorithms in content delivery networks and peer-to-peer (P2P) networks for their shortcomings. We also address the problem of admission control and resource allocation with the objectives of congestion avoidance and frame-loss reduction. Besides, we introduce and discuss various replication schemes. For both the client–server architecture and P2P networks, we highlight the need for a specific storage management policy to preserve system reliability and content availability. We also focus on content distribution and streaming protocols scaling. We deduce that content availability is linked to the characteristics and the performance of the streaming protocols. Finally, we create a comparison table that presents the different contributions of the discussed approaches as well as their limitations. We believe that such a comprehensive survey provides useful insights and contributes to the related domains.
Style APA, Harvard, Vancouver, ISO itp.
3

Liu, Yi, Shinji Sakamoto, Keita Matsuo, Makoto Ikeda, Leonard Barolli i Fatos Xhafa. "Improvement of JXTA-Overlay P2P Platform". International Journal of Distributed Systems and Technologies 6, nr 2 (kwiecień 2015): 45–62. http://dx.doi.org/10.4018/ijdst.2015040104.

Pełny tekst źródła
Streszczenie:
JXTA-Overlay is a middleware built on top of the JXTA specification, which defines a set of protocols that standardize how different devices may communicate and collaborate among them. JXTA-Overlay provides a set of basic functionalities, primitives, intended to be as complete as possible to satisfy the needs of most JXTA-based applications. In this paper, the authors improve the reliability of our JXTA-Overlay P2P platform by implementing a new fuzzy-based Peer Reliability (PR) system. In the system, the authors considered three input parameters: Local Score (LS), Security (S) and Number of Interactions (NI). They evaluate JXTA-Overlay platform for medical applications and reliability. The experimental results show that by using JXTA-Overlay is possible to decide the situation of the patients. The simulation results have shown that the proposed system has a good performance and can choose reliable peers to connect in JXTA-Overlay platform.
Style APA, Harvard, Vancouver, ISO itp.
4

Guru, Divya, Supraja Perumal i Vijayakumar Varadarajan. "Approaches towards Blockchain Innovation: A Survey and Future Directions". Electronics 10, nr 10 (20.05.2021): 1219. http://dx.doi.org/10.3390/electronics10101219.

Pełny tekst źródła
Streszczenie:
A blockchain is a decentralized peer to peer platform which provides security services based on some key concepts, namely authentication, confidentiality, integrity and authorization. It is the process of recording and keeping track of the resources without the intervention of a centralized authority. This paper provides an overview of blockchains, the structure of blockchains, consensus algorithms, etc., It compares the algorithms based on their utility and limitations. Though blockchains provide secure communication, there are some minimal data leaks which are discussed. Various security issues in blockchains are discussed such as denial of service attacks, etc., In addition to security, some other blockchain challenges are presented like scalability, reliability, interoperability, privacy and consensus mechanisms for integration with AI, IoT and edge computing. This paper also explains about the importance of blockchains in the fields of smart healthcare, smart grid, and smart financial systems. Overall, this paper gives the glimpse of various protocols, algorithms, applications, challenges and opportunities that are found in the blockchain domain.
Style APA, Harvard, Vancouver, ISO itp.
5

Liu, Chun-Hung, i Jyh-Cherng Gu. "Modeling and Integrating PV Stations into IEC 61850 XMPP Intelligent Edge Computing Gateway". Energies 12, nr 8 (15.04.2019): 1442. http://dx.doi.org/10.3390/en12081442.

Pełny tekst źródła
Streszczenie:
Distributed energy resources (DERs) are being widely interconnected to electrical power grids. The dispersed and intermittent generational mixes bring technical and economic challenges to the power systems in terms of stability, reliability, and interoperability. In practice, most of the communication technologies in DER are provided by proprietary communication protocols, which are not designed for the prevention of cyber security over a wide area network, and methodology of DER integration is not unified. This has made it technically difficult for power utilities and aggregators to monitor and control the DER systems after they are interconnected with the electrical grids. Moreover, peer to peer communication between DER systems as well as local intelligent computation is required to reduce decision latency and enhance the stability of the smart grid or microgrid. In this paper, the first, novel architecture of IEC 61850 XMPP (extensible messaging and presence protocol) of the edge computing gateway, involving advanced concepts and technologies, was developed and completely studied to counter the abovementioned challenges. The results show that the proposed architecture can enhance the DER system’s effective integration, security in data communication and transparency for interoperability. The novel and advanced concepts involve first modeling the topology of the photovoltaic (PV) station to IEC 61850 information models according to the IEC 61850-7-4 logical nodes and the DER-specific logical nodes defined in IEC 61850-7-420. This guarantees the interoperability between DER and DER, DER and utility and DER and the energy service operator. The second step was to map the information models to IEC 61850-8-2 XMPP for the specific communication protocol in DER applications. XMPP protocol, a publish/subscribe communication mechanism, is recommended in DER applications because of its characteristics of cybersecurity and authenticated encryption. After that we enabled the edge computing capability for data processing and the analytics of the DER side for time-critical missions. The aggregated data was then sent to the control center in the cloud. By applying the edge computing architecture, the system reduced decision latency, improved data privacy and enhanced security. The goal of this paper was to introduce the practical methodologies of these novel concepts to academics and industrial engineers.
Style APA, Harvard, Vancouver, ISO itp.
6

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Rozprawy doktorskie na temat "Peer-to-peer architecture (Computer networks) – Reliability"

1

Yiu, Wai-Pun. "Offering reliability and interactivity for peer-to-peer streaming /". View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20YIU.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

Rakotoarivelo, Thierry Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Distributed discovery and management of alternate internet paths with enhanced quality of service". Awarded by:University of New South Wales. School of Electrical Engineering and Telecommunications, 2006. http://handle.unsw.edu.au/1959.4/27316.

Pełny tekst źródła
Streszczenie:
The convergence of recent technology advances opens the way to new ubiquitous environments, where network-enabled devices collectively form invisible pervasive computing and networking environments around the users. These users increasingly require extensive applications and capabilities from these devices. Recent approaches propose that cooperating service providers, at the edge of the network, offer these required capabilities (i.e services), instead of having them directly provided by the devices. Thus, the network evolves from a plain communication medium into an endless source of services. Such a service, namely an overlay application, is composed of multiple distributed application elements, which cooperate via a dynamic communication mesh, namely an overlay association. The Quality of Service (QoS) perceived by the users of an overlay application greatly depends on the QoS on the communication paths of the corresponding overlay association. This thesis asserts and shows that it is possible to provide QoS to an overlay application by using alternate Internet paths resulting from the compositions of independent consecutive paths. Moreover, this thesis also demonstrates that it is possible to discover, select and compose these independent paths in a distributed manner within an community comprising a limited large number of autonomous cooperating peers, such as the fore-mentioned service providers. Thus, the main contributions of this thesis are i) a comprehensive description and QoS characteristic analysis of these composite alternate paths, and ii) an original architecture, termed SPAD (Super-Peer based Alternate path Discovery), which allows the discovery and selection of these alternate paths in a distributed manner. SPAD is a fully distributed system with no single point of failure, which can be easily and incrementally deployed on the current Internet. It empowers the end-users at the edge of the network, allowing them to directly discover and utilize alternate paths.
Style APA, Harvard, Vancouver, ISO itp.
3

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

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

Pełny tekst źródła
Streszczenie:
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
Style APA, Harvard, Vancouver, ISO itp.
5

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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

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

Pełny tekst źródła
Streszczenie:
 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
Style APA, Harvard, Vancouver, ISO itp.
7

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
8

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.

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.
9

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

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

Pełny tekst źródła
Streszczenie:
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.
Style APA, Harvard, Vancouver, ISO itp.

Książki na temat "Peer-to-peer architecture (Computer networks) – Reliability"

1

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
6

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
7

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
8

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
9

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.

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
10

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

Znajdź pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.

Części książek na temat "Peer-to-peer architecture (Computer networks) – Reliability"

1

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Gaver, Donald P., i Patricia A. Jacobs. "Stochastic Properties of Peer-to-Peer Communication Architecture in a Military Setting". W Communication Networks and Computer Systems, 223–33. PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO., 2006. http://dx.doi.org/10.1142/9781860948947_0013.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
5

Hughes, Jerald, i Karl Reiner Lang. "Content Sharing Systems for Digital Media". W Encyclopedia of Multimedia Technology and Networking, Second Edition, 254–59. IGI Global, 2009. http://dx.doi.org/10.4018/978-1-60566-014-1.ch035.

Pełny tekst źródła
Streszczenie:
In 1999, exchanges of digital media objects, especially files of music, came to constitute a significant portion of Internet traffic, thanks to a new set of technologies known as peer-to-peer (P2P) file-sharing systems. The networks created by software applications such as Napster and Kazaa have made it possible for millions of users to gain access to an extraordinary range of multimedia files. However, the digital product characteristics of portability and replicability have posed great challenges for businesses that have in the past controlled the markets for image and sound recordings. ‘Peer-to-peer’ is a type of network architecture in which the various nodes may communicate directly with other nodes, without having to pass messages through any central controlling node (Whinston, Parameswaran, & Susarla, 2001). The basic infrastructure of the Internet relies on this principle for fault tolerance; if any single node ceases to operate, messages can still reach their destination by rerouting through other still-functioning nodes. The Internet today consists of a complex mixture of peer-to-peer and client-server relationships, but P2P file-sharing systems operate as overlay networks (Gummadi, Saroiu, & Gribble, 2002) upon that basic Internet structure. P2P file-sharing systems are software applications which enable direct communications between nodes in the network. They share this definition with other systems used for purposes other than file sharing, such as instant messaging, distributed computing, and media streaming. What these P2P technologies have in common is the ability to leverage the combined power of many machines in a network to achieve results that are difficult or impossible for single machines to accomplish. However, such networks also open up possibilities for pooling the interests and actions of the users so that effects emerge which were not necessarily anticipated when the network technology was originally created (Castells, 2000). In a narrow sense, P2P file-sharing systems refer to applications that exchange content over computer networks where the nodes act both as client and server machines, requesting and serving files (e.g., Kazaa, BitTorrent). In a wider sense, P2P file-sharing systems also include any application that lets peer users exchange digital content among themselves (e.g., YouTube, Flickr).
Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Peer-to-peer architecture (Computer networks) – Reliability"

1

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
2

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
3

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

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
4

Lallas, Efthimios N., Apostolos Xenakis i Georgios Stamoulis. "A generic framework for a Peer to Peer Blockchain based Fog Architecture in Industrial Automation". W 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.

Pełny tekst źródła
Style APA, Harvard, Vancouver, ISO itp.
Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!

Do bibliografii