Publication

Self-Organizing Wide-Area Routing

Jean-Yves Le Boudec, Silvia Giordano Cremonese, Ljubica Blazevic
2000
Conference Papers

Abstract

We consider the problem of routing in a Mobile Ad-Hoc wide area network called Terminodes Network. In our solution every node builds its personal view of the network, composed of local and remote views. Large scale routing in the terminode network is achieved by the combination of these two views. We describe two methods called Terminode Local Routing (TLR) and Anchored Geodesic Packet Forwarding (AGPF) that are used for routing in such a network, as well as path discovery and path maintenance mechanisms.

Official source

https://infoscience.epfl.ch/entities/publication/00f299f9-153a-4e9f-8808-99810b1ae161

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.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Jean-Yves Le Boudec, Silvia Giordano Cremonese, Ljubica Blazevic
2000
Conference Papers

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/00f299f9-153a-4e9f-8808-99810b1ae161

About this result

Related concepts (17)

Dynamic routing

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.

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.

Distance-vector routing protocol

A distance-vector routing protocol in data networks determines the best route for data packets based on distance. Distance-vector routing protocols measure the distance by the number of routers a packet has to pass; one router counts as one hop. Some distance-vector protocols also take into account network latency and other factors that influence traffic on a given route. To determine the best route across a network, routers using a distance-vector protocol exchange information with one another, usually routing tables plus hop counts for destination networks and possibly other traffic information.

Related publications (10)

Self-Organizing Wide-Area Routing

Chat with Graph Search

A Parsimonious Model of Mobile Partitioned Networks with Clustering

Fault-tolerance of capillary multi-path routing for real-time multimedia streaming with forward error correction

An Artificial Immune System for Misbehavior Detection in Mobile Ad-Hoc Networks with Virtual Thymus, Clustering, Danger Signal and Memory Detectors