Computer network

1 vote
302 views

Token bucket mechanism is used for congestion control at router . Bucket capacity is 700 bytes (initially full), token arrival rate is 200 bytes/sec and maximum output rate is 300 bytes/sec. The amount of time in sec required to transmit 3000 bytes file is _____________________

MY SOLUTION

c= 700 bytes

M= 300 bytes /sec

R= 200 bytes/sec

T =  c / (m-r)

700 / (300-200) =  700 / 100  = 7 sec

data sent = 300 bytes /sec * 7 sec = 2100

remaining data = total data - data sent

3000 - 2100 = 900

t = 900 / (300-200) = 900/100 = 9sec

therefore 7sec + 9sec = 16sec

SOLUTION GIVEN

c= 700 bytes

M= 300 bytes /sec

R= 200 bytes/sec

T =  c / (m-r)

700 / (300-200) =  700 / 100  = 7 sec

data sent = 300 bytes /sec * 7 sec = 2100

remaining data = total data - data sent

3000 - 2100 = 900

t = 900 / 200 = 4.5sec

therefore 7sec + 4.5sec = 11.5sec

CAN someone help with the correct one

2
After empty; transfer rate will be $200$ bytes/sec which is equal to input rate.

You are using effective emptying ($100$ bytes/sec  valid only when the buffer was having extra tokens) rate for remaining $900$ Bytes. which is wrong.
1
you may consider this QS...although you have used the correct formula for the first part.
https://gateoverflow.in/100232/token-bucket-gate-2016-question
0
u mean if the bucket wasnt initially full, then even for the first part it would have been 200 and not 100?
0
yes..!
0
thank you :)

Related questions

1 vote
1
147 views
Consider Dijkstra's algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link connecting $u$ to $v.$ Ram then implements the rest of the algorithm correctly, aiming to produce minimum cost ... and link costs where all routing table entry will be correct. $D)$ Both $A)$ and $B)$ How Dijkstra working here?
Consider a very large network $10000$ routers. Two host $A$ and $B$ connected with this network. Host $A$ sends a data to host $B$. and after some unit of time host $A$ receives $ICMP$ time exceed message for the samedata packet. The number of router ... some distance some ICMP message generated? Say if $ICMP$ message generated in $9999th$ router, then where it give error of time exceed message?
A Go-Back-5 ARQ scheme is employed on a 200 meters cable between two nodes A and B to send frames of size 10,000 bits with bit rate 1 Mbps and bit error probability of 10$^{-5}$. Headers and acknowledgements are 20 bytes each. The Speed of propagation of ... parameter (except for the cable length), what is the maximum distance between the two nodes for which S&W will be as efficient as a GBN.