Location-independent routing in process network overlays

详细信息    查看全文

• 作者：Mads Dam ; Karl Palmskog
• 关键词：Network protocols ; Distributed systems ; Routing ; Object mobility
• 刊名：Service Oriented Computing and Applications
• 出版年：2015
• 出版时间：September 2015
• 年：2015
• 卷：9
• 期：3-4
• 页码：285-309
• 全文大小：2,837 KB
• 参考文献：1.Abadi DJ (2009) Data management in the cloud: limitations and opportunities. IEEE Data Eng Bull 32(1):3-2
  2.Arnold K (2000) The Jini specification, 2nd edn. Addison-Wesley Longman, Boston
  3.Awerbuch B, Peleg D (1995) Online tracking of mobile users. J ACM 42(5):1021-058MathSciNet CrossRef
  4.Barham P, Dragovic B, Fraser K, Hand S, Harris T, Ho A, Neugebauer R, Pratt I, Warfield A (2003) Xen and the art of virtualization. In: Proceedings of the 19th ACM symposium on operating systems principles, SOSP -3. ACM, New York, NY, USA, pp 164-77
  5.Bettini L, Bono V, De Nicola R, Ferrari G, Gorla D, Loreti M, Moggi E, Pugliese R, Tuosto E, Venneri B (2003) The Klaim project: theory and practice. In: Priami C (ed) Global computing, programming environments, languages, security, and analysis of systems, Lecture Notes in Computer Science, vol 2874. Springer, Berlin, pp 88-50
  6.Bishop S, Fairbairn M, Norrish M, Sewell P, Smith M, Wansbrough K (2005) Rigorous specification and conformance testing techniques for network protocols, as applied to TCP, UDP, and sockets. In: Proceedings of the 2005 conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM -5. ACM, New York, NY, USA, pp 265-76
  7.Bonwick J (2007) Rampant layering violation? http://?blogs.?oracle.?com/?bonwick/?entry/?rampant_?layering_?violation . Retrieved 18 Feb 2014
  8.Caesar M, Condie T, Kannan J, Lakshminarayanan K, Stoica I (2006) ROFL: routing on flat labels. ACM SIGCOMM Comput Commun Rev 36(4):363-74CrossRef
  9.Cardelli L, Gordon AD (1998) Mobile ambients. In: Nivat M (ed) Foundations of software science and computation structures, Lecture Notes in Computer Science, vol 1378. Springer, Berlin, pp 140-55
  10.Carlsson R (2001) An introduction to Core Erlang. In: Proceedings of the PLI-1 Erlang workshop
  11.Caromel D, Henrio L, Serpette BP (2009) Asynchronous sequential processes. Inf Comput 207(4):459-95MathSciNet CrossRef
  12.Chandra TD, Toueg S (1996) Unreliable failure detectors for reliable distributed systems. J ACM 43(2):225-67MathSciNet CrossRef
  13.Clavel M, Durán F, Eker S, Lincoln P, Martí-Oliet N, Meseguer J, Quesada JF (2002) Maude: specification and programming in rewriting logic. Theor Comput Sci 285(2):187-43CrossRef
  14.Conchon S, Le Fessant F (1999) Jocaml: mobile agents for objective-caml. In: Agent systems and applications, 1999 and third international symposium on mobile agents. Proceedings. First international symposium on, pp 22-9. IEEE
  15.Dam M, Palmskog K (2013) Efficient and fully abstract routing of futures in object network overlays. In: Proceedings of the 2013 workshop on programming based on actors, agents, and decentralized control, AGERE! -3. ACM, New York, NY, USA, pp 49-0
  16.Demmer MJ, Herlihy MP (1998) The arrow distributed directory protocol. In: Kutten S (ed) Distributed computing, Lecture Notes in Computer Science, vol 1499. Springer, Berlin, pp 119-33
  17.Douglis F, Ousterhout J (1991) Transparent process migration: design alternatives and the sprite implementation. Softw Pract Exp 21(8):757-85CrossRef
  18.Field J, Varela CA (2005) Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments. In: Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on principles of programming languages, POPL -5. ACM, New York, NY, USA, pp 195-08
  19.Fournet C, Gonthier G, Levy JJ, Maranget L, Rémy D (1996) A calculus of mobile agents. In: Montanari U, Sassone V (eds) CONCUR -6: concurrency theory, Lecture Notes in Computer Science, vol 1119. Springer, Berlin, pp 406-21
  20.Havelka D, Schulte C, Brand P, Haridi S (2005) Thread-based mobility in Oz. In: Roy P (ed) Multiparadigm programming in Mozart/Oz, Lecture Notes in Computer Science, vol 3389. Springer, Berlin, pp 137-48
  21.Henrio L, Huet F, István Z (2013) Multi-threaded active objects. In: De Nicola R, Julien C (eds) Coordination models and languages, Lecture Notes in Computer Science, vol 7890. Springer, Berlin, pp 90-04
  22.Jacobson V, Smetters DK, Thornton JD, Plass MF, Briggs NH, Braynard RL (2009) Networking named content. In: Proceedings of the 5th international conference on emerging networking experiments and technologies, CoNEXT -9. ACM, New York, NY, USA, pp 1-2
  23.Jeffrey A, Rathke J (2005) Contextual equivalence for higher-order pi-calculus revisited. Log Methods Comput Sci 1(1), paper 4. doi:10.-168/?LMCS-1(1:-)2005
  24.Jennings B, Stadler R (2014) Resource management in clouds: survey and research challenges. J Netw Syst Manag 1-3. doi:10.-007/?s10922-014-9307-7
  25.Johnsen EB, H?hnle R, Sch?fer J, Schlatte R, Steffen M (2012) ABS: a core language for abstract behavioral specification. In: Aichernig BK, de Boer FS, Bonsangue MM (eds) Formal methods for components and objects, Lecture Notes in Computer Science, vol 6957. Springer, Berlin, pp 142-64
  26.Johnsen EB, Owe
• 作者单位：Mads Dam (1)
  Karl Palmskog (1)
  
  1. School of Computer Science and Communication, KTH Royal Institute of Technology, Lindstedtsv?gen 3, 100 44, Stockholm, Sweden
  
• 刊物类别：Computer Science
• 刊物主题：Computer Systems Organization and Communication Networks
  Software Engineering, Programming and Operating Systems
  Electronic Commerce and eBusiness
  Computer Applications in Administrative Data Processing
  Management of Computing and Information Systems
  Business Information Systems
  
• 出版者：Springer London
• ISSN：1863-2394

文摘

In distributed computing, location transparency—the decoupling of objects from their physical location—is desirable in that it can simplify application development and enables efficient resource allocation. Many systems for location transparency are built on TCP/IP. We argue that addressing mobile objects in terms of temporary hosts may not be the best design decision. Object migration makes it necessary to use dedicated routing infrastructures, e.g., location servers, to deliver inter-object messages. This incurs high costs in terms of complexity, overhead, and latency. Here, we defer object overlay routing to a networking layer, by replacing TCP/IP with a location-independent routing scheme which directs messages to destinations determined by flat identifiers instead of IP addresses. Consequently, messages are delivered directly to objects, instead of possibly out-of-date locations. We explore the scheme using a small object-based language with asynchronous message passing, similar to Core Erlang. We provide a standard, network-oblivious operational semantics of this language, and a network-aware semantics which accounts for many aspects of distribution and routing. The main result is that program execution on top of an abstract network of processing nodes connected by asynchronous point-to-point communication channels preserves 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 for fully connected TCP underlays, where contextual equivalence is typically too strong, due to the need for locking to resolve preemption arising from mobility. Keywords Network protocols Distributed systems Routing Object mobility