111 |
Impact and Analysis of Internet Service using random portHsu, Yu-San 12 February 2008 (has links)
Over the last few years, peer-to-peer (P2P) applications have relentlessly grown
to represent a formidable component of Internet traffic. In contract to P2P networks
witch used well-defined port number, current P2P applications have use of arbitrary
ports. As P2P applications continue to evolve, robust and effective methods are
methods are needed for P2P traffic identification. Many P2P applications are
bandwidth-intensive. Understanding the Internet traffic profile is important for several
reasons, including traffic engineering, network service pricing.
In this Thesis, we integrated port-based method into original Classifier which is
using content-based method only. Therefore, we can improve the recognition rate for
Classifier and identify more applications. We also verified our Classifier recognition
rate by using the results of Service Control Engine.
|
112 |
A vEB-Tree based Strategy for Interactive VoD Services in P2P NetworksTsai, Ming-te 28 August 2009 (has links)
To provide interactive operations such as fast-forward, slow-forward, switch channel, and jump function for peer-to-peer on demand video streaming is a challenge. In this thesis, we proposed a vEB-tree (van Emde Boas tree) based architecture for interactive VoD services in peer-to-peer networks. The proposed architecture assumes videos can be divided into many segments, and these segments are stored in each peer. In the architecture, it includes vEB-tree based topology, procedure of demand segment search, and a distribution scheme. It not only efficiently provides interactive operations but also reduces the control messages. Additionally, each peer stores segments based on the proposed distribution scheme to reduce the server stress. Experimental results demonstrate that the proposed architecture outperforms Baton, BBTU, and VMesh in terms of jump latency, server stress, and neighbors¡¦ maintenance cost.
|
113 |
Robust peer-to-peer systemsLi, Harry Chu-Kit 28 April 2015 (has links)
Peer-to-peer (p2p) approaches are an increasingly effective way to deploy services. Popular examples include BitTorrent, Skype, and KaZaA. These approaches are attractive because they can be highly fault-tolerant, scalable, adaptive, and less expensive than a more centralized solution. Cooperation lies at the heart of these strengths. Yet, in settings where working together is crucial, a natural question is: "What if users stop cooperating?" After all, cooperative services are typically deployed over multiple administrative domains, and thus vulnerable to Byzantine failures and users who may act selfishly. This dissertation explores how to construct p2p systems to tolerate Byzantine participants while also incentivizing selfish participants to contribute resources. We describe how to balance obedience against choice in building a robust p2p live streaming system. Imposing obedience is desirable as it leaves little room for peers to attack or cheat the system. However, providing choice is also attractive as it allows us to engineer flexible and efficient solutions. We first focus on obedience by using Nash equilibria to drive the design of BAR Gossip, the first gossip protocol that is resilient to Byzantine and selfish nodes. BAR Gossip relies on verifiable pseudo-random partner selection to eliminate non-determinism, which can be used to game the system, while maintaining the robustness and rapid convergence of traditional gossip. A novel fair enough exchange primitive entices cooperation among selfish peers on short timescales, thereby avoiding the need for distributed reputation schemes. We next focus on tempering obedience with choice by using approximate equilibria to guide the construction of a novel p2p live streaming system. These equilibria allow us to design incentives to limit selfish behavior rigorously, yet provide sufficient flexibility to build practical systems. We show the advantages of using an [element of]-Nash equilibrium, instead of an exact Nash, to design and implement FlightPath, our live streaming system that uses bandwidth efficiently, absorbs flash crowds, adapts to sudden peer departures, handles churn, and tolerates malicious activity. / text
|
114 |
Resistance commons : file-sharing litigation and the social system of commoningCaraway, Brett Robert, 1974- 28 September 2011 (has links)
This dissertation is an investigation into the practice of peer-to-peer file-sharing and the litigation campaign targeting individual file-sharers carried out by the Recording Industry Association of America (RIAA) from 2003 to 2008. The competing conceptualizations of social relations which motivate the conflict over peer-to-peer file-sharing are explored using a combination of Autonomist Marxist theory and structuration theory. Peer-to-peer file-sharing is framed as part of the social system of commoning stemming from the recent ascendancy of immaterial labor within that sector of the economy dedicated to the production and distribution of informational and cultural goods. The RIAA litigation campaign is framed as a reaction to the emergence of new forms of social relations which are seen by the content-producing industries as subversive of revenue streams premised on commodity exchange in informational and cultural goods. The history of the RIAA litigation campaign is presented in detail with careful attention given to those instances in which defendants and other interested parties fought back against RIAA legal actions. The acts of resistance within the legal arena affected the ultimate potential of the litigation campaign to control the spread of file-sharing activities. Subsequent legal campaigns which have been based on the RIAA litigation model are also examined. These later file-sharing cases have been met with similar forms of resistance which have likewise mitigated the impact of legal efforts to combat file-sharing. In addition, a survey of file-sharers is included in this research as part of an attempt to understand the relationship between legal actions targeting peer-to-peer systems and individual file-sharers and the technological and social development of peer-to-peer systems. This research argues that file-sharing litigation has proven ineffective in turning back the flood of file-sharing and may have increased the technological sophistication and community ties among file-sharers. In the end, the conflict over peer-to-peer file-sharing is cast as a manifestation of a larger dynamic of capitalist crisis as content-producing industries attempt to come to terms with the contradictory tendencies of immaterial labor and the production of common pools of digital resources. / text
|
115 |
The effect of P2P marketplaces on retailing in the presence of mismatch riskJiang, Lifei January 2014 (has links)
Consumers frequently face mismatch risk as goods they purchase may be deemed inappropriate or below expectations. Due to this risk, consumers may avoid purchasing such goods and consequently hurt retailers. Can the emergence of peer-to-peer (P2P) marketplaces benefit retailers? On the one hand, P2P marketplaces can mitigate some of this risk by allowing consumers to trade mismatched goods. On the other hand, P2P marketplaces impose a threat on retailers as they compete with them over consumers. We develop a two-period model that highlights the effects introduced by P2P marketplaces.
We show that a P2P marketplace benefits both the retailer and consumers when the
wholesale price is sufficiently high and hurts them both when the wholesale price is low. The introduction of a P2P marketplace can relieve consumers from the mismatch risk and induces the retailer to post a higher price. However, when the wholesale price is low, the platform manages to extract most, or all, of the consumers surplus and directly hurts consumers, and eventually the retailer who experiences lower sales in both periods. With a high wholesale price the P2P marketplace is limited in its ability of extracting consumer surplus, which increases the retailer sales and benefits both the retailer and consumers. We further observe that social welfare is generally higher unless the wholesale price is relatively low.
|
116 |
Decentralized Web SearchHaque, Md Rakibul 08 June 2012 (has links)
Centrally controlled search engines will not be sufficient and reliable for indexing and
searching the rapidly growing World Wide Web in near future. A better solution is to enable the Web to index itself in a decentralized manner. Existing distributed approaches for ranking search results do not provide flexible searching, complete results and ranking with high accuracy. This thesis presents a decentralized Web search mechanism, named DEWS, which enables existing webservers to collaborate with each other to form a distributed index of the Web. DEWS can rank the search results based on query keyword relevance and relative importance of websites in a distributed manner preserving a hyperlink overlay on top of a structured P2P overlay. It also supports approximate matching of query keywords using phonetic codes and n-grams along with list decoding of a linear covering
code. DEWS supports incremental retrieval of search results in a decentralized manner which reduces network bandwidth required for query resolution. It uses an efficient routing mechanism extending the Plexus routing protocol with a message aggregation technique. DEWS maintains replica of indexes, which reduces routing hops and makes DEWS robust to webservers failure. The standard LETOR 3.0 dataset was used to validate the DEWS protocol. Simulation results show that the ranking accuracy of DEWS is close to the centralized case, while network overhead for collaborative search and indexing is logarithmic on network size. The results also show that DEWS is resilient to changes in the available pool of indexing webservers and works efficiently even in the presence of heavy query load.
|
117 |
Relaxing Routing Table to Alleviate Dynamism in P2P SystemsFang, Hui, Hsu, Wen Jing, Rudolph, Larry 01 1900 (has links)
In dynamic P2P networks, nodes join and depart from the system frequently, which partially damages the predefined P2P structure, and impairs the system performance such as basic lookup functionality. Therefore stabilization process has to be done to restore the logical topology. This paper presents an approach to relax the requirement on routing tables to provide provably better stability than fixed structured P2P systems. We propose a relaxed Chord that keeps the O(logN) number of hops for greedy lookup, but it requires less stabilization overhead. It allows a tradeoff between lookup efficiency and structure flexibility without adding any overhead to the system. In the relaxed routing structure, each routing entry ("finger") of the node is allowed to vary within a set of values. Each node only needs to keep a certain number of fingers that point to nodes in its anchor set. This relaxation reduces the burden of state management of the node. The relaxed routing scheme provides an alternative structure other than randomized P2P and deterministic P2P, by relaxing on finger selection. It provides good flexibility and therefore extends the system functioning time. / Singapore-MIT Alliance (SMA)
|
118 |
Detecção, gerenciamento e consulta a réplicas e a versões de documentos XML / Detection, management and querying of replicas and versions of XML documentsSaccol, Deise de Brum January 2008 (has links)
O objetivo geral desta tese é a detecção, o gerenciamento e a consulta às réplicas e às versões de documentos XML. Denota-se por réplica uma cópia idêntica de um objeto do mundo real, enquanto versão é uma representação diferente, mas muito similar, deste objeto. Trabalhos prévios focam em gerenciamento e consulta a versões conhecidas, e não no problema da detecção de que dois ou mais objetos, aparentemente distintos, são variações (versões) do mesmo objeto. No entanto, o problema da detecção é crítico e pode ser observado em diversos cenários, tais como detecção de plágio, ranking de páginas Web, identificação de clones de software e busca em sistemas peer-to-peer (P2P). Nesta tese assume-se que podem existir diversas réplicas de um documento XML. Documentos XML também podem ser modificados ao longo do tempo, ocasionando o surgimento de versões. A detecção de réplicas é relativamente simples e pode ser feita através do uso de funções hash. Já a detecção de versões engloba conceitos de similaridade, a qual pode ser medida por várias métricas, tais como similaridade de conteúdo, de estrutura, de assunto, etc. Além da análise da similaridade entre os arquivos também se faz necessária a definição de um mecanismo de detecção de versões. O mecanismo deve possibilitar o gerenciamento e a posterior consulta às réplicas e às versões detectadas. Para que o objetivo da tese fosse alcançado foram definidos um conjunto de funções de similaridade para arquivos XML e o mecanismo de detecção de réplicas e de versões. Também foi especificado um framework onde tal mecanismo pode ser inserido e os seus respectivos componentes, que possibilitam o gerenciamento e a consulta às réplicas e às versões detectadas. Foi realizado um conjunto de experimentos que validam o mecanismo proposto juntamente com a implementação de protótipos que demonstram a eficácia dos componentes do framework. Como diferencial desta tese, o problema de detecção de versões é tratado como um problema de classificação, para o qual o uso de limiares não é necessário. Esta abordagem é alcançada pelo uso da técnica baseada em classificadores Naïve Bayesianos. Resultados demonstram a boa qualidade obtida com o mecanismo proposto na tese. / The overall goals of this thesis are the detection, management and querying of replicas and versions of XML documents. We denote by replica an identical copy of a real-world object, and by version a different but very similar representation of this object. Previous works focus on version management and querying rather than version detection. However, the version detection problem is critical in many scenarios, such as plagiarism detection, Web page ranking, software clone identification, and peer-to-peer (P2P) searching. In this thesis, we assume the existence of several replicas of a XML document. XML documents can be modified over time, causing the creation of versions. Replica detection is relatively simple and can be achieved by using hash functions. The version detection uses similarity concepts, which can be assessed by some metrics such as content similariy, structure similarity, subject similarity, and so on. Besides the similarity analysis among files, it is also necessary to define the version detection mechanism. The mechanism should allow the management and the querying of the detected replicas and versions. In order to achieve the goals of the thesis, we defined a set of similarity functions for XML files, the replica and version detection mechanism, the framework where such mechanism can be included and its components that allow managing and querying the detected replicas and versions. We performed a set of experiments for evaluating the proposed mechanism and we implemented tool prototypes that demonstrate the accuracy of some framework components. As the main distinguishing point, this thesis considers the version detection problem as a classification problem, for which the use of thresholds is not necessary. This approach is achieved by using Naïve Bayesian classifiers.
|
119 |
Protocolos de Reputação P2P em Ambientes Ubíquos: Uma Avaliação ExperimentalCarneiro, Elisangela Oliveira 26 October 2010 (has links)
Submitted by Diogo Barreiros (diogo.barreiros@ufba.br) on 2017-02-09T19:37:44Z
No. of bitstreams: 1
dissertacaoElisangelaPPGM.pdf: 2041806 bytes, checksum: 9ec98390f6bfd12f39e3ece4ab870686 (MD5) / Approved for entry into archive by Vanessa Reis (vanessa.jamile@ufba.br) on 2017-02-10T11:28:44Z (GMT) No. of bitstreams: 1
dissertacaoElisangelaPPGM.pdf: 2041806 bytes, checksum: 9ec98390f6bfd12f39e3ece4ab870686 (MD5) / Made available in DSpace on 2017-02-10T11:28:44Z (GMT). No. of bitstreams: 1
dissertacaoElisangelaPPGM.pdf: 2041806 bytes, checksum: 9ec98390f6bfd12f39e3ece4ab870686 (MD5) / Os sistemas entre pares (P2P) são distribuídos e construídos através da colaboração dos seus participantes, portanto, costumam ser autoorganizáveis e escaláveis. Os ambientes ubíquos são formados por dispositivos completamente autônomos, que se conectam de forma espontânea com o objetivo de receber e/ou fornecer algum tipo de serviço. Os modelos empregados nas redes P2P apresentam características adequadas às necessidades dos ambientes ubíquos, já que suportam dinamismo e não possuem um controle centralizado para coordenar as ações dos usuários. Em tais sistemas, as interações ocorrem entre usuários desconhecidos ou que não se conhecem muito bem, o que os tornam vulneráveis aos ataques de usuários maliciosos. Os sistemas de reputação são propostos para facilitar as interações entre os participantes através do fornecimento de informações que possam determinar o grau de confiança das entidades. Este trabalho tem como principal objetivo avaliar a robustez de protocolos de reputação P2P e sua adequação aos ambientes ubíquos. Para isso, construiu-se o simulador PeerRepSim (Simulador para Redes P2P e Sistemas de Reputação) baseado em modelo de ciclos de busca, que simula um sistema de compartilhamento de arquivos. A partir dos resultados gerados nas simulações verificou-se a robustez dos protocolos avaliados diante de um conjunto de ataques de usuários maliciosos. Além da robustez foi possível inferir sobre o comportamento da rede no que diz respeito à complexidade das mensagens, ao armazenamento e à computação requerida pelos protocolos. A partir destas informações identificou-se os protocolos de reputação mais adequados aos ambientes ubíquos, levando-se em consideração às limitações dos dispositivos que fazem parte destes ambientes.
|
120 |
Detecção, gerenciamento e consulta a réplicas e a versões de documentos XML / Detection, management and querying of replicas and versions of XML documentsSaccol, Deise de Brum January 2008 (has links)
O objetivo geral desta tese é a detecção, o gerenciamento e a consulta às réplicas e às versões de documentos XML. Denota-se por réplica uma cópia idêntica de um objeto do mundo real, enquanto versão é uma representação diferente, mas muito similar, deste objeto. Trabalhos prévios focam em gerenciamento e consulta a versões conhecidas, e não no problema da detecção de que dois ou mais objetos, aparentemente distintos, são variações (versões) do mesmo objeto. No entanto, o problema da detecção é crítico e pode ser observado em diversos cenários, tais como detecção de plágio, ranking de páginas Web, identificação de clones de software e busca em sistemas peer-to-peer (P2P). Nesta tese assume-se que podem existir diversas réplicas de um documento XML. Documentos XML também podem ser modificados ao longo do tempo, ocasionando o surgimento de versões. A detecção de réplicas é relativamente simples e pode ser feita através do uso de funções hash. Já a detecção de versões engloba conceitos de similaridade, a qual pode ser medida por várias métricas, tais como similaridade de conteúdo, de estrutura, de assunto, etc. Além da análise da similaridade entre os arquivos também se faz necessária a definição de um mecanismo de detecção de versões. O mecanismo deve possibilitar o gerenciamento e a posterior consulta às réplicas e às versões detectadas. Para que o objetivo da tese fosse alcançado foram definidos um conjunto de funções de similaridade para arquivos XML e o mecanismo de detecção de réplicas e de versões. Também foi especificado um framework onde tal mecanismo pode ser inserido e os seus respectivos componentes, que possibilitam o gerenciamento e a consulta às réplicas e às versões detectadas. Foi realizado um conjunto de experimentos que validam o mecanismo proposto juntamente com a implementação de protótipos que demonstram a eficácia dos componentes do framework. Como diferencial desta tese, o problema de detecção de versões é tratado como um problema de classificação, para o qual o uso de limiares não é necessário. Esta abordagem é alcançada pelo uso da técnica baseada em classificadores Naïve Bayesianos. Resultados demonstram a boa qualidade obtida com o mecanismo proposto na tese. / The overall goals of this thesis are the detection, management and querying of replicas and versions of XML documents. We denote by replica an identical copy of a real-world object, and by version a different but very similar representation of this object. Previous works focus on version management and querying rather than version detection. However, the version detection problem is critical in many scenarios, such as plagiarism detection, Web page ranking, software clone identification, and peer-to-peer (P2P) searching. In this thesis, we assume the existence of several replicas of a XML document. XML documents can be modified over time, causing the creation of versions. Replica detection is relatively simple and can be achieved by using hash functions. The version detection uses similarity concepts, which can be assessed by some metrics such as content similariy, structure similarity, subject similarity, and so on. Besides the similarity analysis among files, it is also necessary to define the version detection mechanism. The mechanism should allow the management and the querying of the detected replicas and versions. In order to achieve the goals of the thesis, we defined a set of similarity functions for XML files, the replica and version detection mechanism, the framework where such mechanism can be included and its components that allow managing and querying the detected replicas and versions. We performed a set of experiments for evaluating the proposed mechanism and we implemented tool prototypes that demonstrate the accuracy of some framework components. As the main distinguishing point, this thesis considers the version detection problem as a classification problem, for which the use of thresholds is not necessary. This approach is achieved by using Naïve Bayesian classifiers.
|
Page generated in 0.0284 seconds