Browsing by Subject "Peer-to-peer architecture (Computer networks)"
Now showing 1 - 5 of 5
Results Per Page
Sort Options
Item Design of a P2P-based network architecture for automated test equipment(Texas Tech University, 2004-05) Pandit, ParagSchemes that use intercormected devices such as control systems and Automated Test Equipment (ATE) traditionally use software that is built upon the client-server model. As a result, these systems are incapable of guaranteeing control of the master over slaves in the event of many cases of system failure. Also, these systems are often written in compiled languages like 'C' or 'Assembly', which makes the task of recompiling software and rebooting systems necessary when modifications are performed. In an effort to provide greater fault tolerance and reliability, we explore the possibility of using the P2P model for networking devices. Moreover, we attempt to use scripts for defíning system behavior, which provides flexibility and ease in making modifications at runtime. We met our goal by developing a distributed P2P architecture for confederations of devices and by defíning an XML-based scripting language for writing distributed applications that run on the said platform. Message protocols for communication between devices were defíned. Many useful features were implemented that make the framework powerfiil and yet simple to use.Item Designing a resilient routing infrastructure for peer-to-peer networks(2005) Liu, Huaiyu; Lam, Simon S., 1947-Item Designing incentives in P2P systems.(2013-09-24) Berciu, Radu Mihai.; Donahoo, Michael J.; Computer Science.; Baylor University. Dept. of Computer Science.The goal of this thesis is bringing closer together the game theoretic approach of creating incentives with the requirements and properties of P2P systems. Briefly, we detail the P2P system context that incentive mechanisms must address, focusing on the main properties (e.g., the existence of cheap identities), types of transacted goods, common goals (e.g., maximize utilization, robustness to rational manipulations) and common problems (e.g., easy-riding) of such systems; we define the design space for P2P incentive mechanisms through the first taxonomy for such mechanisms and examine the main classes; we analyze in-depth how known incentive mechanisms achieve their goals, from both a P2P systems and a game theory perspectives using BitTorrent and mechanism design models; we bundle our prescriptions into a framework for designing P2P incentive mechanisms, and we use it to create an incentive mechanism for a BitTorrent-like system.Item Economic issues in distributed computing(2007) Huang, Yun, 1973-; Whinston, Andrew B.On the Internet, one of the essential characteristics of electronic commerce is the integration of large-scale computer networks and business practices. Commercial servers are connected through open and complex communication technologies, and online consumers access the services with virtually unpredictable behavior. Both of them as well as the e-Commerce infrastructure are vulnerable to cyber attacks. Among the various network security problems, the Distributed Denial-of-Service (DDoS) attack is a unique example to illustrate the risk of commercial network applications. Using a massive junk traffic, literally anyone on the Internet can launch a DDoS attack to flood and shutdown an eCommerce website. Cooperative technological solutions for Distributed Denial-of-Service (DDoS) attacks are already available, yet organizations in the best position to implement them lack incentive to do so, and the victims of DDoS attacks cannot find effective methods to motivate the organizations. Chapter 1 discusses two components of the technological solutions to DDoS attacks: cooperative filtering and cooperative traffic smoothing by caching, and then analyzes the broken incentive chain in each of these technological solutions. As a remedy, I propose usage-based pricing and Capacity Provision Networks, which enable victims to disseminate enough incentive along attack paths to stimulate cooperation against DDoS attacks. Chapter 2 addresses possible Distributed Denial-of-Service (DDoS) attacks toward the wireless Internet including the Wireless Extended Internet, the Wireless Portal Network, and the Wireless Ad Hoc network. I propose a conceptual model for defending against DDoS attacks on the wireless Internet, which incorporates both cooperative technological solutions and economic incentive mechanisms built on usage-based fees. Cost-effectiveness is also addressed through an illustrative implementation scheme using Policy Based Networking (PBN). By investigating both technological and economic difficulties in defense of DDoS attacks which have plagued the wired Internet, our aim here is to foster further development of wireless Internet infrastructure as a more secure and efficient platform for mobile commerce. To avoid centralized resources and performance bottlenecks, online peer-to-peer communities and online social network have become increasingly popular. In particular, the recent boost of online peer-to-peer communities has led to exponential growth in sharing of user-contributed content which has brought profound changes to business and economic practices. Understanding the dynamics and sustainability of such peer-to-peer communities has important implications for business managers. In Chapter 3, I explore the structure of online sharing communities from a dynamic process perspective. I build an evolutionary game model to capture the dynamics of online peer-to-peer communities. Using online music sharing data collected from one of the IRC Channels for over five years, I empirically investigate the model which underlies the dynamics of the music sharing community. Our empirical results show strong support for the evolutionary process of the community. I find that the two major parties in the community, namely sharers and downloaders, are influencing each other in their dynamics of evolvement in the community. These dynamics reveal the mechanism through which peer-to-peer communities sustain and thrive in a constant changing environment.Item Ranch: a dynamic network topology(2004) Li, Xiaozhou; Plaxton, C. GregPeer-to-peer computing is an emerging paradigm that has the potential of harnessing enormous amounts of under-utilized computational resources (e.g., home computers). A central problem in peer-to-peer computing is how to organize the network nodes so that sophisticated applications can be efficiently supported. The cornerstone of a peer-to-peer network is a dynamic network topology that determines the neighbor relationships to be maintained by the network nodes. This dissertation is concerned with algorithmic and concurrency issues in dynamic network topologies. We present Ranch (random cyclic hypercube), a simple, recursive topology consisting of a collection of rings. Ranch is a scalable topology. In particular, it has logarithmic in-degree, out-degree, and diameter, and it uses only a logarithmic number of messages for a node to join or leave the network. Ranch also has a number of additional desirable properties, including locality awareness and fault tolerance. We show how to build a name resolution scheme for Ranch that enables the peer-topeer network to find data items efficiently. Our results include a name replication scheme and a fault-tolerant lookup algorithm. We address the problem of topology maintenance in peer-to-peer networks, that is, how to properly update the neighbor variables when nodes join and leave the network, possibly concurrently. We design, and prove the correctness of, protocols that maintain the ring topology, the basis of several peer-to-peer networks, in the fault-free environment. Our protocols handle both joins and leaves actively (i.e., they update the neighbor variables as soon as a join or a leave occurs). We use an assertional method to prove the correctness of our protocols, that is, we first design a global invariant for a protocol and then show that every action of the protocol preserves the invariant. Our protocols are simple and our proofs are rigorous and explicit. We extend our results on the maintenance of rings to address the maintenance of Ranch. We present active and concurrent maintenance protocols that handle both joins and leaves for Ranch, along with their assertional correctness proofs. The protocols for Ranch use the protocols for rings as a building block. The protocols and the correctness proofs for Ranch substantially extend those for rings. We present simulation results that demonstrate the scalability and locality awareness of Ranch.