Searching Flocks in Peer-to-Peer Networks

被引：0

作者：

Pommier, Hugo ^{[1
]}

Romito, Benoit ^{[1
]}

Bourdon, Francois ^{[1
]}

机构：

[1] Univ Caen Basse Normandie, GREYC CNRS UMR 6072, F-14032 Caen, France

来源：

ADVANCES ON PRACTICAL APPLICATIONS OF AGENTS AND MULTI-AGENT SYSTEMS | 2011年 / 88卷

关键词：

D O I：

10.1007/978-3-642-19875-5_13

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Storage in peer-to-peer networks must be reliable and dependable. This reliability is partially dependent of data placement. In some approaches, information pieces are moving in the network to find a placement that optimizes different criteria. But this mobility may be a drawback for the localization of those pieces. In this paper, we propose to measure the impact that mobility of network objects has on their localization.

引用

页码：103 / 108

页数：6

共 13 条

[1]

[Anonymous], ICS 02

[2]

[Anonymous], SOSP 01

[3] Modeling and analysis of random walk search algorithms in P2P networks [J].

Bisnik, N ;

Abouzeid, A .

SECOND INTERNATIONAL WORKSHOP ON HOT TOPICS IN PEER-TO-PEER SYSTEMS, PROCEEDINGS, 2005, :95-103

[4]

Ganesh A. J., 2001, Networked Group Communication. Third International COST264 Workshop, NGC 2001. Proceedings (Lecture Notes in Computer Science Vol.2233), P44

[5]

Ghemawat S., 2003, SOSP, P29

[6]

GIROIRE F, 2009, LCN 2009, P320

[7]

Plank JS, 1997, SOFTWARE PRACT EXPER, V27, P995, DOI 10.1002/(SICI)1097-024X(199709)27:9<995::AID-SPE111>3.0.CO

[8]

2-6

[9]

Pommier H, 2010, WEBIST 2010: PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON WEB INFORMATION SYSTEMS AND TECHNOLOGY, VOL 1, P319

[10]

Reynolds C.W., 1987, ACM ANN C COMP GRAPH, P25, DOI [10.1145/37402.37406, DOI 10.1145/37402.37406]

← 1 2 →