EBK COMPUTER NETWORKING
EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
Expert Solution & Answer
Book Icon
Chapter 6, Problem P20P

a.

Explanation of Solution

Given:

Frames have constant length (L) = kRS

Where;

k – Constant value

R – Transmission rate

S – Length of the slot

Consider that the propagation delay is less than the length of the slot.

To find: Efficiency of the protocol for the fixed “N” (Nodes) and “p” (probability).

Solution:

Consider the random variable “A” that denotes the number of slots is P(A=m)=β(1-β)m-1. Here, β is the probability of success.

This is considered as the geometric distribution, which has the mean 1β. The consecutive wasted slots is W = A - 1. That is,

x = E[W]

Substitute the value of “W” in the above equation. We get,

x = E[A-1]x = 1-βββ=Np(1-p)N-1

Formula to find the efficiency is: x=kk+x

b.

Explanation of Solution

Given:

Frames have constant length (L) = kRS

Where;

k – Constant value

R – Transmission rate

S – Length of the slot

Consider that the propagation delay is less than the length of the slot.

To find: To find the probability (p) that maxims the efficiency for the fixed number of nodes (N).

Solution:

By minimizing “x”, the efficiency can be maximized which is equivalent to maximize β

c.

Explanation of Solution

Given:

Frames have constant length (L) = kRS

Where;

k – Constant value

R – Transmission rate

S – Length of the slot

Consider that the propagation delay is less than the length of the slot.

To find: Efficiency that approaches to infinity.

Solution:

We know that: Efficiency = kk+1-Np(1-p)N-1Np(1-p)N-1

Substitute 1e for Np(1-p)N-1

d.

Explanation of Solution

Given:

Frames have constant length (L) = kRS

Where;

k – Constant value

R – Transmission rate

S – Length of the slot

Consider that the propagation delay is less than the length of the slot.

To find: Efficiency that approaches to 1...

Blurred answer
Students have asked these similar questions
Computer Science A Go-Back-N (GBN) ARQ scheme has been designed with window-size W = 10 such that it is fully efficient when there are no errors on the channel. Assume that frame size is 20000 bits and the overhead bits are negligible. What is the bit probability error (as seen at Layer 2) that makes the Go-Back-N ARQ 50% efficient?
Computer A uses the Go-back-N ARQ protocol to send a 110 Mbytes file to computer B with a window size of 15. Given each frame carries 100K bytes data. How long does it take to send the whole file (the total time taken from A sending the first bit of the file until A receiving the last acknowledgment)? Given that the transmission rate of the link is 500 Mbps and the propagation time between A and B is 15ms. Assume no data or control frame is lost or damaged and ignore the overhead due to header and trailer.
We compress the video with the pattern GoP (16 : 3) by using MPEG coding. Assume that the average compression ratios of frame I, frame P, and frame B are 1:5, 1:20, and 1:60, respectively. We put the compressed frames in 512 B packets and send them. The header size of each packet is 5% of the size of packet. Each packet contains information on one frame and its header, Each frame can be sent in multiple packets. Picture resolution is 196 × 144 for a video at 32 fps. (a)What is the compression ratio in this pattern? (b)What is the order of coding and transmitting frames in this pattern? (c)If frame 6 is lost while transmission, which frames will be faulty? (d)If frame 5 is lost while transmission, which frames will be faulty? (e)If frame 17 is lost while transmission, which frames will be faulty? (f)Find the size of uncompressed image frame? (g)In how many packets can an I-frame be transmitted on average? (h)In how many packets can an I-frame be transmitted on average? (i)In how many…
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education