Protocol for Tetherless Computing

Size: px
Start display at page:

Download "Protocol for Tetherless Computing"

Transcription

1 Protocol for Tetherless Computing S. Keshav P. Darragh A. Seth S. Fung School of Computer Science University of Waterloo Waterloo, Canada, N2L 3G1 1. Introduction Tetherless computing involves asynchronous messaging between mobile endpoints and back-end centralized servers in environments where connectivity is intermittent and data propogation is delay-prone [1]. To enable this type of communication, the system must attain the following goals: 1. Mobility transparency 2. Disconnection transparency 3. Low control overhead 4. Identity management 5. Support for legacy applications [1] This document outlines the end-to-end protocol between the various entities in the tetherless computing architecture (TCA), which together allow secure communication in complex environments, while achieving the requirements listed above. The main agents in this protocol are the mobile endpoint, the access-point interface, mobile contacts, DHT nodes, i3 servers, and DTN nodes. 2.Acronyms APS (Access-point Server ) CM (Connection Manager) DTN (Delay Tolerant Networking) DHT (Distributed Hash Table) DHT-AM (DHT Addressing Manager) This server runs at the access-point. It provides an authentification service controls access of the network by mobile endpoints. It also maintains a list of local DTN nodes and/or i3 servers that it propagates to connecting endpoints. This module runs on the mobile endpoint, and handles many functions related the connected state of that endpoint and its location. An infrastructure which allows for robust, asynchronous messaging between endpoints in a delay-prone networking environment [2]. A decentralized mechanism for associating keys with values and allowing remotely-initiated queries [4]. This module acts as an interface between DTN and the DHT. Specifically, it resolves an address for the DTN layer by querying the DHT.

2 DTN-MM (DTN Mobility Manager) i3 (Internet Indirection Infrastructure) IDM ( Identity Manager) CL (Client Library) This module deals with inserting keys into the i3 overlay and ensuring that bundles are transferred from the incumbent custody DTN node. An infrastructure that provides mobile transparency for communicating endpoints in the Internet [3]. This module runs on the mobile endpoint. It communicates with the APS to provide secure access to networks. This library will provide application-level functionality. For example, it allows the client to handle registering for bundle delivery with the custody DTN node and receiving those bundles for reassembly. 3. Definitions An arbitrary collection of DTN nodes defined for administrative purposes. The Region identifier of any endpoint belonging to a region must be resolvable by any routing DTN node within that region [2]. Near Mobility This occurs when a mobile endpoint moves within a near area [1]. Far Mobility This occurs when a mobile endpoint moves from one near area to another [1]. Near Area The set of wireless APs which are closer to a given DTN router than any other DTN router [1]. Deep Region A region which is more than one disconnected hop from the Internet [1]. 3. Services 3.1 Description of Parameters GUID (Globally Unique Identifier) DTN tuple DTN address i3 server address Contact ID DTN Node ID DTN Region ID Each endpoint is assigned a globally unique ID. The formatted string used by DTN to address communication endpoints in the network. Includes information about region id, administrative id of the endpoint, interface, and more. The IP and port of the DTN node (the bundledaemon in particular. The IP and port of the i3 server. A globally unique identifier for a particular contact. An identifier for a DTN node that is unique within the region in which the node resides. A globally unique identifier for a particular region. 3.2 General Description of Scenarios There are two categories of scenarios for tetherless computing presented here. Mobile endpoints in the first set of scenarios are no more than one disconnected hop from the Internet. This means that any accesspoint to which an endpoint connects allows the

3 endpoint direct access to the Internet. These scenarios should cover the most prevalent use cases of tetherless computing. In the second set of scenarios, endpoints can be more than one disconnected hop from the Internet. Thus, they can connect to accesspoints, DTN nodes, and contacts which are themselves disconnected from the Internet. These scenarios are most likely to occur in rural areas where buses and planes act as mobile links within different deep regions. 4. Endpoints One Disconnected Hop From the Internet Fig. 4: TCA (DTN/I3) Network Topology The scenarios in this section cover the most common uses of tetherless computing architecture because they assume that the mobile endpoints in the system are no more than one disconnected hop from the Internet. As described earlier, this means that any access-point to which an endpoint can connect has direct access to the Internet, as shown in Figure 4 [1]. An integration of DTN and i3 is used to enable these scenarios. 4.1 Endpoint gains access to a network via an interface After the endpoint has selected an interface, it must scan for a signal from networks supporting that interface. In the case that there are multiple sources of signals, the endpoint must choose the optimal network to which it should connect. Having selected a

4 particular network, the endpoint must gain secure access to the services provided by the network. To this end, the endpoint and the network access-point must be able to identify each other and apply that identity against their respective trust model and access rules. Here are the general steps for gaining access to a network: The CM selects a network interface The CM detects signals from networks supporting that interface, compiles a list of reachable networks and their respective signal strength, traffic load, etc CM chooses a network according to rules that take into account the endpoint's trust model, the signal strength, the network load data, billing, etc The IDM authenticates the network and replies with the endpoint's identity for authorization The APS confirms that access is granted to the endpoint and responds with a list of DTN and i3 servers (see Section 4.2). Here are the specific parameters passed between entities: Authentification (security) IDM APS Confirmation (security) APS IDM Table 1: Parameters for authentification between the network provider and the mobile endpoint. 4.2 Endpoint registers with custodian DTN node and i3 Once the endpoint has been authorized to access the network and determines that it trusts the provider, it must choose a custody DTN node and register that node with the i3 overlay. The accesspoint is aware of DTN nodes and i3 servers in its vicinity, as well as maintaining relevant stats on those hosts to allow the endpoint to make an optimal choice. Here are the general steps that allow the endpoint to choose its custody node and relaying that information to the i3 overlay: The APS transmits to the end-point a list of neighboring DTN and i3 server nodes, with their respective traffic load. This list is piggybacked on the confirmation of access to the network The CM chooses a DTN custody node based on the data provided by the APS. The IDM informs the CL of this choice The CL layer registers itself with the DTN node and prepares to accept bundles (see Section 4.3) The DTN-MM inserts the GUID of the endpoint as a public trigger into i3 with the address of the custody DTN node.

5 Here are the specific parameters passed between entities: DTN, i3 Server List <num nodes><dtn address><traffic measure>.. <num servers><i3 server address><traffic measure> APS IDM -> CM DTN Registration (security), DTN tuple CL DTN Register Trigger GUID, DTN address CM i3 server Table 2: Parameters for endpoint choosing DTN and i3 server. 4.3 Endpoint receives bundles from its custody DTN node There are two options available for the endpoint to receive bundles buffered at its custody DTN node. The first involves periodically polling the node for bundles. The DTN node buffers bundles until such a request comes from the client. This can be used when the endpoint wants to marshall its resources (eg: it is periodically in low-power mode). The other way the endpoint can have bundles delivered is to maintain a persistent connection with the DTN node while there is connectivity. This way, whenever the DTN node receives a bundle or has bundles buffered, it simply places it on this connection. Whenever the connection is not in place, the DTN node assumes the endpoint is disconnected and buffers any bundles addressed to that endpoint it receives. ISSUE: It is important that the DTN node can correctly verify the identity of the endpoint, and the endpoint can determine whether to trust the node (security). Here are the specific parameters passed between the endpoint and the DTN node. In both cases outlined above, the protocol is the same. The only difference is that for polling, the endpoint explicitly closes the connection. Bundle Request (security), DTN tuple CL DTN Bundle Delivery <num bundles> <bundle size> <bundle> DTN CL Table 3: Parameters for endpoint to receive bundles from custody DNT node. 4.4 Endpoint changes its current custody DTN node This scenario is most likely to occur when the endpoint engages in far mobility. That is, the endpoint regains connectivity and determines that the distance from its custody DTN node is causing inefficiencies for receiving bundles. For example, when connected the endpoint may monitor the RTT of packets sent to its custody DTN node, and when this value exceeds some threshold, it may choose to switch custody nodes. Besides proximity, the endpoint could choose to move to a new custody DTN node for a variety of other reasons, including load balancing, node failure, or network partition. In

6 all these cases, the protocol is as described below: The endpoint gains authorization to a network, as described in Section The endpoint then selects a new custody DTN node and updates the GUID entry in i3 as described in Section The CM notifies the DTN-MM of the former custody DTN node of the change in custody The DTN-MM at the former custody DTN node(s) re-sends undelivered bundles to the GUID of the endpoint via i The endpoint polls its new custody DTN node for bundles, as described in Section 4.3. Here are the specific parameters passed between entities notifying the former custody node; otherwise, the protocol follows the referenced sections. Custody Change Notification DTN tuple, DTN address CM DTN-MM Table 4: Parameters for endpoint to notify its former custody DTN node of its migration. 4.5 Endpoint achieves connectivity and stays with current custody DTN node When the endpoint regains connectivity in close proximity to its current custody DTN node, it may choose not to switch DTN nodes. In this case, it must simply resume polling its custody node, as described in Section Endpoint sends to a mobile endpoint Because all endpoints are at most one hop away from the Internet, it is possible to use i3, a network overlay that affords mobility transparency by allowing the sender endpoint to address bundles to a constant GUID assigned to the receiver. This section describes the protocol that allows i3 to route the bundles from the sender to the custody DTN node of the receiver endpoint After resolving the receiver's name to its GUID, the sender endpoint addresses the bundles with the DTN tuple bundles://internet/tcp://<guid>.i3:5000/<guid> and sends them using the CL interface Upon receiving the bundles from the i3 overlay, the receiver's custody DTN node attempts to deliver the bundles to the connection maintained by the endpoint ( as described in Section 4.3). If no connection to the endpoint exists, the DTN node buffers the bundles until the receiver reconnects or the DTN-MM receives a custody change notification.

7 4.7 Endpoint polls for list of DTN nodes and i3 servers The endpoint may choose while connected to move to a new custody DTN node. This could occur for a variety of reasons, including load balancing, node failure, or network partition. In order to choose a new node, the endpoint needs to poll the APS for a list of neighboring DTN and i3 nodes. The protocol is described below: The CM contacts the APS with a request for the current list of neighboring DTN and i3 nodes The APS transmits a list of neighboring DTN and i3 server nodes, with their respective traffic load. Here are the parameters involved in the communication: DTN, i3 Server Query (security) CM APS DTN, i3 Server List <num nodes><dtn address><traffic measure>.. <num servers><i3 server address><traffic measure> APS CM Table 5: Parameters for endpoint to poll for local DTN and i3 server information. ISSUE: What is the protocol by which DTN and i3 servers coming online register themselves with local APs? How does the AP detect when these nodes go down? 5. Entities More Than One Disconnected Hop From the Internet In these less common scenarios, mobile endpoints can be more than one disconnected hop from the Internet. Thus, they can connect to access-points, DTN nodes, and contacts that are themselves not directly connected to the Internet. A combination of DTN and DHT technologies is used to enable these scenarios. 5.1 Endpoint gains direct connectivity to a network via an interface This scenario is identical to the process described in Section 4.1 since the actual protocol between the endpoint and the network provider is not affected by the increase in hops between the APS and the Internet region. 5.2 Endpoint selects a custodian DTN node and registers with the DHT Similar to Section 4.2, this scenario involves the endpoint establishing itself within the framework of the architecture; however in this case, the endpoint interacts with a DHT rather than the i3 overlay, and more importantly, the custody DTN node may only be reachable via a mobile contact, which runs the APS.

8 Here are the steps involved for this scenario: The APS transmits a list of neighboring DTN nodes, with their respective traffic load (this information is piggybacked on the confirmation of access to the network). In the case that the APS is running on a mobile contact, then the DTN nodes on the list are only those reachable by the mobile contact. Also, the mobile contact will indicate its flight path and the GPS location and RTT for each DTN node The CM chooses a DTN custody node based on the data provided by the APS. The IDM informs the CL of this choice The CL registers with its custody DTN node (see Section 5.3) The CM updates the routing information for the endpoint in the system (see Section 5.4). Here are the specific parameters passed between entities: DTN Server List <num nodes><dtn Node Id><traffic measure><gps location><round trip time>.. <contact flight path info> APS IDM -> CM Table 6: Parameters for endpoint to select custody DTN node. 5.3 Endpoint selects custodian DTN node This scenario involves the endpoint notifying its custody DTN node to buffer bundles addressed to it. Since the endpoint may be in a disconnected environment, it may not be able to communicate directly with its custody DTN node to register. In this case, the mobile contact with which the endpoint gaining access to the network couriers both the registration data to the DTN node and possibly the bundles being delivered from the DTN node to the endpoint. Thus, when registering itself with the custody node, the endpoint needs to indicate that it is reachable via that mobile contact. Below are the parameters between the endpoint and the mobile contact. The mobile contact then passes this information on to the custody DTN node in the format shown in Table 8 below. Proxy DTN Registration (security), DTN Node ID, DTN tuple, contact ID CL Mobile Contact -> Custody DTN Node Table 7: Parameters for the endpoint to register with the custody DTN node by proxy through the mobile contact. If the endpoint can directly reach its custody DTN node via the access-point, then the registration is similar to that described in Section 4.2. The exception is the contact ID communicated to the DTN node indicates that the endpoint is directly reachable (ie, there is no intermediary mobile contact). The parameters are below:

9 DTN Registration (security), DTN tuple, contact ID CL DTN Table 8: Parameters for registering an endpoint with its custody DTN node. 5.4 Endpoint updates its routing information The prevalence of deep regions in these scenarios complicates the routing information required to locate an endpoint. This occurs because an endpoint cannot be located by just its GUID alone; the DTN routing algorithm requires the endpoint's current region as well. Thus, the endpoint needs to notify not only the regional gateways of its residency in their region, but also the global DHT of what region it is in. If the endpoint is in a deep region then here are the steps: The CM transmits to the mobile contact a control bundle which is meant to notify all the custodians to update their local lookup tables The mobile contact and the selected custodians participate in a group communication protocol during which all the custodians get updated When the previous step terminates, a chosen custodian in each region participates in a group communication protocol with all the DTN gateways in the region, or a centralized DHT to update all the regional route tables When the previous step terminates, one of the chosen DTN gateways updates the Internet region s DHT, and supplies information about the region in which the endpoint GUID is located, as well as callback information for the endpoint s DTN custody node Next, a DTN gateway in the Internet region participates in a group communication protocol with the set of gateways in the mobile s old region to update their regional mappings for deleting the route outdated entries for the mobile When the previous step terminates, the gateway reliably multicasts an update to all the custodians in the old region. The custodian send any stored bundles to the mobile in the new region by rewriting the bundles destination address as unknown and forwarding them on its default route. Here are the contents of the control bundles Region Routing Control Bundle GUID, DTN Node ID CM Mobile Contact -> Regional Gateways DHT Control Bundle GUID, DTN Region ID, DTN Node ID CM Mobile Contact -> Regional Gateway for Routing to Internet Table 9: Contents of control bundles for updating router information of an endpoint entering new near region. If the endpoint can connect directly to a DTN node (ie, it is not in a disconnected region),

10 then it transmits these bundles itself directly to a DTN router, bypassing the need for a mobile contact. 5.5 Endpoint moves from one deep region to another If the endpoint moves from one region to another, then there are two processes that must occur. The endpoint must update its routing information, and its former custody DTN node must be notified so that it can pass on any buffered bundles for the endpoint to the new custody DTN node. The steps in Section 5.4 describe the required actions to be performed. 5.6 Endpoint changes DTN custody nodes in same near region This is the degenerate case that mirrors the scenario described in Section 4.4, in which there is only one region: the Internet. Since the endpoint has not moved regions, it must simply update the local routing information. Also, the former custody node must be notified so that any buffered bundles are passed on to the new custody node. Here are the steps involved: The CM transmits to the mobile contact a control bundle which is meant to notify all the custodians to update their local lookup tables The mobile contact and the selected custodians participate in a group communication protocol during which all the custodians get updated When the previous step terminates, a chosen custodian in each region participates in a group communication protocol with all the DTN gateways in the region, or a centralized DHT to update all the regional route tables When the previous step terminates, the custodian reliably multicasts an update to all the old custodians. These old custodians send any stored bundles to the mobile according to its new route mappings. Here are the contents of the control bundles: Callback Control DTN tuple (endpoint), DTN tuple CM Mobile Contact -> Bundle (new custody node) DTN DHT Update Control GUID, DTN node ID CM Mobile Contact -> Bundle Regional Gateway for Routing to Internet Table 10: Contents of control bundles for updating router and custody information of endpoint engaging in near mobility. 5.7 Endpoint resolves address of mobile endpoint This scenario involves an endpoint wishing to know the location of mobile endpoint, in order to address bundles to that endpoint.

11 5.7.1 The DHT-AM transmits a bundle which queries the DHT for the address of the receiver endpoint The DHT looks up the given GUID and responds with a control bundle containing the region information of the endpoint in question. Here are the contents of these control bundles: DTH Look-Up GUID (query), GUID (sender) DHT-AM DHT Control Bundle DHT Response Control Bundle GUID, DTN Region ID DHT DHT-AM Table 11: Contents of control bundles for querying a GUID in global DHT. 5.8 Endpoint in deep region sends to endpoint in different deep region The endpoint has two methods by which it can address bundles to a mobile receiver in a particular region. It can either perform the resolution of the receiver's DHT itself, or it can allow the DTN Internet gateways to perform the resolution. These two options are described in detail below Endpoint manually resolves GUID of receiver endpoint In this case, the sender has previously cached the location of the receiver and has reason to believe it is up-to-date, or the sender may have a scheme by which it periodically polls the DHT for the receiver's current region. In any case, here are the steps involved: The sender looks up the current region of the receiver, as described in Section The sender addresses the bundles with the following format: bundles://<receiverregionid>//<receiverguid>:5000/<receiverguid>. The sender then transmits them through DTN (potentially via a mobile contact) Endpoint does not resolve GUID of receiver endpoint To avoid having to resolve the GUID of the receiver, the sender endpoint can take advantage of default routing. Initially, the sender simply guesses that the receiver is in its own region, and addresses the bundles accordingly. When a DTN gateway in the sender's region receives the bundles, it will fail to find the receiver's GUID in its routing table. As a result, it will replace the DTN Region ID field in the DTN tuple of the bundles with a flag that indicates that the region of the receiver should be resolved in the global DHT in the Internet by a DTN gateway in that region. The full sequence in this process is described below: The sender addresses the bundles with the following format: bundles://<senderregionid>//<receiverguid>:5000/<receiverguid>. It then

12 transmits them through DTN (potentially via a mobile contact) The bundles first reach the DTN regional gateway of the sender's region. Since the receiver endpoint is not in that region, the gateway cannot resolve the GUID to a custody DTN node. Thus, it replaces the DTN tuple of each bundle with the tuple: bundles://<receiverguid>//<receiverguid>:5000/<receiverguid>. The gateway then forwards the bundles on a path toward the Internet region Each subsequent DTN gateway router along the way to the Internet fails in its attempt to resolve the region <receiverguid>, and continue to forward the bundles towards the Internet When a DTN gateway bordering on the Internet region receives the bundles, it recognizes that <receiverguid> as a flag. It resolves the receiver's GUID, as described in Section The gateway updates the DTN tuple of the bundles with the following format: bundles://<receiverregionid>//<receiverguid>:5000/<receiverguid> The DTN gateway then routes the bundles towards the receiver's region. 5.9 Endpoint in deep region sends to Receiver in same deep region This scenario is the degenerate case where the sender and receiver endpoints are in the same region, as in Scenario 4.6. The sender may or may not have previously resolved the address of the receiver, but in any case, the steps are the same: (optional) The sender resolves the address of the receiver endpoint, as in Section The sender addresses the bundles with the following format: bundles://<senderregionid>//<receiverguid>:5000/<receiverguid>. It then transmits them through DTN (potentially via a mobile contact) The bundles reach the DTN gateway of the sender's region. Since the receiver endpoint is in that region, the gateway resolves the receiver's GUID to a particular DTN node ID in the region The DTN gateway routes the bundles to that DTN node in the region Endpoint receives bundles from its custody DTN node Since the endpoint may or may not be able to directly connect to its custody DTN node, then there are two cases to consider. If the endpoint can connect directly to the DTN node, then its contact ID registered with the DTN node indicates so. Thus, when the custody DTN node receives bundles for the endpoint, it will recognize that it should wait for the endpoint to actively retrieve the bundles according to the steps described in Section 4.3. Otherwise, the contact ID for the endpoint will indicate the mobile contact by which it is reachable. When the custody DTN node receives bundles for the endpoint, it transmits them to the mobile contact for delivery. In the case that there are multiple contacts for a single endpoint, then the DTN node must optimally route the data based on its knowledge of the contacts involved, using an unspecified DTN routing algorithm. The steps below

13 describe this process: When the mobile contact comes within range, the DTN node transmits any bundles destined for endpoints reachable by that contact When within range of the mobile contact, the endpoint contacts the APS of the mobile contact, and accesses the network, as described in Section The endpoint queries the mobile contact for bundles addressed to it The mobile contact delivers all bundles addressed to the endpoint, terminates the connection, and replies to the custody DTN node with the state of the delivery. The parameters involved in the interactions are described below: Proxy Bundle (security), <num bundles>, <bundle size> DTN Mobile Contact Delivery <bundle> DTN Bundle Request (security), DTN tuple CL Mobile Contact DTN Bundle Delivery <num bundles>, <bundle size> <bundle> Mobile Contact DTN CL Table 12: Parameters for endpoint to receive bundles from custody DTN node by proxy through a mobile contact. 5.11The endpoint polls for a list of neighboring DTN nodes This scenario is analogous to that described in Section 4.7, except now the endpoint could be located in a deep region and be communicating with a mobile contact. Otherwise, the reason for the endpoint choosing to move to a new custody DTN node are much the same as those described in that section, namely load balancing, node failure, or contact failure. In order to choose a new node, the endpoint needs to poll the APS for a list of neighbouring DTN nodes. The protocol is described below: The CM contacts the APS with a request for the current list of neighboring DTN nodes The APS transmits a list of neighboring DTN nodes, with their respective traffic load. If the APS in on a mobile contact, then the contact's flight path and the GPS location and RTT for each DTN node will also be passed on. Here are the specific parameters for this communication: DTN Node Query (security) CM APS DTN Node List <num nodes><dtn Node Id><traffic measure><gps location><round trip time>.. <contact flight path info> APS CM Table 13: Parameters for endpoint to query APS for information on local DTN nodes.

14 6. Description of Data Maintained By Modules This section describes what data must be maintained by the various modules in the architecture. Just as the scenarios are divided into two categories, so too is this section because the modules are different depending on how many hops the endpoint is from the internet. 6.1 Endpoints One Disconnected Hop From the Internet The table in this section describes the data maintained by modules referenced in Section 4, where mobile endpoints in the system were assumed to be no more than one disconnected hop from the Internet. As described earlier, this means that any access-point to which an endpoint can connect has direct access to the Internet. Module CM APS DTN node i3 Data -address, proximity, and traffic load of current custody DTN node -address, proximity, and traffic load of i3 server entry point -map of local DTN addresses to associated traffic load data -map of local i3 addresses to associated traffic load data -identity management data for endpoints currently authorized to access network -security data that allows APS to grant access to network -list of registered endpoints -map of GUID trigger to associated DTN tuple of custody DTN node for the endpoint 6.2 Entities More Than One Disconnected Hop From the Internet The table in this section describes the data maintained by modules referenced in Section 5, where entities were more than one disconnected hop from the Internet. In other words, endpoints can connect to access-points, DTN nodes, and contacts that are themselves not directly connected to the Internet. CM APS Module Data -DTN Node ID, GPS coordinates, round trip time, and traffic load of current custody DTN node -map of known Contacts ID to associated flight paths -address of global DHT entry point -map of local DTN Node IDs to associated GPS coordinates, round trip time, and traffic load data -Contact ID where APS resides

15 Module Data -identity management data for endpoints currently authorized to access network -security data that allows APS to grant access to network -(optional) bundles intended for delivery to endpoints reachable from mobile contact DTN node -list of registered endpoints Local DHT/regional -map of GUID to associated DTN node ID of custody DTN node of DTN gateways endpoint Global DHT -map of GUID to associated DTN Region ID of endpoint 7. Open Issues Section , 4.4, 4.6, , 5.5, 5.6 Issue It is important that the DTN node can correctly verify the identity of the endpoint, and the endpoint can determine whether to trust the node (security). What is the protocol by which DTN and i3 servers coming online register themselves with local APs? How does the AP detect when these nodes go down? There are changes required of DTN, namely the functionality of the DTN-MM and the DHT-AM. There are changes required of the DHT, namely the callbacks for changes in key values. 7. References [1] A. Seth, et al. An Architecture for Tetherless Computing, Proc. Of InfoCOM, March [2] Kevin Fall. A Delay-Tolerant Network for Challenged Internets, Proc. Of SIGCOMM, August [3] Shelley Q. Zhuang, et al. Host Mobility using an Internet Indirection Infrastructure, First International Conference on Mobile Systems, Applications, and Services (ACM/USENIX Mobisys), May [4] Ion Stoica, et al. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, Proc. Of SIGCOMM, 2001.

P2P Based Architecture for Global Home Agent Dynamic Discovery in IP Mobility

P2P Based Architecture for Global Home Agent Dynamic Discovery in IP Mobility P2P Based Architecture for Global Home Agent Dynamic Discovery in IP Mobility Rubén Cuevas, Carmen Guerrero, Ángel Cuevas, María Calderón, Carlos J. Bernardos Departamento de Ingeniería Telemática, Universidad

More information

A Scalable Content- Addressable Network

A Scalable Content- Addressable Network A Scalable Content- Addressable Network In Proceedings of ACM SIGCOMM 2001 S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker Presented by L.G. Alex Sung 9th March 2005 for CS856 1 Outline CAN basics

More information

Chapter 12 Network Protocols

Chapter 12 Network Protocols Chapter 12 Network Protocols 1 Outline Protocol: Set of defined rules to allow communication between entities Open Systems Interconnection (OSI) Transmission Control Protocol/Internetworking Protocol (TCP/IP)

More information

March 10, Distributed Hash-based Lookup. for Peer-to-Peer Systems. Sandeep Shelke Shrirang Shirodkar MTech I CSE

March 10, Distributed Hash-based Lookup. for Peer-to-Peer Systems. Sandeep Shelke Shrirang Shirodkar MTech I CSE for for March 10, 2006 Agenda for Peer-to-Peer Sytems Initial approaches to Their Limitations CAN - Applications of CAN Design Details Benefits for Distributed and a decentralized architecture No centralized

More information

05 Indirect Communication

05 Indirect Communication 05 Indirect Communication Group Communication Publish-Subscribe Coulouris 6 Message Queus Point-to-point communication Participants need to exist at the same time Establish communication Participants need

More information

Chapter 09 Network Protocols

Chapter 09 Network Protocols Chapter 09 Network Protocols Copyright 2011, Dr. Dharma P. Agrawal and Dr. Qing-An Zeng. All rights reserved. 1 Outline Protocol: Set of defined rules to allow communication between entities Open Systems

More information

A Delay-Tolerant Network Architecture for Challenged Internets

A Delay-Tolerant Network Architecture for Challenged Internets A Delay-Tolerant Network Architecture for Challenged Internets Kevin Fall Intel Research Berkeley, CA kfall@intel.com http://www.intel-research.net Aug 26, 2003 SIGCOMM Karlsruhe, Germany Berkeley Unstated

More information

Evaluating the Performance of Mobile Agent-Based Message Communication among Mobile Hosts in Large Ad Hoc Wireless Network

Evaluating the Performance of Mobile Agent-Based Message Communication among Mobile Hosts in Large Ad Hoc Wireless Network Evaluating the Performance of Mobile Agent-Based Communication among Mobile Hosts in Large Ad Hoc Wireless Network S. Bandyopadhyay Krishna Paul PricewaterhouseCoopers Limited Techna Digital Systems Sector

More information

Better Approach To Mobile Adhoc Networking

Better Approach To Mobile Adhoc Networking Better Approach To Mobile Adhoc Networking batman-adv - Kernel Space L2 Mesh Routing Martin Hundebøll Aalborg University, Denmark March 28 th, 2014 History of batman-adv The B.A.T.M.A.N. protocol initiated

More information

Thoughts on the Current IPN Architecture Proposal

Thoughts on the Current IPN Architecture Proposal Thoughts on the Current IPN Architecture Proposal Kevin Fall Intel Research Berkeley, CA kfall@intel.com Presentation at JPL, October, 2001 Outline IPN goal and related Terrestrial work Bundling service

More information

Interdomain Routing Design for MobilityFirst

Interdomain Routing Design for MobilityFirst Interdomain Routing Design for MobilityFirst October 6, 2011 Z. Morley Mao, University of Michigan In collaboration with Mike Reiter s group 1 Interdomain routing design requirements Mobility support Network

More information

Custodial Multicast in Delay Tolerant Networks

Custodial Multicast in Delay Tolerant Networks Custodial Multicast in Delay Tolerant Networks Challenges and Approaches Susan Symington, Robert C. Durst, and Keith Scott The MITRE Corporation McLean, Virginia susan@mitre.org, durst@mitre.org, kscott@mitre.org

More information

Internet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana. UC Berkeley SIGCOMM 2002

Internet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana. UC Berkeley SIGCOMM 2002 Internet Indirection Infrastructure (i3) Ion Stoica, Daniel Adkins, Shelley Zhuang, Scott Shenker, Sonesh Surana UC Berkeley SIGCOMM 2002 Motivations Today s Internet is built around a unicast pointto-point

More information

Mobile IP Overview. Based on IP so any media that can support IP can also support Mobile IP

Mobile IP Overview. Based on IP so any media that can support IP can also support Mobile IP Introduction: Mobile IP Overview An Internet Protocol address (IP address) is a numerical label assigned to each device (e.g., computer, printer) participating in a computer network that uses the Internet

More information

Architectures for Distributed Systems

Architectures for Distributed Systems Distributed Systems and Middleware 2013 2: Architectures Architectures for Distributed Systems Components A distributed system consists of components Each component has well-defined interface, can be replaced

More information

EARM: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems.

EARM: An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems. : An Efficient and Adaptive File Replication with Consistency Maintenance in P2P Systems. 1 K.V.K.Chaitanya, 2 Smt. S.Vasundra, M,Tech., (Ph.D), 1 M.Tech (Computer Science), 2 Associate Professor, Department

More information

Outline 9.2. TCP for 2.5G/3G wireless

Outline 9.2. TCP for 2.5G/3G wireless Transport layer 9.1 Outline Motivation, TCP-mechanisms Classical approaches (Indirect TCP, Snooping TCP, Mobile TCP) PEPs in general Additional optimizations (Fast retransmit/recovery, Transmission freezing,

More information

Networking: Network layer

Networking: Network layer control Networking: Network layer Comp Sci 3600 Security Outline control 1 2 control 3 4 5 Network layer control Outline control 1 2 control 3 4 5 Network layer purpose: control Role of the network layer

More information

Internet Technology. 06. Exam 1 Review Paul Krzyzanowski. Rutgers University. Spring 2016

Internet Technology. 06. Exam 1 Review Paul Krzyzanowski. Rutgers University. Spring 2016 Internet Technology 06. Exam 1 Review Paul Krzyzanowski Rutgers University Spring 2016 March 2, 2016 2016 Paul Krzyzanowski 1 Question 1 Defend or contradict this statement: for maximum efficiency, at

More information

An Analysis of The Fast Handovers for Mobile IPv6 Protocol

An Analysis of The Fast Handovers for Mobile IPv6 Protocol An Analysis of The Fast Handovers for Mobile IPv6 Protocol Janne Lundberg Helsinki University of Technology Laboratory for Theoretical Computer Science May 28, 2003 Abstract Fast Handovers for Mobile IPv6

More information

Internet Technology 3/2/2016

Internet Technology 3/2/2016 Question 1 Defend or contradict this statement: for maximum efficiency, at the expense of reliability, an application should bypass TCP or UDP and use IP directly for communication. Internet Technology

More information

Charles Perkins Nokia Research Center 2 July Mobility Support in IPv6 <draft-ietf-mobileip-ipv6-14.txt> Status of This Memo

Charles Perkins Nokia Research Center 2 July Mobility Support in IPv6 <draft-ietf-mobileip-ipv6-14.txt> Status of This Memo IETF Mobile IP Working Group INTERNET-DRAFT David B. Johnson Rice University Charles Perkins Nokia Research Center 2 July 2000 Mobility Support in IPv6 Status of This

More information

IN recent years, the amount of traffic has rapidly increased

IN recent years, the amount of traffic has rapidly increased , March 15-17, 2017, Hong Kong Content Download Method with Distributed Cache Management Masamitsu Iio, Kouji Hirata, and Miki Yamamoto Abstract This paper proposes a content download method with distributed

More information

fp2p-hn: A P2P-based Route Optimization Solution for Mobile IP and NEMO clients.

fp2p-hn: A P2P-based Route Optimization Solution for Mobile IP and NEMO clients. 1 fp2p-hn: A P2P-based Route Optimization Solution for Mobile IP and NEMO clients. Albert Cabellos-Aparicio 1, Rubén Cuevas 2, Jordi Domingo-Pascual 1, Ángel Cuevas 2, Carmen Guerrero 2 Abstract Wireless

More information

ROUTE OPTIMIZATION EXTENSION FOR THE MOBILE INTERNET PROTOCOL IN LINUX

ROUTE OPTIMIZATION EXTENSION FOR THE MOBILE INTERNET PROTOCOL IN LINUX ROUTE OPTIMIZATION EXTENSION FOR THE MOBILE INTERNET PROTOCOL IN LINUX M. L. Jiang and Y. C. Tay ABSTRACT The base Mobile Internet Protocol (Mobile IP)[1] provides a means for portable computers to roam

More information

Chapter 3 A New Framework for Multicast Mobility in WiFi Networks

Chapter 3 A New Framework for Multicast Mobility in WiFi Networks Chapter 3 A New Framework for Multicast Mobility in WiFi Networks 3.1 Introduction This chapter presents the designed framework that was produced during this research. The chapter describes about network

More information

Chapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms

Chapter 13 TRANSPORT. Mobile Computing Winter 2005 / Overview. TCP Overview. TCP slow-start. Motivation Simple analysis Various TCP mechanisms Overview Chapter 13 TRANSPORT Motivation Simple analysis Various TCP mechanisms Distributed Computing Group Mobile Computing Winter 2005 / 2006 Distributed Computing Group MOBILE COMPUTING R. Wattenhofer

More information

Naming. Distributed Systems IT332

Naming. Distributed Systems IT332 Naming Distributed Systems IT332 2 Outline Names, Identifier, and Addresses Flat Naming Structured Naming 3 Names, Addresses and Identifiers A name is used to refer to an entity An address is a name that

More information

CAS 703 Software Design

CAS 703 Software Design Dr. Ridha Khedri Department of Computing and Software, McMaster University Canada L8S 4L7, Hamilton, Ontario Acknowledgments: Material based on Software by Tao et al. (Chapters 9 and 10) (SOA) 1 Interaction

More information

Enhanced Mobility Control in Mobile LISP Networks

Enhanced Mobility Control in Mobile LISP Networks Enhanced Mobility Control in Mobile LISP Networks Moneeb Gohar School of Computer Science and Engineering Kyungpook National University Daegu, South Korea moneebgohar@gmail.com Ji In Kim School of Computer

More information

CSC 4900 Computer Networks: Routing Protocols

CSC 4900 Computer Networks: Routing Protocols CSC 4900 Computer Networks: Routing Protocols Professor Henry Carter Fall 2017 Last Time Link State (LS) versus Distance Vector (DV) algorithms: What are some of the differences? What is an AS? Why do

More information

Multicasting in Delay Tolerant Networks: Semantic Models and Routing Algorithms

Multicasting in Delay Tolerant Networks: Semantic Models and Routing Algorithms Multicasting in Delay Tolerant Networks: Semantic Models and Routing Algorithms Wenrui Zhao, Mostafa Ammar and Ellen Zegura College of Computing, Georgia Institute of Technology, Atlanta, Georgia 3332

More information

VXLAN Overview: Cisco Nexus 9000 Series Switches

VXLAN Overview: Cisco Nexus 9000 Series Switches White Paper VXLAN Overview: Cisco Nexus 9000 Series Switches What You Will Learn Traditional network segmentation has been provided by VLANs that are standardized under the IEEE 802.1Q group. VLANs provide

More information

Configuring BGP. Cisco s BGP Implementation

Configuring BGP. Cisco s BGP Implementation Configuring BGP This chapter describes how to configure Border Gateway Protocol (BGP). For a complete description of the BGP commands in this chapter, refer to the BGP s chapter of the Network Protocols

More information

Communication. Distributed Systems Santa Clara University 2016

Communication. Distributed Systems Santa Clara University 2016 Communication Distributed Systems Santa Clara University 2016 Protocol Stack Each layer has its own protocol Can make changes at one layer without changing layers above or below Use well defined interfaces

More information

DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES

DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES DISTRIBUTED COMPUTER SYSTEMS ARCHITECTURES Dr. Jack Lange Computer Science Department University of Pittsburgh Fall 2015 Outline System Architectural Design Issues Centralized Architectures Application

More information

Top-Down Network Design

Top-Down Network Design Top-Down Network Design Chapter Seven Selecting Switching and Routing Protocols Original slides by Cisco Press & Priscilla Oppenheimer Selection Criteria for Switching and Routing Protocols Network traffic

More information

Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5

Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5 Wireless and Mobile Networks Reading: Sections 2.8 and 4.2.5 Acknowledgments: Lecture slides are from Computer networks course thought by Jennifer Rexford at Princeton University. When slides are obtained

More information

CSE 4215/5431: Mobile Communications Winter Suprakash Datta

CSE 4215/5431: Mobile Communications Winter Suprakash Datta CSE 4215/5431: Mobile Communications Winter 2013 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/4215 Some slides are adapted

More information

Peer Assisted Content Distribution over Router Assisted Overlay Multicast

Peer Assisted Content Distribution over Router Assisted Overlay Multicast Peer Assisted Content Distribution over Router Assisted Overlay Multicast George Xylomenos, Konstantinos Katsaros and Vasileios P. Kemerlis Mobile Multimedia Laboratory & Department of Informatics Athens

More information

CMPE 257: Wireless and Mobile Networking

CMPE 257: Wireless and Mobile Networking CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 8 CMPE 257 Spring'15 1 Announcements Project proposals. Feedback. Class schedule updated. Exam:

More information

BlackBerry Enterprise Server for Microsoft Exchange Version: 5.0. Feature and Technical Overview

BlackBerry Enterprise Server for Microsoft Exchange Version: 5.0. Feature and Technical Overview BlackBerry Enterprise Server for Microsoft Exchange Version: 5.0 Feature and Technical Overview SWDT305802-524791-0331031644-001 Contents 1 Overview: BlackBerry Enterprise Server... 5 New in this release...

More information

MULTI-DOMAIN VoIP PEERING USING OVERLAY NETWORK

MULTI-DOMAIN VoIP PEERING USING OVERLAY NETWORK 116 MULTI-DOMAIN VoIP PEERING USING OVERLAY NETWORK Herry Imanta Sitepu, Carmadi Machbub, Armein Z. R. Langi, Suhono Harso Supangkat School of Electrical Engineering and Informatics, Institut Teknologi

More information

Dissemination of Paths in Path-Aware Networks

Dissemination of Paths in Path-Aware Networks Dissemination of Paths in Path-Aware Networks Christos Pappas Network Security Group, ETH Zurich IETF, November 16, 2017 PANRG Motivation How does path-awareness extend to the edge? 2 PANRG Motivation

More information

Multipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network

Multipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network 1 Multipath Routing Protocol for Congestion Control in Mobile Ad-hoc Network Nilima Walde, Assistant Professor, Department of Information Technology, Army Institute of Technology, Pune, India Dhananjay

More information

Building a low-latency, proximity-aware DHT-based P2P network

Building a low-latency, proximity-aware DHT-based P2P network Building a low-latency, proximity-aware DHT-based P2P network Ngoc Ben DANG, Son Tung VU, Hoai Son NGUYEN Department of Computer network College of Technology, Vietnam National University, Hanoi 144 Xuan

More information

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica Examination Architecture of Distributed Systems (2IMN10), on Monday November 7, 2016, from 13.30 to 16.30 hours. Before you start, read

More information

CSC8223 Wireless Sensor Networks. Chapter 3 Network Architecture

CSC8223 Wireless Sensor Networks. Chapter 3 Network Architecture CSC8223 Wireless Sensor Networks Chapter 3 Network Architecture Goals of this chapter General principles and architectures: how to put the nodes together to form a meaningful network Design approaches:

More information

IP: Addressing, ARP, Routing

IP: Addressing, ARP, Routing IP: Addressing, ARP, Routing Network Protocols and Standards Autumn 2004-2005 Oct 21, 2004 CS573: Network Protocols and Standards 1 IPv4 IP Datagram Format IPv4 Addressing ARP and RARP IP Routing Basics

More information

Store-and-Forward Performance in a DTN

Store-and-Forward Performance in a DTN Store-and-Forward Performance in a DTN Mooi-Choo Chuah, Peng Yang, Brian D. Davison, Liang Cheng Department of Computer Science and Engineering Lehigh University 19 Memorial Drive West, Bethlehem, PA 18015,

More information

Master s Thesis. A Construction Method of an Overlay Network for Scalable P2P Video Conferencing Systems

Master s Thesis. A Construction Method of an Overlay Network for Scalable P2P Video Conferencing Systems Master s Thesis Title A Construction Method of an Overlay Network for Scalable P2P Video Conferencing Systems Supervisor Professor Masayuki Murata Author Hideto Horiuchi February 14th, 2007 Department

More information

Multicast Technology White Paper

Multicast Technology White Paper Multicast Technology White Paper Keywords: Multicast, IGMP, IGMP Snooping, PIM, MBGP, MSDP, and SSM Mapping Abstract: The multicast technology implements high-efficiency point-to-multipoint data transmission

More information

LECT-05, S-1 FP2P, Javed I.

LECT-05, S-1 FP2P, Javed I. A Course on Foundations of Peer-to-Peer Systems & Applications LECT-, S- FPP, javed@kent.edu Javed I. Khan@8 CS /99 Foundation of Peer-to-Peer Applications & Systems Kent State University Dept. of Computer

More information

Mobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading

Mobile Routing : Computer Networking. Overview. How to Handle Mobile Nodes? Mobile IP Ad-hoc network routing Assigned reading Mobile Routing 15-744: Computer Networking L-10 Ad Hoc Networks Mobile IP Ad-hoc network routing Assigned reading Performance Comparison of Multi-Hop Wireless Ad Hoc Routing Protocols A High Throughput

More information

Lecture 3: Packet Forwarding

Lecture 3: Packet Forwarding Lecture 3: Packet Forwarding CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Mike Freedman & Amin Vahdat Lecture 3 Overview Paper reviews Packet Forwarding IP Addressing Subnetting/CIDR

More information

Routing in a Delay Tolerant Network

Routing in a Delay Tolerant Network Routing in a Delay Tolerant Network Vladislav Marinov Jacobs University Bremen March 31st, 2008 Vladislav Marinov Routing in a Delay Tolerant Network 1 Internet for a Remote Village Dial-up connection

More information

Mobile Communications Chapter 9: Mobile Transport Layer

Mobile Communications Chapter 9: Mobile Transport Layer Prof. Dr.-Ing Jochen H. Schiller Inst. of Computer Science Freie Universität Berlin Germany Mobile Communications Chapter 9: Mobile Transport Layer Motivation, TCP-mechanisms Classical approaches (Indirect

More information

Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s

Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s Performance Evaluation of Mesh - Based Multicast Routing Protocols in MANET s M. Nagaratna Assistant Professor Dept. of CSE JNTUH, Hyderabad, India V. Kamakshi Prasad Prof & Additional Cont. of. Examinations

More information

Lecture 4: Intradomain Routing. CS 598: Advanced Internetworking Matthew Caesar February 1, 2011

Lecture 4: Intradomain Routing. CS 598: Advanced Internetworking Matthew Caesar February 1, 2011 Lecture 4: Intradomain Routing CS 598: Advanced Internetworking Matthew Caesar February 1, 011 1 Robert. How can routers find paths? Robert s local DNS server 10.1.8.7 A 10.1.0.0/16 10.1.0.1 Routing Table

More information

Delay Tolerant Networks

Delay Tolerant Networks Delay Tolerant Networks DEPARTMENT OF INFORMATICS & TELECOMMUNICATIONS NATIONAL AND KAPODISTRIAN UNIVERSITY OF ATHENS What is different? S A wireless network that is very sparse and partitioned disconnected

More information

Addressing: when mobile is moving around. Mobile Registration. Principles of Mobile Routing. Mobility via Indirect Routing

Addressing: when mobile is moving around. Mobile Registration. Principles of Mobile Routing. Mobility via Indirect Routing Wireless Networks Wireless Networks Kai Shen Advantages of wireless links: Mobility, easy setup Wireless s: Infrastructured wireless s Ad hoc wireless s Often, but sometimes fixed location /8/009 CSC 57/57

More information

LECTURE 8. Mobile IP

LECTURE 8. Mobile IP 1 LECTURE 8 Mobile IP What is Mobile IP? The Internet protocol as it exists does not support mobility Mobile IP tries to address this issue by creating an anchor for a mobile host that takes care of packet

More information

CMPE 257: Wireless and Mobile Networking

CMPE 257: Wireless and Mobile Networking CMPE 257: Wireless and Mobile Networking Katia Obraczka Computer Engineering UCSC Baskin Engineering Lecture 8 CMPE 257 Winter'11 1 Announcements: Student presentations: Security: Jim. Seth: security in

More information

Distributed Hash Table

Distributed Hash Table Distributed Hash Table P2P Routing and Searching Algorithms Ruixuan Li College of Computer Science, HUST rxli@public.wh.hb.cn http://idc.hust.edu.cn/~rxli/ In Courtesy of Xiaodong Zhang, Ohio State Univ

More information

Locator ID Separation Protocol (LISP) Overview

Locator ID Separation Protocol (LISP) Overview Locator ID Separation Protocol (LISP) is a network architecture and protocol that implements the use of two namespaces instead of a single IP address: Endpoint identifiers (EIDs) assigned to end hosts.

More information

Mobile host protocols support host

Mobile host protocols support host INTERNATIONAL JOURNAL OF NETWORK MANAGEMENT Int. J. Network Mgmt 2000; 10:191 214 Location update and routing scheme for a mobile computing environment By Anna Hać Ł and Yujing Huang We present a new hierarchical

More information

Advanced Computer Networks

Advanced Computer Networks Advanced Computer Networks Network Architectures Jianping Pan Summer 2007 5/16/07 csc485b/586b/seng480b 1 Internet architectures Design principles store-and-forward packet switching end-to-end arguments

More information

Opportunistic Application Flows in Sensor-based Pervasive Environments

Opportunistic Application Flows in Sensor-based Pervasive Environments Opportunistic Application Flows in Sensor-based Pervasive Environments Nanyan Jiang, Cristina Schmidt, Vincent Matossian, and Manish Parashar ICPS 2004 1 Outline Introduction to pervasive sensor-based

More information

Postellation: an Enhanced Delay-Tolerant Network (DTN) Implementation with Video Streaming and Automated Network Attachment

Postellation: an Enhanced Delay-Tolerant Network (DTN) Implementation with Video Streaming and Automated Network Attachment Postellation: an Enhanced Delay-Tolerant Network (DTN) Implementation with Video Streaming and Automated Network Attachment Marc Blanchet, Simon Perreault and Jean-Philippe Dionne Viagénie, Québec, Québec,

More information

Reliable Stream Analysis on the Internet of Things

Reliable Stream Analysis on the Internet of Things Reliable Stream Analysis on the Internet of Things ECE6102 Course Project Team IoT Submitted April 30, 2014 1 1. Introduction Team IoT is interested in developing a distributed system that supports live

More information

A Decentralized Content-based Aggregation Service for Pervasive Environments

A Decentralized Content-based Aggregation Service for Pervasive Environments A Decentralized Content-based Aggregation Service for Pervasive Environments Nanyan Jiang, Cristina Schmidt, Manish Parashar The Applied Software Systems Laboratory Rutgers, The State University of New

More information

Heterogeneous Addressing in DTN

Heterogeneous Addressing in DTN Heterogeneous Addressing in DTN Rick Taylor John Dowdell Airbus Defence and Space Based on discussion with Scott Burleigh 1 What s the problem? DTNs can be addressed by a URI scheme such as dtn:

More information

Handover Management for Mobile Nodes in IPv6 Networks

Handover Management for Mobile Nodes in IPv6 Networks TECHNOLOGY ADVANCES FOR 3G AND BEYOND Handover Management for Mobile Nodes in IPv6 Networks Nicolas Montavont and Thomas Noël LSIIT Louis Pasteur University CNRS, Strasbourg ABSTRACT In this article we

More information

Agent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma. Distributed and Agent Systems

Agent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma. Distributed and Agent Systems Agent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma Distributed and Agent Systems Peer-to-Peer Systems & JXTA Prof. Agostino Poggi What is Peer-to-Peer

More information

Fixed Internetworking Protocols and Networks. IP mobility. Rune Hylsberg Jacobsen Aarhus School of Engineering

Fixed Internetworking Protocols and Networks. IP mobility. Rune Hylsberg Jacobsen Aarhus School of Engineering Fixed Internetworking Protocols and Networks IP mobility Rune Hylsberg Jacobsen Aarhus School of Engineering rhj@iha.dk 1 2011 ITIFN Mobile computing Vision Seamless, ubiquitous network access for mobile

More information

Mobile Transport Layer

Mobile Transport Layer Mobile Transport Layer 1 Transport Layer HTTP (used by web services) typically uses TCP Reliable transport between TCP client and server required - Stream oriented, not transaction oriented - Network friendly:

More information

Telecommunication Services Engineering Lab. Roch H. Glitho

Telecommunication Services Engineering Lab. Roch H. Glitho 1 Support Infrastructure Support infrastructure for application layer Why? Re-usability across application layer protocols Modularity (i.e. separation between application layer protocol specification /

More information

An Expresway over Chord in Peer-to-Peer Systems

An Expresway over Chord in Peer-to-Peer Systems An Expresway over Chord in Peer-to-Peer Systems Hathai Tanta-ngai Technical Report CS-2005-19 October 18, 2005 Faculty of Computer Science 6050 University Ave., Halifax, Nova Scotia, B3H 1W5, Canada An

More information

UNIVERSITY OF CAGLIARI

UNIVERSITY OF CAGLIARI UNIVERSITY OF CAGLIARI DIEE - Department of Electrical and Electronic Engineering Infrastrutture ed Applicazioni Avanzate nell Internet SDN: Control Plane ACK: content taken from Foundations of Modern

More information

A Low-Overhead DVR Based Multicast Routing Protocol for Clustered MANET

A Low-Overhead DVR Based Multicast Routing Protocol for Clustered MANET A Low-Overhead DVR Based Multicast Routing Protocol for Clustered MANET B. Gupta, S. Rahimi, R. Jandhyala, and V. Doraiswamy Department of Computer Science, Southern Illinois University, Carbondale, IL

More information

CMPE150 Midterm Solutions

CMPE150 Midterm Solutions CMPE150 Midterm Solutions Question 1 Packet switching and circuit switching: (a) Is the Internet a packet switching or circuit switching network? Justify your answer. The Internet is a packet switching

More information

Question 1 (6 points) Compare circuit-switching and packet-switching networks based on the following criteria:

Question 1 (6 points) Compare circuit-switching and packet-switching networks based on the following criteria: Question 1 (6 points) Compare circuit-switching and packet-switching networks based on the following criteria: (a) Reserving network resources ahead of data being sent: (2pts) In circuit-switching networks,

More information

Rule based Forwarding (RBF): improving the Internet s flexibility and security. Lucian Popa, Ion Stoica, Sylvia Ratnasamy UC Berkeley Intel Labs

Rule based Forwarding (RBF): improving the Internet s flexibility and security. Lucian Popa, Ion Stoica, Sylvia Ratnasamy UC Berkeley Intel Labs Rule based Forwarding (RBF): improving the Internet s flexibility and security Lucian Popa, Ion Stoica, Sylvia Ratnasamy UC Berkeley Intel Labs Motivation Improve network s flexibility Middlebox support,

More information

Cluster Based Approach for Overhead Reduction and Load Balancing in Delay Tolerant Mobile Applications

Cluster Based Approach for Overhead Reduction and Load Balancing in Delay Tolerant Mobile Applications Cluster Based Approach for Overhead Reduction and Load Balancing in Delay Tolerant Mobile Applications 1 Shankar B Sajjan, 2 Amit Kumar, 3 Masrath Begum, 4 Ambrish Kaneri 1234 Assistant Professor, CSE

More information

Brocade: Landmark Routing on Peer to Peer Networks. Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz

Brocade: Landmark Routing on Peer to Peer Networks. Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz Brocade: Landmark Routing on Peer to Peer Networks Ling Huang, Ben Y. Zhao, Yitao Duan, Anthony Joseph, John Kubiatowicz State of the Art Routing High dimensionality and coordinate-based P2P routing Decentralized

More information

Overlay and P2P Networks. Introduction and unstructured networks. Prof. Sasu Tarkoma

Overlay and P2P Networks. Introduction and unstructured networks. Prof. Sasu Tarkoma Overlay and P2P Networks Introduction and unstructured networks Prof. Sasu Tarkoma 14.1.2013 Contents Overlay networks and intro to networking Unstructured networks Overlay Networks An overlay network

More information

T Computer Networks II. Mobility Issues Contents. Mobility. Mobility. Classifying Mobility Protocols. Routing vs.

T Computer Networks II. Mobility Issues Contents. Mobility. Mobility. Classifying Mobility Protocols. Routing vs. T-0.50 Computer Networks II Mobility Issues 6.0.008 Overview Mobile IP NEMO Transport layer solutions i SIP mobility Contents Prof. Sasu Tarkoma Mobility What happens when network endpoints start to move?

More information

Chapter 3: Naming Page 38. Clients in most cases find the Jini lookup services in their scope by IP

Chapter 3: Naming Page 38. Clients in most cases find the Jini lookup services in their scope by IP Discovery Services - Jini Discovery services require more than search facilities: Discovery Clients in most cases find the Jini lookup services in their scope by IP multicast/broadcast Multicast UDP for

More information

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica

TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica Examination Architecture of Distributed Systems (2IMN10 / 2II45), on Monday November 2, 2015, from 13.30 to 16.30 hours. Indicate on

More information

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking

Wireless Challenges : Computer Networking. Overview. Routing to Mobile Nodes. Lecture 25: Wireless Networking Wireless Challenges 15-441: Computer Networking Lecture 25: Wireless Networking Force us to rethink many assumptions Need to share airwaves rather than wire Don t know what hosts are involved Host may

More information

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5.

Content. 1. Introduction. 2. The Ad-hoc On-Demand Distance Vector Algorithm. 3. Simulation and Results. 4. Future Work. 5. Rahem Abri Content 1. Introduction 2. The Ad-hoc On-Demand Distance Vector Algorithm Path Discovery Reverse Path Setup Forward Path Setup Route Table Management Path Management Local Connectivity Management

More information

Deploying LISP Host Mobility with an Extended Subnet

Deploying LISP Host Mobility with an Extended Subnet CHAPTER 4 Deploying LISP Host Mobility with an Extended Subnet Figure 4-1 shows the Enterprise datacenter deployment topology where the 10.17.1.0/24 subnet in VLAN 1301 is extended between the West and

More information

Wireless Sensor Architecture GENERAL PRINCIPLES AND ARCHITECTURES FOR PUTTING SENSOR NODES TOGETHER TO

Wireless Sensor Architecture GENERAL PRINCIPLES AND ARCHITECTURES FOR PUTTING SENSOR NODES TOGETHER TO Wireless Sensor Architecture 1 GENERAL PRINCIPLES AND ARCHITECTURES FOR PUTTING SENSOR NODES TOGETHER TO FORM A MEANINGFUL NETWORK Mobile ad hoc networks Nodes talking to each other Nodes talking to some

More information

MobilityFirst GSTAR: Generalized Storage Aware Routing

MobilityFirst GSTAR: Generalized Storage Aware Routing MobilityFirst GSTAR: Generalized Storage Aware Routing Samuel Nelson MobilityFirst Design Goals Design a future internet architecture that supports: Host and network mobility Diverse communication devices/entities/paradigms

More information

History Page. Barracuda NextGen Firewall F

History Page. Barracuda NextGen Firewall F The Firewall > History page is very useful for troubleshooting. It provides information for all traffic that has passed through the Barracuda NG Firewall. It also provides messages that state why traffic

More information

Data Communication & Networks G Session 5 - Main Theme Wireless Networks. Dr. Jean-Claude Franchitti

Data Communication & Networks G Session 5 - Main Theme Wireless Networks. Dr. Jean-Claude Franchitti Data Communication & Networks G22.2262-001 Session 5 - Main Theme Wireless Networks Dr. Jean-Claude Franchitti New York University Computer Science Department Courant Institute of Mathematical Sciences

More information

CS5984 Mobile Computing

CS5984 Mobile Computing CS5984 Mobile Computing Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech Mobile IPv4 Micro-mobility 1 Outline solutions 2 Local-area Mobility Solutions Within the Mobile IP framework Regional

More information

Inter-Domain Routing: BGP

Inter-Domain Routing: BGP Inter-Domain Routing: BGP Richard T. B. Ma School of Computing National University of Singapore CS 3103: Compute Networks and Protocols Inter-Domain Routing Internet is a network of networks Hierarchy

More information

Distributed Systems 26. Mobile Ad Hoc Mesh Networks

Distributed Systems 26. Mobile Ad Hoc Mesh Networks Distributed Systems 26. Mobile Ad Hoc Mesh Networks Paul Krzyzanowski pxk@cs.rutgers.edu 12/16/2011 1 Mesh Networks Mobile Ad-hoc networks, sensor networks, Decentralized networking No need for routers

More information

MANET Architecture and address auto-configuration issue

MANET Architecture and address auto-configuration issue MANET Architecture and address auto-configuration issue Namhi Kang Catholic University E-mail: kang@catholic.ac.kr Contents Background Information Overview Common MANET misperception Multilink subnet issue

More information