1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
PtichkaEL [24]
4 years ago
3

Consider a point to point link 50 km in length. At what speed would propagation delay (at a speed 2 x 108 meters/second) equal t

ransmit delay for 100 byte packets.
Computers and Technology
2 answers:
Colt1911 [192]4 years ago
4 0

Answer:

The complete question is here:

Consider a point-to-point link 2 km in length. At what bandwidth would propagation delay (at a speed of 2 x 108 m/s) equal transmission delay for

(a) 100-byte packets?

(b) 512-byte packets?

Explanation:

Given:

Length of the link = 50 km

Propagation delay = distance/speed = d/s

To find:

At what speed would propagation delay (at a speed 2 x 10^8 meters/second) equal transmit delay for 100 byte packets?

Solution:

Propagation Delay = t prop

                                 = 50 * 10^3 / 2 * 10^8

                                 = 50000 / 200000000

                                 = 0.00025

                                 = 25 ms

(a) When propagation delay is equal to transmission delay for 100 packets:

Transmission Delay = packet length / data rate = L / R

So when,

Transmission Delay = Propagation Delay

100 * 8  / bits/sec = 50 * 10^3  / 2 * 10^8

Let y denotes the data rate in bit / sec

speed = bandwidth = y bits/sec

         100 * 8  / y bits/sec = 50 * 10^3  / 2 * 10^8

                        y bit/sec   =  100 * 8  / 25 * 10^ -5

                                         = 800 / 0.00025

                                     y  = 3200000 bit/sec

                                      y = 3200 Kbps

(b) 512-byte packets

512 * 8  / y bits/sec = 50 * 10^3  / 2 * 10^8

                        y bit/sec   =  512 * 8  / 25 * 10^ -5

                                         = 4096 / 0.00025

                                     y  = 16384000 bit/sec

                                      y = 16384 Kbps

Dmitriy789 [7]4 years ago
3 0

Answer:

The bandwidth is 3200 Kbps

Explanation:

Given:

The length of the point to point link = 50 km = 50×10³ = 50000 m

Speed of transmission = 2 × 10⁸ m/s

Therefore the propagation delay is the ratio of the length of the link to speed of transmission

Therefore,  t_{prop} = \frac{distance}{speed}

t_{prop} = \frac{50000}{2*10^{8} }=2.5*10^{-4}

Therefore the propagation delay in 25 ms

100 byte = (100 × 8) bits

Transmission delay = \frac{(100*8)bits }{(x)bits/sec}

If propagation delay is equal to transmission delay;

\frac{(100*8)bits }{(x)bits/sec}= \frac{50000}{2*10^{8} }

x=\frac{100*8*2*10^{8}  }{50000}

x=\frac{100*8}{2.5*10 ^-4}=3200000

x = 3200 Kbps

You might be interested in
Mix ‘em Let s1 and s2 be 2 c-strings of the same length. Write a function char* mixem(char*s1, char* s2) which returns a c-strin
Shkiper50 [21]

Answer:

See Explaination

Explanation:

#include <iostream>

#include <string.h>

using namespace std;

char *mixem(char *s1, char *s2);

int main() {

cout << mixem("abc", "123") << endl;

cout << mixem("def", "456") << endl;

return 0;

}

char *mixem(char *s1, char *s2) {

char *result = new char[1 + strlen(s1) + strlen(s2)];

char *p1 = s1;

char *p2 = s2;

char *p = result;

while (*p1 || *p2) {

if (*p1) {

*p = *p1;

p1++;

p++;

}

if (*p2) {

*p = *p2;

p2++;

p++;

}

}

*p = '\0';

return result;

}

5 0
4 years ago
Give a recursive version of the algorithm Insertion-Sort (refer to page 18 in the textbook) that works as follows: To sort A[1..
Inga [223]

Answer:

see explaination

Explanation:

void insertion( int e,int *x, int start, int end)

{

if (e >= x[end])

x[end+1] = e;

else if (start < end)

{

x[end+1] = x[end];

insertion(e, x, start, end-1);

}

else

{

x[end+1] = x[end];

x[end] = e;

}

}

void insertion_recurssion(int *b, int start, int end)

{

if(start < end)

{

insertion_sort_recur(b, start, end-1);

insertion(b[end], b, start, end-1);

}

}

void main()

{

insertion_recurssion(x,0,5);

}

3 0
3 years ago
A foreign exchange student brought his desktop computer from his home in Europe to the United States. He brought a power adapter
lidiya [134]
The European plug takes up 220 volts while the American one takes 110 volts.
6 0
3 years ago
Why is it helpful hat the ribbon tabs can collapse
UkoKoshka [18]
This is helpful in order to have a larger space to work in.

Being able to collapse the ribbon gives the user a larger document to work with instead of focusing on what they’re typing as well as extra effects.

Hope this helps!
4 0
3 years ago
A startup is developing a new web browser with a focus on accessibility for visually impaired users. The startup founder is cons
gavmur [86]

Answer:

A license that allows developers to change and share the source

code of the licensed software

Explanation:

i learned this, btw brainly stop removing my answers

7 0
3 years ago
Other questions:
  • Where should you look to find contact information about a company? I. on the company website II. at your local library III. in t
    11·2 answers
  • A hub or ____ is a central point that connects several devices in a network together.
    11·1 answer
  • Drag each label to the correct location on the image.
    10·1 answer
  • Give the algorithm and flowchart for following C code:
    6·1 answer
  • In order for bitlocker to protect the system volume without the aid of an external drive, your computer must:
    12·2 answers
  • 5 características de la obsolescencia programada...
    7·1 answer
  • How do I write my name in binary code?
    5·1 answer
  • In a network, servers receive requests from which of the following?
    7·2 answers
  • Discuss how a lack of infrastructure in poor communities could contribute to ill-health such as the Unrest looting.​
    9·1 answer
  • Look at the code below. What does it do?
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!