BANANAS

Abstract

Today the Internet offers a single path between end-systems even though it intrinsically has a large multiplicity of paths. This paper proposes an evolutionary architectural framework "BANANAS" aimed at simplifying the introduction of multipath routing in the Internet. The framework starts with the observation that a path can be encoded as a short hash ("PathID") of a sequence of globally known identifiers. The PathID therefore has global significance (unlike MPLS or ATM labels). This property allows multipath capable nodes to autonomously compute PathIDs in a partially upgraded network without requiring an explicit signaling protocol for path setup. We show that this framework allows the introduction of sophisticated explicit routing and multipath capabilities within the context of widely deployed connectionless routing protocols (e.g. OSPF, IS-IS, BGP) or overlay networks. We establish these characteristics through the development of PathID encoding and route-computation schemes. The BANANAS framework also allows considerable flexibility in terms of architectural function placement and complexity management. To illustrate this feature, we develop an efficient variable-length hashing scheme that moves control-plane complexity and state over-heads to network edges, allowing a very simple interior node design. All the schemes have been evaluated using both sizable SSFNet simulations and Linux/Zebra implementation evaluated on Utah's Emulab testbed facility.