Types of topologies, Computer Networking

Assignment Help:

TWO DIFFERENT KINDS OF TOPOLOGIES:

LOGICAL TOPOLOGY:

 It is described by the specific network technology.

PHYSICL TOPOLOGY:

It relays on the wiring scheme.

NETWORK INTERFACE CARD AND WIRING SCHEMES:

1686_Types OF TOPOLOGIES.png

 

Figure 

To allow modifying the wiring without modifying the interface hardware, NICs support multiple wiring methods. it is given in the figure below.

 


Related Discussions:- Types of topologies

Explain about virtual circuit switching, Q. Explain about Virtual Circuit S...

Q. Explain about Virtual Circuit Switching? Virtual Circuit Switching - All packets belong to a message (or) session is preserved. - Single route is selected between s

Find the domain, Find the domain Name of 128.252.160.200

Find the domain Name of 128.252.160.200

Function of the transport system and workbench organizer, What is the funct...

What is the function of the transport system and workbench organizer? The function of the transport system and the Workbench Organizer is to handle any changes made to objects

Which protocol is used for booting diskless workstations, Reverse Address R...

Reverse Address Resolution Protocol - RARP is ARP's counterpart, but it resolves IP addresses to MAC addresses typically on diskless workstations.

Packet switching and virtual circuit packet switching, Describe Circuit swi...

Describe Circuit switching, Packet switching and Virtual Circuit Packet switching. Explain their suitability for different applications such as telephone and internet. Packet S

Explain about the integrating intranet, Explain about the Integrating Intra...

Explain about the Integrating Intranet These Intranets are designed to replace the complexity of in-house communications and processing systems that large organisations ofte

Illustrate addressing, Addressing Complicated addressing scheme because...

Addressing Complicated addressing scheme because there may be intermediate stations (APs), identified by flags

Shortest path - network layer and routing , Shortest path  The  dijkst...

Shortest path  The  dijkstra algorithms  four steps to discover what it called  the shortest path  tree . a.The algorithm  beings  to build  the tree identifying  its root.

Illustrate the bellman-ford algorithm, Illustrate the Bellman-Ford algorith...

Illustrate the Bellman-Ford algorithm The Bellman-Ford algorithm uses only on information from its neighbours and knowledge of its link costs, to update it costs and paths. Dij

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