Since the invention of the Gutenberg Press, the infrastructure of content creation has been built on an industrial model, which has culminated in the current broadcast media narrative hegemony. This model of ‘‘mass media’’ is based on the notion that there is a centralized producer who distributes a large quantity of identical content ‘‘products’’ to a large, mass audience. This structure is bu...

The Branch and Bound (B&B) algorithm is one of the most used methods to solve in an exact way combinatorial optimization problems. In a previous article, we proposed a new approach of the parallel B&B algorithm for distributed systems using the farmer-worker paradigm. However, the new farmer-worker approach has a disadvantage: some nodes of the B&B tree can be explored by several B&B processes....

Traditional approaches for searching through websites for media files to download, and tracing broken links is a frustrating experience and a time consuming task for end users. This experience can be improved through Peer-to-Peer (P2P) computing. The notion of P2P or cooperative computing and resource sharing has been around for quite some time, but it wasn’t utilized until file sharing solutio...

Overlay-Netzwerke haben sich während der vergangenen Jahre zu einem neuen Paradigma im Bereich verteilter Systeme entwickelt. Sie erlauben es durch das Überlagern eines logischen Netzwerkes auf ein physikalisches Netzwerk, die Suche von verteilten Ressourcen unter Verwendung anwendungsspezifischer Schlüssel und Suchkriterien zu unterstützen. Dabei wird auf eine zentrale Koordination weitgehend ...

The peer-to-peer (P2P) paradigm for building distributed applications has recently gained attention from both industry and the media, following the enormous success of P2P systems like Napster, Gnutella and Freenet. The multitude of P2P projects appeared recently must confront common problems including security, reliability and routing. Unfortunately, traditional techniques for dealing with the...

With the advent of web applications such as Napster, Gnutella and Freenet, peer-to-peer (P2P) networks have gained unprecedented importance in the networking world. In this paper we study the effect of different network parameters on the performance of P2P networks supporting mobile code applications, and analyze various quality of service (QoS) issues such as response times, jitter and loss pr...

Since the appearance of Napster in 1999, peer-to-peer networks which don't distinguish clients with servers, have become one of the fastest growing and most popular Internet applications. Content location is a key function, but it presents a very difficult and challenging problem for large-scale peer-to-peer systems. A number of different methods are currently in use. However, new mechanism whi...

Popularized by Napster and Gnutella file sharing solutions, peer to peer (P2P) computing has suddenly emerged at the forefront of Internet computing. The basic notion of cooperative computing and resource sharing has been around for quite some time, although these new applications have opened up possibilities of very flexible web-based information sharing. This paper provides a framework for cl...

Searching a file by its name is an essential problem of a large peerto-peer file-sharing system. Napster and Gnutella have poor scalability. DHTbased systems do not keep the order of the keys. Skip graphs and SkipNet have too many links. In this paper, we present a new scalable distributed data structure LinkNet for searching in a large peer-to-peer system. In LinkNet, all elements are stored i...

Initial designs of P2P systems such as Napster, Gnutella and Freenet have significant scaling problems. Recently several research groups have independently proposed a new generation of topology-aware P2P systems to support scalable routing and location schemes. As the P2P architecture is becoming popular and more systems are introduced, we feel it necessary to propose an abstract and generic to...