IEICE TRANSACTIONS on Information
A P2P Sensor Data Stream Delivery System That Guarantees the Specified Reachability under Churn Situations
Summary :
In this paper, we propose a method to construct a scalable sensor data stream delivery system that guarantees the specified delivery quality of service (i.e., total reachability to destinations), even when delivery server resources (nodes) are in a heterogeneous churn situation. A number of P2P-based methods have been proposed for constructing a scalable and efficient sensor data stream system that accommodates different delivery cycles by distributing communication loads of the nodes. However, no existing method can guarantee delivery quality of service when the nodes on the system have a heterogeneous churn rate. As an extension of existing methods, which assign relay nodes based on the distributed hashing of the time-to-deliver, our method specifies the number of replication nodes, based on the churn rate of each node and on the relevant delivery paths. Through simulations, we confirmed that our proposed method can guarantee the required reachability, while avoiding any increase in unnecessary resource assignment costs.
- Publication
- IEICE TRANSACTIONS on Information Vol.E102-D No.5 pp.932-941
- Publication Date
- 2019/05/01
- Publicized
- 2019/02/06
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.2018NTP0014
- Type of Manuscript
- Special Section PAPER (Special Section on the Architectures, Protocols, and Applications for the Future Internet)
- Category
Authors
Tomoya KAWAKAMI
Nara Institute of Science and Technology
Tomoki YOSHIHISA
Osaka University
Yuuichi TERANISHI
Osaka University,National Institute of Information and Communications Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Tomoya KAWAKAMI, Tomoki YOSHIHISA, Yuuichi TERANISHI, "A P2P Sensor Data Stream Delivery System That Guarantees the Specified Reachability under Churn Situations" in IEICE TRANSACTIONS on Information,
vol. E102-D, no. 5, pp. 932-941, May 2019, doi: 10.1587/transinf.2018NTP0014.
Abstract: In this paper, we propose a method to construct a scalable sensor data stream delivery system that guarantees the specified delivery quality of service (i.e., total reachability to destinations), even when delivery server resources (nodes) are in a heterogeneous churn situation. A number of P2P-based methods have been proposed for constructing a scalable and efficient sensor data stream system that accommodates different delivery cycles by distributing communication loads of the nodes. However, no existing method can guarantee delivery quality of service when the nodes on the system have a heterogeneous churn rate. As an extension of existing methods, which assign relay nodes based on the distributed hashing of the time-to-deliver, our method specifies the number of replication nodes, based on the churn rate of each node and on the relevant delivery paths. Through simulations, we confirmed that our proposed method can guarantee the required reachability, while avoiding any increase in unnecessary resource assignment costs.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2018NTP0014/_p
Copy
@ARTICLE{e102-d_5_932,
author={Tomoya KAWAKAMI, Tomoki YOSHIHISA, Yuuichi TERANISHI, },
journal={IEICE TRANSACTIONS on Information},
title={A P2P Sensor Data Stream Delivery System That Guarantees the Specified Reachability under Churn Situations},
year={2019},
volume={E102-D},
number={5},
pages={932-941},
abstract={In this paper, we propose a method to construct a scalable sensor data stream delivery system that guarantees the specified delivery quality of service (i.e., total reachability to destinations), even when delivery server resources (nodes) are in a heterogeneous churn situation. A number of P2P-based methods have been proposed for constructing a scalable and efficient sensor data stream system that accommodates different delivery cycles by distributing communication loads of the nodes. However, no existing method can guarantee delivery quality of service when the nodes on the system have a heterogeneous churn rate. As an extension of existing methods, which assign relay nodes based on the distributed hashing of the time-to-deliver, our method specifies the number of replication nodes, based on the churn rate of each node and on the relevant delivery paths. Through simulations, we confirmed that our proposed method can guarantee the required reachability, while avoiding any increase in unnecessary resource assignment costs.},
keywords={},
doi={10.1587/transinf.2018NTP0014},
ISSN={1745-1361},
month={May},}
Copy
TY - JOUR
TI - A P2P Sensor Data Stream Delivery System That Guarantees the Specified Reachability under Churn Situations
T2 - IEICE TRANSACTIONS on Information
SP - 932
EP - 941
AU - Tomoya KAWAKAMI
AU - Tomoki YOSHIHISA
AU - Yuuichi TERANISHI
PY - 2019
DO - 10.1587/transinf.2018NTP0014
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E102-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2019
AB - In this paper, we propose a method to construct a scalable sensor data stream delivery system that guarantees the specified delivery quality of service (i.e., total reachability to destinations), even when delivery server resources (nodes) are in a heterogeneous churn situation. A number of P2P-based methods have been proposed for constructing a scalable and efficient sensor data stream system that accommodates different delivery cycles by distributing communication loads of the nodes. However, no existing method can guarantee delivery quality of service when the nodes on the system have a heterogeneous churn rate. As an extension of existing methods, which assign relay nodes based on the distributed hashing of the time-to-deliver, our method specifies the number of replication nodes, based on the churn rate of each node and on the relevant delivery paths. Through simulations, we confirmed that our proposed method can guarantee the required reachability, while avoiding any increase in unnecessary resource assignment costs.
ER -
English
