A Model Approach to the Estimation of Peer-to-Peer Traffic Matrices

被引:11
|
作者
Xu, Ke [1 ]
Shen, Meng [2 ]
Cui, Yong [2 ]
Ye, Mingjiang [3 ]
Zhong, Yifeng [2 ]
机构
[1] Tsinghua Univ, Dept Comp Sci, Tsinghua Natl Lab Informat Sci & Technol, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Dept Comp Sci, Beijing 100084, Peoples R China
[3] Yahoo, Ctr Res & Dev, Beijing, Peoples R China
基金
澳大利亚研究理事会;
关键词
Traffic matrix; peer-to-peer (P2P); traffic engineering;
D O I
10.1109/TPDS.2013.179
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Peer-to-Peer (P2P) applications have witnessed an increasing popularity in recent years, which brings new challenges to network management and traffic engineering (TE). As basic input information, P2P traffic matrices are of significant importance for TE. Because of the excessively high cost of direct measurement, many studies aim to model and estimate general traffic matrices, but few focus on P2P traffic matrices. In this paper, we propose a model to estimate P2P traffic matrices in operational networks. Important factors are considered, including the number of peers, the localization ratio of P2P traffic, and the network distance. Here, the distance can be measured with AS hop counts or geographic distance. To validate our model, we evaluate its performance using traffic traces collected from both the real P2P video-on-demand (VoD) and file-sharing applications. Evaluation results show that the proposed model outperforms the other two typical models for the estimation of the general traffic matrices in several metrics, including spatial and temporal estimation errors, stability in the cases of oscillating and dynamic flows, and estimation bias. To the best of our knowledge, this is the first research on P2P traffic matrices estimation. P2P traffic matrices, derived from the model, can be applied to P2P traffic optimization and other TE fields.
引用
收藏
页码:1101 / 1111
页数:11
相关论文
共 50 条
  • [21] PeerTIS - A Peer-to-Peer Traffic Information System
    Rybicki, Jedrzej
    Scheuermann, Bjoern
    Koegel, Markus
    Mauve, Martin
    SIXTH ACM INTERNATIONAL WORKSHOP ON VEHICULAR INTER-NETWORKING - VANET 2009, 2009, : 23 - 32
  • [22] Peer-to-Peer Traffic: From Measurements to Analysis
    Guillemin, Fabrice
    Rosenberg, Catherine
    Le, Long
    Brugier, Guillaume Vu
    GLOBECOM 2008 - 2008 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2008,
  • [23] Modeling of peer-to-peer traffic caching deployment
    Ye, Mingjiang
    Wu, Jianping
    Xu, Ke
    Qinghua Daxue Xuebao/Journal of Tsinghua University, 2009, 49 (01): : 110 - 113
  • [24] Characterizing peer-to-peer traffic across Internet
    Zhang, YF
    Lei, LH
    Chen, CJ
    GRID AND COOPERATIVE COMPUTING, PT 1, 2004, 3032 : 388 - 395
  • [25] ANALYSIS OF PEER-TO-PEER TRAFFIC AND USER BEHAVIOUR
    Alsbih, Amir
    Janson, Thomas
    Schindelhauer, Christian
    PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON INTERNET TECHNOLOGIES AND APPLICATIONS (ITA 11), 2011, : 185 - 192
  • [26] Peer-to-Peer BotNet Traffic Analysis and Detection
    Han, Dongseok
    Han, Kyoung Soo
    Kang, Boojoong
    Han, Hwansoo
    Im, Eul Gyu
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2012, 15 (04): : 1605 - 1624
  • [27] A Traffic Cache for Structure Peer-to-Peer Networks
    Lin Kuisheng
    Zhou Ya
    Huang Guimin
    THIRD INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTING, 2009, : 844 - +
  • [28] Capacity estimation of peer-to-peer networks based on a flow deviation approach
    Tan, Michael
    Acampora, Anthony
    2007 IEEE 18TH INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS, VOLS 1-9, 2007, : 961 - 965
  • [29] Impact of peer-to-peer applications on wide area network traffic: an experimental approach
    Ben Azzouna, N
    Guillemin, F
    GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2004, : 1544 - 1548
  • [30] Peer Regulation in a Peer-to-Peer Business Model
    Miao, Li
    Lin, Meizhen
    Wei, Wei
    Moon, Hyoungeun
    JOURNAL OF HOSPITALITY & TOURISM RESEARCH, 2023, 47 (05) : 908 - 926