Trustworthy Opportunistic Access to the Internet of Services

  • Alessandro Armando
  • Aniello Castiglione
  • Gabriele Costa
  • Ugo Fiore
  • Alessio Merlo
  • Luca Verderame
  • Ilsun You
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7804)

Abstract

Nowadays web services pervade the network experience of the users. Indeed, most of our activities over the internet consist in accessing remote services and interact with them. Clearly, this can happen only when two elements are available: (i) a compatible device and (ii) a suitable network connection. The recent improvement of the computational capabilities of mobile devices, e.g., tablets and smartphones, seriously mitigated the first aspect. Instead, the inappropriateness, or even the absence, of connectivity is still a major issue.

Although mobile, third generation (3G) networks can provide basic connectivity, complex interactions with web services often require different levels of Quality of Service (QoS). Also, 3G connectivity is only available in certain areas, e.g., user’s country, and purchasing temporary connection abroad can be very costly. These costs weigh down on the original service price, seriously impacting the web service business model.

In this paper we describe the problems arising when considering the orchestration of service-oriented opportunistic networks and we present the assumptions that we want to consider in our context. We claim that our model is realistic mainly for two reasons: (i) we consider state-of-the-art technology and technical trends and (ii) we refer to a concrete problem for service providers.

References

  1. 1.
    Armando, A., Costa, G., Merlo, A.: Formal modeling and reasoning about the Android security framework. In: Proc. of 7th International Symposium on Trustworthy Global Computing (2012) (to appear)Google Scholar
  2. 2.
    Baier, C., Katoen, J.-P.: Principles of Model Checking (Representation and Mind Series). The MIT Press (2008)Google Scholar
  3. 3.
    Bartoletti, M., Degano, P., Ferrari, G., Zunino, R.: Local policies for resource usage analysis. ACM Transactions on Programming Languages and Systems, TOPLAS 31(6), 23 (2009)Google Scholar
  4. 4.
    Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399–416. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  5. 5.
    Bertolino, A., Calabrò, A., Lonetti, F., Di Marco, A., Sabetta, A.: Towards a Model-Driven Infrastructure for Runtime Monitoring. In: Troubitsyna, E.A. (ed.) SERENE 2011. LNCS, vol. 6968, pp. 130–144. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  6. 6.
    Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: Design, analysis and applications. In: Proceedings of IEEE INFOCOM, pp. 1653–1664 (2005)Google Scholar
  7. 7.
    Clarke Jr., E.M., Grumberg, O., Peled, D.A.: Model checking. MIT Press, Cambridge (1999)Google Scholar
  8. 8.
    Costa, G., Martinelli, F., Mori, P., Schaefer, C., Walter, T.: Runtime monitoring for next generation java me platform. Computers & Security 29(1), 74–87 (2010)CrossRefGoogle Scholar
  9. 9.
    Pfaff, B., et al.: OpenFlow Switch Specification. OpenFlow (February 2011), http://www.openflow.org/documents/openflow-spec-v1.1.0.pdf
  10. 10.
    Gasti, P., Merlo, A., Ciaccio, G., Chiola, G.: On the integrity of network coding-based anonymous p2p file sharing networks. In: Proceedings of the 2010 Ninth IEEE International Symposium on Network Computing and Applications, NCA 2010, pp. 192–197. IEEE Computer Society, Washington, DC (2010)Google Scholar
  11. 11.
    McKeown, N., Anderson, T., Balakrishnan, H., Parulkar, G., Peterson, L., Rexford, J., Shenker, S., Turner, J.: OpenFlow: enabling innovation in campus networks. SIGCOMM Comput. Commun. Rev. 38(2), 69–74 (2008)CrossRefGoogle Scholar
  12. 12.
    Merlo, A.: Secure cooperative access control on grid. Future Generation Computer Systems 29(2), 497–508 (2013)CrossRefGoogle Scholar
  13. 13.
    Necula, G.C.: Proof-carrying code. In: Proceedings of the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1997, pp. 106–119. ACM, New York (1997)CrossRefGoogle Scholar
  14. 14.
    Preneel, B., Van Oorschot, P.C.: On the Security of Two MAC Algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 19–32. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  15. 15.
    Tootoonchian, A., Ganjali, Y.: Hyperflow: a distributed control plane for openflow. In: Proceedings of the 2010 Internet Network Management Conference on Research on Enterprise Networking, pp. 3–9. USENIX Association, Berkeley (2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Alessandro Armando
    • 1
  • Aniello Castiglione
    • 2
  • Gabriele Costa
    • 1
  • Ugo Fiore
    • 3
  • Alessio Merlo
    • 1
    • 4
  • Luca Verderame
    • 1
  • Ilsun You
    • 5
  1. 1.Università degli Studi di GenovaGenovaItaly
  2. 2.Università degli Studi di SalernoFiscianoItaly
  3. 3.Università di Napoli Federico IINapoliItaly
  4. 4.Università E-CampusNovedrateItaly
  5. 5.Korean Bible UniversitySeoulRepublic of Korea

Personalised recommendations