Log in

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

To see the other types of publications on this topic, follow the link: Peer-to-peer architecture (Computer networks).

Dissertations / Theses 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 top 50 dissertations / theses for your research 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.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

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

11

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

12

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

13

Kwong, Kin Wah. "Topology construction and searching algorithms for heterogeneous peer-to-peer networks /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202005%20KWONG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Zhang, Xin, and 张昕. "Gossip-based publish-subscribe systems in peer-to-peer networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/208013.

Full text

Abstract:

Peer-to-peer (P2P) paradigm, for its scalability and low cost management, is widely used in today’s network. Based on the typical designs for request/response services, a lot of efforts have been made to support publish-subscribe services in P2P networks. Gossip-based publish-subscribe system, which is commonly used in unstructured P2P networks, can provide great flexibility in query language and does not require special efforts on maintaining topology. The purpose of our work is to investigate effective and efficient mechanisms to build gossip-based publish-subscribe systems in unstructured P2P networks. Specifically, the probabilistic bi-quorum system (PBQS), for its assurance in effectiveness, becomes the object of our study. Uniform sampling is a fundamental tool to construct PBQS. By adopting uniform sampling, PBQS provides a bound on the likelihood that data messages will find a copy of the subscription. A random walk of length O(log n) is commonly used to gain a uniform sample on an expander graph of size n. To obtain a multitude of uniform samples thus requires an equivalent number of random walks of length O(log n) each. A number of works have relied on the Chernoff bound to analytically reduce the overhead needed to obtain a multitude of uniform samples. Besides, researchers have also shown that it is not necessary to replicate both data and query on uniformly chosen nodes. Alternatively, BubbleStorm performs controlled flooding on a constructed overlay to build PBQS. BubbleStorm does not require nodes forming a bubble to be uniformly chosen at random, and the probabilistic bound computed by BubbleStorm is different from uniform sampling based PBQS. In this thesis, we first show that the Chernoff bound on the statistical properties of samples collected from a random walk does not help in selecting uniformly random nodes. We then re-examine the role of uniform sampling in PBQS, and found that when multiple data answer a single subscription, it is sufficient and necessary for each data to be distributed uniformly at random. Looking into BubbleStorm, we examine more closely the probabilistic bound provided by this system. We found that, unlike uniform sampling based PBQS, the bubble intersection in BubbleStorm is distance dependent. Given a specific pair of publisher-subscriber, the data may never find the subscription. We further investigate the topology construction and found that re-creating topology prior to each controlled flooding or keeping topology with high degree of churn can help alleviate the distance dependency problem. We arrive at the conclusion that BubbleStorm construction is equivalent to caching of random walks. We show that re-using this cache to obtain samples over time leads to degradation of uniformity of the samples. We evaluate topology re-wiring as a simple method to keep the cache fresh, thereby benefiting from the low latency of controlled flooding without degrading the uniformity of samples over time.
published_or_final_version
Electrical and Electronic Engineering
Master
Master of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

15

Stutzbach, Daniel. "Measuring and characterizing properties of peer-to-peer systems /." view abstract or download file of text, 2006. http://proquest.umi.com/pqdweb?did=1280151121&sid=1&Fmt=2&clientId=11238&RQT=309&VName=PQD.

Full text

Abstract:

Thesis (Ph. D.)--University of Oregon, 2006.
Typescript. Includes vita and abstract. Includes bibliographical references (leaves 214-227) and index. Also available for download via the World Wide Web; free to University of Oregon users.

APA, Harvard, Vancouver, ISO, and other styles

16

Xu, Jialing, and 徐加羚. "On live data streaming over peer-to-peer networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B44904472.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Li, Yung-Ming. "Essays in peer-to-peer content distribution networks : scale, formation, and pricing /." Thesis, Connect to this title online; UW restricted, 2005. http://hdl.handle.net/1773/8765.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Jin, Xin, and 靳鑫. "Peer-to-peer system design: incentives and evolution of cooperation." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B50662235.

Full text

Abstract:

The persistence of cooperation is a longstanding problem in the social and biological sciences. Recent advances of peer-to-peer (P2P) networks manifest as a promising platform to experiment and contribute to theories and algorithms on cooperation. In this thesis, by and large, we view P2P systems as an economy in which incentives are critical to stimulate contribution. Indeed, a P2P system can be considered as a society where different behaviors can emerge, and an empirical platform to understand cooperation and mimic evolving population. Specifically, we consider the problem of cooperation from two perspectives. First and foremost, autonomous nodes are strategic and selfish, who are reluctant to cooperate solely for public good. We investigate incentive scheme design for cooperation in P2P live media streaming networks. The general approach of protocol decomposition shows that practical incentives can only be guaranteed by efficient peer selection, due to stringent playback deadlines. Striker strategy is then proposed so as to align the optimal peer selection of heterogeneous nodes with social welfare maximization, the efficiency of which is validated by repeated game modeling and extensive simulations. The hidden philosophy is to coerce non-cooperative peers into cooperation by collectively implementing punishment threats. This is analogous to strikes and coercion implemented by organizations like unions in human society. On the other hand, just as node selfishness, competition and struggle for survival raise another problem for cooperation. Similar to human society and biological systems, we envision that diverse strategies—some are more exploitative, while others more altruistic—could be deployed by selfish participants to compete against interacting nodes and gain performance advantages. In such a variegated environment, our coevolutionary perspective aims to understand cooperation and rationalize the coexistence and success of diverse behaviors. Population games and evolutionary game theory provide analytical tractability, while learning and evolutionary dynamics are proposed to evolve strategies.
published_or_final_version
Electrical and Electronic Engineering
Doctoral
Doctor of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

19

Zou, Li. "State and file sharing in peer-to-peer systems." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/8093.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Sharan, Ajitabh Sharan Ajitabh. "Exploiting semantic locality to improve peer-to-peer search mechanisms /." Online version of thesis, 2006. https://ritdml.rit.edu/dspace/handle/1850/2891.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Magharei, Nazanin 1979. "Peer-to-peer streaming: Design and challenges." Thesis, University of Oregon, 2010. http://hdl.handle.net/1794/11089.

Full text

Abstract:

xxii, 413 p. : ill.
Streaming multimedia content over the Internet is extremely popular mainly due to emerging applications such as IPTV, YouTube and e-learning. All these applications require simultaneous streaming of multimedia content from one or multiple sources to a large number of users. Such applications impose unique requirements in terms of server bandwidth and playback delay which are difficult to achieve in a scalable fashion with the traditional client-server architecture. Peer-to-peer (P2P) overlays offer a promising approach to support scalable streaming applications, that we broadly refer to as "P2P streaming". Design of a scalable P2P streaming mechanism that accommodates heterogeneity of peers' bandwidth and copes with dynamics of peer participation while ensuring in-time delivery of the multimedia content to individual peers is extremely challenging. Besides these fundamental challenges, P2P streaming applications are facing practical issues such as encouraging peers' contribution and decreasing the costly inter-ISP P2P traffic. In this dissertation, we study several aspects of live P2P streaming with the goal of improving the performance of such systems. This dissertation can be categorized into two parts as follows. ( i ) We present the design and evaluation of a mesh-based live P2P streaming mechanism, called PRIME. Further, we perform a head-to-head comparison between the two approaches on live P2P streaming, namely tree-based and mesh-based. We demonstrate the superiority of the mesh-based approach. In the quest for a systematic comparison of existing mesh-based solutions on live P2P streaming, we leverage the insights from our design in PRIME and propose an evaluation methodology. Utilizing the evaluation methodology, we compare the performance of existing mesh-based live P2P streaming solutions. ( ii ) From a more practical perspective, we tackle some of the existing practical issues in the deployment of live P2P streaming applications, namely providing incentives for participating peers to contribute their resources and designing ISP-friendly live P2P streaming protocols with the ultimate goal of reducing costly inter-ISP traffic. In the end, this dissertation reveals fundamental trade-offs in the design, comparison and meaningful evaluation of basic and practical live P2P streaming mechanisms under realistic settings. This dissertation includes my previously published and my co-authored materials.
Committee in charge: Prof. Reza Rejaie, Chair; Prof. Virginia Lo; Prof. Jun Li; Prof. David Levin; Prof. Markus Hofmann

APA, Harvard, Vancouver, ISO, and other styles

22

Wu, Yiping. "Bounded rationality for BitTorrent networks." Diss., Columbia, Mo. : University of Missouri-Columbia, 2008. http://hdl.handle.net/10355/6681.

Full text

Abstract:

Thesis (M.S.)--University of Missouri-Columbia, 2008.
The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on August 19, 2009) Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

23

Cheng, Kan-Leung. "Offering differentiated services for peer-to-peer streaming /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20CHENG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Zou, Li. "State and file sharing in peer-to-peer systems." Available online, Georgia Institute of Technology, 2004:, 2003. http://etd.gatech.edu/theses/available/etd-06072004-131435/unrestricted/zou%5Fli%5F200405%5Fphd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Hajiarabderkani, Masih. "Adaptive dissemination of network state knowledge in structured peer-to-peer networks." Thesis, University of St Andrews, 2015. http://hdl.handle.net/10023/6761.

Full text

Abstract:

One of the fundamental challenges in building Peer-to-Peer (P2P) applications is to locate resources across a dynamic set of nodes without centralised servers. Structured overlay networks solve this challenge by proving a key-based routing (KBR) layer that maps keys to nodes. The performance of KBR is strongly influenced by the dynamic and unpredictable conditions of P2P environments. To cope with such conditions a node must maintain its routing state. Routing state maintenance directly influences both lookup latency and bandwidth consumption. The more vigorously that state information is disseminated between nodes, the greater the accuracy and completeness of the routing state and the lower the lookup latency, but the more bandwidth that is consumed. Existing structured P2P overlays provide a set of configuration parameters that can be used to tune the trade-off between lookup latency and bandwidth consumption. However, the scale and complexity of the configuration space makes the overlays difficult to optimise. Further, it is increasingly difficult to design adaptive overlays that can cope with the ever increasing complexity of P2P environments. This thesis is motivated by the vision that adaptive P2P systems of tomorrow, would not only optimise their own parameters, but also generate and adapt their own design. This thesis studies the effects of using an adaptive technique to automatically adapt state dissemination cost and lookup latency in structured overlays under churn. In contrast to previous adaptive approaches, this work investigates the algorithmic adaptation of the fundamental data dissemination protocol rather than tuning the parameter values of a protocol with fixed design. This work illustrates that such a technique can be used to design parameter-free structured overlays that outperform other structured overlays with fixed design such as Chord in terms of lookup latency, bandwidth consumption and lookup correctness. A large amount of experimentation was performed, more than the space allows to report. This thesis presents a set of key findings. The full set of experiments and data is available online at: http://trombone.cs.st-andrews.ac.uk/thesis/analysis.

APA, Harvard, Vancouver, ISO, and other styles

26

Leung, Ka-ho Andrew. "Localized topology control in wireless peer-to peer file sharing networks." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B32048208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Leung, Ka-ho Andrew, and 梁嘉浩. "Localized topology control in wireless peer-to peer file sharing networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B32048208.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Guo, Dingding, and 郭丁丁. "On the efficiency of resources utilization in strategic peer-to-peer systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2014. http://hdl.handle.net/10722/206652.

Full text

Abstract:

Peer-to-peer (P2P) systems have achieved outstanding success during the past decades and much efforts has been put into investigating incentive mechanisms for strategic P2P networks. In the numerous studies of P2P system, efficient resource utilization has always been a critical factor in designing incentive schemes. Most existing studies try to encourage strategic peers to contribute more to the system, in order to maximize the resources. However, without considering how to effectively measure contributions and without adopting well-designed trading policies, simply motivating more contributions could lead to outcomes that do not match the original intention. This thesis, therefore, focuses on the investigation of efficient resource utilization in strategic P2P systems. First, it is found that increased contributions in terms of upload rate does not necessarily lead to better system performance. Observing that different chunks have different values to both the system and individual peers, a value-based metric is devised to measure contributions instead of using rate-based metrics. A variation of BitTorrent is also proposed, called value-based BitTorrent (VBT). VBT is found to effectively punish the strategic behaviors of an underreporting chunk map, and there is a positive correlation between investment and return for cooperative peers in VBT networks. Moreover, VBT always outperforms BitTorrent in terms of system performance. Second, taking the chunk value in the reciprocity process into consideration, the overpayment problem in a BitTorrent network is investigated, and four side effects of overpayment are identified. A new scheme is proposed to visualize overpayment and a series of metrics is proposed based on this method to quantify overpayment. The proposed value-based approach is found to be able to alleviate the degree of overpayment and consequently relieve the side effects of overpayment. Third, the performance of popular protocols in a P2P file-sharing system is investigated from the perspective of overpayment. These protocols are studied in two directions, when the measurement metrics are varied and when trading policy becomes tighter. The correlations between fairness, performance, and robustness are also examined. Finally, because overpayment is a fundamental problem of improper price setting, and auction is a widely used and effective method in setting prices in distributed systems. Auction is analytically proved that it is able to lead to optimal price without overpayment. However, most existing auction schemes are based on credit, which could induce a huge overhead in maintaining a monetary system, and monetary systems also have many inherent problems, such as inflation. The efficacy of applying an auction-like approach in P2P systems without money is investigated. A simplified version of the barter-based auction-like approach is tested in P2P file sharing and its overpayment degree is evaluated. Moreover, a novel barter-based auction-like approach is proposed for a P2P streaming system, and it is found that it can successfully punish strategic behaviors, with overall system performance outperforming a tit-for-tat strategy.
published_or_final_version
Electrical and Electronic Engineering
Doctoral
Doctor of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

29

Ou, Qi. "Bandwidth allocation algorithms for file distribution networks and location-aware topology construction in peer-to-peer networks /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?ECED%202007%20OU.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Agbeko, Joseph. "Evaluation and application of bloom filters in computer network security /." Connect to resource online, 2009. http://rave.ohiolink.edu/etdc/view?acc_num=ysu1253733230.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Needels, Keith. "Detecting and recovering from overlay routing attacks in peer-to-peer distributed hash tables /." Online version of thesis, 2008. http://hdl.handle.net/1850/8800.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Xie, Jing, and 謝靜. "Socio-aware random walk search and replication in peer-to-peer networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B43085556.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Xie, Jing. "Socio-aware random walk search and replication in peer-to-peer networks." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B43085556.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Chan, Kam-Hung. "SPANC : optimizing scheduling delay for peer-to-peer live streaming /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CSED%202009%20CHANK.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Chan, Siu-kei Jonathan. "Scheduling algorithms for data distribution in peer-to-peer collaborative file distribution networks." Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B3704588X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Chan, Siu-kei Jonathan, and 陳兆基. "Scheduling algorithms for data distribution in peer-to-peer collaborative file distribution networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2006. http://hub.hku.hk/bib/B3704588X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Leung, Man-Fung. "Peer-to-peer collaborative streaming among mobiles for video broadcasting /." View abstract or full-text, 2006. http://library.ust.hk/cgi/db/thesis.pl?COMP%202006%20LEUNG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Purandare, Darshan. "A framework for efficient data distribution in peer-to-peer networks." Doctoral diss., Orlando, Fla. : University of Central Florida, 2008. http://purl.fcla.edu/fcla/etd/CFE0002260.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Chakravarti, Arjav Jagannath. "Scientific computation on a peer-to-peer network using mobile agents." Columbus, Ohio : Ohio State University, 2004. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1086190904.

Full text

Abstract:

Thesis (Ph. D.)--Ohio State University, 2004.
Title from first page of PDF file. Document formatted into pages; contains xvii, 119 p.; also includes graphics. Includes abstract and vita. Advisor: Gerald Baumgartner, Dept. of Computer and Information Science. Includes bibliographical references (p. 111-119).

APA, Harvard, Vancouver, ISO, and other styles

41

Wen, Zheng, and 文峥. "Algorithm design of layered peer-to-peer video on demand streaming networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B50434433.

Full text

Abstract:

Peer-to-peer (P2P) video streaming has become a very popular and cost-effective solution to provide video-on-demand (VoD) streaming service to a large group of Internet users. Recent advances of layered video coding are shown to be promising in addressing the problem of receiver heterogeneity in P2P streaming networks. The key idea is to encode a raw video into multiple non-overlapped layers. Peers in the network can enjoy different streaming qualities by subscribing to different number of layers according to their specific network bandwidth. In this thesis, a systematic and comprehensive study of layered P2P VoD streaming networks is conducted. We first investigate the overlay construction problem that concerns the strategy of forming a logical overlay network for peers to exchange data pieces. We propose a neighbor relationship management algorithm to maintain a stable yet diversified neighbor set to facilitate adding or dropping a video layer, i.e. layer adaptation. Subsequently, an incentive scheme is designed to differentiate neighbors’ contributions at different layers, and a peer is allowed to adjust its number of neighbors according to its average service response time. We then develop an efficient layer adaptation algorithm for adjusting the number of video layers a peer subscribes to. We use a sliding buffer window for video piece scheduling, and make use of the time difference between the playback point and the starting point of the sliding window to initiate the process of adding or dropping a layer. A probing period is also introduced to ensure the adding decision is indeed correct. We next focus on designing piece scheduling algorithm for video data exchange among peers. At each peer, a utility function for calculating the relative importance of each missing video data piece is designed. In piece scheduling, a peer prefers a piece with higher utility value. We show that our utility based piece scheduling algorithm yields better video quality than conventional approaches. Last but not least, we study the request peer selection problem for identifying the most suitable neighbor for a peer to make a piece request. Two algorithms are designed, smallest service response time first (SSF) and closest playback point first (CPF). SSF ensures peers with larger uplink bandwidths to serve more requests, and CPF encourages a newly joined peer to contribute its uplink bandwidth as quickly as possible. We show that there exists a sweet spot by properly combining the two together. Although our algorithms are presented sequentially in addressing each of the problems above, they do interact with each other. Throughout our study, a comprehensive packet-level simulator is used to closely examine and analyze such interactions. With that, our algorithms are judicially designed and fine-tuned for best performance. To the best of our knowledge, our in-house developed simulator is the most comprehensive packet-level simulator for layered P2P VoD streaming.
published_or_final_version
Electrical and Electronic Engineering
Doctoral
Doctor of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

42

Kwan, Tin-man Tony. "Scalable content distribution in overlay networks." Click to view the E-thesis via HKUTO, 2007. http://sunzi.lib.hku.hk/hkuto/record/B3847900X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Kwan, Tin-man Tony, and 關天文. "Scalable content distribution in overlay networks." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2007. http://hub.hku.hk/bib/B3847900X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Chokkalingam, Arun Speegle Gregory D. Donahoo Michael J. Gipson Stephen L. Green Gina. "Analysis of transaction throughput in P2P environments." Waco, Tex. : Baylor University, 2005. http://hdl.handle.net/2104/3010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Huang, Wei, and 黄威. "The performance and locality tradeoff in bitTorrent file sharing systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2010. http://hub.hku.hk/bib/B45528585.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Ma, Hung Anh. "A sensor web service framework to enable realtime information sharing." Pullman, Wash. : Washington State University, 2009. http://www.dissertations.wsu.edu/Thesis/Summer2009/H_Ma_072209.pdf.

Full text

Abstract:

Thesis (M.S. in computer science)--Washington State University, August 2009.
Title from PDF title page (viewed on Sept. 22, 2009). "School of Engineering and Computer Science." Includes bibliographical references (p. 68-71).

APA, Harvard, Vancouver, ISO, and other styles

47

Meng, Xiang, and 孟翔. "Bandwidth partition strategies for minimizing peer-to-peer multi-file distribution time." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hub.hku.hk/bib/B5089996X.

Full text

Abstract:

Peer-to-Peer (P2P) technology has been developed rapidly during the past few years. Due to its superiorities on robustness and scalability, P2P technology has been viewed as a promising networking technology and many studies have been done on how to improve P2P technology. P2P file distribution, as a major application of P2P technology, has also been studied a lot. The amount of time required for all peers to get the file has been considered as a major optimization metric, which we refer as the file distribution time. Researchers have proposed protocols to minimize the file distribution time for different cases. However, most of the existing works are based on the single-file scenario. On the other hand, studies show that in a file sharing application, users may download multiple files at the same time. In this thesis, we analyze the file distribution time for the distribution of multiple files in both wired and wireless networks. We develop explicit expressions for lower bound of time needed to distribute multiple files in a heterogeneous P2P fluid model. Unlike the single-file scenario, we demonstrate that the theoretical lower bound in multi-file scenario is not always achievable. With a comprehensive consideration of all the configurations, we develop algorithms to partition the bandwidth of all the peers for a particular file such that the file distribution time is optimal.
published_or_final_version
Electrical and Electronic Engineering
Master
Master of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

48

Xie, Susu. "The large scale peer-to-peer (P2P) live streaming in the Internet /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20XIE.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Chowdhury, Farida. "Structured peer-to-peer overlays for NATed churn intensive networks." Thesis, University of Stirling, 2015. http://hdl.handle.net/1893/23038.

Full text

Abstract:

The wide-spread coverage and ubiquitous presence of mobile networks has propelled the usage and adoption of mobile phones to an unprecedented level around the globe. The computing capabilities of these mobile phones have improved considerably, supporting a vast range of third party applications. Simultaneously, Peer-to-Peer (P2P) overlay networks have experienced a tremendous growth in terms of usage as well as popularity in recent years particularly in fixed wired networks. In particular, Distributed Hash Table (DHT) based Structured P2P overlay networks offer major advantages to users of mobile devices and networks such as scalable, fault tolerant and self-managing infrastructure which does not exhibit single points of failure. Integrating P2P overlays on the mobile network seems a logical progression; considering the popularities of both technologies. However, it imposes several challenges that need to be handled, such as the limited hardware capabilities of mobile phones and churn (i.e. the frequent join and leave of nodes within a network) intensive mobile networks offering limited yet expensive bandwidth availability. This thesis investigates the feasibility of extending P2P to mobile networks so that users can take advantage of both these technologies: P2P and mobile networks. This thesis utilises OverSim, a P2P simulator, to experiment with the performance of various P2P overlays, considering high churn and bandwidth consumption which are the two most crucial constraints of mobile networks. The experiment results show that Kademlia and EpiChord are the two most appropriate P2P overlays that could be implemented in mobile networks. Furthermore, Network Address Translation (NAT) is a major barrier to the adoption of P2P overlays in mobile networks. Integrating NAT traversal approaches with P2P overlays is a crucial step for P2P overlays to operate successfully on mobile networks. This thesis presents a general approach of NAT traversal for ring based overlays without the use of a single dedicated server which is then implemented in OverSim. Several experiments have been performed under NATs to determine the suitability of the chosen P2P overlays under NATed environments. The results show that the performance of these overlays is comparable in terms of successful lookups in both NATed and non-NATed environments; with Kademlia and EpiChord exhibiting the best performance. The presence of NATs and also the level of churn in a network influence the routing techniques used in P2P overlays. Recursive routing is more resilient to IP connectivity restrictions posed by NATs but not very robust in high churn environments, whereas iterative routing is more suitable to high churn networks, but difficult to use in NATed environments. Kademlia supports both these routing schemes whereas EpiChord only supports the iterating routing. This undermines the usefulness of EpiChord in NATed environments. In order to harness the advantages of both routing schemes, this thesis presents an adaptive routing scheme, called Churn Aware Routing Protocol (ChARP), combining recursive and iterative lookups where nodes can switch between recursive and iterative routing depending on their lifetimes. The proposed approach has been implemented in OverSim and several experiments have been carried out. The experiment results indicate an improved performance which in turn validates the applicability and suitability of ChARP in NATed environments.

APA, Harvard, Vancouver, ISO, and other styles

50

Tang, Ho-Shing. "POPCA : optimizing segment caching for peer-to-peer on-demand streaming /." View abstract or full-text, 2008. http://library.ust.hk/cgi/db/thesis.pl?CSED%202008%20TANG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!