Abstract
The last decades have seen the emergence of the sea of objects paradigm for structuring complex distributed systems on workstations and local area networks. In this approach, applications and system services are composed of and communicate among themselves through reliable and transparently accessible object interfaces, leading to the interaction of hundred or thousands of unstructured objects.
This approach has lead to major progress in software composability and reliability. Unfortunately, it is based on a number of assumptions that do not hold on wide area networks. There, access to resources is intrinsically unreliable (because of failure, congestion, voluntary disconnected operation, etc.) and not transparent (because of variations in latency and bandwidth, hardware and software mobility, and the presence of firewalls). These characteristics are so radically different from the current computational norm that they amount to a new model of computation.
We discuss the challenges of computation on wide area networks. Our approach reflects the intuition that, to function satisfactorily on a wide area network, the sea of objects must be partitioned and made hierarchical, internally mobile, and secure. This paper is an abridged version of [3].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bharat, K. and L. Cardelli: Migratory applications, Proc. of the ACM Symposium on User Interface Software and Technology’ 95. 133–142. 1995.
Bracha, G. and S. Toueg, Asynchronous consensus and broadcast protocols. J.ACM 32(4), 824–840. 1985.
Cardelli, L., Abstractions for Mobile Computation, in Secure Internet Programming: Security Issues for Distributed and Mobile Objects, Jan Vitek and Christian Jensen (Eds.). Springer. 1999. (To appear.)
Cardelli, L., A language with distributed scope. Computing Systems, 8(1), 27–59. MIT Press. 1995.
Cardelli, L. and R. Davies. Service combinators for web computing. Proc. of the First Usenix Conference on Domain Specific Languages, Santa Barbara. 1997.
Cardelli L., G. Ghelli, and A.D. Gordon, Mobility Types for Mobile Ambients, Proc. ICALP’99.
Cardelli, L. and A.D. Gordon, Mobile ambients, in Foundations of Software Science and Computational Structures, Maurice Nivat (Ed.), Lecture Notes in Computer Science 1378, Springer, 140–155. 1998.
Carriero, N. and D. Gelernter, Linda in Context. Communications of the ACM, 32(4), 444–458. 1989.
Chandra, T.D., S. Toueg, Unreliable failure detectors for asynchronous systems. ACM Symposium on Principles of Distributed Computing, 325–340. 1991.
Fischer, M.J., N.A. Lynch, and M.S. Paterson, Impossibility of distributed consensus with one faulty process. J.ACM 32(2), 374–382. 1985.
Milner, R., J. Parrow and D. Walker, A calculus of mobile processes, Parts 1-2. Information and Computation, 100(1), 1–77.1992
Sander, A. and C.F. Tschudin, Towards mobile cryptography, ICSI technical report 97049, November 1997. Proc. IEEE Symposium on Security and Privacy, Spring 1998.
Stamos, J.W. and D.K. Gifford, Remote evaluation. ACM Transactions on Programming Languages and Systems 12(4), 537–565.1990.
White, J.E., Mobile agents. In Software Agents, J. Bradshaw, ed. AAAI Press / The MIT Press. 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cardelli, L. (1999). Wide Area Computation. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_2
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive