Vai al contenuto| Home page|

   Ti trovi in: HOME »Programmi, progetti e risultati »I progetti »PRIN - Programmi di ricerca di Rilevante Interesse Nazionale»Programma di ricerca
INIZIO_TESTO_DA_INDICIZZARE

RESEARCH PROGRAM

italiano - inglese
Research Units
Similar research programs:
Scientific and education field classification
International Patent Classification
Geographical classification
Bibliografia
[1] Napster, http://www.napster.com
[2] T.Klingberg, R.Manfredi, “The Gnutella Protocol Specification,”
http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html
[3] The Kazaa Network, http://www.kazaa.com/
[4] S.Ratnasamy, P.Francis, M.Handley, R.Karp, S.Shenker, “A Scalable Content-Addressable Network,” ACM SIGCOMM 2001, San Diego, CA, Aug.2001
[5] I.Stoica, R.Morris, et. al, “Chord: A scalable peer-to-peer lookup service for Internet applications,” ACM SIGCOMM 2001, San Diego, CA, Aug.2001
[6] P.Drushel, A.Rowstron, “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,” Middleware 2001, Heidelberg, DE, Nov.2001
[7] J.Kubiatowicz, D.Bindel, et.al, “OceanStore: An Architecture for Global-Scale Persistent Storage,” ASPLOS 2000, Cambridge, MA, Nov.2000
[8] A. Rowstron, A.-M. Kermarrec, M. Castro, P. Druschel, “SCRIBE: The design of a large-scale event notication infrastructure,” Third Intl. COST264 Workshop, London, UK, Nov.2001
[9] D. Stolarz, “Peer to peer streaming media delivery,” P2P'01, Linköpings, SE, Aug.2001
[10] X. Zhang, J. Liu, B. Li, T.-S. P. Yum, “DONet/CoolStreaming: A Data-driven Overlay Network for Live Media Streaming,” IEEE INFOCOM 05, Miami, FL, Mar.2005
[11] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, A. Singh, “SplitStream: High-bandwidth multicast in a cooperative environment,” SOSP'03, Bolton Landing, NY, Oct.2003
[12] V. N. Padmanabhan, H. J. Wang, P. A. Chou, K. Sripanidkulchai, “Distributing Streaming Media Content Using Cooperative Networking,” Technical Report MSR-TR-2002-37, 2002
[13] D. Jiang, Y. Dong, D. Xu, and B. Bhargava, “Gnustream: a P2P media streaming system prototype,” ICME 2003, Baltimore, Ma, Jul.2003
[14] M. Hefeeda, A. Habib, B. Botev, D. Xu, B. Bhargava, “PROMISE: peer-to-peer media streaming using Collect-Cast,” ACM 2003, Berkeley, CA, Aug.2003
[15] The BitTorrent Project, http://bittorrent.com
[16] D. Kostic, R. Braud, C. Killian, E. Vandekieft, J. W. Anderson, A. C. Snoeren, A. Vahdat, “Maintaining High Bandwidth under Dynamic Network Conditions,” USENIX 2005, Anaheim, CA, Apr.2005
[17] R. Sherwood, R. Braud, B. Bhattacharjee, “Slurpie: A Cooperative Bulk Data Transfer Protocol”, IEEE INFOCOM 04, Hong Kong, HK, Mar.2004
[18] D. Levin, R. Sherwood, B. Bhattacharjee, “Fair File Swarming with FOX,” IPTPS'06, Santa Barbara, CA, Feb.2006.
[19] D. Stutzbach, D. Zappala, R. Rejaie, “The Scalability of Swarming Peer-to-Peer Content Delivery,” IFIP Networking 2005, Waterloo, ON, May 2005
[20] A. Stavrou, D. Rubenstein, S. Sahu, “A Lightweight, Robust, P2P System to Handle Flash Crowds,” JSAC, Vol. 22, No. 1, Jan.2004
[21] Skype P2P Telephony System. http://www.skype.com
[22] J. Rosenberg, H. Schulzrinne, G. Camarillo, A. Johnston, J. Peterson, R. Sparks, M. Handley, E. Schooler, “SIP: Session Initiation Protocol,” RFC 3261, Jun.2002
[23] K. Singh, H. Schulzrinne, “Peer-to-Peer Internet Telephony using SIP,” Columbia University Technical Report CUCS-044-04, New York, NY, Oct.2004
[24] “P2P SIP”, http://www.p2psip.org/
[25] “JXTA v2.0 Protocols Specification”, http://www.jxta.org
[26] M. Ripeanu, A. Iamnitchi, I. Foster, “Mapping the Gnutella Network,” IEEE Internet Computing, Vol. 6, No. 1, Jan./Feb. 2002
[27] S. Saroiu, P. Gummadi, S. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems,” MMCN '02, San Jose, CA, Jan.2002
[28] K.Tutschku, “A Measurement-based Traffic Profile of the eDonkey Filesharing Service,” PAM 2004, Antibes Juan-les-Pins, F, Apr.2004
[29] M. Izal, G. Urvoy-Keller, E. Biersack, P. Felber, A. Hamra, L. Garces-Erice, “Dissecting BitTorrent: Five Months in a Torrent's Lifetime,” ibid.
[30] M.Schlosser, T.Condie, S.Kamvar, “Simulating a File-Sharing P2P Network,” 1st Workshop on Semantics in P2P and Grid Computing, Budapest, HU, May 2003
[31] K.Kant, R.Iyer, “Modeling and simulation of ad-hoc/ P2P file-sharing networks,” Tools 03, Urbana, IL, Sept.2003
[32] X.Yang, G.De Veciana, “Service Capacity of Peer to Peer Networks,” IEEE INFOCOM 04, Hong Kong, HK, Mar.2004
[33] D. Qiu, R. Srikant, “Modeling and Performance Analysis of BitTorrent-Like Peer-to-Peer Networks,” ACM SIGCOMM 04, Portland, OR, Sep.2004
[34] F.Lo Piccolo, G.Neglia, G.Bianchi, “The Effect of Heterogeneous Link Capacities in BitTorrent-like File Sharing Systems,” HOT- P2P ’04, Volendam, NL, Oct.2004
[35] F.Clevenot-Perronnin, P.Nain, K.W.Ross. “Multiclass P2P networks: static resource allocation for service differentiation and bandwidth diversity”, Performance Evaluation (62/1), Elsevier, 2005
[36] R.Gaeta, M.Gribaudo, D.Manini, M.Sereno, “Analysis of Resource Transfers in Peer-to-Peer File Sharing Applications using Fluid Models,” Performance Evaluation, (63/3), Elsevier 2006
[37] N. Daswani, H. Garcia-Molina, B. Yang, “Open problems in data-sharing peer-to-peer systems,” 9th ICDT, Siena, IT, Jan.2003
[38] N. Daswani and H. Garcia-Molina, “Query-flood dos attacks in Gnutella,” ACM Conference on Computer and Communications Security, Washington, DC, Nov.2002.
[39] A. Stavrou, A. D. Keromytis, D. Rubenstein, “Exploiting the Structure in DHT Overlays for DoS Protection,” Columbia University Technical Report CUCS-019-04, New York, NY, 2004
[40] P. Maniatis, T. J. Giuli, M. Roussopoulos, D. S. H. Rosenthal, M. Baker “Impeding Attrition Attacks in P2P Systems,” ACM SIGOPS European Workshop, Leuven, BE, Sept.2004
[41] F. Cornelli, E. Damiani, S. De Capitani di Vimercati, S. Paraboschi, P. Samarati, “Choosing reputable servents in a P2P network,” 11th Intl. World Wide Web Conference, Honolulu, HI, May 2002
[42] J. Liang, R. Kumar, Y. Xi, and K. Ross, “Pollution in P2P file sharing systems,” IEEE INFOCOM 05, Miami, FL, Mar.2005
[43] E.Sit, R.Morris, “Security Consideration for Peer-to-Peer Distributed Hash Tables,” IPTPS '01, Cambridge, MA, Mar.2002
[44] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, D. S. Wallach, “Secure Routing for Structured Peer-to-Peer Overlay netwoks,” OSDI 2002, Boston, MA, Dec.2002
[45] M.Castro, B. Liskov, “Practical Byzantine Fault Tolerance,” OSDI 1999, New Orleans, LA, Feb.1999
[46] J. R. Douceur, “The sybil attack,” IPTPS 02, Cambridge, MA, Mar.2002
[47] S. D. Kamvar, M. T. Schlosser, H. Garcia-Molina, “The Eigentrust algorithm for reputation management in P2P networks,” 12th Intl. World Wide Web Conference, Budapest, HU, May 2003
[48] M. Gupta, P. Judge, M. Ammar, “A reputation system for peer-to-peer networks,” NOSSDAV'03, Monterey, CA, Jun.2003 <br />[49] A.Singh, L.Liu, “TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems,” P2P’03, Linköping, SE, Sep.2003
[50] The eMule Project, http://www.emule-project.net,
[51] B.Yang, H.Garcia-Molina, “PPay: micropayments for peer-to-peer systems,” CCS-03, New York, NY, Oct.2003.
[52] D.Hausheer, B.Stiller, “PeerMint: Decentralized and Secure Accounting for Peer-to-Peer Applications,” IFIP Networking 2005, Waterloo, ON, May 2005.
[53] C. Buragohain, D. Agrawal, S. Suri, “A Game Theoretic Framework for Incentives in P2P Systems,” P2P’03, Linköping, SE, Sep.2003.
[54] P. Golle, K. Leyton-Brown, I. Mironov, “Incentives for Sharing in Peer-to-Peer Networks,” EC’01, Tampa, FL, Oct.2001
Keywords
PERR-TO-PEER NETWORKS, P2P NETWORKS, OVERLAY NETWORKS, TIME-SENSITIVE APPLICATIONS, DELAY TOLERANT APPLICATIONS, DISTRIBUTION ARCHITECTURES, CONTENT DISTRIBUTION, STREAMING DISTRIBUTION

Peer to peeR beyOnd FILE Sharing (PROFILES)

Università degli Studi di Trento
Abstract
This project addresses the study of peer-to-peer (P2P) communication systems, considering P2P as a novel communication paradigm that is changing the rules of the communication game in the Internet. P2P applications (Napster, Gnutella, Kazaa, ...) became famous (or infamous!) thanks to file-sharing and the exchange of copyrighted information. However, the key point for the success of P2P networks are cooperation and resource sharing, which make the system scalable, highly performing, dependable, and resilient. Recent P2P systems like Bit-Torrenti, Spit-Stream, and Skype made it clear that P2P networking can address many other applications apart from file-sharing.
The Profiles (Peer to peeR beyOnd FILE Sharing) project goal is the systematic study and design of a specific class of non file-sharing services: Content Distribution Applications (CDAs). A CDA is a system where a piece of information (audio, video, data or multimedia) is distributed to a community of users. They include live event broadcasting/multicasting, conferencing and conversational applications, fast delivery of critical software patches, etc. Different CDA have different performance metrics and different requirements, but they also share common features and fundamental architectures.
Profiles starts from the system analysis and modeling and proceed to the implementation of proof-of-concept prototypes. The project is subdivided in three WPs (plus management – WP0), and further in nine tasks: >>>

Principal Investigator
Renato Antonio Lo Cigno Università degli Studi di TRENTO
Research Objectives
P2P paradigm owes its success to file-sharing, applications where users make their files (e.g., MP3 music, video clips, or simply PC applications) available to the community in exchange of the possibility to download other users’ files. New applications focused on file exchange are continuously designed and introduced in the Internet. Unfortunately, some examples of illegal use of P2P communications (mainly for sharing copyrighted material) made it to the newspapers headlines, creating a bad reputation for P2P applications.
P2P networking, however, represents a major breakpoint in the communication paradigm, whose impact on the Internet is still not completely understood, but it is probably as large as the introduction of mobility in telephone networks.
The diffusion of P2P applications is not only due to the free availability of contents, but also for their easy of use and performance. The client-server communication paradigm was at the root of the Internet growth and success, but it has to adapt continuously to increasing demand and it very often show its limitations when services and traffic patterns change abruptly. For instance, Internet telephony (not simple VoIP applications, but a real global service with directory services, open users’ registration, etc.) did not quite take off until Skype (a proprietary P2P-based system) was introduced. In spite of Skype and other innovative applications discussed in the State of >>>

Timescale
24 months
National and international background
Basics
Peer-to-peer (P2P) applications have obtained an unexpected success in the Internet users' community. Statistics on IP traffic point out that P2P traffic represents the dominant component of the whole Internet traffic. The novelty of the P2P paradigm relies on two main concepts: cooperation among users and resource sharing. Cooperation, with users providing services to the community, has several beneficial effects on the global system performance: it permits to improve capacity, the network reliability, and it makes the network more adaptive to the users’ needs. The P2P paradigm has become very popular essentially for file-sharing: Napster, Gnutella, Kazaa, and [1][2][3] are well known examples of P2P file-sharing applications. In such systems a fully distributed database of files is maintained by the users (peers), each user (peer) making available local files to the rest of the community. When a peer desires to retrieve a file from the network, he first has to localize the file (i.e., the IP addresses of the peers storing it) through a specific search procedure; then it downloads the file from one (or many) of the identified peers. The design of efficient content localization procedures is a key issue to make the P2P file-sharing systems scalable.
In P2P systems of the first generation (also known as unstructured P2P systems - Napster, Gnutella, Kazaa, ...) the procedure relied on simple >>>