The rapid growth of peer-to-peer (P2P) networks in the past few years has brought with it increases in transit cost to Internet Service Providers (ISPs), as peers exchange large amounts of traffic across ISP boundaries. This ISP oblivious behavior has resulted in misalignment of incentives between P2P networks|that seek to maximize user quality|and ISPs|that would seek to minimize costs. Can we design a P2P overlay that accounts for both ISP costs as well as quality of service, and attains a desired tradeoff between the two? We design a system, which we call MultiTrack, that consists of an overlay of multiple kinds of Trackers whose purpose it is to align these goals. We have mTrackers that form an overlay network among themselves, and split demand from users among different ISP domains while trying to minimize their individual costs (delay plus transit cost) in their ISP domain. We design the signals in this overlay of mTrackers in such a way that potentially competitive individual optimization goals are aligned across the mTrackers. The system could also have a tTracker that acts as a gateway into the system, and ensures that users who are from different ISP domains have a fair chance of being admitted into the system, while keeping costs in check. We prove analytically that our system is stable and achieves maximum utility with minimum cost. We validated our system design using Matlab simulations, and implemented the system on ns-2 in order to conduct more realistic experiments. We showed that our system significantly outperforms two types of systems, one in which user delay is the only control dimension (forwarding traffic without considering the transit prices) and a second system in which transit prices are the only control dimension (localized traffic only). Thus, we conclude that our system, that operates in two dimensions: (1) user delay and (2) transit prices, results in minimum cost and maximum utility for fixed capacity of the system.

A "peer advisory group" essentially melds a business advisory board with a peer group. Peer advisory groups consist of business managers who meet together for the purpose of mutual self-improvement and learning through the sharing of experiences. The entire peer advisory group concept encompasses many variations and this research focuses on groups consisting of farm managers. Unfortunately, some farm managers who wish to participate have expressed frustration with group formation: they find it difficult to identify suitable individuals to participate in a peer advisory group with. Peer advisory groups can take many forms, and experts have suggested an individual should specifically seek out people interested in the same type of group. For example, an individual who wants to strictly focus discussion on production issues should seek out other individuals who also seek to focus on production discussions. Some individuals have suggested that some type of "clearinghouse" organizations could be beneficial in assisting individuals with the peer advisory group formation problem. Such an organization would likely need to adapt some sort of method for identifying individuals who have interest in a similar type of group. Although this could be approached from several different angles, one possible approach involves the practice of cluster analysis?a wide set of procedures intended to break down a set of objects into "clusters" of individuals with similar attributes. Cluster analysis comes with several attractive benefits; however, literature includes countless variations in the methods and criticisms of certain aspects of the methodology. This thesis focuses on using cluster analysis to assist with peer advisory group formation. More specifically, this thesis seeks to answer the following question: how could a clearinghouse organization apply cluster analysis methods to a pool of candidates to effectively create peer advisory groups congruent to the individuals' needs and wants? An approach was proposed which differs slightly from traditional cluster analysis methods, and this was applied to a hypothetical pool of candidates, along with several control methods. The proposed approach was found to most effectively create peer advisory groups which fulfilled the desires of the individuals.

Peer-to-peer technologies have shown a lot of promise in sharing the remote resources effectively. The resources shared by peers are information, bandwidth, storage space or the computing power. When used properly, they can prove to be very advantageous as they scale well, are dynamic, autonomous, fully distributed and can exploit the heterogeneity of peers effectively. They provide an efficient infrastructure for an application seeking to distribute numerical computation. In this thesis, we investigate the feasibility of using a peer-to-peer infrastructure to distribute the computational load of Matlab and similar applications to achieve performance benefits and scalability. We also develop a proof of concept application to distribute the computation of a Matlab style application.

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.

In a video-on-demand streaming system, each user watch dufferent video frame according to their arrival time. In the thesis, the concept of multi-source and the forward error correction scheme are implemented to decrease the workload bandwidth of server and reduce the packet loss probability of each peer in the peer-to-peer video-on-demand system. Here, in order to share data to some peers arrive later, each peer must cache part of video data that recently viewed. Each new arrival peer needs to contact multiple sources who have initial part of video data to get video streaming data, and each source transmits different part of video streaming. Once receiving all of these partial stream, the peer will get completely video data. Simulation shows that a suitable preserve time of peers in the system can be used. Thus, the workload bandwidth of server used and memory used by peers can be reduced, too. Furthermore, the packet loss probability is decreased by the sources diversity and the FEC recovery.

Due to the fast growing bandwidth of Internet users, the P2P video streaming on the Internet becomes one of impaortant solutions to release the traffic load. However, the current studies fall short of addressing the video delay issue on live P2P streaming. In this research, we proposed a topology construction method: Smart-Fit, towards minimizing the transmission delay between users and video server. The concept is based on minimizing the hop counts between server and users, in further to reduce the delay. With the bandwidth variety of Internet users, the proppsed method builds a predicted ideal template. Then the users¡¦ joining and leaving behaviors and the system¡¦s topology are constructed according to the template. Simulation results show the proposed method successfully reduces the hop count and the transmission delay between users and server. Moreover, due to the reduction of hop count, the packet loss rate is also reduced.

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.

<p>Fildelning har på sistone varit ett aktuellt ämne i media där den nya upphovsrättslagen har diskuterats för fullt. När den nya upphovsrättslagen infördes 1 juli 2005 i Sverige, skapades det ett intresse från vår sida att undersöka vilken inverkan den nya lagen skulle få och om den skulle lyckas minska fildelningen.</p><p>Denna teknik går till så att man delar med sig av sina filer (media till andra användare antingen genom Internet eller i ett nätverk. Genom att dela med sig av sina filer kan man själv få tillgång till andras filer. Men för att kunna fildela krävs det att man använder speciella fildelningsprogram som exempelvis Bittorrent, DC och Kazaa. Det som vi strävar efter med denna rapport är att se om lagen har påverkat fildelarnas attityd gentemot fildelning, men också hur den nya upphovsrättslagen har påverkat fildelningen idag.</p><p>I referensramen har vi tagit upp redan befintlig fakta (sekundär data) som vi anser relevant för forskningens syfte. Här vill vi att läsaren ska kunna sätta sig in i arbetet för att lättare förstå och få en överblick över fildelning och dess lag. Intresseorganisationen Antipiratbyrån har beskrivits kortfattat eftersom de är den största organisationen i Sverige som kämpar för att stoppa illegal fildelning men vi har också tagit upp lite om Piratbyrån som är för fildelning och är Antipiratbyråns största rival. Här har vi även tagit upp de två första fildelningsfallen i Sverige.</p><p>Vi har även samlat in primär data från olika tänkbara fildelare. En enkät har utvecklats som besvarades av 92 respondenter i åldrarna 16-35 år. De har delats ut i Jönköpings högskolor, Per Brahe gymnasiet samt på allmänna platser. Enkäten fokuserar på ämnet fildelning, men också på upphovsrättslagen och innehåller mest frågor med bestämda svarsalternativ men också några frågor med öppna svar, där respondenterna får svara med egna ord. Enkätundersökningen är av kvantitativ karaktär medan analysen av enkäterna är av kvalitativ karaktär.</p><p>Utifrån vår referensram, samt våra resultat från enkäten har vi försökt analysera dessa så gott det går och svarat på våra två forskningsfrågor.</p><p>Vi har kommit fram till att upphovsrättslagen inte fungerar tillräckligt bra. Genom enkäten har vi dragit slutsatsen till att ingen reducering av fildelning har skett. Av de många anmälningar som gjorts av Antipiratbyrån har också bara ett fåtal fall gått till domstol. För att upphovsrättslagen ska fungera bättre krävs det mer insatser för att stoppa fildelningen.</p>

Gemeinsamer Workshop von Universitaetsrechenzentrum und Professur Rechnernetze und verteilte Systeme der Fakultaet fuer Informatik der TU Chemnitz. Anhand des Freenet-Projektes wird erklärt, wie anonymes Filesharing funktioniert. Der Vortrag beschreibt den Aufbau und die Funktion von Freenet und wie man Daten in Freenet einspielt bzw. wiederfinden kann. Es werden Vor und Nachteile von Freenet gegenüber anderen Projekten genannt.

Gemeinsamer Workshop von Universitaetsrechenzentrum und Professur Rechnernetze und verteilte Systeme der Fakultaet fuer Informatik der TU Chemnitz. Es wird ein Konzept zur verteilten Datensicherung auf potentiell unsicheren Klienten beschrieben.