A stack-vector routing protocol for automatic tunneling

Abstract

In a network, a tunnel is a part of a path where a protocol is encapsulated in another one. A tunnel starts with an encapsulation and ends with the corresponding decapsulation. Several tunnels can be nested at some stage, forming a protocol stack. Tunneling is very important nowadays and it is involved in several tasks: IPv4/IPv6 transition, VPNs, security (IPsec, onion routing), etc. However, tunnel establishment is mainly performed manually or by script, which present obvious scalability issues. Some works attempt to automate a part of the process (e.g., TSP, ISATAP, etc.). However, the determination of the tunnel(s) endpoints is not fully automated, especially in the case of an arbitrary number of nested tunnels. The lack of routing protocols performing automatic tunneling is due to the unavailability of path computation algorithms taking into account encapsulations and decapsulations. There is a polynomial centralized algorithm to perform the task. However, to the best of our knowledge, no fully distributed path computation algorithm is known. Here, we propose the first fully distributed algorithm for path computation with automatic tunneling, i.e., taking into account encapsulation, decapsulation and conversion of protocols. Our algorithm is a generalization of the distributed Bellman-Ford algorithm, where the distance vector is replaced by a protocol stack vector. This allows to know how to route a packet with some protocol stack. We prove that the messages size of our algorithm is polynomial, even if the shortest path can be of exponential length. We also prove that the algorithm converges after a polynomial number of steps in a synchronized setting. We adapt our algorithm into a proto-protocol for routing with automatic tunneling and we show its efficiency through simulations.

Semiring Algebraic Structure for Metarouting with Automatic Tunneling

“…On the side of routing in multilayer networks, the authors of [10] proposed the first distributed algorithm to compute the shortest paths while automatically establishing tunnels. It is widely inspired by Bellman-Ford algorithm.…”

“…However, the second operation must keep all valid paths, and in equality cases, i.e., valid paths having the same protocol stack (tunnel), must keep the shortest one. The proposed algebraic structures can be used to prove some convergence properties of the stackvector algorithm proposed in [10].…”

“…be the set of all possible protocol stacks. Note that this set is finite if we consider only the stacks induced par the shortest paths, since these stacks are bounded by λn 2 (see [10] for the proof). We can define an elementary adaptation function as a function f from H a → H b where H a (resp.…”

Improvement of Perception Layer Routing Protocol with Static Nodes in IoT-Based Microgrids

“…The SERP protocol algorithm is described as follows: First, initialize the parameters after completing the arrangement of sensor nodes and base station nodes. Then, calculate R i , the cluster radius of each node and ratio of cluster heads p, the optimal cluster head ratio according to Formulas (10) and (12). Determine T(s i ), the cluster head selection threshold for each node by the distance factor D f and the energy factor E f , select the cluster head by comparing it with a randomly generated random number within the range of 0-1, and update the G set.…”

“…The actuators execute operations based on the perceived data or the request from the user. At the same time, the self-organizing network technique and routing protocols [9][10][11] are the key objects of research on the perception layer, and efficient routing protocols can improve the efficiency of sensor node data fusion and the overall life cycle of the network. However, the method of randomly selecting cluster heads can easily give rise to problems such as uneven clustering and uncoordinated cluster sizes.…”