L.S.A. (Link State Advertisement) are messages communicated in the OSPF (Open Shortest Path First) domain to other routers through multicast. They are sent from internal routers to the D.R. (Designated Router) or the B.D.R. (Backup D.R.) to announce the changes. The role of the DR is to provide a central point for exchanging OSPF information among several routers on the same broadcast ...
A graph is a non-linear data structure. It consists of several nodes, also referred to as vertices. The nodes of a graph are connected through edges. A graph in which there’s associated a sense of a specific direction with each edge is referred to as a directed graph. Directed graphs, from graph theory, are extensively used ...
ARP stands for Address Resolution Protocol. It is a crucial communication protocol in the Internet protocol suite. It is used for discovering the data link layer address, such as a MAC (Media Access Control) address, corresponding to a given network layer address (typically IPv4). In Internet Protocol Version 6 (IPv6) networks, the functionality of ARP ...
What is a segment tree?A flexible tree-based data structure that is used to effectively solve problems involving range query operations. Takeaways A Segment Tree is a data structure that allows answering range queries over an array effectively, while still being flexible enough to allow modifying the array. What is Segment Tree? A segment tree enters ...
Given an undirected graph containing ‘n’ nodes and ‘e’ edges. Determine whether or not the graph contains a cycle. Takeaways Worst-case time complexity of Depth first search for detecting the cycle in undirected graph is O(n) where n is the number of nodes. Example of problem. Consider the following image. It shows an undirected graph with a cycle. Now have a look at ...
A WebSocket is a full-duplex and bidirectional protocol used in the client-server communication channels. A WebSocket address starts with wss:// or ws://. It is a stateful protocol, implying that the connection between the server and the client is kept alive until either client or server terminates it. After closing the connection by either the server ...
The Diffie-Hellman Algorithm is a secure way of cryptographic keys exchange across a public channel. It was among the very first public-key protocols. Ralph Merkle came up with the Diffie-hellman key exchange and it was named after Whitfield Diffie and Martin Hellman. Within the fields of cryptography, DH (Diffie-Hellman) is the earliest example of public ...
In computer networking, a collision happens when multiple devices attempt to transfer data via a commonly shared circuit. In a common circuit, various devices may listen at the same time, but only one device at a time is allowed to transmit data. This requires that all other devices listen to the transmission. Many devices are ...
Throughput in computer networking is the rate of successful transmission of messages over a channel of communication, such as packet radio, Ethernet, etc. The data contained in these messages may be delivered through network nodes, or over logical or physical links. Throughput is mostly measured in B.P.S. (Bits Per Second). The throughput of a network ...
There exists a routing table in the Unix operating system consisting of several tuples that contain the I.P. (Internet Protocol) address of the network, the subnet mask, the IP address of the gateway, and the name of the interface. This information is required for forwarding packets to the exterior of the network for connecting to ...