Keywords : OSPF
European Journal of Molecular & Clinical Medicine,
2022, Volume 9, Issue 3, Pages 10755-10766
As the name suggests, this system is made up of a number of computers that share the resources that the network's nodes have. The computers interact with each other using the same protocols across digital links. There are several network topologies that may be used for these linkages, which are made up of telecommunication network technologies, such as physically wired, optical, and wireless radio-frequency means. Personal computers, servers, networking devices, and other specialised or general-purpose hosts are all examples of nodes in a computer network. Network addresses and hostnames may be used to identify them. Hostnames serve as node identifiers that may be easily remembered and are seldom modified after being assigned. For communication protocols like the Internet Protocol, network addresses are necessary.Computer networks may be categorised in a variety of ways, including by the medium used to transmit signals, bandwidth, the protocols used to arrange network traffic, the scale of the network, topology, traffic management mechanisms, and the purpose of the organisation.Access to the World Wide Web, digital video and music, shared usage of application and storage servers and printers/fax machines, as well as use of email and instant messaging programmes are all supported via computer networks. Protocols that define how routers interact with one other are known as routing protocols. These protocols let routers determine the most efficient path between two nodes on a computer network.We may say that routing algorithms are in charge of finding the most efficient route for communication. The language a router uses to communicate with other routers about the reachability and state of a network is known as a routing protocol. Routing and bridging are frequently used interchangeably.The main distinction between the two is that they are functioning in different layers. To get to a certain location, routing algorithms consider a variety of factors, including the present load on a route, its dependability, latency, and other metrics. First, it exchanges data with its local neighbours, and subsequently with everyone else on the network as a whole.