Static routing

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

Source routing in computer networks

Abstract: As plans for network interconnection develop, the problems of internet routing and addressing become increasingly important. In one popular model of internet addressing, a hierarchical form of network and local (within network) address is used, with the source providing only the destination address while the intermediate network(s) and/or Gateways between networks take care of routing packets to that destination by various paths. This and related techniques requiring some form of routing table and knowledge at intermediate nodes are more fully discussed in [1,2,3].This paper considers another technique for internet routing in which the source of internet packets specifies the complete internet route. When the entire route accompanies each internet packet, no routing decisions or tables are required at Gateways, but the packet format is complicated and overhead increases. In particular, the packet must carry a varying number of intermediate addresses depending on the path and destination [4]. This overhead may be reduced by setting up a fixed route with connection tables [1] when a connection is established.

Biologically inspired self-adaptive multi-path routing in overlay networks

Abstract: In this paper we propose a multi-path routing scheme based on a biologically inspired attractor selection model. The advantage of this approach is that it is highly noise-tolerant and capable to operate in a very robust manner under varying environmental conditions. Further- more, the route selection is performed in accordance to

On-demand multicast in mobile wireless networks

Abstract: We propose an "on-demand" multicast routing protocol for a wireless, mobile, multihop network. The proposed scheme has two key features: (a) it is based on the forwarding group concept (i.e., a subset of nodes is in charge of forwarding the multicast packets via scoped flooding) rather than on the conventional multicast tree scheme (b) it dynamically refreshes the forward group members using a procedure akin to on-demand routing (hence the name). "On-demand" multicast is well suited to operate in an on-demand routing environment where routes are selectively computed as needed between communicating node pairs instead of being maintained and updated globally by a routing "infrastructure" (like in distance vector or link state, for example). On-demand multicast is particularly attractive in mobile, rapidly changing networks, where the traffic overhead caused by routing updates and tree reconfigurations may become prohibitive beyond a critical speed; and in large network with sparse traffic requirements, where the traffic, processing and storage overhead of the routing infrastructure solution compromises scalability. Via simulation, we compare on-demand multicast with a traditional tree multicast scheme, DVMRP, and with a version of forwarding group multicast which uses conventional distance vector routing instead of on-demand routing. This allows us to assess the penalty of the tree and of the global routing infrastructure as a function of mobility and sparseness.

Hydro: A Hybrid Routing Protocol for Low-Power and Lossy Networks

Abstract: Existing routing protocols for sensor networks ei- ther exclusively focus on collection-based traffic, or optimize for point-to-point traffic in a homogeneous network. As these networks become more general, a mix of these workloads in a heterogeneous setting is expected, while still abiding by the resource constraints of low- power and lossy networks (L2Ns). Our design leverages the predominantly two-tiered topology of L2N deployments, with capable border routers supplementing resource-starved in- network nodes, and optimizes for the typical traffic workloads consisting mainly of collection based traffic with specific instances of point-to-point traffic. We present Hydro, a hybrid routing protocol that combines local agility with centralized control. In-network nodes use distributed DAG formation to provide default routes to border routers, concurrently forming the foundation for triangle point- to-point routing. Border Routers build a global, but typically incomplete, view of the network using topology reports received from in- network nodes, and subsequently install optimized routes in the network for active point-to-point flows. Building on the vast existing literature on distributed DAG for- mation in L2Ns and centralized routing in large-scale networks, our contribution lies in the merging of these ideas in the form of a routing protocol that addresses the needs of L2Ns while remaining grounded in their inherent constraints. Evaluations across testbeds and deployments demonstrate the performance and functionality of Hydro across a variety of workloads and network conditions.

Outsourcing the routing control logic: better internet routing based on SDN principles

Abstract: Inter-domain routing is based on a fully decentralized model, where multiple Autonomous Systems (AS) interact via the BGP protocol. Although BGP is the "glue" of the Internet, it faces a lot of problems regarding its fully distributed nature, policy enforcement capabilities, scalability, security and complexity. Due to the widespread adoption of BGP, only incrementally deployable solutions are feasible. Taking this observation into account, we describe a new, backwards-compatible routing model which is based on outsourcing and logically centralizing the routing control plane. We claim that outsourcing enables enhanced inter-domain routing. As multiple ASes outsource their routing control plane to the same outsourcing service contractor, AS clusters are being gradually formed. A logically centralized multi-AS routing control platform based on Software Defined Networking (SDN) principles is the natural point for taking efficient routing decisions, detecting policy conflicts, troubleshooting routing problems, and evolving BGP. We present the technical and financial incentives which support the feasibility of the model and also propose an implementation scheme to facilitate it.