Peer-to-peer systems have recently emerged to address the problem of enabling the virtualization of distributed resources such as processing, network bandwidth and storage capacity, to create a single system image, granting users and applications seamless access to vast IT capabilities. Participants in peer-to-peer networks are not only potential consumers but also potential resource providers, and operate autonomously with no central authority. Efficient resource sharing and discovery mechanisms are both essential for the functioning of the system as a whole and for the benefit of all participants.
Performance Evaluation of Advanced Routing Algorithms for Unstructured Peer-to-Peer Networks / Amoretti, Michele; Zanichelli, Francesco; Conte, Gianni. - (2006), pp. 500-511. (Intervento presentato al convegno First International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2006) tenutosi a Pisa, Italy nel Ottobre 2006) [10.1145/1190095.1190159].
Performance Evaluation of Advanced Routing Algorithms for Unstructured Peer-to-Peer Networks
AMORETTI, Michele;ZANICHELLI, Francesco;CONTE, Gianni
2006-01-01
Abstract
Peer-to-peer systems have recently emerged to address the problem of enabling the virtualization of distributed resources such as processing, network bandwidth and storage capacity, to create a single system image, granting users and applications seamless access to vast IT capabilities. Participants in peer-to-peer networks are not only potential consumers but also potential resource providers, and operate autonomously with no central authority. Efficient resource sharing and discovery mechanisms are both essential for the functioning of the system as a whole and for the benefit of all participants.File | Dimensione | Formato | |
---|---|---|---|
AmorettiZanichelliConteVALUETOOLS06.pdf
non disponibili
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
386.7 kB
Formato
Adobe PDF
|
386.7 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.