Case: Different Routing Protocols Essay

In the Network Design Paper I will explain how the University has recently leased a building in Adelphi, Maryland. The measurements of the University is 240 feet long, 95 feet wide and 30 feet tall and broken down to two different floors. This University will be used for education purposes of course, the facility will be made of six instructional labs, seven offices, library, five classrooms, a student lobby and a computer lab. There will be a server room on each floor. The purpose of this paper is to explain the design of the networks in this building. The student accessed computers will be set up on a separate network than the network that they staff will be using.

“Networks are all around us. They are in our walls, in the air. At schools, hotels, hospitals, even coffee shops. Always there, always on…This power exists today. In our routers. In our switches... . (Cisco, n.d.)

the routing protocol is simply flooding, S will broadest the data packets and then these data packets are rebroadcasted by every neighbor of S, and

The wireless local area network diagram uses a combination of three different topologies. The topologies represented are Ring, Star, and Mesh.

Presently consider node S that needs to focus a route to node D. The proposed LAR algorithms utilization flooding with one adjustment. Node S characterizes (certainly or expressly) a request zone for the route ask for A node advances a route ask for just in the case that it has a place with tie request zone. To build the likelihood that the route demand Will achieve node D, the request zone ought to incorporate the expected zone (depicted previously). Extra, the request zone might likewise incorporate different areas around the request zone. There are two purposes behind this:-

| Given a network topology of three or more routers with bandwidth designations, compare the metrics used during the route selection process and the resulting routing tables generated by the DUAL and SPF algorithms.

Ranges of Addresses – Class A, Class B and Class C and the private ranges

This protocol use Dijkstra algorithm. It maintains a complex data base, also called as link state database, which contains full information about the remote routers and the exact network topology. The goal from this protocol is to provide similar information about network connection to each router, so each router can calculate the best route to each network this is happen when each router generates information about itself and pass these information to other routers in the network so each router make a copy of this information without changing it.

The work that will be performed will include the design and installation of a fully switched star network. This includes the installation and setup of all the network devices, cabling and interfaces but may be limited to workstations, devices, servers, switches, routers, racks and all related software.

DSDV is a proactive, hop-by-hop distance vector routing protocol where the routing table is maintained by each and every network node. The routing table consists of all the nodes required to reach destination also including the nodes to which packets are not sent. The routing table is kept updated at every time after each entry. In order to avoid the routing loops, DSDV uses the concept of sequence numbers to maintain the originality of route at all times. For the network in figure. 1 below, the routing table for node A can be seen in table. 1 which contains information about all possible paths reachable by node A, along with the next hop, number of hops and sequence number.

In simulated network the source node designated as1 initiates the routing procedure by sending RREQ or Route Request message to its surrounding nodes. The RREQ message sent by the source node is denoted in the color green. The other RREQ messages are shown in cyan, yellow, black etc. The source node 1 is sending the RREQ message to its neighbour nodes 5, 6, 9, 11 and 13 and the links are formed shown by the green line. Every time node 5,6,9,11,13 is sending the RREQ message to its neighbour and the links are formed.

Create a summary static route for R1 in figure 1 for the 3 LANs it has attached. Use the steps from your text Chapter 2 page 125: Calculating a Summary Route.

Step 1: Construct a network diagram for the project. (NOTE: EF for activity H should be 19)

The purpose of this paper is to provide a better understanding of switching and routing used in a network environment and familiarize the reader with various hardware and software associated with there functions. This paper will look at some switching concepts that will include store and forward switching, cut through switching, fragment free switching, and V-Lan. This paper will also cover routing concepts, along with some comparisons including routed vs. routing protocols, Classful vs. classless protocols, and distance vector vs. link state protocols.

Key tools utilized, variable length subnet masking and route summarization are explained as well. Here choosing the appropriate routing protocol is equally critical for a successful design. To implement different masks for the same major network it is necessary to have a routing protocol that supports VLSM. Such routing protocols are called classless routing protocols. They carry the mask information along with the route advertisements therefore allowing for the support of more than one mask.