KEMBAR78
Network Routing | Computer Science | PPTX
What is routing
Routing is the act of moving information across an
internetwork from a source to a destination.
Router
When one network is connected to another, a device called a
router connects both networks and passes data between them
Routing Algorithms
Shortest Path Algorithm: he idea is to build a graph of the network,
with each node of the graph representing a router and each edge of
the graph representing a communication line, or link.
Distance Vector Routing: A distance vector routing algorithm operates by
having each router maintain a table (i.e., a vector) giving the best known
distance to each destination and which link to use to get there.
Link State Routing: Distance vector routing was used in the ARPANET until
1979, when it was replaced by link state routing.
Distance vector
Link state
Routing Protocols
Routing Information Protocol: The Routing Information Protocol, or RIP,
as it is more commonly called, is one of the most enduring of all routing
protocols.
OSPF— An Interior Gateway Routing Protocol: The Internet is made up
of a large number of independent networks or Ases (Autonomous
Systems) that are operated by different organizations. Inside of its own
network, an organization can use its own algorithm for internal routing,
or intradomain routing, an intradomain routing protocol is also called an
interior gateway protocol. OSPF (Open Shortest Path First), became a
standard in 1990.
BGP—The Exterior Gateway Routing Protocol: Within a single AS,
OSPF and IS-IS are the protocols that are commonly used. Between ASes,
a different protocol, called BGP (Border Gateway Protocol), is used.
Hello Friend,
This was just a summary on Network Routing. For more detailed
information on this topic, please type the link given below or copy it
from the description of this PPT and open it in a new browser window.
www.transtutors.com/homework-help/computer-science/network-routing.aspx

Network Routing | Computer Science

  • 2.
    What is routing Routingis the act of moving information across an internetwork from a source to a destination.
  • 3.
    Router When one networkis connected to another, a device called a router connects both networks and passes data between them
  • 4.
    Routing Algorithms Shortest PathAlgorithm: he idea is to build a graph of the network, with each node of the graph representing a router and each edge of the graph representing a communication line, or link.
  • 5.
    Distance Vector Routing:A distance vector routing algorithm operates by having each router maintain a table (i.e., a vector) giving the best known distance to each destination and which link to use to get there. Link State Routing: Distance vector routing was used in the ARPANET until 1979, when it was replaced by link state routing. Distance vector Link state
  • 6.
    Routing Protocols Routing InformationProtocol: The Routing Information Protocol, or RIP, as it is more commonly called, is one of the most enduring of all routing protocols. OSPF— An Interior Gateway Routing Protocol: The Internet is made up of a large number of independent networks or Ases (Autonomous Systems) that are operated by different organizations. Inside of its own network, an organization can use its own algorithm for internal routing, or intradomain routing, an intradomain routing protocol is also called an interior gateway protocol. OSPF (Open Shortest Path First), became a standard in 1990. BGP—The Exterior Gateway Routing Protocol: Within a single AS, OSPF and IS-IS are the protocols that are commonly used. Between ASes, a different protocol, called BGP (Border Gateway Protocol), is used.
  • 9.
    Hello Friend, This wasjust a summary on Network Routing. For more detailed information on this topic, please type the link given below or copy it from the description of this PPT and open it in a new browser window. www.transtutors.com/homework-help/computer-science/network-routing.aspx