Self-Configuration Protocols for Small-Scale P2P Networks

Wang, J.Z.; Vanninen, M.A.

doi:10.1109/noms.2006.1687675

Cited by 8 publications

(7 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The overloaded peer can mutually exchange the details of the underloaded peers that it has interacted with in the past and present. Wang and Vanninen (2006) and Zou et al (2002) focused on maximizing the throughput of the system and reducing message overheads and considered the CPU and memory capacities as load parameters. The maximum number of socket connections possible per unit time is considered to be a parameter.…”

Section: Related Workmentioning

confidence: 99%

“…The load must be distributed among peers based on their ability to get better throughput (Wang and Vanninen, 2006;Zou et al, 2002). Instead of transferring tasks between peers, the trend for some time has been to migrate virtual servers from one peer to another.…”

Section: Introductionmentioning

confidence: 99%

“…In this case, each peer hosts a number of virtual servers. To balance the load of the system, the virtual servers are moved from an overloaded to an underloaded peer (Rao et al, 2003;Li and Shao, 2011;Wang and Vanninen, 2006;Zou et al, 2002;Hsiao et al, 2011;Godfrey et al, 2004). In earlier work, the virtual servers were transferred from overloaded to underloaded peers in only one direction (Hsiao et al, 2011).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Using Mobile Agents for Load Balancing in Peer-to-Peer Systems Hosting Virtual Servers

Gopalakrishnan¹,

Saibharath²,

Uthariaraj³

2014

Journal of Computer Science

View full text Add to dashboard Cite

This study proposes a novel load-balancing algorithm for managing virtual servers in a Peer-To-Peer (P2P) system through mobile agents. The proposed algorithm is implemented in a fully decentralized manner for a structured P2P system. It uses mobile agents and is independent of the geometry of the P2P auxiliary networks. The load-balancing algorithm effectively reduces the load imbalance of the system using the load per unit capacity derived by the mobile agents. A unique feature of the proposed algorithm is the mutual swapping of virtual servers between overloaded and underloaded peers to efficiently use the available resources. The proposed solution has been verified in a P2P environment consisting of peers and embedded glassfish server instances, created dynamically to act as virtual servers.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Using Mobile Agents for Load Balancing in Peer-to-Peer Systems Hosting Virtual Servers

Gopalakrishnan¹,

Saibharath²,

Uthariaraj³

2014

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…The utility-based resource allocation problem is a problem that aims to maximize the sum of utilities of users for each allocation period, but does not consider other factors and constraints (i.e., fair allocation [1,33], security and privacy concerns [41], uncertainty [39,40], etc.). Combinatorial auction is not only the approach for resource allocation problems.…”

Section: Combinatorial Auction and Resource Allocation Problemmentioning

confidence: 99%

Fine-grained efficient resource allocation using approximated combinatorial auctions

Fukuta

Ito

2009

Web Intelligence and Agent Systems: An International Journal

View full text Add to dashboard Cite

Combinatorial auctions, one of the most popular market mechanisms, have a huge effect on electronic markets and political strategies. Combinatorial auctions provide suitable mechanisms for efficient allocation of resources to self-interested attendees. On the other hand, efficient resource allocation is also becoming crucial in many computer systems that should manage resources efficiently. Considering ubiquitous computing scenarios, the ability to complete an auction within a fine-grained time period without loss of allocation efficiency is in strong demand. Furthermore, to achieve such scenarios, it is very important to handle a large number of bids in an auction. In general, the optimal winner determination problem of a combinatorial auction is NP-hard. Thus, much work focuses on tackling the computational costs for winner determination. In this paper, we show that our approximation algorithms provide sufficient quality of winners for auctions that have a large number of bids on hard time constraints. Furthermore, we compare and discuss desirable properties of such approximation algorithms to be embedded in application systems.

show abstract

“…Many research proposals exist for providing self-configuration mechanisms for decentralized and unstructured P2P networks with different goal settings. For example, Wang and Vanninen [37] proposed several protocols for selfconfiguring P2P networks with the aims of minimizing the diameter of the P2P network (i.e., the maximum latency time of message routing between two nodes through the shortest path) and the network eccentricity (i.e., the maximum logical network distance to the centroid of the P2P network from any node in the network). They discussed small-scale homogeneous P2P network environments and large-scale heterogeneous P2P network environments separately and proposed appropriate configuration strategies for each environment.…”

Section: Related Workmentioning

confidence: 99%

Privacy-conscious P2P data sharing scheme with bogus profile distribution

Iguchi

Goto

2009

Web Intelligence and Agent Systems: An International Journal

View full text Add to dashboard Cite

With the increasing use of P2P (peer-to-peer) network technology in everyday services, the issue of privacy protection has gained considerable importance. This paper describes a method to realize an anonymity-conscious P2P data sharing network. The proposed network allows users to extract data possessed by other users who have similar profiles, thereby providing them with a collaborative filtering-based data recommendation. In the proposed P2P network protocol, bogus user profiles are distributed intentionally throughout the network to protect users' anonymity without harming the overall effectiveness of the data exchange. We conduct a series of simulations to prove that our proposed method protects the profile's privacy and performs efficient data exchange.

show abstract

Self-Configuration Protocols for Small-Scale P2P Networks

Cited by 8 publications

References 2 publications

Using Mobile Agents for Load Balancing in Peer-to-Peer Systems Hosting Virtual Servers

Using Mobile Agents for Load Balancing in Peer-to-Peer Systems Hosting Virtual Servers

Fine-grained efficient resource allocation using approximated combinatorial auctions

Privacy-conscious P2P data sharing scheme with bogus profile distribution

Contact Info

Product

Resources

About