Use the network diagram for the following questions. Repeaters, bridges, and switches are not counted as nodes. Everyone on a ring sees a message if it is sent on the ring. B Switch T1 T2 a. Identify the 3 different network structures that are shown in the figure. Ring, Bus, and Star b. Suppose A wants to send a message to C. How many nodes (not counting A) will see the message if T1 and T2 are repeaters? c. What if T1 and T2 are bridges? d. What is the length of the shortest path from A to B (include the switch, T1, and T2 in the length)? Will a packet always take this path? If not, what is the length of an alternative path?

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
100%

I think the answer for part B is 2, and for C is 1. For D I think it'll take the path of Switch, T1, then go clockwise around the ring, an alternative pathway would be to go counter-clockwise. Is this correct?

7. Use the network diagram for the following questions.
Repeaters, bridges, and switches are not counted as nodes. Everyone on a ring sees a
message if it is sent on the ring.
LA
B
Switch
T1
T2
a. Identify the 3 different network structures that are shown in the figure.
Ring, Bus, and Star
b. Suppose A wants to send a message to C. How many nodes (not counting A) will
see the message if T1 and T2 are repeaters?
c. What if T1 and T2 are bridges?
d. What is the length of the shortest path from A to B (include the switch, T1, and
T2 in the length)? Will a packet always take this path? If not, what is the length of
an alternative path?
Transcribed Image Text:7. Use the network diagram for the following questions. Repeaters, bridges, and switches are not counted as nodes. Everyone on a ring sees a message if it is sent on the ring. LA B Switch T1 T2 a. Identify the 3 different network structures that are shown in the figure. Ring, Bus, and Star b. Suppose A wants to send a message to C. How many nodes (not counting A) will see the message if T1 and T2 are repeaters? c. What if T1 and T2 are bridges? d. What is the length of the shortest path from A to B (include the switch, T1, and T2 in the length)? Will a packet always take this path? If not, what is the length of an alternative path?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Network Transmission Cabling
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education