## Directed Acyclic Graph (DAG)

Moumita

Updated on 22-Feb-2021 11:57:05

DefinitionIn computer science and mathematics, a directed acyclic graph (DAG) refers to a directed graph which has no directed cycles.ExplanationIn graph theory, a graph refers to a set of vertices which are connected by lines called edges. In a directed graph or a digraph, each edge is associated with a ... Read More

## Shortest Path algorithm in Computer Network

Moumita

Updated on 22-Feb-2021 11:55:17

In computer networks, the shortest path algorithms aim to find the optimal paths between the network nodes so that routing cost is minimized. They are direct applications of the shortest path algorithms proposed in graph theory.ExplanationConsider that a network comprises of N vertices (nodes or network devices) that are connected ... Read More

## Flooding in Computer Network

Moumita

Updated on 22-Feb-2021 11:44:11

Flooding is a non-adaptive routing technique following this simple method: when a data packet arrives at a router, it is sent to all the outgoing links except the one it has arrived on.For example, let us consider the network in the figure, having six routers that are connected through transmission ... Read More

## Dijkstra’s algorithm to compute the shortest path through a graph

Moumita

Updated on 22-Feb-2021 11:38:19

DefinitionThe Dijkstra’s algorithm finds the shortest path from a particular node, called the source node to every other node in a connected graph. It produces a shortest path tree with the source node as the root. It is profoundly used in computer networks to generate optimal routes with the aim ... Read More

## Flooding versus Fixed Routing Algorithms

Moumita

Updated on 22-Feb-2021 11:25:54

Flooding and fixed routing are methods to transmit data packets from the source to the destination through a number of intermediate routers connected by transmission lines.Flooding is a non-adaptive routing technique following this simple method − when a data packet arrives at a router, it is sent to all the ... Read More

## Adaptive versus Non-Adaptive Routing Algorithms

Moumita

Updated on 03-Feb-2021 08:01:46

Routing Algorithms − A routing algorithm is a procedure that lays down the route or path to transfer data packets from source to the destination. There can be many paths from the source to the destination; routing algorithm mathematically computes the best path, i.e. “least – cost path”. Routing algorithms ... Read More

## Sink Tree in Computer Networks

Moumita

Updated on 03-Feb-2021 07:59:15

DefinitionSink trees of a given node in a computer network is a tree formed by connecting the node with all the other nodes of in the network with the optimal path, or more precisely the shortest path. Or, in other words, a sink tree is a minimal cost tree formed ... Read More

## The Optimality Principle in Computer Networks

Moumita

Updated on 03-Feb-2021 07:57:51

The optimality principle in computer networks is stated as follows −ExplanationThe purpose of a routing algorithm at a router is to decide which output line an incoming packet should go. The optimal path from a particular router to another may be the least cost path, the least distance path, the ... Read More

## Adaptive Routing Algorithms

Moumita

Updated on 03-Feb-2021 07:55:34

Adaptive routing algorithms, also known as dynamic routing algorithms, makes routing decisions dynamically while transferring data packets from the source to the destination. These algorithms constructs routing tables depending on the network conditions like network traffic and topology. They try to compute computes the best path, i.e. “least – cost ... Read More

## Non-adaptive Routing Algorithms

Moumita

Updated on 03-Feb-2021 07:51:35

Non-adaptive routing algorithms, also known as static routing algorithms, do not change the selected routing decisions for transferring data packets from the source to the destination. They construct a static routing table in advance to determine the path through which packets are to be sent.The static routing table is constructed ... Read More

Advertisements