The Special Interest Group on Communications gives one of the most famous computer science conferences, abbreviated SIGCOMM. The conference features landmark research. In this talk, I introduce interesting topics of the 205 SIGCOMM.
Peer-to-Peer (P2P) file-sharing has become the killer application in the wired Internet and might also be highly attractive for mobile networks. In particular since UMTS operators are searching for new applications which do both: a) exploit the potential of the UMTS technology and b) motivate the user to adopt the new technology. In this work we are investigating the performance of an eDonkey-based mobile P2P filesharing system bymeans of time-dynamic simulation. Mobile networks differ from wireline networks by the limited capacity of the radio link and the mobility of the users. P2P networks, in contrast, are overlays which consider the transport network in an abstract way. In a mobile environment, the question arises, whether the abstraction can be maintained and what will be the performance impact if there is any. We will show in detail how the mobile access technology (GPRS or UMTS), the churn behavior of mobile users, the file size of mobile specific content, and special infrastructure entities, such as a cache peer, influences the performance of the suggested mobile P2P file-sharing service.
Weiterlesen: Simulative Performance Evaluation of a Mobile Peer-to-Peer File-Sharing System
Traffic engineering in P2P networks deals with organizing overlay networks. The challenge of unavailability has not been mastered yet. Considering the resource allocation can gain further improvements. While adapting P2P file sharing into mobile infrastructures, we learned that replication is a solution to both issues: availability and traffic optimization.
Weiterlesen: P2P Replication Revisited: Mobile Infrastructures
File-sharing in mobile networks has differing demands to a P2P architecture. Resource access and mediation techniques must follow constraints given in 2.5G/3G networks. Enhancing the eDonkey protocol, we reconcile decentralized operation with traffic control.
Weiterlesen: An Architecture Concept for Mobile P2P File Sharing Services
Incentive mechanisms protect P2P networks from free-riders. Pricing controls the cost and benefit of cooperation, e.g., the granted upload-download ratio. Some file-sharing networks enforce cooperation by credit-based mechanisms. The locally-stored credit value rates the willingness to grant service to a certain peer. As an incentive, future requests of cooperative peers are accelerated. We examine the correlation of available bandwidth, received data rate, credits, and pricing. In our results we identify the limitations of this incentive mechanism, especially when selfish nodes deny cooperation to maximize their benefit.
Weiterlesen: Non-Remuneration: Benefits and Pricing in P2P Incentive Mechanisms
A method for making contact between a peer communication terminal and an index server for providing peer-to-peer data transmission is provided. The method involves a peer communication terminal associated with a first telecommunication network sending a make-contact message addressed to a first index server. This make-contact message is transmitted to a proxy node in the first telecommunication network. The proxy node terminates the transmission of the make-contact message, and the proxy node then prompts contact to be made between the peer communication terminal and a second index server, which is arranged in the first telecommunication network.
Weiterlesen: Method for making contact between a peer communication terminal and an index server
The invention relates to a method for ascertaining an address for a peer communication terminal which holds a file. If peer communication terminals (P1, P2) repeatedly send request messages (N1, N2) to a first index server (IS1), with the request messages relating to a file (D) and with the first index server (IS1) not storing an address for a peer communication terminal which holds this file (D), then an interrogation device (AE) automatically ascertains an address (IP3) for a peer communication terminal (P3) which holds this file (D). This address (IP3) is transmitted to the first index server (IS1) by the interrogation device (AE). The first index server (IS1) then stores this address (IP3), so that when a further request message relating to this file appears the first index server (IS1) is able to provide this address (IP3) in response to the further request message.
Weiterlesen: Method for ascertaining an address for a communication terminal
In this paper we present a P2P file-sharing architecture optimized for mobile networks. We discuss the applicability of current P2P techniques for resource access and mediation in the context of 2.5G/3G mobile networks. We investigate a mobile P2P architecture that is able to reconcile the decentralized operation of P2P file sharing with the interests of network operators, e. g. control and performance. The architecture is based on the popular eDonkey protocol and is enhanced by additional caching entities and a crawler.
Seite 1 von 2
1996-2009 (c) by Jens O. Oberender
Powered by 