Showing papers on "Equal-cost multi-path routing published in 2020"

IPv6 Segment Routing Header (SRH)

Abstract: Segment Routing can be applied to the IPv6 data plane using a new type of Routing Extension Header. This document describes the Segment Routing Extension Header and how it is used by Segment Routing capable nodes.

Hop-Constrained Oblivious Routing

Abstract: We prove the existence of an oblivious routing scheme that is $\mathrm{poly}(\log n)$-competitive in terms of $(congestion + dilation)$, thus resolving a well-known question in oblivious routing. Concretely, consider an undirected network and a set of packets each with its own source and destination. The objective is to choose a path for each packet, from its source to its destination, so as to minimize $(congestion + dilation)$, defined as follows: The dilation is the maximum path hop-length, and the congestion is the maximum number of paths that include any single edge. The routing scheme obliviously and randomly selects a path for each packet independent of (the existence of) the other packets. Despite this obliviousness, the selected paths have $(congestion + dilation)$ within a $\mathrm{poly}(\log n)$ factor of the best possible value. More precisely, for any integer hop-bound $h$, this oblivious routing scheme selects paths of length at most $h \cdot \mathrm{poly}(\log n)$ and is $\mathrm{poly}(\log n)$-competitive in terms of $congestion$ in comparison to the best possible $congestion$ achievable via paths of length at most $h$ hops. These paths can be sampled in polynomial time. This result can be viewed as an analogue of the celebrated oblivious routing results of Racke [FOCS 2002, STOC 2008], which are $O(\log n)$-competitive in terms of $congestion$, but are not competitive in terms of $dilation$.

A new position based routing algorithm for vehicular ad hoc networks

Abstract: The main requirement to make safer journey in VANET environment is minimum delay with high packet delivery rate. This ensures that all data packets are received with minimal delay to prevent any accident. This paper presents a new algorithm for VANET class routing protocol that covers sparse and coarse region of vehicles. It takes the advantage of road layout to improve the performance of routing in VANETs. The proposed algorithm uses real-time GPS tracking system to obtain traffic information for creating road based paths from source node to destination node. The optimize forwarding is used to figure out the forwarding node along the road pattern that form the path to deliver the data packets. The results shows that proposed algorithm obtain better results considering the various simulation parameters.