The Basics Of Opnet It

The primarys Of Opnet ItIn this lab we have followed the instructions that were prone in the tutorial from the help menu. We built two profits as the starting network that which is having 30 nodes and an internet innkeeper those be connected with opthalmic Fibre cables, and the second network that is having 15 nodes and it was connected to the first network with Optical fibre as comfortably. And we get out sight the runs resembling demoralize and DELAY for the first network and We provide repeat the alike aft(prenominal) connecting the second network to the same router. And we nates lionize in the represents. affinitys and limited review of the networksAll the circuit is been built by placing two networks one in first floor and second in the other floor. And we tick off up observe it in the graph clearly. count on 1 Both the networks in both first and second floorsBy the below form we can detect the hamper and Load on the horde. When it was not connected t o the second network the DELAY and LOAD are as shown in the project come in 2 Ethernet Delay (in sec) and Ethernet load (bits/sec) on the server nodeWhen the delay is observed in the server at that place is considerable delay , because server can receive all these nodes at the same magazine still the nodes are preceding(prenominal) the limit then there is a occur of delay in the server. write in code 3 This is the canvassd result of delay among primary floor and expansionWhen the delay is observed in the server there is LOAD, According to this analysis we can feel out that the distance increase in the network can increase the load . As headspring as the more round of nodes overly increases the load on server. recruit 5 this is the load (bit/sec) for first gear floor and expansionConclusion later on this lab we can learn the basics of the OPNET IT GURU .I faced some problems with the spoken communication and with registration of the softwares whiles installing .This lab helped me in creationing the small networks and affiliateing them and go out the results especially the load and delayLab 5_ automated teller machineASYNCHRONOUS TANSFER MODEA Connection-Oriented, Cell-Switching Technology foundingThe goal of this lab is to analyse and dig into the doing of Asynchronous Transfer Mode ATM adaptation layers and dish out dividees on the performance of the network. There are different layers such as AAL that go forth discuss in this lab and entrust provide volt service classes that can give a lot of useful nurture.ObjectiveTo examine the effect of Asynchronous Transfer Mode ATM. And provide QoS capabilities through its five service classes cosmic microwave background, VBR-rt, VBRnrt, ABR, and UBR. With CBR (constant bit rate). And support all sorts of operate, including persona, video, and data by progressment ATM. To study how the choice of the adaptation layer as well as the service classes can affect the performance of the diligen ces. functioningAs given in the manual raise a immature externalize after completing pieced the network initialized the network, configured the applications, followed by profiles were done. speckle in the subnets part first configure northwesterlyeast subnet was completed and wreak remaining subnets was added. later that choose the statistics was tested and configure the subterfuge was fixed. conterminous duplicate the new scenario was duplicated and boot it UBR_UBR. Finally unpick the make-believe was run and the view results and analyse. fingerbreadth 1 this the CBR_UBR scenario show 2 this the design of north east subnet visualize 3 4 indicate the run simulation.Figure 3Figure 4View the ResultsFigure 5 this is the voice draw that indicate the different delay between the CBR and UBRQuestions and suffices1) see the result we obtained regarding the voice Packet Delay Variation time. Obtain the graphs that compare the Voice mailboat finish up-to-end delay, the el ectronic mail transfer solvent time, and the file transfer communications protocol download response time for both scenarios. Comment on the results. sohWhen we observe the voice packet delay variation in the supra shown figure 5, it indicates the UBR makes delay for voice because of the service class as UBR is employ for all applications for ATM Adaption layer AAL5 . While CBR is using AAL2 and we can observe a very smooth service. So we can say that CBR service class is good for Voice applications and UBR service class is good for electronic mail and FTP applications.Figures 6, 7 8 show the graph which compares the Voice packet end-to-end delay ,the Email download response time, and the FTP download response time for both scenarios.Figure 6 in Voice Packer End_ to End Delay (sec)Figure 7 Email Download Response time (sec)Figure 8 the FTP Download Response Time (sec)By the voice packet end to end indicates that the CBR service is having higher quality when compared to UBR service.By Email download response time when compared responses from both the scenarios.From FTP responses when observed UBR_UBR the responses are beter when compared to CBR_UBR scenario. So as stated before from his graphs UBR is good for Email and FTP only if not good for Voice, CBR service is good for Voice.2) bring into being another scenario as a duplicate of the CBR_UBR scenario. Name the new scenario Q2_CBR_ABR. In the new scenario you should use the ABR class of service for data, i.e., the FTP and Email applications in the data stations. Compare the performance of the CBR_ABR scenario with that of the CBR_UBR scenario.Hints To stigmatise ABR class of service to a node, assign ABR Only to its ATM Application Parameters attribute and ABR precisely (Per VC get hold) to its Queue Configuration (one of the ATM Parameters). For all switches in the network (total of 6 switches), configure the Max_Avail_BW of the ABR queue to be 100% and the Min_Guaran_BW to be 20%.SolFigure 9, the delay variation for both CBR_UBR and Q2_CBR_ABR is similar that means ABR and CBR services are good quality service that uses for voice.Figure 9 this diagram of voice that indicates the delay variationFigure 10, the down load for CBR service is more than ABR service.Figure 10 this is time average for emailFigure 11, CBR and ABR services are having same FTP download response time.Figure 11 FTP3) Edit the FTP application defined in the Applications node so that its File size is double the current size (i.e., make it 100000 bytes preferably of 50000 bytes). Edit the EMAIL application defined in the Applications node so that its File Size is five times the current size (i.e., make it 10000 bytes instead of 2000 bytes). Study how this affects the voice application performance in both the CBR_UBR and UBR_UBR scenarios. (Hint to execute this straits, you might need to create duplicates of the CBR_UBR and UBR_UBR scenarios. Name the new scenarios Q3_CBR_UBR and Q3_UBR_UBR respectiv ely.)SolWhen we belittle the size of the file the QoS will improve, as the traffic congestion will decrese as in fig.13 and 14, the delay of voice time variation is same and the time average voice packet end to end is also same. And we can say as the decreasing of packet size can decrease traffic congestion.Figure 12Figure 13Figure 14ConcolusionAfter this lab analysing the of Asynchronous Transfer Mode (ATM), and ATM adaption layers and service classes and their effect on the performance of the network. And it taught me how to deal with different layers like ATM adaption layers(AAL).Laboratory_6 ( take out)RIP Routing info communications protocolObjective In this lab we can analyze and configure the Routing Information protocol. R.I.POverview Router has to check the packets destination divvy up and determine which output ports is the best choice to the address. By seeing the advancement give in router do the decision. And these algorithms are needed to build routing add-ins an d the forwarding tables. Basic problem of the routing to find the lowest- price path between two nodes, Where the cost of a path equals to the sum of costs of all edges that make the path. In this laboratory, we will build a network that utilizes RIP as its routing protocol. We will examine the routing tables generated in the routers, and also check that how RIPS is affected by link visitations. single-valued functionAt the first the scenario named as NO_ loser was created.Network was build by using ethernet4_ slip8_gtwy and 100BaseT_LAN objects along with bidirectional 100BaseT_LAN links.After completion router configuration, remaining LANs were added.Then the statistics were chosen to realize the performance of the RIP protocol.Then simulation process was performed. The intentional figure is given below Figure-1 RIP Network (No_ blow)And we have to design a Failure scenario for that duplicate the of scenario 1, with inclusion of link node trouble simulations as shown in figure -2.Figure-2 Rip Network (Failure)And after editing the attributes , which develop a link reverse between Router 1 and Router 2. Then simulation process was performed.Figure-3 Comparison of upshot of updates in adversity and No_Failure scenario.The above figures shows the number updates those are sent by the router to its routing table and when there is a failure to any other node connected to it as compared to the situation when there is no failure in any of the link.From the obtained graphs we can observe that for NO_Failure the number of updates decrease from 13 to 4 with time by approximately , because the routing table has already gathered information about neighboring nodes and after that only the information is updated that means updates being sent are little. The scenario is similar for failure in starting, but with time when the router senses link failure it again starts modify information in its routing table, the intensity of which is a little bit less then the time w hen it sensed the failure.RIP Trafic in No_Failure and Failure scenariosFigure-4 Comparison of RIP traffic sent in Failure and NO_Failure.Figure-5 Comparison for RIP sent traffic in failure and No Failure Scenarios.The above two graphs shows the comparison of RIP sent traffic in Failure and No_failure scenario. The above graphs the first represents overlaid comparison and second one is stacked comparison. The failure introduced into the RIP system changes the traffic sent signals and also the traffic authentic signals.ConclusionBy observing the results we can say that both No_failure and Failure scenarios are having different results and as the time taken for updating the Routing Information protocol is more for Failure scenario compared to NO_Failure scenario .Because the system require ac receiptledgement and pitch the packet and resend it that takes lots of time to updatingLAB 7_OSPFOpen Shortest course of action FirstA Routing communications protocol Based on the cerebrate-S tate AlgorithmIntroductionThis lab lets us to know the working method of OSPF(Open Shortest Path First Protocol). By some analysis and steps in order to know more about this.AimTo introduce the Open Shortest Path First (OSPF) routing protocol. And analyse the performance of the Open Shortest Path First (OSPF) routing protocol. Then set up a network that utilizes OSPF as its routing protocol. Analyse the routing tables generated in the routers. And observe how the resulting routes are affected by assigning sphere of influences and enabling load balancing.ProcedureBy following the steps in the maual we can create the new project is done as we can see in the figure 1Figure 1 create a new scinarioAfter Creating, Configure the Network, Initialize the Network, Configure the subsume addresss, Traffic Demands and figure the Routing Protocol and predictes were completed. After that Configure the Simulation was the obtained results of the run was put it in the figure 2 3.Figure 2 run thr ee simulationFigure 3 the result of simulationAfter getting the simulation result duplicate the present scenarios (Areas and Balanced Scenarios) and observe the results as shown in the figures 4,56ResultsFigure 4 No_Areas Scenario paths from router A to router CFigure 5 No_Areas Scenario paths from router B to router HFigure 6 Area scenarioFigure 7 the Balanced ScenarioAnswer the Question1) Explain why the Areas and Balanced scenarios result in different routes than those observed in the No_Areas scenario, for the same pair of routers.SolAs the A and C router link is created as a traffic congestion in No_Areas, the packets go to other shortest path A,D,E and C are smaller as compared to A and C. And the cost is also more for A and C when compared to A,D,E and C , those are like 15 for A,D,E and C and A and C is 20.By OSPF protocol the shortest path is chosen. As the loop back interface allows a server and client to communicate on same host by using TCp/Ip the traffic packets between router A and C in the Areas scenario are expanded ,the packet will pass through link router A and C.And as per the load building option the Path cost for A,C,E,G and H and path cost for B,A,D,F and H are equal, So the packet may choose any one.2) Using the simulation log, examine the generated routing table in Router A for each of the three scenarios. Explain the values depute to the Metric column of each route.Hints Refer to the View Results section in Lab 6 for information about examining the routing tables. You will need to set the globular attribute IP Interface Addressing Mode to the value railroad car intercommunicate/Exportand rerun the simulation. To determine the IP address information for all interfaces, you need to open the Generic information File that contains the IP addresses and associated with the scenarios.solNo_AreasCampus Network.RouterA,Campus Network.RouterC,163.64,0,RouterA RouterC,Campus Network.RouterA, Network.RouterA RouterD,Campus Network.RouterD,C ampus Network.RouterD RouterE,Campus Network.RouterE,Campus Network.RouterE RouterCCampus Network.RouterB,Campus Network.RouterH,168.59,1,RouterB RouterH,Campus Network.RouterB,Campus Network.RouterC RouterB,Campus Network.RouterC,Campus Network.RouterE RouterC,Campus Network.RouterE,Campus Network.RouterG RouterE,Campus Network.RouterG,Campus Network.RouterH RouterGCampus Network.RouterC,Campus Network.RouterA,169.09,2,RouterC RouterA,Campus Network.RouterC,Campus Network.RouterE RouterC,Campus Network.RouterE,Campus Network.RouterD RouterE,Campus Network.RouterD,Campus Network.RouterA RouterDCampus normal ROUTE TABLE pushover forRouter name Campus Network. (Router A)at time 600.00 secondsROUTE TABLE contentsDest. Address Subnet Mask next skim Interface Name Metric Protocol Insertion Time192.0.1.0 255.255.255.0 192.0.1.1 IF0 0 calculate 0.000192.0.3.0 255.255.255.0 192.0.3.1 IF1 0 Direct 0.000192.0.4.0 255.255.255.0 192.0.4.1 IF2 0 Direct 0.000192.0.12.0 255.255.255. 0 192.0.12.1 Loopback 0 Direct 0.000192.0.13.0 255.255.255.0 192.0.3.2 IF1 20 OSPF 36.496192.0.11.0 255.255.255.0 192.0.1.2 IF0 35 OSPF 36.496192.0.14.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.10.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.17.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.2.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.6.0 255.255.255.0 192.0.1.2 IF0 20 OSPF 36.496192.0.7.0 255.255.255.0 192.0.1.2 IF0 20 OSPF 36.496192.0.15.0 255.255.255.0 192.0.1.2 IF0 20 OSPF 36.496192.0.8.0 255.255.255.0 192.0.1.2 IF0 25 OSPF 36.496192.0.19.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.9.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.16.0 255.255.255.0 192.0.1.2 IF0 5 OSPF 36.496192.0.5.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.18.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496Areas scenarioCampus Network.RouterA,Campus Network.RouterC,163.64,0,RouterA RouterC,Campus Network.RouterA,Campus Network.RouterA RouterCCampus Network.RouterB,Campus Ne twork.RouterH,168.59,1,RouterB RouterH,Campus Network.RouterB,Campus Network.RouterC RouterB,Campus Network.RouterC,Campus Network.RouterE RouterC,Campus Network.RouterE,Campus Network.RouterG RouterE,Campus Network.RouterG,Campus Network.RouterH RouterGCampus Network.RouterC,Campus Network.RouterA,169.09,2,RouterC RouterA,Campus Network.RouterC,Campus Network.RouterE RouterC,Campus Network.RouterE,Campus Network.RouterD RouterE,Campus Network.RouterD,Campus Network.RouterA RouterDCOMMON ROUTE TABLE snapshot forRouter name Campus Network. Router Aat time 600.00 secondsROUTE TABLE contentsDest. Address Subnet Mask Next Hop Interface Name Metric Protocol Insertion Time192.0.1.0 255.255.255.0 192.0.1.1 IF0 0 Direct 0.000192.0.3.0 255.255.255.0 192.0.3.1 IF1 0 Direct 0.000192.0.4.0 255.255.255.0 192.0.4.1 IF2 0 Direct 0.000192.0.12.0 255.255.255.0 192.0.12.1 Loopback 0 Direct 0.000192.0.16.0 255.255.255.0 192.0.1.2 IF0 5 OSPF 36.496192.0.2.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.5.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.18.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.9.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.10.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.17.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.13.0 255.255.255.0 192.0.3.2 IF1 20 OSPF 36.496192.0.11.0 255.255.255.0 192.0.4.2 IF2 40 OSPF 36.496192.0.3.2 IF1 40 OSPF 36.496192.0.14.0 255.255.255.0 192.0.4.2 IF2 20 OSPF 36.496192.0.6.0 255.255.255.0 192.0.1.2 IF0 20 OSPF 36.496192.0.7.0 255.255.255.0 192.0.1.2 IF0 20 OSPF 36.496192.0.19.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.8.0 255.255.255.0 192.0.1.2 IF0 25 OSPF 36.496192.0.15.0 255.255.255.0 192.0.1.2 IF0 20 OSPF 39.238Balanced scenarioCampus Network.RouterA,Campus Network.RouterC,163.64,0,RouterA RouterC,Campus Network.RouterA,Campus Network.RouterA RouterD,Campus Network.RouterD,Campus Network.RouterD RouterE,Campus Network.RouterE,Campus Network.RouterE RouterCCampus Network.RouterB,Cam pus Network.RouterH,168.59,1,RouterB RouterH,Campus Network.RouterB,Campus Network.RouterC RouterB,Campus Network.RouterC,Campus Network.RouterE RouterC,Campus Network.RouterE,Campus Network.RouterG RouterE,Campus Network.RouterG,Campus Network.RouterH RouterGCampus Network.RouterB,Campus Network.RouterH,168.59,1,RouterB RouterH,Campus Network.RouterB,Campus Network.RouterA RouterB,Campus Network.RouterA,Campus Network.RouterA RouterD,Campus Network.RouterD,Campus Network.RouterD RouterF,Campus Network.RouterF,Campus Network.RouterF RouterHCampus Network.RouterC,Campus Network.RouterA,169.09,2,RouterC RouterA,Campus Network.RouterC,Campus Network.RouterE RouterC,Campus Network.RouterE,Campus Network.RouterD RouterE,Campus Network.RouterD,Campus Network.RouterA RouterDCOMMON ROUTE TABLE snapshot forRouter name Campus Network. Router Aat time 600.00 secondsROUTE TABLE contentsDest. Address Subnet Mask Next Hop Interface Name Metric Protocol Insertion Time192.0.1.0 255.25 5.255.0 192.0.1.1 IF0 0 Direct 0.000192.0.3.0 255.255.255.0 192.0.3.1 IF1 0 Direct 0.000192.0.4.0 255.255.255.0 192.0.4.1 IF2 0 Direct 0.000192.0.12.0 255.255.255.0 192.0.12.1 Loopback 0 Direct 0.000192.0.13.0 255.255.255.0 192.0.3.2 IF1 20 OSPF 36.496192.0.11.0 255.255.255.0 192.0.1.2 IF0 35 OSPF 36.496192.0.14.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.10.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.17.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.2.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.6.0 255.255.255.0 192.0.1.2 IF0 20 OSPF 36.496192.0.7.0 255.255.255.0 192.0.1.2 IF0 20 OSPF 36.496192.0.15.0 255.255.255.0 192.0.1.2 IF0 20 OSPF 36.496192.0.8.0 255.255.255.0 192.0.1.2 IF0 25 OSPF 36.496192.0.19.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.9.0 255.255.255.0 192.0.1.2 IF0 15 OSPF 36.496192.0.16.0 255.255.255.0 192.0.1.2 IF0 5 OSPF 36.496192.0.5.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496192.0.18.0 255.255.255.0 192.0.1.2 IF0 10 OSPF 36.496When we ob serve the tables both No_Area and Balanced are having same tables but they are different in Area scenario. And this occurs by some reasons like no traffic in between A and C and the area identifier ,the path will pass as per the identifier and table will be different .3) OPNET allows you to examine the link-state database that is used by each router to build the order graph of the network. Examine this database for Router A in the No_ Areas scenario. Show how Router A utilizes this database to create a map for the topology of the network and draw this map. (This is the map that will be used later by the router to create its routing table.)Hints To export the link-state database of a router, Edit the attributes of the router and set the yoke State informationbase Export parameter (one of the OSPF Parameters, infra Processes) to Once at End of Simulation. You will need to set the global attribute IP Interface Addressing Mode to the value Auto Addressed/Export. This will allow you to check the automatically assigned IP addresses to the interfaces of the network. (Refer to the notes of question 2 above.) After rerunning the simulation, you can check the link-state database by opening the simulation log (from the Results menu). The link-state database is available in Classes _ OSPF _ LSDB_Export.SolNo_Areas subsume State selective informationbase snapshot forRouter Name Router Aat time 600.00Router link ups Advertisements for Area 0.0.0.0 unite state advertisement list size 8-LSA sheath Router bear ons, cerebrate State ID 192.0.12.1, Adv Router ID 192.0.12.1 Sequence add 47, LSA Age 3LSA Timestamp 22.687 affiliate type butt Network, cogitate ID 192.0.12.1, get in touch Data 255.255.255.0, cogitate address 0, unite reference Point-To-Point, marry ID 192.0.16.1, tie-up Data 192.0.1.1, connectedness appeal 5, connective suit bottom Network, railroad tie ID 192.0.1.0, nexus Data 255.255.255.0, tangency cost 5, get in touch theatrical role Poi nt-To-Point, unify ID 192.0.13.1, intimacy Data 192.0.3.1, association salute 20, association font heart Network, railroad tie ID 192.0.3.0, unite Data 255.255.255.0, Link bell 20,Link typeface Point-To-Point, Link ID 192.0.14.1, Link Data 192.0.4.1, Link apostrophize 20,Link flake Stub Network, Link ID 192.0.4.0, Link Data 255.255.255.0, Link Cost 20,LSA Type Router Links, Link State ID 192.0.13.1, Adv Router ID 192.0.13.1 Sequence second 49, LSA Age 3LSA Timestamp 24.149Link Type Stub Network, Link ID 192.0.13.1, Link Data 255.255.255.0, Link Cost 0,Link Type Point-To-Point, Link ID 192.0.12.1, Link Data 192.0.3.2, Link Cost 20,Link Type Stub Network, Link ID 192.0.3.0, Link Data 255.255.255.0, Link Cost 20,Link Type Point-To-Point, Link ID 192.0.14.1, Link Data 192.0.11.1, Link Cost 20,Link Type Stub Network, Link ID 192.0.11.0, Link Data 255.255.255.0, Link Cost 20,LSA Type Router Links, Link State ID 192.0.14.1, Adv Router ID 192.0.14.1 Sequence exit 50, LSA Age 3 LSA Timestamp 24.149Link Type Stub Network, Link ID 192.0.14.1, Link Data 255.255.255.0, Link Cost 0,Link Type Point-To-Point, Link ID 192.0.12.1, Link Data 192.0.4.2, Link Cost 20,Link Type Stub Network, Link ID 192.0.4.0, Link Data 255.255.255.0, Link Cost 20,Link Type Point-To-Point, Link ID 192.0.18.1, Link Data 192.0.10.1, Link Cost 5,Link Type Stub Network, Link ID 192.0.10.0, Link Data 255.255.255.0, Link Cost 5,Link Type Point-To-Point, Link ID 192.0.13.1, Link Data 192.0.11.2, Link Cost 20,Link Type Stub Network, Link ID 192.0.11.0, Link Data 255.255.255.0, Link Cost 20,LSA Type Router Links, Link State ID 192.0.17.1, Adv Router ID 192.0.17.1 Sequence Number 52, LSA Age 4LSA Timestamp 24.239Link Type Stub Network, Link ID 192.0.17.1, Link Data 255.255.255.0, Link Cost 0,Link Type Point-To-Point, Link ID 192.0.16.1, Link Data 192.0.2.2, Link Cost 5,Link Type Stub Network, Link ID 192.0.2.0, Link Data 255.255.255.0, Link Cost 5,Link Type Point-To-Point, Link ID 192.0.19.1, Li nk Data 192.0.6.1, Link Cost 10,Link Type Stub Network, Link ID 192.0.6.0, Link Data 255.255.255.0, Link Cost 10,Link Type Point-To-Point, Link ID 192.0.15.1, Link Data 192.0.7.2, Link Cost 10,Link Type Stub Network, Link ID 192.0.7.0, Link Data 255.255.255.0, Link Cost 10,LSA Type Router Links, Link State ID 192.0.15.1, Adv Router ID 192.0.15.1 Sequence Number 51, LSA Age 5LSA Timestamp 24.239Link Type Stub Network, Link ID 192.0.15.1, Link Data 255.255.255.0, Link Cost 0,Link Type Point-To-Point, Link ID 192.0.17.1, Link Data 192.0.7.1, Link Cost 10,Link Type Stub Network, Link ID 192.0.7.0, Link Data 255.255.255.0, Link Cost 10,Link Type Point-To-Point, Link ID 192.0.19.1, Link Data 192.0.8.1, Link Cost 10,Link Type Stub Network, Link ID 192.0.8.0, Link Data 255.255.255.0, Link Cost 10,LSA Type Router Links, Link State ID 192.0.19.1, Adv Router ID 192.0.19.1 Sequence Number 129, LSA Age 5LSA Timestamp 27.687Link Type Stub Network, Link ID 192.0.19.1, Link Data 255.255.255.0, Link Cost 0,Link Type Point-To-Point, Link ID 192.0.17.1, Link Data 192.0.6.2, Link Cost 10,Link Type Stub Network, Link ID 192.0.6.0, Link Data 255.255.255.0, Link Cost 10,Link Type Point-To-Point, Link ID 192.0.15.1, Link Data 192.0.8.2, Link Cost 10,Link Type Stub Network, Link ID 192.0.8.0, Link Data 255.255.255.0, Link Cost 10,Link Type Point-To-Point, Link ID 192.0.18.1, Link Data 192.0.9.2, Link Cost 5,Link Type Stub Network, Link ID 192.0.9.0, Link Data 255.255.255.0, Link Cost 5,LSA Type Router Links, Link State ID 192.0.16.1, Adv Router ID 192.0.16.1 Sequence Number 130, LSA Age 3LSA Timestamp 27.688Link Type Stub Network, Link ID 192.0.16.1, Link Data 255.255.255.0, Link Cost 0,Link Type Point-To-Po