Classifying Behavior Patterns of User Nodes
1
조회
0
다운로드
4
인용
0
참고문헌
키워드
초록
To increase the scalability of cloud computing, utilizing resources of individual users has been widely adopted especially in video streaming services. Accurately predicting behavior of user nodes is critical to achieve a high efficiency in such a peer-assisted system. Though there have been many measurement studies on peer-to-peer systems, most of them have focused on the design and characterization of the systems. Thus the behavior patterns of individual nodes have seldom been studied. In this paper, we present new techniques for classifying behavior of nodes in terms of availability and compare them with naive manual classification. We apply a k-means clustering algorithm with various classification criteria on real trace data of a peer-to-peer system. Our analysis shows that there are various hidden behavior patterns with respect to the transition of availability. Our study will give a useful hint to a system designer in handling churns more efficiently based on the peer classification.
Abstract
To increase the scalability of cloud computing, utilizing resources of individual users has been widely adopted especially in video streaming services. Accurately predicting behavior of user nodes is critical to achieve a high efficiency in such a peer-assisted system. Though there have been many measurement studies on peer-to-peer systems, most of them have focused on the design and characterization of the systems. Thus the behavior patterns of individual nodes have seldom been studied. In this paper, we present new techniques for classifying behavior of nodes in terms of availability and compare them with naive manual classification. We apply a k-means clustering algorithm with various classification criteria on real trace data of a peer-to-peer system. Our analysis shows that there are various hidden behavior patterns with respect to the transition of availability. Our study will give a useful hint to a system designer in handling churns more efficiently based on the peer classification.
참고문헌 (20)
- R. Torres, "Inferring undesirable behavior from P2P traffic analysis", Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, pp.25~36 (2009)
- M. Collins, "Finding peer-topeer file-sharing using coarse network behaviors", Computer Security–ESORICS 2006, pp.1~17 (2006)
- M. Iliofotou, "etwork monitoring using traffic dispersion graphs (tdgs)", Proceedings of the 7th ACM SIGCOMM conference on Internet measurement. ACM, pp.315~320 (2007)
- S. Saroiu, "An analysis of internet content delivery systems", ACM SIGOPS Operating Systems Review, 36(si), pp.315~ (2002)
- S. Saroiu, "A measurement study of peer-to-peer file sharing systems", proceedings of Multimedia Computing and Networking, 2002 (2002)
- P. Gummadi, "A measurement study of napster and gnutella as examples of peer-to-peer file sharing systems", ACM SIGCOMM Computer Communication Review, 32(1), pp.82~82 (2002)
- M. Izal, "Dissecting bittorrent: Five months in a torrent’s lifetime", LECTURE NOTES IN COMPUTER SCIENCE, pp.1~11 (2004)
- Exploring the use of bittorrent as the basis for a large trace repository, "A. Bellissimo", University of Massachusetts Technical Report, Tech. Rep, ~ (2004)
- L. Guo, "Measurements, analysis, and modeling of bittorrent-like systems", ~ (2005)
- W. J. Bolosky, "Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs", SIGMETRICS Perform. Eval. Rev, 28(1), pp.339~345 (2000)
- C. Simache, "Measurementbased availability analysis of Unix systems in a distributed environment", Proc. of the 12th InternationalSymposium on Software Reliability Engineering (ISSRE’01) (2001)
- Mining for availability models in large-scale distributed systems: A case study of seti@ home, "B. Javadi", ~ (2009)
- J. Douceur, "Optimizing file availability in a secure serverless distributed file system", Proceedings of the Symposium on Reliable Distributed Systems, pp.4~13 (2001)
- R. Bhagwan, "Replication strategies for highly availablepeer-to-peer storage systems", Proceedingsof Fu-DiCo:Future directions in DistributedComputing (2002)
- C. Blake, "High availability, scalable storage, dynamic peer networks: Pick two" (2003)
- J. Douceur, "Is remote host availability governed by a universal law", ACM SIGMETRICS Performance Evaluation Review, 31(3), pp.25~29 (2003)
- M. Steiner, "Long term study of peer behavior in the KADDHT", IEEE, 2009, pp.17(5), 1371~1384
- G. Song, "Understanding individual nodes in peer-to-peer systems", Computer Communications andNetworks (ICCCN), 2010 Proceedings of19th International Conference on, pp.1~6 (2010)
- P. Maymounkov, "Kademlia: A peer-to-peer information system based on the xor metric", Proceedings of ,Cambridge, USA, 1, pp.2~2 (2002)
- T. Segaran, "Programming collective intelligence,1st ed" (2007), O’Reilly