An Optimization Method for P2P Resource Scheduling

Shi-dong Zhang; Geng-yu Wei; Bai Wang; De-yu Yuan
March 2012
International Journal of Digital Content Technology & its Applic;Mar2012, Vol. 6 Issue 4, p159
Academic Journal
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 for P2P resource scheduling is proposed. The task of system is defined as an ant, and pheromone is applied to the resource scheduling for nodes' information. Experiment shows that, with the aid of the method, the utilization rate of P2P resources scheduling and success rate of task committing is increased, and the performance of the P2P system is corresponding improved.


Related Articles

  • Symmetric routing in DHT overlays. Ktari, Salma; Hecker, Artur; Labiod, Houda // Telecommunication Systems;Oct2011, Vol. 48 Issue 1/2, p163 

    In this paper, we propose to extend the DHT topology to a bidirectional graph to provide a super-peer based lookup algorithm and a scalable search support. We consider routing algorithms for a bidirectional variant of the DHT network and show how the resulting structure extends the search region...

  • An Efficient Semantic Search Scheme for Decentralized P2P Environment. Jianyong Chen; Huawang Zeng; Yang Wang // Proceedings of the International Symposium on Information System;2009, p491 

    Peer-to-peer (P2P) is becoming prevalent on the Internet. However, due to the nature of exact hash matching, the DHT-based P2P itself doesn't support decentralized semantic search. In this letter, we propose a Decentralized Unicode Suffix Tree Overlay (DUSTO), which can support multiple...

  • CSA: A Credibility Search Algorithm Based on Different Query in Unstructured Peer-to-Peer Networks. Hongyan Mei; Yujie Zhang; Xiangwu Meng // Mathematical Problems in Engineering;2014, p1 

    Efficient searching for resources has become a challenging task with less network bandwidth consumption in unstructured peer-topeer (P2P) networks. Heuristic search mechanism is an effective method which depends on the previous searches to guide future ones. In the proposed methods, searching...

  • MDPM: AN ALGORITHM FOR MAPPING DISCOVERY IN P2P MEDIATION SYSTEM. IDRISSI, SELMA EL YAHYAOUI EL; ZELLOU, AHMED; IDRI, ALI // Journal of Theoretical & Applied Information Technology;5/20/2014, Vol. 63 Issue 2, p261 

    The information integration systems consist in offering a uniform interface, to provide access to a set of autonomous and distributed information sources. The most important advantage of an information integration system is that allows users to specify what they want, rather than thinking about...

  • A survey of skyline processing in highly distributed environments. Hose, Katja; Vlachou, Akrivi // VLDB Journal International Journal on Very Large Data Bases;Jun2012, Vol. 21 Issue 3, p359 

    During the last decades, data management and storage have become increasingly distributed. Advanced query operators, such as skyline queries, are necessary in order to help users to handle the huge amount of available data by identifying a set of interesting data objects. Skyline query...

  • A Topology Adjustment Algorithm for P2P Systems. Zhen Yu; Jie Zhu; Guicheng Shen; Haiyan Liu // Journal of Software (1796217X);Aug2014, Vol. 9 Issue 8, p2217 

    In order to improve the Peer-to-Peer (P2P) network resource locating efficiency and isolate malicious peers, a topology adjustment algorithm for unstructured P2P networks is proposed. TTL (time-to-live) value for each neighbor has been set up and adjusted; specific information on the query path...

  • 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...

  • IDENTIFICATION OF EFFICIENT PEERS IN P2P COMPUTING SYSTEM FOR REAL TIME APPLICATIONS. Dubey, Jigyasu; Tokekar, Vrinda // International Journal of Peer to Peer Networks;Nov2012, Vol. 3 Issue 6, p1 

    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...

  • 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...


Read the Article


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

Try another library?
Sign out of this library

Other Topics