Designing a Foundation for Mobile Agents in Peer-to-Peer Networks

Author(s):  
Daniel Lübke ◽  
Jorge Marx Gómez

Within this chapter, we present the requirements and a possible conception of a framework, which provides a platform and starting point for the development of mobile agents in peer-to-peer networks. Peer-to-peer networks like Kazaa, Gnutella, and so forth have reached a widespread use on the Internet. By deploying mobile agents that can travel between network nodes to a large P2P network, one could embrace the peer-to-peer technology and use it for all kinds of services like making network traffic anonymous, distributing storage of documents, replicating contents of heavily accessed Internet sites, trading of information, and so forth. For many of these things there are solutions available, but by using a common framework and moving the logic into the agents, there is the opportunity to access all kinds of information through a common API, which guarantees extensibility and widespread use.

Author(s):  
Rodrigo L. Santana ◽  
Danielo G. Gomes ◽  
José Neuman de Souza ◽  
Rossana M. C. Andrade ◽  
Elias Procópio Duarte ◽  
...  

Author(s):  
Takafumi Yamaya ◽  
Toramatsu Shintani ◽  
Tadachika Ozono ◽  
Yusuke Hiraoka ◽  
Hiromitsu Hattori ◽  
...  

Author(s):  
Zoltán Czirkos ◽  
Gábor Hosszú

Communication in computer networks can be organized in two different ways, according to the client/ server model and the peer-to-peer model (Spinellis & Androutsellis-Theotokis, 2004). In the client/server model, the network is centralized. There is one host on the network, the server, which provides services to its clients. Its network address is usually well-known. On the other hand, in the peer-to-peer model, there is no central point in the network. Hosts participating are sometimes called “servents” (Gnutella, 2006), as they act both as servers and as clients at the same time: they provide services to other servents, while they also use the services of others. Nodes in unstructured peer-to-peer networks usually communicate via message flooding. For example, a search request for a given file in the Gnutella network is sent to all neighboring servents. However, this solution is not scalable, and it generates a lot of unnecessary network traffic.


2011 ◽  
Vol 295-297 ◽  
pp. 1945-1950
Author(s):  
Ya Dong Gong ◽  
Yong Xiang Wen ◽  
He Ping Deng ◽  
Zhan Ran Gu

Although the original intent of the peer-to-peer (P2P) concept is to treat each participant equally, the heterogeneity is an inherent characteristic of P2P systems. In this paper, according to the previous researches in P2P resource sharing networks, we first conclude and classify the heterogeneity in P2P networks, and then analyze each type of P2P systems that utilize heterogeneity in P2P network. The above analysis and conclusion will become a good guidance to design new resource locating algorithm which takes advantage of heterogeneity in P2P networks.


Sign in / Sign up

Export Citation Format

Share Document