Mobility and Multihoming
Abstract: As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Mobility can be viewed as a special case of multihoming --- as a node moves, it unsubscribes from one network and subscribes to another, which is akin to one interface becoming inactive and another active. The current Internet architecture has been facing significant challenges in effectively dealing with multihoming (and consequently mobility), which has led to the emergence of several custom point-solutions. The Recursive InterNetwork Architecture (RINA) was recently proposed as a cleanslate solution to the current problems of the Internet. In this paper, we present a specification of the process of ROuting in Recursive Architectures (RORA). We also perform an average-case cost analysis to compare the multihoming / mobility support of RINA, against that of other approaches such as LISP and Mobile-IP. Extensive experimental results confirm the premise that the RINA architecture and its RORA routing approach are inherently better suited for supporting mobility and multihoming.
Ishakian, Vatche; Akinwumi, Joseph; Esposito, Flavio; Matta, Ibrahim. On Supporting Mobility and Multihoming in Recursive Internet Architectures, October 15, 2010. [PDF][PS]
Under revision at Elsevier Journal of Computer Communication
Ishakian, Vatche; Akinwumi, Joseph; Matta, Ibrahim. On the Cost of Supporting Mobility and Multihoming. In Proceedings of the IEEE GLOBECOM 2010 Workshop on Network of the Future, Miami, Florida, December 2010. [PDF]
"Networking is IPC"
Abstract: This position paper outlines a new network architecture that is based on the fundamental principle that networking is inter-process communication (IPC). In this model, application processes (APes) communicate via an IPC facility. The IPC processes that make up this facility provide a protocol that implements an IPC mechanism, and a protocol for managing distributed IPC (routing, security and other management tasks). Our architecture is recursive in that the IPC processes can themselves be APes requesting services from lower IPC facilities. We present the repeating patterns and structures in our architecture, and show how the proposed model would cope with the challenges faced by today's Internet (and that of the future).
John Day, Ibrahim Matta, and Karim Mattar ``Networking is IPC": A Guiding Principle to a Better Internet. In Proceedings of ReArch'08 - Re-Architecting the Internet, Madrid, SPAIN, December 2008. Co-located with ACM CoNEXT 2008. [PDF]
Declarative Transport
Abstract: We argue that in a clean-slate architecture, transport state is an integral part of the network state, which includes information for routing, monitoring, resource allocation, etc. Given the myriad of transport policies needed to support advanced functions such as in-network caching, in-network fair allocation, and proxying, these policies should be made programmable. We outline how flexible and generic transport policies can be specified in a declarative language to realize a transport service where distributed transport state is shared and manipulated using recursive queries.
Karim Mattar, Ibrahim Matta, John Day, Vatche Ishakian, and Gonca Gursun. Declarative Transport: A Customizable Transport Service for the Future Internet. In Proceedings of the 5th International Workshop on Networking Meets Databases (NetDB 2009), co-located with SOSP 2009, Big Sky, MT, October 2009. [PDF]