Abstract
Mobile P2P networks possess particular characteristics which make accessibility of services deployed on peers a challenge. This has to be taken into account when considering robustness of applications that depend on successfully accessing a set of services. While ensuring robustness is traditionally handled through replication or redundancy, those solutions are not readily applicable to decentralized and dynamic networks. Instead, current solutions are based on efficient P2P structure maintenance or unstructured network search algorithms. A novel and alternative method proposed in this paper is based on the observation that some redundancy may exist between services offered on the network, a fact which could be used to recreate an unavailable service from services accessible to a peer. Instead of adding redundancy to the system, our solution exploits the already existing redundancy to improve robustness of mobile P2P applications. We model the interaction with services as finite-state transducers and propose a heuristic to obtain redundancy between any pair of services. Then, a set of algorithms that uses this inter-service redundancy to recreate the interaction with one service from the other is discussed. The computational cost is polynomial with respect to services’ size, and in practice, the non-redundant functionality and related control need to be implemented locally.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
Different services may be the reflection of different capabilities of various mobile devices.
A relation is regular if it is computed by a finite state transducer.
In the case when C ≡ T, that is, T contains C and C contains T, then the number of states and links is exactly the same.
References
Kellerer W, Schollmeier R, Wehrle K (2005) Peer-to-peer in mobile environments. In: Steinmetz R, Wehrle K (eds) Peer-to-peer systems and applications. Lecture notes in computer science, vol 3485. Springer, Heidelberg, pp 401–417
Shneidman J, Parkes DC (2003) Rationality and self-interest in peer to peer networks. In: Kaashoek MF, Ion Stoica (eds) IPTPS. Lecture notes in computer science, vol 2735. Springer, Heidelberg, pp 139–148
Petrie CJ, Bussler C (2003) Service agents and virtual enterprises: a survey. IEEE Internet Computing 7(4):68–78
Kellerer W, Despotovic Z, Michel M, Hofstatter Q, Zöls S (2007) Towards a mobile peer-to-peer service platform. In: SAINT workshops. IEEE Computer Society, Los Alamitos, p 2
Wolfson O, Xu B, Tanner RM (2007) Mobile peer-to-peer data dissemination with resource constraints. In: Becker C, Jensen CS, Su J (eds) MDM. IEEE, Piscataway, pp 16–23
Takeshita K, Sasabe M, Nakano H (2008) Mobile p2p networks for highly dynamic environments. In: PerCom. IEEE Computer Society, Los Alamitos, pp 453–457
Risson J, Moors T (2006) Survey of research towards robust peer-to-peer networks: search methods. Comput Netw 50(17):3485–3521
Lindemann C, Waldhorst OP (2004) Exploiting epidemic data dissemination for consistent lookup operations in mobile applications. SIGMOBILE Mob Comput Commun Rev 8(3):44–56
Medidi M, Ding J, Medidi S (2005) Data dissemination using limited flooding in wireless sensor networks. In: Yang LT, Arabnia HR, Wang L-C (eds) ICWN. CSREA, Las Vegas, pp 434–440
Landsiedel O, Götz S, Wehrle K (2006) A churn and mobility resistant approach for dhts. In: MobiShare ’06: proceedings of the 1st international workshop on decentralized resource sharing in mobile computing and networking, New York, NY, USA. ACM, New York, pp 42–47
Brand D, Zafiropulo P (1983) On communicating finite-state machines. J ACM 30(2):323–342
Abiteboul S, Vianu V, Fordham BS, Yesha Y (1998) Relational transducers for electronic commerce. In: Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, June 1–3, 1998, Seattle, Washington. ACM, New York, pp 179–187
Farahbod R, Glässer U, Vajihollahi M (2004) Specification and validation of the business process execution language for web services. In: Abstract state machines. Springer, Heidelberg, pp 78–94
Gurevich Y (2000) Sequential abstract-state machines capture sequential algorithms. ACM Trans Comput Log 1(1):77–111
Börger E (2007) Modeling workflow patterns from first principles. In: Parent C, Schewe K-D, Storey VC, Thalheim B (eds) ER. Lecture notes in computer science, vol 4801. Springer, Heidelberg, pp 1–20
Grieskamp W, Gurevich Y, Schulte W, Veanes M (2002) Generating finite state machines from abstract state machines. In: Proceedings of the international symposium on software testing and analysis (ISSTA), pp 112–122
Berardi D, Calvanese D, De Giacomo G, Lenzerini M, Mecella M (2003) Automatic composition of e-services that export their behavior. In: Orlowska ME, Weerawarana S, Papazoglou MP, Yang J (eds) ICSOC. Lecture notes in computer science, vol 2910. Springer, Heidelberg, pp 43–58
Bultan T, Fu X, Hull R, Su J (2003) Conversation specification: a new approach to design and analysis of e-service composition. In: WWW, pp 403–410
Dang Z, Ibarra OH, Su J (2004) Composability of infinite-state activity automata. In: Fleischer R, Trippen G, (eds) ISAAC. Lecture notes in computer science, vol 3341. Springer, Heidelberg, pp 377–388
Roche E (1997) Compact factorization of finite-state transducers and finite-state automata. Nord. J. Comput. 4(2):187–216
Roczniak A, Melhem J, Levy P, El-Saddik A (2006) Design of distributed collaborative application through service aggregation. In: DS-RT. IEEE Computer Society, Los Alamitos, pp 165–174
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Roczniak, A., El Saddik, A. Improving robustness of P2P applications in mobile environments. Peer-to-Peer Netw. Appl. 2, 217–229 (2009). https://doi.org/10.1007/s12083-009-0032-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12083-009-0032-z