A Peer Selection Scheme Using Cache and Measurement in P2P

FU Jian-ming; SUN Fang-qi; LIU Li; ZHANG Huan-guo

您当前的位置：

首页 >

文章列表页 >

A Peer Selection Scheme Using Cache and Measurement in P2P

更新时间：2025-07-16

- A Peer Selection Scheme Using Cache and Measurement in P2P
- Acta Electronica Sinica Vol. 34, Issue 8, Pages: 1545-1548(2006)
- 作者机构：
  
  1. 武汉大学计算机学院湖北武汉,430072
  2. 武汉大学软件工程国家重点实验室湖北武汉,430072
  3. 武汉大学计算机学院,湖北,武汉,430072
  4. 武汉大学软件工程国家重点实验室,湖北,武汉,430072
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393
- Published：2006
- 稿件说明：
移动端阅览
FU Jian-ming, SUN Fang-qi, LIU Li, et al. A Peer Selection Scheme Using Cache and Measurement in P2P[J]. Acta Electronica Sinica, 2006, 34(8): 1545-1548.
DOI：

FU Jian-ming, SUN Fang-qi, LIU Li, et al. A Peer Selection Scheme Using Cache and Measurement in P2P[J]. Acta Electronica Sinica, 2006, 34(8): 1545-1548. DOI：

摘要

针对非结构化P2P中服务节点的选择问题

利用缓存和测量技术

提出了测量次数可变的选择模式(VM)和测量次数不变的选择模式(FM).同时

给出了4种缓存更新策略:随机丢弃

最大延迟丢弃

最早时间丢弃和最少使用丢弃.仿真实验的结果表明

FM优于VM

最大延迟丢弃和最少使用丢弃策略获得了较好的性能

同时

该选择模式对节点加入和离开有较好的鲁棒性

且并发测量可以降低节点选择的时延.

Abstract

In order to solve peer selection problem in unstructured P2P

size-Varied Measurement (VM) and size-Fixed Measurement (FM) using cache are provided.Moreover

four caching strategies are investigated: Random Drop (RD)

Largest Latency Drop (LLD)

Earliest Timestamp Drop (ED) and Least Use Drop (LUD).Finally

our experimental results show the following observations: FM greatly outperforms VM

LLD and LUD are prior to others

our schemes are stable when the rate of topology change is below 5%

and concurrent measurement can sharply reduce the peer selection latency.

关键词

Keywords

references

Views

886

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

A Diverse Content Delivery Scheme Based on Traffic Types in Content Centric Networking

Related Author

GE Guo-dong

GUO Yun-fei

LIU Cai-xia

LAN Ju-long

Related Institution

中国人民解放军 75753部队

国家数字交换系统工程技术研究中心

⁰