Monitoring, analyzing and characterizing lookup traffic in a large-scale DHT

  • Authors:
  • Jie Yu;Liming Lu;Peng Xiao;Zhoujun Li;Yuan Zhou

  • Affiliations:
  • School of Computer, National University of Defense Technology, Changsha 410073, China and Department of Computer Science, National University of Singapore, Singapore 117417, Singapore;Department of Computer Science, National University of Singapore, Singapore 117417, Singapore;State Key Laboratory of Software Development Environment, Beihang University, Beijing 100191, China;State Key Laboratory of Software Development Environment, Beihang University, Beijing 100191, China;National Computer Network Emergency Response Technical Team/Coordination Center of China (CNCERT/CC), Beijing 100031, China

  • Venue:
  • Computer Communications
  • Year:
  • 2011

Quantified Score

Hi-index 0.24

Visualization

Abstract

Lookup is crucial to locate peers and resources in structured P2P networks. In this paper, we measure and analyze the traffic characteristics of lookup in Kad, which is a widely used DHT network. Some previous works studied the user behaviors of Kad, yet we believe that investigating its traffic characteristics will also be beneficial, as it gives feedbacks to fine tune the system parameters, helps to uncover the abnormalities or misuses, and provides solid ground for synthesizing P2P traffic to evaluate future designs. To track the lookup requests more efficiently and from more peers in Kad, we develop an active traffic monitor, named Rememj. From the one-week data it collected, we uncover some interesting phenomena. Moreover, we characterize the traffic characteristics from the collected data in a form that can be used for constructing representative synthetic workloads for evaluating DHT optimizations or designs. In particular, the analysis exposes heterogeneous behavior that occurs in different geographical regions (i.e., Europe, Asia, and America) or during different periods of the day. The workload measures include distribution of peers, distribution of request load, distribution of targets, as well as similarity among targets.