Static routing

About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.

Spine routing in ad hoc networks

Abstract: An ad hoc network is a multihop wireless network in which mobile hosts communicate without the support of a wired backbone for routing messages. We introduce a self organizing network structure called a spine and propose a spine-based routing infrastructure for routing in ad hoc networks. We propose two spine routing algorithms: (a) Optimal Spine Routing (OSR), which uses full and up-to-date knowledge of the network topology, and (b) Partial-knowledge Spine Routing (PSR), which uses partial knowledge of the network topology. We analyze the two algorithms and identify the optimality-overhead trade-offs involved in these algorithms.

Cross-layer routing in wireless mesh networks

Abstract: Routing in wireless network is challenging because of the unpredictable behavior of the medium and the proactive effect of interference. In order to exploit all the advantages that the wireless medium offers, new routing metrics must be explored. These metrics should come from a cross-layer approach in order to make the routing layer aware of the local issues of the underling layers. In the present paper, we explore three primitive physical layer parameters: interference, packet success rate, and data rate. We define the metrics so that the routing level can correctly find paths that offer: low levels of generated interference, reliability in terms of packet success rate, and highest available transmission rate. We prove that for cross-layer based routing, if the metrics are well designed, the problem is NP-complete.

Loop-free multipath routing using generalized diffusing computations

Abstract: A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or Internet are presented, validated, and analyzed. According to this algorithm, which is called DASM (diffusing algorithm for shortest multipath), each router maintains a set of entries for each destination in its routing table, and each such entry consists of a set of tuples specifying the next router and distance in a loop-free path to the destination. DASM guarantees instantaneous loop freedom of multipath routing tables by means of a generalization of Dijkstra and Scholten's diffusing computations. With generalized diffusing computations, a node in a directed acyclic graph (DAG) defined for a given destination has multiple next nodes in the DAG and is able to modify the DAG without creating a directed loop. DASM is shown to be loop-free at every instant, and its average performance is analyzed by simulation and compared against an ideal link-state algorithm and the diffusing update algorithm (DUAL).

Method and apparatus for routing and link metric assignment in shortest path networks

Abstract: The invention discloses a method and apparatus for assigning link "distance" metrics that result in near optimal routing for a network formed of nodes (routers) and links, where each link has a capacity associated with it, and where source-destination flows are given. The routing optimality is measured with respect to some objective function (e.g., average network delay).

Routing on a curve

Abstract: Relentless progress in hardware technology and recent advances in sensor technology, and wireless networking have made it feasible to deploy large scale, dense ad-hoc networks. These networks together with sensor technology can be considered as the enablers of emerging models of computing such as embedded computing, ubiquitous computing, or pervasive computing. In this paper, we propose a new paradigm called trajectory based forwarding (or TBF), which is a generalization of source based routing and Cartesian routing. We argue that TBF is an ideal technique for routing in dense ad-hoc networks. Trajectories are a natural namespace for describing route paths when the topology of the network matches the topography of the physical surroundings in which it is deployed which by very definition is embedded computing.We show how simple trajectories can be used in implementing important networking protocols such as flooding, discovery, and network management. Trajectory routing is very effective in implementing many networking functions in a quick and approximate way, as it needs very few support services. We discuss several research challenges in the design of network protocols that use specific trajectories for forwarding packets.