參考文獻 |
[1] E. Adar and B. A. Huberman. Free riding on gnutella. First Monday, 5(10), October 2000.
[2] S. Androutsellis-Theotokis and D. Spinellis. A survey of peer-to-peer content distribution tech-
nologies. ACM Computing Surveys, 36(4):335–371, December 2004.
[3] C. Bettstetter, G. Resta, and P. Santi. The node distribution of the random waypoint mobility
model for wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2(3):257–269,
July-September 2003.
[4] B. BISKUPSKI, J. DOWLING, and J. SACHA. Properties and mechanisms of self-organizing
manet and p2p systems. ACM Transactions on Autonomous and Adaptive Systems, 2(1):Article
1, March 2007.
[5] R. Bolla, R. Gaeta, A. Magnetto, M. Sciuto, and M. Sereno. A measurement study supporting
p2p …le-sharing community models. Computer Networks, 53(4):485–500, March 2009.
[6] D. Braun, et al. UP2P: A peer-to-peer overlay architecture for ubiquitous communications and
networking. IEEE Communications Magazine, 46(12):32–39, December 2008.
[7] F. E. Bustamante and Y. Qiao. Designing less-structured p2p systems for the expected high
churn. IEEE/ACM Transactions on Networking, 16(3):617–627, June 2008.
[8] H. Byun and M. Lee. Howto: A hybrid overlay approach with tree optimization. In Proceedings
of 2009 WRI World Congress on Computer Science and Information Engineering, pages 311 –
315, March 2009.
[9] C.-Y. Chow, H. V. Leong, and A. T. Chan. Grococa: group-based peer-to-peer cooperative
caching in mobile environment. IEEE Journal on Selected Areas in Communications, 25(1):179–
191, January 2007.
[10] B. Cohen. Incentives build robustness in bittorrent. In Proceedings of the 1st Workshop on
Economics of Peer-to-Peer Systems, June 2003.
[11] C. Cramer, K. Kutzner, and T. Fuhrmann. Bootstrapping locality-aware p2p networks. In
Networks, 2004. (ICON 2004). Proceedings. 12th IEEE International Conference on, volume 1,
pages 357 –361 vol.1, 16-19 2004.
[12] K. Eger and U. Killat. Bandwidth trading in bittorrent-like p2p networks for content distribu-
tion. Computer Communications, 31(2):201–211, February 2008.
[13] N. Fedotova and L. Veltri. Reputation management algorithms for dht-based peer-to-peer envi-
ronment. Computer Communications, 32(12):1400–1409, July 2009.
[14] M. Feldman and J. Chuang. Overcoming free-riding behavior in peer-to-peer systems. ACM
SIGecom Exchanges, 5(4):41–50, July 2005.
[15] E. Fourquet, K. Larson, and W. Cowan. A reputation mechanism for layered communities. ACM
SIGecom Exchanges, 6(1):11–22, June 2006.
[16] W. Frakes and R. Baeza-Yates. Information Retrieval: Data Structures and Algorithms. Prentice
Hall, New Jersey, USA, 1992.
[17] P. Francis, et al. An architecture for a global internet host distance estimation service. In
Proceedings of IEEE INFOCOM’99, March 1999.
[18] P. Golle, K. Leyton-Brown, I. Mironov, and M. Lillibridge. Incentives for sharing in peer-to-peer
networks. In Proceedings of the 2nd International Workshop on Electronic Commerce, volume
2232, pages 75–87. Lecture Notes In Computer Science, October 2001.
[19] J. Han, D.Watson, and F. Jahanian. Topology aware overlay networks. In Proceedings of IEEE
INFOCOM,05, volume 4, pages 2554–2565, March 2005.
[20] C.-M. Huang, T.-H. Hsu, and M.-F. Hsu. Network-aware p2p …le sharing over the wireless mobile
networks. IEEE Journal on Selected Areas in Communications, 25(1):72–93, January 2007.
[21] D. Hughes, G. Coulson, and J. Walkerdine. Free riding on gnutella revisited: The bell tolls?
IEEE Distributed Systems Online, 6(6), June 2005.
[22] Y.-J. Joung and Z.-W. Lin. On the self-organization of a hybrid peer-to-peer system. Journal of
Network and Computer Applications, pages Article in Press, via doi:10.1016/j.jnca.2009.08.002,
2009.
[23] S. Jun and M. Ahamad. Incentives in bittorrent induce free riding. In Proceedings of the 2005
ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 116–121, August 2005.
[24] R. Jurca and B. Faltings. Reputation-based pricing of p2p services. In Proceedings of the 2005
ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 144–149, August 2005.
[25] J. S. Kong, J. S. A. Bridgewater, and V. P. Roychowdhury. Resilience of structured p2p systems
under churn: The reachable component method. Computer Communications, 31(10):2109–2123,
June 2008.
[26] A. Legout, G. Urvoy-Keller, and P. Michiardi. Rarest …rst and choke algorithms are enough. In
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, pages 203–216,
October 2006.
[27] M. Li, W.-C. Lee, and A. Sivasubramaniam. Performance evaluation of neighborhood signature
techniques for peer-to-peer search. Journal of Computers, 17(4):11–36, January 2007.
[28] X. Liao, H. Jin, Y. Liu, L. M. Ni, and D. Deng. Anysee: Peer-to-peer live streaming. In
Proceedings of IEEE INFOCOM’06, pages 1–10, April 2006.
[29] Y. Liu, Y. Guo, and C. Liang. A survey on peer-to-peer video streaming systems. Peer-to-Peer
Networking and Applications, 1(1):18–28, March 2008.
[30] Y. Liu, L. Xiao, X. Liu, L. M. Ni, and X. Zhang. Location awareness in unstructured peer-to-
peer systems. IEEE Transactions on Parallel and Distributed Systems, 16(2):163–174, February
2005.
[31] J. Liu, et al. Distributed distance measurement for large-scale networks. Int’l Journal of Com-
puter and Telecommunications Networking, 41, 2003.
[32] E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim. A survey and comparison of peer-to-
peer overlay network schemes. IEEE Communications Tutorials and Surveys, 7(2):72–93, July
2005.
[33] E. K. Lua and X. Zhou. Network-aware superpeers-peers geometric overlay network. In Pro-
ceedings of 16th International Conference on Computer Communications and Networks, pages
141–148, August 2007.
[34] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-
peer networks. In Proceedings of the 16th ACM International Conference on Supercomputing,
pages 84–95, June 2002.
[35] S. Marti and H. Garcia-Molina. Taxonomy of trust: categorizing peer-to-peer reputation sys-
tems. Computer Networks, 50(4):472–484, March 2006.
[36] A. Nayebi, M. R. Rahimi, and H. S. Azad. Analysis of time-based random waypoint mobility
model for wireless mobile networks. In Proceedings of the 4th International Conference on
Information Technology : New Generations, pages 42–47, April 2007.
[37] T. Qiu, G. Chen, M. Ye, E. Chan, and B. Y. Zhao. Towards location-aware topology in both
unstructured and structured p2p systems. In Proceedings of International Conference on Parallel
Processing, pages 133–144, September 2007.
[38] P. Resnick, K. Kuwabara, R. Zeckhauser, and E. Friedman. Reputation systems. Communica-
tions of the ACM, 43, issue. 12:45–48, December 2000.
[39] M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: properties of large-scale
peer-to-peer systems and implications for system design. IEEE Internet Computing, 6(1):50–57,
2002.
[40] P. Sharma, Z. Xu, S. Banerjee, and S.-J. Lee. Estimating network proximity and latency. ACM
SIGCOMM Computer Communication Review, 36(3):39–50, July 2006.
[41] R. So…a and P. Mendes. User-provided networks: Consumer vs. provider. IEEE Communications
Magazine, 46(12):86–91, December 2008.
[42] D. Stutzbach and R. Rejaie. Understanding churn in peer-to-peer networks. In Proceedings of
the 6th ACM SIGCOMM conference on Internet measuremen, pages 189–202, October 2006.
[43] W. Theilmann and K. Rothermel. Dynamic distance maps of internet. In Proceedings of IEEE
INFOCOM’00, volume 1, March 2000.
[44] F. Wang, Y. Xiong, and J. Liu. mtreebone: A hybrid tree/mesh overlay for application-layer
live video multicast. In Proceedings of the 27th IEEE International Conference on Distributed
Computing Systems, June 2007.
[45] C. Xie, G. Chen, A. Vandenberg, and Y. Pan. Analysis of hybrid p2p overlay network topology.
Computer Communications, 31(2):190–200, February 2008.
[46] M. Yang and Z. Fei. A novel approach to improving search e¢ ciency in unstructured peer-to-peer
networks. Journal of Parallel and Distributed Computing, 69(11):877–884, November 2009.
|