what-when-how
In Depth Tutorials and Information
15. C. Dale and J. Liu. A measurement study of piece population in BitTorrent. In
GlobeCom
, Washington, DC, November 26-30 2007.
16. P. Erdős and A. Rényi. On random graphs.
Publ.Math
, pages 290-297, 1959.
17. S. Guha, N. Daswani, and R. Jain. An experimental study of the Skype peer-to-peer
VoIP system. In
Proc.oftheIPTPS'06
, Santa Barbara, CA, February 2006.
18. T. Hong. Performance. In Andy Oram, editor,
Peer-to-Peer: Harnessing the Power
of Disruptive Technologies
, chapter 14, pp. 203-241. O'Reilly & Associates, Inc.,
Sebastopol, CA, 2001.
19. K.Y.K. Hui, J.C.S. Lui, and D.K.Y. Yau. Small world overlay P2P networks.
Proc.
TwelfthIEEEInternationalWorkshoponQualityofService
, pp. 201-210, 2004.
20. T. Karagiannis, P. Rodriguez, and K. Papagiannaki. Should Internet service providers
fear peer-assisted content distribution? In
Proc.ACM/USENIXIMC2005
.
21. V. Latora and M. Marchiori. Efficient behavior of small-world networks.
Phys. Rev.
Lett.
, 87(19):198701, October 2001.
22. A. Legout, N. Liogkas, E. Kohler, and L. Zhang. Clustering and sharing incentives in
bittorrent systems. In
SIGMETRICS
, pages 301-312, 2007.
23. A. Legout, G. Urvoy-Keller, and P. Michiardi. Rarest first and choke algorithms are
enough. In
Proc.IMC'06
, Rio de Janeiro, Brazil, October 2006.
24. G. Liu, M. Hu, B. Fang, and H. Zhang. Measurement and modeling of large-scale
peer-to-peer storage system.
LectureNotesinComputerScience
, pages 270-277, 2004.
25. S. Milgram. he Small World Problem.
PsychologyToday
, 2(1):60-67, 1967.
26. G. Neglia, G. Reina, H. Zhang, D. Towsley, A. Venkataramani, and J. Danaher.
Availability in BitTorrent systems. In
Proc.IEEEINFOCOM2007
.
27. D. Niu and B. Li. On the resilience-complexity tradeoff of network coding in dynamic
P2P networks.
Proc.FifteenthIEEEInternationalWorkshoponQualityofService
, pp.
38-46, June 21-22, 2007.
28. D. Qiu and R. Srikant. Modeling and performance analysis of BitTorrent-like peer-to-peer
networks. In
Proc.SIGCOMM'04
, Portland, Oregon, August 30-September 3, 2004.
29. G. Urvoy-Keller and P. Michiardi. Impact of inner parameters and overlay structure on
the performance of bittorrent. In
INFOCOM
, 2006.
30. D.J. Watts.
SmallWorlds: he Dynamics of Networks between Order and Randomness
.
Princeton Univ. Pr., 1999.
31. D.J. Watts and S.H. Strogatz. Collective dynamics of “small-world” networks.
Nature
,
393(6684):409-10, 1998. http://www.nature.com, Nature Publishing Group.
32. S. Willmott, J.M. Pujol, and U. Cortes. On exploiting agent technology in the design
of peer-to-peer applications.
LectureNotesinComputerScience
, 3601:98, 2005.
33. R.H. Wouhaybi. Algorithms for Reliable Peer-to-Peer Networks. Ph.D. thesis,
Columbia University, 2006.
34. H. Xie, R.Y. Yang, A. Krishnamurthy, Y.G. Liu, and A. Silberschatz. P4P: Provider
portal for applications. In
Proc.ACMSIGCOMM2008
.
35. X. Yang and G. de Veciana. Service capacity of peer to peer networks. In
Proc.IEEE
INFOCOM2004
.
36. H. Zhang, A. Goel, and R. Govindan. Using the small-world model to improve freenet
performance.
ComputerNetworks
, 46(4):555-574, 2004.
