Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
Question
Book Icon
Chapter 7, Problem P8P

a.

Program Plan Intro

Given scenario:

  • The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
  • If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
  • If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
  • The time is slotted, with a message transmission time taking exactly one time slot.

b.

Program Plan Intro

Given scenario:

  • The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
  • If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
  • If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
  • The time is slotted, with a message transmission time taking exactly one time slot.

c.

Program Plan Intro

Given scenario:

  • The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
  • If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
  • If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
  • The time is slotted, with a message transmission time taking exactly one time slot.

d.

Program Plan Intro

Given scenario:

  • The network consists of four wireless nodes A, B, C and D. The shaded region in the given figure is radio coverage of the four nodes and all the nodes share the same frequency.
  • If A transmits only send/ received by the node B; if B transmits both A and C can send/ receive from the node B; if C transmits both B and D can send/ receive from C; if D transmits only C can send/ receive from D.
  • If the node A wants to send the message to the node D, first a message send to the node B, which then sends to node C and finally a message reaches the targeted node D.
  • The time is slotted, with a message transmission time taking exactly one time slot.

e.

Explanation of Solution

  • Maximum rate which a data message can be transferred from C to A with ACK:
    • The maximum rate which a data message can be transferred from C to A is one message per four slots (1 message/ 4 slots), in slot 1 a message sends from A to B, in slot 2 a message sends from B to C, in slot 3 the ACK sends from C to B and in slot 4 the ACK sends from B to A.
  • Combined maximum rate which a data message can be transferred from A to B and D to C with ACK:
    • The combined maximum rate which a data message can be transferred from A to B and D to C are two ...

Blurred answer
Knowledge Booster
Background pattern image
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY