Location Independent Routing in Process Network Overlays
2014 (English)In: Service Oriented Computing and Applications, ISSN 1863-2386, E-ISSN 1863-2394, no Special Issue, 1-25 p.Article in journal (Other academic) Published
In distributed computing, location transparency - the decoupling of objects, tasks, and virtual machines from their physical location - is desirable in that it can simplify application development and management, and enable load balancing and efficient resource allocation. Many existing systems for location transparency are built on top of TCP/IP. We argue that addressing mobile objects in terms of the host where they temporarily reside may not be the best design decision. When objects can migrate, it becomes necessary to use a dedicated routing infrastructure to deliver inter-object messages, such as location servers or forwarding chains. This incurs high costs in terms of complexity, overhead, and latency. In this paper, we defer object overlay routing to an underlying networking layer, by assuming a location independent routing scheme in place of TCP/IP. In this scheme, messages are directed to destinations determined by flat identifiers instead of IP addresses. Consequently, messages are delivered directly to a recipient object, instead of a possibly out-of-date location. We explore the scheme in the context of a small object-based language with asynchronous message passing, in the style of core Erlang. We provide a standard, network-oblivious operational semantics of this language, and a network-aware semantics which takes many aspects of distribution and message routing into account. The main result is that execution of a program on top of an abstract network of processing nodes connected by asynchronous point-to-point communication channels preserves the network-oblivious behavior in a sound and fully abstract way, in the sense of contextual equivalence. This is a novel and strong result for such a low-level model. Previous work has addressed distributed implementations only in terms of fully connected TCP underlays. But in this setting, contextual equivalence is typically too strong, due to the need for locking to resolve preemption arising from object mobility.
Place, publisher, year, edition, pages
2014. no Special Issue, 1-25 p.
distributed systems, network protocols, routing, object mobility, semantics of programming languages
Research subject SRA - ICT
IdentifiersURN: urn:nbn:se:kth:diva-131378DOI: 10.1007/s11761-014-0173-7ScopusID: 2-s2.0-84945480958OAI: oai:DiVA.org:kth-131378DiVA: diva2:655912
FunderEU, FP7, Seventh Framework Programme, 6854
QC 201502092013-10-142013-10-142015-02-09Bibliographically approved