This paper introduces a methodology for engineering best-effort P2P algorithms into dependable P2P-based network control mechanism. The proposed method is built upon an iterative approach consisting of improving the original P2P algorithm by appropriate mechanisms and of thorough performance assessment with respect to dependability measures. The potential of the methodology is outlined by the example of timely routing control for vertical handover in B3G wireless networks. In detail, the well-known Pastry and CAN algorithms are enhanced to include locality. By showing how to combine algorithmic enhancements with performance indicators, this case study paves the way for future engineering of dependable network control mechanisms through P2P algorithms.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Kurt TUTSCHKU, Akihiro NAKAO, "Towards the Engineering of Dependable P2P-Based Network Control -- The Case of Timely Routing Control Messages" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 1, pp. 17-25, January 2009, doi: 10.1587/transcom.E92.B.17.
Abstract: This paper introduces a methodology for engineering best-effort P2P algorithms into dependable P2P-based network control mechanism. The proposed method is built upon an iterative approach consisting of improving the original P2P algorithm by appropriate mechanisms and of thorough performance assessment with respect to dependability measures. The potential of the methodology is outlined by the example of timely routing control for vertical handover in B3G wireless networks. In detail, the well-known Pastry and CAN algorithms are enhanced to include locality. By showing how to combine algorithmic enhancements with performance indicators, this case study paves the way for future engineering of dependable network control mechanisms through P2P algorithms.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.17/_p
Copy
@ARTICLE{e92-b_1_17,
author={Kurt TUTSCHKU, Akihiro NAKAO, },
journal={IEICE TRANSACTIONS on Communications},
title={Towards the Engineering of Dependable P2P-Based Network Control -- The Case of Timely Routing Control Messages},
year={2009},
volume={E92-B},
number={1},
pages={17-25},
abstract={This paper introduces a methodology for engineering best-effort P2P algorithms into dependable P2P-based network control mechanism. The proposed method is built upon an iterative approach consisting of improving the original P2P algorithm by appropriate mechanisms and of thorough performance assessment with respect to dependability measures. The potential of the methodology is outlined by the example of timely routing control for vertical handover in B3G wireless networks. In detail, the well-known Pastry and CAN algorithms are enhanced to include locality. By showing how to combine algorithmic enhancements with performance indicators, this case study paves the way for future engineering of dependable network control mechanisms through P2P algorithms.},
keywords={},
doi={10.1587/transcom.E92.B.17},
ISSN={1745-1345},
month={January},}
Copy
TY - JOUR
TI - Towards the Engineering of Dependable P2P-Based Network Control -- The Case of Timely Routing Control Messages
T2 - IEICE TRANSACTIONS on Communications
SP - 17
EP - 25
AU - Kurt TUTSCHKU
AU - Akihiro NAKAO
PY - 2009
DO - 10.1587/transcom.E92.B.17
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 1
JA - IEICE TRANSACTIONS on Communications
Y1 - January 2009
AB - This paper introduces a methodology for engineering best-effort P2P algorithms into dependable P2P-based network control mechanism. The proposed method is built upon an iterative approach consisting of improving the original P2P algorithm by appropriate mechanisms and of thorough performance assessment with respect to dependability measures. The potential of the methodology is outlined by the example of timely routing control for vertical handover in B3G wireless networks. In detail, the well-known Pastry and CAN algorithms are enhanced to include locality. By showing how to combine algorithmic enhancements with performance indicators, this case study paves the way for future engineering of dependable network control mechanisms through P2P algorithms.
ER -