EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 9, Problem P21P
Explanation of Solution
Need for the Leaky bucket specification (r, b) to wait:
“No”, the packet flow that conform the leaky bucket specification need not have to wait at the leaky bucket policer with the parameters r and b.
Reason:
- Consider the packet that is transmitted into the network.one packet requires one token for being transmitted.
- The flow that is conforms the leaky bucket will never need to wait...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
8. Consider the leaky bucket policer that polices the average rate and burst size of a
packet flow. We now want to police the peak rate, p, as well. Show how the output
of this leaky bucket policer can be fed into a second leaky bucket policer so that the
two leaky buckets in series police the average rate, peak rate, and burst size. Be sure
to give the bucket size and token generation rate for the second policer.
MCQ
1.Suppose 4 packets are received in a burst at a token bucket shaper, which has 1 token in the bucket at the time of arrival (t=0).
Tokens are refilled at the rate of 1 token per 5 time units, with the first of the (new) tokens arriving at time t=2.
Assume that the shaping buffer is very large.
At what times are the packets eventually transmitted?
Choose the most appropriate response. The choices list the scheduling times of the packets in order (packet 1, packet 2, packet 3, packet 4).
A:2, 7, 12, 17
B:5, 10, 15, 20
C:0, 2, 7, 12
D: 0, 5, 10, 15
In the generic SR protocol, the sender transmits a message as soon as it is available (if it is in the window) without waiting for an acknowledgment. Suppose now that we want an SR protocol that sends messages two at a time. That is, the sender will send a pair of messages and will send the next pair of messages only when it knows that both messages in the first pair have been received correctly.Supposethat the channel may lose messages but will not corrupt or reorder messages.
i) Outline an error-control protocol for the unidirectional rdt of messages.
ii) Give an FSM description of the sender and receiver.
iii) Describe the format of the packets sent between sender and receiver and vice versa.
iv) If you use any procedure calls other than those in SR protocol (for example, udt_send(), start_timer(), rdt_rcv(), and so on),clearly state their actions.
v) Give an example (a timeline trace of sender and receiver) showing how your protocol recovers from a lost packet
Chapter 9 Solutions
EBK COMPUTER NETWORKING
Ch. 9 - Prob. R1RQCh. 9 - Prob. R2RQCh. 9 - Prob. R3RQCh. 9 - Prob. R4RQCh. 9 - Prob. R5RQCh. 9 - Prob. R6RQCh. 9 - Prob. R7RQCh. 9 - Prob. R8RQCh. 9 - Prob. R9RQCh. 9 - Prob. R10RQ
Ch. 9 - Prob. R11RQCh. 9 - Prob. R12RQCh. 9 - Prob. R13RQCh. 9 - Prob. P1PCh. 9 - Prob. P2PCh. 9 - Prob. P3PCh. 9 - Prob. P4PCh. 9 - Prob. P5PCh. 9 - Prob. P6PCh. 9 - Prob. P7PCh. 9 - Prob. P8PCh. 9 - Prob. P9PCh. 9 - Prob. P10PCh. 9 - Prob. P11PCh. 9 - Prob. P12PCh. 9 - Prob. P13PCh. 9 - Prob. P14PCh. 9 - Prob. P15PCh. 9 - Prob. P16PCh. 9 - Prob. P17PCh. 9 - Prob. P18PCh. 9 - Prob. P19PCh. 9 - Prob. P20PCh. 9 - Prob. P21PCh. 9 - Prob. P22P
Knowledge Booster
Similar questions
- please answer with proper explanation and step by step solution.arrow_forwardTo ensure the quality of service, especially for multiple applications, regulating the rate at which packets are sent to the network is an important strategy. The leaky bucket is just one of such mechanisms. A flow of packets is said to conform to the leaky bucket specification (r, b), where r is the average rate and b is the burst rate, if the number of packets arriving at the leaky bucket is less than r*t + b in every time interval of t. What is the implication of that? What will happen if the number of packets arriving at the leaky bucket is equal to or greater than r*t + b?arrow_forwardWe 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…arrow_forward
- NAKs are handled in protocol 6's code for frame arrival.If the incoming frame is a NAK and another condition is satisfied, this section gets activated.Describe a situation in which this other condition is critical.arrow_forwardI need the answer as soon as possiblearrow_forwardWill there be any collision between two nodes for given scenario? Given that two nodes start to transmit a packet of length "L" at the same time at the rate "R". The propagation delay between the two nodes is "dprop".arrow_forward
- A sender with window size (W=3) is connected to a go back N receiver by a link with bandwidth =106 bytes/second and propagation delay of 0.25 msec. The receiver sends Positive ACK for correctly received in order packets. For each packet sent, the sender sets a timer with time out value of 5 msec. On receiving an ack for that packet, the timer is cancelled. If the timer expires, that packet is retransmitted immediately. Assume that the sender sends packets 1, 2, and 3 (at t=0, packet size =1000 Bytes) and packet 2 is lost. NO other packet is lost. Under this scheme , at what time (in msec) would all the packets been received at the receiver.arrow_forwardIt is possible for a series of packets to be sent from one host to another utilizing the same route between the hosts. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last for a certain period of time, while the other delay's length remains open?arrow_forwardIt is possible for a series of packets to be sent from one host to another over the same connection. Please break down the time it takes for a single package to go from beginning to conclusion. Is it expected that one of the delays would last a certain period of time while the other delay's length will be more malleable?arrow_forward
- As discussed in the OSI protocol stack, one way a data link layer handles transmission errors is by requesting damaged frames to be retransmitted (i.e. by sending a NACK, Not ACKnowledgment). If the frame arrived successfully, an ACK would be sent instead. Let probability of a frame being transmitted correctly be p. a) Find the probability, kq , of a frame requiring exactly k transmissions b) If p=0.3, what is the mean number of transmissions required to send a frame if acknowledgements (ACKS and NACKS) are never lost? Hint: If you don't already know this, the mean number would simply be: 1k k kq | = | And c) What if some NACKS are lost, would that increase or decrease (or not change) the mean number of transmissions to send a frame? Explain briefly.arrow_forwardAsaparrow_forwardIn a data communication system, several messages that arrive at a node are bundled into a packet before they are transmitted over the network. Assume that the messages arrive at the node according to a Poisson process with rate 30 messages per minute (0.5 per second). Five messages are used to form a packet.What is the mean time until a packet is formed, that is, until five messages arrive at the node?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education