Advertisement

Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems

  • Luigi Liquori
  • Michel Cosnard
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4912)

Abstract

We propose and discuss foundations for programmable overlay networks and overlay computing systems. Such overlays are built over a large number of distributed computational individuals, virtually organized in colonies, and ruled by a leader (broker) who is elected or imposed by system administrators. Every individual asks the broker to log in the colony by declaring the resources that can be offered (with variable guarantees). Once logged in, an individual can ask the broker for other resources. Colonies can recursively be considered as evolved individuals who can log in an outermost colony governed by another (super)-broker. Communications and routing intra-colonies goes through a broker-2-broker PKI-based negotiation. Every broker routes intra- and inter- service requests by filtering its resource routing table, and then by forwarding the request first inside its colony, and second outside, via the proper super-broker (thus applying an endogenous-first-estrogen-last strategy). Theoretically, queries are formulæ in first-order logic equipped with a small program used to orchestrate and synchronize atomic formulæ. When the client individual receives notification of all (or part of) the requested resources, then the real resource exchange is performed directly by the server(s) individuals, without any further mediation of the broker, in a pure peer-to-peer fashion. The proposed overlay promotes an intermittent participation in the colony, since peers can appear, disappear, and organize themselves dynamically. This implies that the routing process may lead to failures, because some individuals have quit, or are temporarily unavailable, or they were logged out manu militari by the broker due to their poor performance or greediness. We design, validate through simulation, and implement these foundations in a programmable overlay computer system, called Arigatoni.

Keywords

Service Request Overlay Network Logical Network Distribute Hash Table Resource Provider 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Abe01]
    Aberer, K.: P-Grid: A Self-Organizing Access Structure for P2P Information Systems. In: Batini, C., Giunchiglia, F., Giorgini, P., Mecella, M. (eds.) CoopIS 2001. LNCS, vol. 2172, pp. 179–194. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  2. [AD97]
    Alexander, S., Droms, R.: RFC2132, DHCP Options and BOOTP Vendor Extensions. Technical report, IETF (1997)Google Scholar
  3. [AEO06]
    AEOLUS. Deliverable D2.1.1: Resource Discovery: State of the Art Survey and Algorithmic Solutions (2006)Google Scholar
  4. [Ari]
  5. [Bac54]
    Backus, J.W.: The IBM 701 Speedcoding System. J. ACM 1(1), 4–6 (1954)CrossRefGoogle Scholar
  6. [BCLV06]
    Benza, D., Cosnard, M., Liquori, L., Vesin, M.: Arigatoni: Overlaying Internet via Low Level Network Protocols. In: JVA, John Vincent Atanasoff International Symposium on Modern Computing, pp. 82–91. IEEE, Los Alamitos (2006)CrossRefGoogle Scholar
  7. [BCM+99]
    Banavar, G., Chandra, T., Mukherjee, B., Nagarajarao, J., Strom, R.E., Sturman, D.C.: An efficient multicast protocol for content-based publish-subscribe systems. In: Proc. of ICDCS (1999)Google Scholar
  8. [Bit]
    BitTorrent, Inc., http://www.bittorrent.com/
  9. [Car95]
    Cardelli, L.: A language with distributed scope. Computing Systems 8(1), 27–59 (1995)Google Scholar
  10. [CCL06]
    Chand, R., Cosnard, M., Liquori, L.: Resource Discovery in the Arigatoni Overlay Network. In: I2CS, International Workshop on Innovative Internet Community Systems. LNCS, Springer, Heidelberg (2006)Google Scholar
  11. [CCL08]
    Chand, R., Cosnard, M., Liquori, L.: Powerful resource discovery for Arigatoni overlay network. Future Generation Computer Systems 24(1), 31–38 (2008)CrossRefGoogle Scholar
  12. [CF04]
    Chand, R., Felber, P.: XNet: A Reliable Content-Based Publish/Subscribe System. In: Proc. of SRDS: Symposium on Reliable Distributed Systems (2004)Google Scholar
  13. [Cha]
    Grand UK Challenge. Global Computing and Pervasive Computing, http://www-dse.doc.ic.ac.uk/Projects/UbiNet/GC/
  14. [CLC07a]
    Chand, R., Liquori, L., Cosnard, M.: Improving Resource Discovery in the Arigatoni Overlay Network. In: Lukowicz, P., Thiele, L., Tröster, G. (eds.) ARCS 2007. LNCS, vol. 4415, pp. 98–111. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. [CLC07b]
    Cosnard, M., Liquori, L., Chand, R.: Virtual Organizations in Arigatoni. DCM, International Workshop on Development in Computational Models 171(3) (2007)Google Scholar
  16. [CRW01]
    Carzaniga, A., Rosenblum, D.S., Wolf, A.L.: Design and Evaluation of a Wide-Area Event Notification Service. ACM TOCS 19(3) (2001)Google Scholar
  17. [EFGK03]
    Eugster, P.T., Felber, P., Guerraoui, R., Kermarrec, A.M.: The Many Faces of Publish/Subscribe. Computing Survey 35(2), 114–131 (2003)CrossRefGoogle Scholar
  18. [FM03]
    Freedman, M.J., Mazières, D.: Sloppy Hashing and Self-Organizing Clusters. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735, pp. 45–55. Springer, Heidelberg (2003)Google Scholar
  19. [GKGM04]
    Ganesan, P., Krishna, P., Garcia-Molina, H.: Canon in G-major: Designing DHTS with Hierarchical Structure. In: Proc. of ICDCS, pp. 263–272. IEEE, Los Alamitos (2004)Google Scholar
  20. [Glo]
    Globus Alliance, http://www.globus.org/
  21. [Gri]
    Grid 5000 Consortium, http://www.grid5000.org
  22. [GVE00]
    Gulbrandsen, A., Vixie, P., Esibov, L.: RFC2782, A DNS RR for specifying the location of services (DNS SRV). Technical report, IETF (2000)Google Scholar
  23. [Hei01]
    Heimbigner, D.: Adapting publish/subscribe middleware to achieve gnutella-like functionality. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 176–181. Springer, Heidelberg (2001)Google Scholar
  24. [IBM]
    IBM. Business Process Execution Language, http://www.ibm.com/developerworks/library/specification/ws-bpel/
  25. [INR]
    INRIA. Strategic Plan 2008-2012 (to appear)Google Scholar
  26. [JV05]
    Jagadish, H.V., Ooiand, B.C., Vu, Q.H.: BATON: A Balanced Tree Structure for Peer-to-Peer Networks. In: Proc. of VLDB, pp. 661–672. ACM, New York (2005)Google Scholar
  27. [JXT]
    JXTA Community, http://www.jxta.org/
  28. [LC07]
    Liquori, L., Cosnard, M.: Weaving Arigatoni with a Graph Topology. In: ADVCOMP, International Conference on Advanced Engineering Computing and Applications in Sciences, IEEE Computer Society Press, Los Alamitos (2007)Google Scholar
  29. [Lin00]
    Linn, J.: RFC 2743, Generic Security Service Application Program Interface Version 2, Update 1. Technical report, IETF (2000)Google Scholar
  30. [Log]
  31. [NCL07]
    Nain, P., Casetti, C., Liquori, L.: A Stochastic Model of an Arigatoni Overlay Computer. Research report, Politecnico di Torino (2007)Google Scholar
  32. [Nok]
    Nokia. N810 Internet TerminalGoogle Scholar
  33. [OSG]
    OSGi Alliance. Open Services Gateway Initiative, http://www.osgi.org/
  34. [Pau]
    Pautasso, C.: JOpera: Process Support for more than Web Services, http://www.jopera.org/
  35. [Rap63]
    Rapoport, A.: Mathematical models of social interaction. In: Handbook of Mathematical Psychology, vol. II, pp. 493–579. John Wiley and Sons, Chichester (1963)Google Scholar
  36. [RWHM03]
    Rosenberg, J., Weinberger, J., Huitema, C., Mahy, R.: RFC3489, STUN - Simple Traversal of User Datagram Protocol (UDP) Through Network Address Translators (NATs). Technical report, IETF (2003)Google Scholar
  37. [vN88]
    von Neumann, J.: The Principles of Large-Scale Computing Machines. IEEE Ann. Hist. Comput. 10(4), 243–256 (1988)CrossRefGoogle Scholar
  38. [Whi94]
    White, J.E.: Telescript Technology: The Foundation for the Electronic Marketplace. White Paper. General Magic, Inc. (1994)Google Scholar
  39. [WV03]
    Wang, Y., Vassileva, J.: Trust and Reputation Model in Peer-to-Peer Networks. In: Proc. of Peer-to-Peer Computing, IEEE Computer Society, Los Alamitos (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Luigi Liquori
    • 1
  • Michel Cosnard
    • 1
  1. 1.INRIAFrance

Personalised recommendations