Dynamic routing | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

Dynamic routing, also called adaptive routing, is a process where a router can forward data via a different route for a given destination based on the current conditions of the communication circuits within a system. The term is most commonly associated with data networking to describe the capability of a network to 'route around' damage, such as loss of a node or a connection between nodes, as long as other path choices are available. Dynamic routing allows as many routes as possible to remain valid in response to the change. Systems that do not implement dynamic routing are described as using static routing, where routes through a network are described by fixed paths. A change, such as the loss of a node, or loss of a connection between nodes, is not compensated for. This means that anything that wishes to take an affected path will either have to wait for the failure to be repaired before restarting its journey, or will have to fail to reach its destination and give up the journey. There are several protocols that can be used for dynamic routing. Routing Information Protocol (RIP) is a distance-vector routing protocol that prevents routing loops by implementing a limit on the number of hops allowed in a path from source to destination. Open Shortest Path First (OSPF) uses a link state routing (LSR) algorithm and falls into the group of interior gateway protocols (IGPs). Intermediate System to Intermediate System (IS-IS) determines the best route for data through a packet-switched network. Interior Gateway Routing Protocol (IGRP) and its advanced form Enhanced Interior Gateway Routing Protocol (EIGRP) are used by routers to exchange routing data within an autonomous system. Many systems use some next-hop forwarding protocol—when a packet arrives at some node, that node decides on-the-fly which link to use to push the packet one hop closer to its final destination. Routers that use some adaptive protocols, such as the Spanning Tree Protocol, in order to "avoid bridge loops and routing loops", calculate a tree that indicates the one "best" link for a packet to get to its destination.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (2)

Related people (3)

Related units (1)

Related concepts (2)

Related courses (6)

Related lectures (42)

Differential Amplifier Design EE-320: Analog IC design

Covers the design of a differential amplifier with key parameters like gain and bias current.

Bellman Ford: Shortest Paths CS-250: Algorithms I

Introduces the Bellman-Ford algorithm for finding shortest paths in directed graphs with edge weights.

Bellman-Ford Algorithm: Analysis and Correctness CS-250: Algorithms I

Explores the Bellman-Ford algorithm, its correctness, and practical applications in dynamic networks and real-world scenarios.

A Test-Bed for Misbehavior Detection in Mobile Ad-hoc Networks - How Much Can Watchdogs Really Do?

Jean-Yves Le Boudec, Cédric Tissières, Sonja Buchegger

Several misbehavior detection and reputation systems have been proposed for mobile ad-hoc networks, relying on direct network observation mechanisms, so-called watchdogs. While these approaches have so far only been evaluated in simulations and restricted to selfish packet dropping, we are interested in the capabilities of a watchdog detection component in a real network. In this paper we present our test-bed implementation of misbehavior detection. Following an evaluation of both the feasibility and detectability of attacks on routing and forwarding in the Dynamic Source Routing (DSR) protocol, we present the design of our test-bed. In order to add detection capabilities, we extend the concept of passive acknowledgment by mechanisms for partial dropping, packet modification, and fabrication detection. We combine DSR with Netfilter and APE to enable detection. We implement both attackers and detection and show their feasibility and limitations.

2004

A Test-Bed for Misbehavior Detection in Mobile Ad-hoc Networks --- How Much Can Watchdogs Really Do?

Jean-Yves Le Boudec, Cédric Tissières, Sonja Buchegger

2003

COM-407: TCP/IP networking

In the lectures you will learn and understand the main ideas that underlie and the way communication networks are built and run. In the labs you will exercise practical configurations.

EE-320: Analog IC design

Introduction to the design of analog CMOS integrated circuits at the transistor level. Understanding and design of basic structures.

COM-208: Computer networks

This course provides an introduction to computer networks. It describes the principles that underly modern network operation and illustrates them using the Internet as an example.

Dynamic routing

Routing

Routing is the process of selecting a path for traffic in a network or between or across multiple networks. Broadly, routing is performed in many types of networks, including circuit-switched networks, such as the public switched telephone network (PSTN), and computer networks, such as the Internet. In packet switching networks, routing is the higher-level decision making that directs network packets from their source toward their destination through intermediate network nodes by specific packet forwarding mechanisms.