Moumita has Published 149 Articles

What are Hub and Switch in Computer Network?

Moumita

Moumita

Updated on 02-Sep-2023 12:19:27

62K+ Views

HubsA hub is a physical layer networking device which is used to connect multiple devices in a network. They are generally used to connect computers in a LAN.A hub has many ports in it. A computer which intends to be connected to the network is plugged in to one of ... Read More

Directed Acyclic Graph (DAG)

Moumita

Moumita

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

14K+ Views

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

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

Moumita

Moumita

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

20K+ Views

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

Moumita

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

2K+ Views

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

Moumita

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

5K+ Views

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

Moumita

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

7K+ Views

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

Adaptive Routing Algorithms

Moumita

Moumita

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

8K+ Views

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

Moumita

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

5K+ Views

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

Comparison of Virtual-Circuit and Datagram Networks

Moumita

Moumita

Updated on 15-Jan-2021 06:25:23

8K+ Views

Virtual – circuit and datagram networks are categories of packet switching network. In virtual circuits, a virtual path is established between the source and the destination systems through which the data packets are transferred from the source to the destination. In the other hand, in datagram networks, each data packet ... Read More

Multi-Protocol Label Switching (MPLS)

Moumita

Moumita

Updated on 15-Jan-2021 06:20:36

3K+ Views

Multiprotocol Label Switching (MPLS) is a routing technique that augments speed and control of the network traffic by directing data from one node to the next node based on short path labels. Instead of being routed using long network addresses, the data packets are routed through path labels that identify ... Read More

Advertisements