TY - GEN
T1 - Robust mesh-based data delivery over multiple tree-shaped routes in P2P overlay network
AU - Awiphan, Suphakit
AU - Zhou, Su
AU - Katto, Jiro
PY - 2009/11/6
Y1 - 2009/11/6
N2 - In this paper, we introduce a new mesh-based approach for data delivery which is organized over multiple tree-shaped core routes. Given that both tree and mesh approaches for multicast overlay construction have their own strong points, we simply combine them. During session, the mesh connections are formed dynamically to facilitate the data delivery on tree-shaped core routes which may experience bandwidth bottlenecks. Unlike existing mesh-based approaches, our proposal employs push-based data delivery along mesh connection. A well-organized mesh construction scheme is defined to avoid data redundancies. We evaluated the proposal through ns-2 simulator. The simulation results demonstrate that our approach can provide higher average received quality and has acceptable control overhead when compared to a single tree method. We also show that, over a static overlay, the push-based data delivery on mesh can provide the received quality close to supposed pull-based data delivery method with less latency. Moreover, it has lower control overhead than the pull-based method when the peer number is large.
AB - In this paper, we introduce a new mesh-based approach for data delivery which is organized over multiple tree-shaped core routes. Given that both tree and mesh approaches for multicast overlay construction have their own strong points, we simply combine them. During session, the mesh connections are formed dynamically to facilitate the data delivery on tree-shaped core routes which may experience bandwidth bottlenecks. Unlike existing mesh-based approaches, our proposal employs push-based data delivery along mesh connection. A well-organized mesh construction scheme is defined to avoid data redundancies. We evaluated the proposal through ns-2 simulator. The simulation results demonstrate that our approach can provide higher average received quality and has acceptable control overhead when compared to a single tree method. We also show that, over a static overlay, the push-based data delivery on mesh can provide the received quality close to supposed pull-based data delivery method with less latency. Moreover, it has lower control overhead than the pull-based method when the peer number is large.
UR - http://www.scopus.com/inward/record.url?scp=70350580313&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70350580313&partnerID=8YFLogxK
U2 - 10.1109/ISORC.2009.34
DO - 10.1109/ISORC.2009.34
M3 - Conference contribution
AN - SCOPUS:70350580313
SN - 9780769535739
T3 - Proceedings of the 2009 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2009
SP - 181
EP - 187
BT - Proceedings of the 2009 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2009
T2 - 2009 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing, ISORC 2009
Y2 - 17 March 2009 through 20 March 2009
ER -