TITLE

IDENTIFICATION OF EFFICIENT PEERS IN P2P COMPUTING SYSTEM FOR REAL TIME APPLICATIONS

AUTHOR(S)
Dubey, Jigyasu; Tokekar, Vrinda
PUB. DATE
November 2012
SOURCE
International Journal of Peer to Peer Networks;Nov2012, Vol. 3 Issue 6, p1
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Currently the Peer-to-Peer computing paradigm rises as an economic solution for the large scale computation problems. However due to the dynamic nature of peers it is very difficult to use this type of systems for the computations of real time applications. Strict deadline of scientific and real time applications require predictable performance in such applications. We propose an algorithm to identify the group of reliable peers, from the available peers on the Internet, for the processing of real time application's tasks. The algorithm is based on joint evaluation of peer properties like peer availability, credibility, computation time and the turnaround time of the peer with respect to the task distributor peer. Here we also define a method to calculate turnaround time (distance) on task distributor peers at application level.
ACCESSION #
84297292

 

Related Articles

  • Distributed optimization of P2P live streaming overlays. Payberah, Amir; Dowling, Jim; Rahimain, Fatemeh; Haridi, Seif // Computing;Sep2012, Vol. 94 Issue 8-10, p621 

    Peer-to-peer live media streaming over the Internet is becoming increasingly more popular, though it is still a challenging problem. Nodes should receive the stream with respect to intrinsic timing constraints, while the overlay should adapt to the changes in the network and the nodes should be...

  • Practical load balancing for content requests in peer-to-peer networks. Roussopoulos, Mema; Baker, Mary // Distributed Computing;Jun2006, Vol. 18 Issue 6, p421 

    This paper studies the problem of balancing the demand for content in a peer-to-peer network across heterogeneous peer nodes that hold replicas of the content. Previous decentralized load balancing techniques in distributed systems base their decisions on periodic updates containing information...

  • Xheal: a localized self-healing algorithm using expanders. Pandurangan, Gopal; Trehan, Amitabh // Distributed Computing;Feb2014, Vol. 27 Issue 1, p39 

    We consider the problem of self-healing in reconfigurable networks e.g., peer-to-peer and wireless mesh networks. For such networks under repeated attack by an omniscient adversary, we propose a fully distributed algorithm, Xheal, that maintains good expansion and spectral properties of the...

  • Shared-Storage Auction Ensures Data Availability. Lauw, Hady W.; Hui, S. C.; Lai, Edmund // IEEE Internet Computing;Sep/Oct2004, Vol. 8 Issue 5, p22 

    Most current e-auction systems are based on the client-server architecture. Such centralized systems provide a single point of failure and control. In contrast, peer-to-peer systems permit distributed control and minimize individual node and link failures' impact on the system. The...

  • Distributed Universal Number Discovery.  // Network Dictionary;2007, p157 

    A definition of the term "Distributed Universal Number Discovery" in computer networking is presented. The term refers to a Peer-to-Peer protocol for providing services equivalent to those provided by Electronic Numbering (ENUM). It has an advantage compared to ENUM because it is far more...

  • A Review of some P2P-IPTV Applications. Ketmaneechairat, Hathairat; Sodanil, Maleerat // International Journal of Information Processing & Management;Jan2013, Vol. 4 Issue 1, p35 

    This paper reviews concepts and algorithms of some popular existing IPTV applications which popular on the Internet. There are presented based on the experience of a real system deployed by PPLive, CoolStreaming, Sopcast and UUSee. The performance and technological challenges are concerned and...

  • ANYCASTING IN CONNECTION-ORIENTED COMPUTER NETWORKS: MODELS, ALGORITHMS AND RESULTS. WALKOWIAK, KRZYSZTOF // International Journal of Applied Mathematics & Computer Science;Mar2010, Vol. 20 Issue 1, p207 

    Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated...

  • An Optimization Method for P2P Resource Scheduling. Shi-dong Zhang; Geng-yu Wei; Bai Wang; De-yu Yuan // International Journal of Digital Content Technology & its Applic;Mar2012, Vol. 6 Issue 4, p159 

    Because the information exchange between peers of P2P application system is limited by the real network topology, effective resource scheduling technology becoming an important issue. Without change to peers' reciprocity and self-organization, an optimization method based on ant colony algorithm...

  • TSP-Chord: An Improved Chord Model with Physical Topology Awareness. Zhen He; Jianping Wang; Si Liu // International Proceedings of Computer Science & Information Tech;2012, Vol. 27, p176 

    A physical topology awared Chord model (TSP-Chord) which based on ant colony algorithm is proposed in this paper. The idea of TSP-Chord is regarding the storage nodes in the whole Chord as a TSP problem and solving the TSP problem quickly by using the ant colony optimization algorithm, then...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics