China
Africa
Explore chapters and articles related to this topic
Computer Networking
Published in Mohssen Mohammed, Al-Sakib Khan Pathan, Automatic Defense Against Zero-day Polymorphic Worms in Communication Networks, 2016
Mohssen Mohammed, Al-Sakib Khan Pathan
Source routing allows a sender of a packet to partially or completely specify the route that the packet takes through the network. On the other hand, in nonsource routing protocols, routers in the network determine the path based on the packet’s destination. It is somewhat good that the packets in source routing contain header information describing the route they are to take to the destination. However, this type of routing is also a security concern when an attacker may gain access to a network without going through the firewall. So, by disabling source routing on the routers’ traffic filtering mechanism, network security could be enhanced.
Security Issues in FHAMIPv6
Published in Jonathan Loo, Jaime Lloret Mauri, Jesús Hamilton Ortiz, Mobile Ad Hoc Networks, 2016
Jesús Hamilton Ortiz, Jorge Luís Perea Ramos, Julio Cesar Rodríguez Ribon, Juan Carlos López
The Dynamic source routing (DSR) protocol is a reactive routing protocol that allows nodes to dynamically discover routes that involve multiple hops to any destination. The term source routing means that each packet contains in its header the complete path information from the source to the destination: the header contains the addresses of all nodes between the source and the destination. However, DSR uses no periodic routing messages to reduce network overload, battery consumption, CPU usage, and bandwidth.
Routing and Flow Control
Published in Jerry D. Gibson, The Communications Handbook, 2018
In contrast, source routing describes the situation where the route that a packet travels is determined by the source. In this case, the source explicitly specifies what route the packet should take within a header field of the packet. Typically, this specification consists of the list of node addresses along the path that the packet should travel. This eliminates the need for large lookup tables within each network node. For example, link state routing can be used, where the sources compute shortest paths.
A Systematic Review Paper on Energy-Efficient Routing Protocols in Internet of Things
Published in IETE Journal of Research, 2023
RPL is a type of distance vector protocol and source routing protocol. It uses a bidirectional link for communication among the nodes of the network. RPL uses a Directed acyclic graph (DAG) as a basic standard for its topology. It uses a specific type of DAG, which is called DODAG (Destination Oriented DAG). The difference between these two acyclic graphs is DODAG, which has only one sink node in its network. This standardization of routing is built for literacy, language and numeracy (LLN). DAG is built by using routing metrics and parameters. DODAG uses the default objective function (OF), uses the rank metric for selecting the parent node, and makes a network without any cycle. ROLL had introduced two types of OFs; the first is Objective_function_zero (OF0) and another one is Minimum_Rank_with_Hysteresis_OF (MRHOF).
The demand potential of shared autonomous vehicles: a large-scale simulation using mobility survey data
Published in Journal of Intelligent Transportation Systems, 2023
Riccardo Iacobucci, Jonas Donhauser, Jan-Dirk Schmöcker, Marco Pruckner
To provide more realistic agent travel times and distances, the Open Source Routing Machine (OSRM) is used. OSRM is a stand-alone application providing an efficient routing API based on OpenStreetMap data. OSRM is not only able to provide street map based travel times and distances for cars, but also for pedestrians and bicycles. The MiD dataset does contain train and public transport trips, which may also be sampled as agents by the augmentation algorithm. Since OSRM does not provide railway routing, no OSRM based travel time or distance can be assigned to those trips, and an alternative approach is used in these cases, as described in Section 5.3. In the future, the framework could be extended to use data from OpenRailwayMap (https://www.openrailwaymap.org/) to fill this missing attribute.
A Survey on Packet Switching Networks
Published in IETE Journal of Research, 2022
Figure 27 The source routing concept is the base of segment routing (SR). The basic of SR is to forward the packet across the network. Any node on the network can have an ordered instructions list in the headers of the packets. The instructions of the list are used in steering the packets for forwarding and processing on their path in the network. There can be either single instruction or a sequence of instructions. The former is known as the segment, while the latter is called an SR policy or segment list. The segment can have either service requirements or topological requirements. The word segment shows that any network path going to the destination can be divided into segments. These segments are created by incorporating way-points. Either of these two ways can be used for including the segment list: including by source or by adding by the intermediate node. While the removing process can be accomplished by any node on the path towards the destination. This removing process supports the tunneling concept using the SR domain from ingress to egress nodes. Other interior Gateway protocols like MPSL, OSPF and IS-IS are leveraged by SR for flexible and efficient forwarding. However, the SR leverages the MPLS core network as SR is an efficient and faster way of forwarding traffic on a network.