by Dinesh Thakur Category: Routing

These are OSPF, IS-IS (Intermediate System to Intermediate System Intra-Domain Routing Exchange Protocol).

 
by Dinesh Thakur Category: Routing

The problem encountered while performing local routing may be summarized as follows:

 
by Dinesh Thakur Category: Routing

A Routing Algorithm is a method for determining the routing of packets in a node. For each node of a network, the algorithm determines a routing table, which in each destination, matches an output line. The algorithm should lead to a consistent routing, that is to say without loop. This means that you should not route a packet a node to another node that could send back the package.

 
by Dinesh Thakur Category: Routing

The major objective of network design is to select the network service and to determine the transmission speed for the system. Following are the typical examples of network using WAN and network services:

 
by Dinesh Thakur Category: Routing

Routing refers to the process of selecting the shortest and the most reliable path intelligently over which to send data to its ultimate destination. IP routing protocol makes the distinction between hosts and gateways. A host is the end system to which data is ultimately deliverable. An IP gateway, on the other hand, is the router that accomplishes the act of routing data between two networks. A router can be a specialized device supporting multiple interfaces connected to a different network or a computer multiple interfaces (commonly called a multihomed host) with routing services running in that computer.



 
by Dinesh Thakur Category: Routing

For routing in a network having two or more routers, routing tables are used to determine the destination to which a packet is to be forwarded. If two or m9re routes are available, the route that requires the least possible cost (link cost) should be selected so that the packet can be sent to the destination more quickly and more reliably. Cost can be generally considered as the number of routers via which the packet is to be sent. If changes are made to this network configuration, there are two methods to update the contents of routing tables, which will be described next.

 
by Dinesh Thakur Category: Routing

In a mesh network, the routing of packets is part of a complex algorithm, by the distribution of decisions, which are both space and time. A node should know the status of all the other nodes before deciding where to send a packet, which is impossible to achieve.

 
by Dinesh Thakur Category: Routing

IP addresses are assigned independently of the hardware addresses of the machines. To send a datagram on the Internet, the network software must convert the IP address into a physical address, used to transmit the frame.

 
by Dinesh Thakur Category: Routing

A parameter that controls how long a network switch or ROUTER will store learned IP addresses in its address table before discarding them for new ones.

 
by Dinesh Thakur Category: Routing

An Internet environment results from the interconnection of physical networks by routers. Each router is connected directly to two or more networks, hosts are generally connected to a single network, but this is not mandatory.

 

Page 2 of 3

About Dinesh Thakur

Dinesh ThakurDinesh Thakur holds an B.SC (Computer Science), MCSE, MCDBA, CCNA, CCNP, A+, SCJP certifications. Dinesh authors the hugely popular blog. Where he writes how-to guides around Computer fundamental , computer software, Computer programming, and web apps. For any type of query or something that you think is missing, please feel free to Contact us.



Search Content