Configure the management interface- spanning tree protocol, Computer Networking

Assignment Help:

6_CCNA.png

Configure the management interface address on all three switches. 

S1(config)#interface vlan1

S1(config-if)#ip address 172.17.10.1 255.255.255.0

S1(config-if)#no shutdown

S2(config)#interface vlan1

S2(config-if)#ip address 172.17.10.2 255.255.255.0

S2(config-if)#no shutdown

S3(config)#interface vlan1

S3(config-if)#ip address 172.17.10.3 255.255.255.0

S3(config-if)#no shutdown

Verify that the switches are correctly configured by pinging among them. From S1, ping the management interface on S2 and S3. From S2, ping the management interface on S3. 

Were the pings successful?

If not, troubleshoot the switch configurations and try again.  

 

 

 


Related Discussions:- Configure the management interface- spanning tree protocol

Explain the two modes of ip security, Question 1 Describe the architecture...

Question 1 Describe the architecture and usage of ISDN Question 2 Write about different network structures in use Question 3 Explain the concept of framing in Data Li

Building routing tables, There are basically two functions for creating rou...

There are basically two functions for creating routing tables, which are as given: Manual entry Software Further there are two types for computing routing table inf

Describe the concept of successor and feasible successor, Describe the conc...

Describe the concept of successor and feasible successor?

Show the drawbacks of go-back-N, Q. Show the Drawbacks of Go-back-N? D...

Q. Show the Drawbacks of Go-back-N? Drawbacks of Go-back- N - Inefficient - Every out of order received packets are discarded (receiver side is simplified) - This

packing -unpacking data with parallel virtual machine , Packing and Unpack...

Packing and Unpacking Data pvm_packs - Pack the active message buffer with arrays of prescribed data type: int info = pvm_packf( const char *fmt, ... ) int info = pv

Shortest path tree and minimum-spanning tree, We studied Dijkstra's link-st...

We studied Dijkstra's link-state routing algorithm for computing the unicast paths that are individually the shortest paths from the source to all destinations. The union of these

Bluej programming, i have been given a question:- any 50 numbers are given ...

i have been given a question:- any 50 numbers are given and to find out the 1)frequency of odd and even numbers 2)frequency of positive and negative numbers

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd