Exploiting Self-Adaptive Replication Management on Decentralized Tuple Space
Decentralized Tuple Space (DTS) implements tuple
space model among a series of decentralized hosts and provides the
logical global shared tuple repository. Replication has been introduced
to promote performance problem incurred by remote tuple access. In
this paper, we propose a replication approach of DTS allowing
replication policies self-adapting. The accesses from users or other
nodes are monitored and collected to contribute the decision making.
The replication policy may be changed if the better performance is
expected. The experiments show that this approach suitably adjusts the
replication policies, which brings negligible overhead.
[1] Gelernter, D., "Generative communication in Linda", ACM T Progr Lang
Sys, 1985, 7(1), pp. 80-112.
[2] Freeman, E., Hupfer, S., and Arnold, K., JavaSpaces Principles, Patterns,
and Practice (Pearson Education, 1999).
[3] Wyckoff, P., McLaughry, S.W., Lehman, T.J., and Ford, D.A., "T spaces",
Ibm Syst J, 1998, 37(3), pp. 454-474.
[4] Murphy, A.L., Picco, G.P., and Roman, G.C., "LIME: A coordination
model and middleware supporting mobility of hosts and agents", ACM
Transactions on Software Engineering and Methodology 2006, 15(3), pp.
279-328.
[5] Murphy, A.L., and Picco, G.P., ÔÇÿUsing coordination middleware for
location-aware computing: A LIME case study-: Coordination Models and
Languages, Proceedings (Springer Berlin, 2004), pp. 263-278.
[6] Jiankuan, X., Zheng, Q., and Jinxue, Z., "A Decentralized Tuple Space
Model with Policy Management for Collaboration", Chiese Journal of
Electronics, 2010 (Accepted, estimated published in 2010.4).
[7] Bellini, L., "Lime II: Reengineering a mobile middleware", Master Thesis,
Politecnico di Milano, Italy, 2004.
[8] Balzarotti, D., Costa, P., and Picco, G.P., "The LighTS tuple space
framework and its customization for context-aware applications", Web
Intell. Agent Syst., 2007, 5(2), pp. 215-231.
[9] Xu, A., and Liskov, B., "A design for a fault-tolerant, distributed
implementation of Linda", in The Nineteenth International Symposium on
Fault-Tolerant Computing, pp. 199-206.
[10] Bakken, D.E., and Schlichting, R.D., "Supporting Fault-Tolerant Parallel
Programming in Linda", IEEE T Parall Distr, 1995, 6(3), pp. 287-302.
[11] Murphy, A.L., and Picco, G.P., "Using LIME to support replication for
availability in mobile ad hoc networks", in Coordination Models and
Languages, Proceedings (Springer-Verlag Berlin, 2006), pp. 194-211.
[12] Russello, G., Chaudron, M., and van Steen, M., "Dynamically adapting
tuple replication for managing availability in a shared data space",
Coordination Models and Languages, Proceedings (Springer-Verlag
Berlin, 2005), pp. 109-124.
[13] Russello, G., Chaudron, M.R.V., van Steen, M., and Bokharouss, I., "An
experimental evaluation of self-managing availability in shared data
spaces", Sci. Comput. Program., 2007, 64(2), pp. 246-262.
[14] Busi, N., Montresor, A., and Zavattaro, G., "Data-driven coordination in
peer-to-peer information systems", Int J Coop Inf Syst, 2004, 13(1), pp.
63-89.
[1] Gelernter, D., "Generative communication in Linda", ACM T Progr Lang
Sys, 1985, 7(1), pp. 80-112.
[2] Freeman, E., Hupfer, S., and Arnold, K., JavaSpaces Principles, Patterns,
and Practice (Pearson Education, 1999).
[3] Wyckoff, P., McLaughry, S.W., Lehman, T.J., and Ford, D.A., "T spaces",
Ibm Syst J, 1998, 37(3), pp. 454-474.
[4] Murphy, A.L., Picco, G.P., and Roman, G.C., "LIME: A coordination
model and middleware supporting mobility of hosts and agents", ACM
Transactions on Software Engineering and Methodology 2006, 15(3), pp.
279-328.
[5] Murphy, A.L., and Picco, G.P., ÔÇÿUsing coordination middleware for
location-aware computing: A LIME case study-: Coordination Models and
Languages, Proceedings (Springer Berlin, 2004), pp. 263-278.
[6] Jiankuan, X., Zheng, Q., and Jinxue, Z., "A Decentralized Tuple Space
Model with Policy Management for Collaboration", Chiese Journal of
Electronics, 2010 (Accepted, estimated published in 2010.4).
[7] Bellini, L., "Lime II: Reengineering a mobile middleware", Master Thesis,
Politecnico di Milano, Italy, 2004.
[8] Balzarotti, D., Costa, P., and Picco, G.P., "The LighTS tuple space
framework and its customization for context-aware applications", Web
Intell. Agent Syst., 2007, 5(2), pp. 215-231.
[9] Xu, A., and Liskov, B., "A design for a fault-tolerant, distributed
implementation of Linda", in The Nineteenth International Symposium on
Fault-Tolerant Computing, pp. 199-206.
[10] Bakken, D.E., and Schlichting, R.D., "Supporting Fault-Tolerant Parallel
Programming in Linda", IEEE T Parall Distr, 1995, 6(3), pp. 287-302.
[11] Murphy, A.L., and Picco, G.P., "Using LIME to support replication for
availability in mobile ad hoc networks", in Coordination Models and
Languages, Proceedings (Springer-Verlag Berlin, 2006), pp. 194-211.
[12] Russello, G., Chaudron, M., and van Steen, M., "Dynamically adapting
tuple replication for managing availability in a shared data space",
Coordination Models and Languages, Proceedings (Springer-Verlag
Berlin, 2005), pp. 109-124.
[13] Russello, G., Chaudron, M.R.V., van Steen, M., and Bokharouss, I., "An
experimental evaluation of self-managing availability in shared data
spaces", Sci. Comput. Program., 2007, 64(2), pp. 246-262.
[14] Busi, N., Montresor, A., and Zavattaro, G., "Data-driven coordination in
peer-to-peer information systems", Int J Coop Inf Syst, 2004, 13(1), pp.
63-89.
@article{"International Journal of Information, Control and Computer Sciences:64807", author = "Xing Jiankuan and Qin Zheng and Zhang Jinxue", title = "Exploiting Self-Adaptive Replication Management on Decentralized Tuple Space", abstract = "Decentralized Tuple Space (DTS) implements tuple
space model among a series of decentralized hosts and provides the
logical global shared tuple repository. Replication has been introduced
to promote performance problem incurred by remote tuple access. In
this paper, we propose a replication approach of DTS allowing
replication policies self-adapting. The accesses from users or other
nodes are monitored and collected to contribute the decision making.
The replication policy may be changed if the better performance is
expected. The experiments show that this approach suitably adjusts the
replication policies, which brings negligible overhead.", keywords = "Decentralization, Replication Management, SelfAdaption, Tuple Space.", volume = "4", number = "4", pages = "850-7", }
