A Tetherless Computing Architecture Darcy Kroeker S Keshav

A Tetherless Computing Architecture Darcy Kroeker S. Keshav 1

Background – Routing in Time-Varying Networks A n n n B This network is partitioned into disconnected components Routing from A to B is impossible But… routing from A toward B is possible when components collide … even if A and B are never connected So… make sure the components collide once in a while This requires a store-and-forward delivery mechanism similar to mail and e-mail. 2

Where Is This Important? Mars Satellite Mars Rover Mars Base Station Earth Satellite Earth Base Station 3

Where Is This Important? Developing Regions Challenges: n Infrastructure is unreliable (eg. electricity, connectivity) n Communication and access to Internet is poor in rural areas n Costs must be very low to be affordable Idea: n Use buses as “data mules” to ferry data between disconnected networks n Data hops on the bus, hops off again closer to destination n We trade communication response time for low cost, by using mechanical backhaul (bus) for remote links Key Applications n E-mail with attachments n Offline web browsing 4

DTN – Remaining Problems DTNRG goes a long way toward a solution, but from our perspective there a few remaining problems: Node Mobility n Nodes drop out and re-appear in a different place in the network! n How to notify other nodes of the new location? n How to re-direct any bundles already in transit to the old location? Routing n DTN reference implementation includes three routing algorithms: q Static: uses static (manually configured) routing tables q Flood q Link State n We need a dynamic routing protocol that supports a high degree of node mobility. Our Tetherless Computing Architecture (TCA) addresses these problems 5

TCA Overview Node Types n All nodes run the TCA Protocol n There are three types of nodes: q Mobile: a leaf node (an end-user device typically, such as a phone, laptop, or PC) q Router: forwards data between nodes q Gateway: a special type of Router with a permanent connection to Internet Phone (Mobile) Village Kiosk (Router) Bus Terminal (Gateway) 6

TCA Overview Regions n A collections of nodes sharing a single gateway forms a Region n A Region is a disconnected network in general Region Phone (Mobile) Village Kiosk (Router) Bus Terminal (Gateway) 7

TCA Overview A Higher-Level View : Many Regions n Unlike Regions, the Internet is usually available and connected n Gateways are the points at which the Regions connect to the Internet n A Region is associated with the gateway that serves it n TCA uses the Internet to host a Registry containing the current location (Region) of each node Internet Region A Gateway A Registry Gateway C Gateway B Region C Region B 8

TCA Protocol Stack The TCA Protocols deal with: n Registering a mobile node in the network n Routing bundles addressed to a mobile node n Route discovery TCA Protocol Implementation: n Mostly implemented at the Application Layer n Uses the services of the DTN Bundle Layer TCA Application Layer Bundle Layer DTN Convergence Layer TCP UDP … Before discussing the protocols, some background on naming and addressing…. 9

TCA Naming and Addressing Naming in DTN n The naming scheme in DTN is borrowed from existing Internet standards n Names are URIs, of the form <scheme name>: <scheme-specific part, or ssp> n The <scheme name> specifies the format and meaning of the <ssp> n Each “endpoint” in DTN (an application-level source or sink of bundles) has a URI “Endpoint ID” Example: dtn: //blackice. uwaterloo. ca Naming in TCA defines a custom scheme named “tca” n TCA Endpoint ID’s are of the form: tca: //<host>/<app> where q <host> is a GUID (globally unique identifier) of the node (analogous to <ip address> in TCP) q <app> is the identifier of an application on that node (analogous to <port> in TCP) Example: tca: //blackice/app These names are just identifiers, not sufficient information to actually contact a node. 10

TCA Naming and Addressing Contd. Addresses n In addition to its name, each node has an address at which it may be contacted n This address is tied to a particular convergence layer (eg. tcp) n This address is again expressed as a URI: Example: tcp: //5. 6. 7. 8: 5000 A route (or a single hop thereof) can be expressed as a mapping from name to address name For example: tca: //blackice/app address tcp: //5. 6. 7. 8: 5000 means: to send a bundle to the endpoint named tca: //blackice/app, send it using the tcp concvergence layer, to the TCP/IP address 5. 6. 7. 8 port 5000. Unlike in TCP/IP, in TCA it is not necessary (or even useful) for addresses to be known globally. Only a node’s nearest neighbors – its direct contacts – need to know its address. 11

TCA Late-Bound Bundles Example: hail sends bundle to blackice n bundle is forwarded up the default route to hail’s gateway n hail’s gateway looks up blackice’s gateway in the Registry and send bundle n blackice’s gateway forwards the bundle to blackice along known route tca: //blackice > 1. 2. 3. 4: 5 Internet Region A tca: //windstorm tca: //blackice tca: //gwa addr: 1. 2. 3. 4: 5 Registry tca: //gwc Tca: //gwb Region B Region C tca: //hurricane tca: //hail 12

TCA Late-Bound Bundles Contd. Details: n n Each node knows the address of the next hop router toward its gateway. This is its default route used for all bundles addressed to unknown endpoints. This enables routing from hail in Region C toward gateway C. Each node knows the address of the previous hop router toward any router that has previously registered with it. (registration to be discussed later). This enables routing from gateway A to blackice in region A, assuming blackice has previously registered in region A. Implementation Notes: n The Registry is implemented as a Distributed Hash Table (using Open. DHT). n The Registry contains the SHA 1 hash of an endpoint id, not the endpoint id itself. 13

TCA Registration Example: blackice registers n blackice sends a special registration bundle up the default route n the “reverse path” is constructed along the way n gateway updates the Registry with blackice’s new location n if a previous registration for blackice existed, gateway initiates a change-of-address Internet Region A tca: //blackice > 1. 2. 3. 4: 5 tca: //windstorm tca: //blackice tca: //gwa addr: 1. 2. 3. 4: 5 Registry tca: //gwc tca: //gwb Region B Region C tca: //hurricane tca: //hail 14

TCA Registration Contd. Details: n The register bundle is forwarded up the default route. n Each node along the way modifies the register bundle, adding its address as last_hop n Each node along the way adds the route back to the mobile to its routing table, using the last_hop address n Gateway C checks the Registry to see if blackice has previously registered in a different region, deleting the previous entry if any. n In either case, Gateway C adds the new Registry entry for blackice, specifying its own address as blackice’s gateway. n If blackice had previously registered in another region, Region B, Gateway C sends a “change of address” bundle (COA) to Gateway B. n Gateway B forwards the COA toward blackice’s previous location using the reverse path. n At each hop along the reverse path, the node destroys its route table entry for blackice after forwarding the COA. Implementation Notes: n No race condition! If a bundle is in-flight to a route undergoing destruction, it becomes a regular unbound bundle at some point. Thereafter, the right thing happens. n Registration bundles are sent to the special endpoint id tca: //registry 15

TCA Route Discovery Motive n Most infrastructure nodes (“permanent” Routers and Gateways) will have their route tables configured manually on setup. n Mobiles (and perhaps some Routers) need to choose routes dynamically, based on their current location Details n Similar to DHCP n Node A detects a new link. eg. potential neighbour node B at tcp: //5. 6. 7. 8: 5000 n Node A probes the DTN port on this link by sending an ASK bundle n If B is a TCA router, it responds with an ADV bundle n ADV contains B’s eid, and the eid of its reachable gateway n In future, ADV could contain additional info (link schedule, capacity, etc. ) n Node A can now decide whether to add a permanent route to B n … and if so, whether to make this route its default route. 16

TCA Protocol Implementation n n TCA Control logic is implemented outside DTN for greater separation of concerns TCA Controller runs as an ordinary DTN client application All Control messages are sent as bundles through the ordinary DTN API Inter-Node Control bundles are sent to the eid of the destination Controller Inter-Layer Control bundles are sent to a special eid tca: //localhost/bundlelayer TCA Controller TCA DTN TCA Controller Bundle Layer Convergence Layer register(eid) TCP mobile … TCP register(eid) … router TCP register(eid) … gateway 17

TCA Control Bundles Cross-Calls (Inter-Node) src = tca: //<host_eid>/admin dest = tca: //<host_eid>/admin register(mobile_eid, link_spec) coa(mobile_eid, gateway_link_spec) ask(link_spec) adv(link_spec, adv_str) Down-Calls (Inter-Layer) src = tca: //<host_eid>/admin dest = tca: //localhost/bundlelayer add_route(pattern, link_spec) del_routes(pattern) get_routes(pattern) Up-Calls (Inter-Layer) src = tca: //localhost/bundlelayer dest = tca: //<host_eid>/admin ask_sent adv_sent coa_sent contact_down contact_up link_available link_unavailable reg_received(mobile_eid, link_spec) routes(route_list) unb_received(eid) Complete Control API documentation: http: //www. mindstream. watsmore. net/wiki/index. php? title=TCA_Source 18

ASK Protocol – Sequence Diagram 19

REGISTER Protocol – Sequence Diagram 20

TCA Design Controversy Layering TCA Control over Bundle Layer n Q: Is it the “right” separation of concerns? n Q: What functionality belongs in each layer? n Q: One process or two? n Q: Even if “right”, is it worth the trouble? n A: No clear answer. Similar to question of which parts of a protocol stack belong in kernel, and which in user-level code. Inter-Layer Communication as Bundles n Q: Is this a good idea? n A: Similar to the question of control-over-data channel versus separate control channel. We have opted for control-over-data channel. 21

Future Work n n We have a concrete application driving all future work: Government services offered through kiosks in rural India Plan to use a bus and kiosk network, running TCA protocols Topics of Current Research n Mutual Authentication (Bus-Kiosk, Kiosk-User) n More advanced routing protocols using multiple routes: q Multiple buses with different schedules, destinations, gateways n Flow control – utilizing finite bus capacity: q Maximize fairness q Maximize throughput n Mixed-media communications q Cheap, high-capacity bus (but slow!) q Expensive, low-capacity cell network (but always available!) q OCMP uses policy definitions to send data using most suitable medium 22

Conclusion 1. TCA solves two of the problems with DTN: n Node mobility n Routing in a changing network 2. The Control API provides an extension point for future work 3. We hope our approach has applications of social importance in developing regions 23