My very first C++ program
#include <iostream>
using namespace std;
int main();
{
cout<<"This is a c++ program\n";
return 0;
}
using namespace std;
int main();
{
cout<<"This is a c++ program\n";
return 0;
}
Dynamic Routing Demonstration Using CISCO PACKET TRACER and RIP
Dynamic routing is all about configuring a network using dynamic routing protocols. Dynamic Routing Protocol is divided in to two main parts. 1.Interior Gateway Protocol 2.Exterior Gateway Protocol In this section will look at Interior Gateway Protocols. -this is an autonomous system and handled by only one admin. -this protocol is also divide into two parts, 1. Distant Vector Protocols(Bellman-Ford Algorithm) - distance is measured by `hop count` and use for simple networks 2. Link State Protocol(Dijkstra Algorithm) - this uses some other information like neighbour router info and this is best for complex network designs In this Scenario we are using Routing Information Protocol(RIP) as the dynamic routing protocol. So below mentioned diagram is the network plan for a small network. In this Network diagram, 192.168.10.0 , 192.168.30.0 , 192.168.20.0 , 10.0.0.0 , 11.0.0.0 are 5 different networks. Router 1, Route
Comments
Post a Comment