TY - GEN
T1 - Peer-to-peer architectures for scalable, efficient and reliable media services
AU - Kalogeraki, Vana
AU - Delis, Alex
AU - Gunopulos, Dimitrios
N1 - Publisher Copyright:
© 2003 IEEE.
PY - 2003
Y1 - 2003
N2 - In this paper, we propose and study the behavior of a number of peer-to-peer (P2P)-based distributed computing systems in order to offer efficient and reliable media services over a large-scale heterogeneous network of computing nodes. Our proposed middleware architectures exploit features including availability of high-performance links to networks, usage of exclusive and partial indexing in peers, making nodes "aware" of the content of their own vicinity, replication of objects and caching of popular items, as well as full connectivity among servers if feasible. Through detailed simulation and experimentation, we investigate the behavior of the suggested P2P architectures for video provision and examine the trade-offs involved. We show that under realistic assumptions, the proposed architectures are resilient to multiple peer-failures, provide timeliness guarantees and are scalable with respect to dropped requests when the number of messages in the network increases.
AB - In this paper, we propose and study the behavior of a number of peer-to-peer (P2P)-based distributed computing systems in order to offer efficient and reliable media services over a large-scale heterogeneous network of computing nodes. Our proposed middleware architectures exploit features including availability of high-performance links to networks, usage of exclusive and partial indexing in peers, making nodes "aware" of the content of their own vicinity, replication of objects and caching of popular items, as well as full connectivity among servers if feasible. Through detailed simulation and experimentation, we investigate the behavior of the suggested P2P architectures for video provision and examine the trade-offs involved. We show that under realistic assumptions, the proposed architectures are resilient to multiple peer-failures, provide timeliness guarantees and are scalable with respect to dropped requests when the number of messages in the network increases.
UR - http://www.scopus.com/inward/record.url?scp=84947277899&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84947277899&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2003.1213109
DO - 10.1109/IPDPS.2003.1213109
M3 - Conference contribution
AN - SCOPUS:84947277899
T3 - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
BT - Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - International Parallel and Distributed Processing Symposium, IPDPS 2003
Y2 - 22 April 2003 through 26 April 2003
ER -