EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem P17P
a)
Program Plan Intro
Leaky Bucket:
The request that are available at the wide range are stored and organized such that the rate of the output packet is set for the transfer that happens to the network is called as leaky bucket
Working of leaky bucket:
- Leaky bucket consists of a bucket that can hold up to b tokens.
- Tokens are being added to the bucket.
- The tokens are generated at the rate r token per second.
- The bucket gets filled when it contains b less than tokens
- The new tokens are added into the bucket.
- If the bucket is full newly generated tokens are being ignored.
- The token bucket remains full with b tokens.
Policing the packet flow:
- Consider a packet is transmitted into the network, a token needs to be removed from the token bucket.
- If the token bucket is empty, the packets are required to wait for the token.
b)
Program Plan Intro
Leaky Bucket:
The request that are available at the wide range are stored and organized such that the rate of the output packet is set for the transfer that happens to the network is called as leaky bucket algorithm.
Working of leaky bucket:
- Leaky bucket consists of a bucket that can hold up to b tokens.
- Tokens are being added to the bucket.
- The tokens are generated at the rate r token per second.
- The bucket gets filled when it contains b less than tokens
- The new tokens are added into the bucket.
- If the bucket is full newly generated tokens are being ignored.
- The token bucket remains full with b tokens.
Policing the packet flow:
- Consider a packet is transmitted into the network, a token needs to be removed from the token bucket.
- If the token bucket is empty, the packets are required to wait for the token.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Write a program to simulate the behavior of the CSMA/CD protocol over Ethernet when ther are N stations ready to transmit while a frame is being transmitted. Your program should report the times when each station successfully starts sending its frame. Assume that a clock tick occurs every slot time (51.2 microsec) and a collison detection and sending of a jamming sequence takes one slot time. All frames are the maximum length allowed.
We observed that (n-1)D is the maximal delay in queuing if the fabric of switching is n times faster than the input line rate. Suppose all packets have the same duration, n packets are sent to n entry ports at the same time, and all n packets are sent to separate exit ports. What is the maximum delay for a memory packet?
(a) Suppose a server S and client C are connected over the Internet. The one-way prop-
agation delay from S to C is 50 ms. The maximum throughput between S and C is
R = 200 Mbps. A browser on client C makes an HTTP request for a webpage on server
S. The base HTML file is of size 500 KB and it references five objects, each of size
5 MB. Find the total response time for the client to receive the entire webpage using
nonpersistent HTTP with up to two parallel connections. Assume that when two par-
allel connections are active, the throughput for each connection is 40% of the maximum
throughput R.
(b) Suppose an application running on host ece.gmu.edu needs to resolve the domain name
cs.vtech.edu. Draw a diagram (with labels) showing the sequence of queries/responses
in a recursive DNS query to find the answer in a scenario where all levels of the DNS
hierarchy are involved.
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
- When we encode a signal (a stream of bits) in the physical layer, we convert the bits into different voltage levels. We have a choice of the signal level range, and how many different levels to use, but all communicating nodes must agree on the encoding scheme so that they may properly decode the signal later. For example, we might encode values as either 0 volts (OV) or 5 volts (5V), therefore using two signal levels. We might encode 0V, 10V, 20V, 30V, 40V, 50V and have six signal levels. There is no "correct" choice of encoding scheme for all situations. a) How would the distance of a link affect this decision? (The physical distance between two communicating machines which are using the same encoding scheme) b) In what way might cost be an issue when deciding the scheme?arrow_forwardWhen we encode a signal (a stream of bits) in the physical layer, we convert the bits into different voltage levels. We have a choice of the signal level range, and how many different levels to use, but all communicating nodes must agree on the encoding scheme so that they may properly decode the signal later. For example, we might encode values as either 0 volts (OV) or 5 volts (5V), therefore using two signal levels. We might encode 0V, 10V, 20V, 30V, 40V, 50V and have six signal levels. There is no "correct" choice of encoding scheme for all situations. a) How would the distance of a link affect this decision? (The physical distance between two communicating machines which are using the same encoding scheme) b) In what way might cost be an issue when deciding the scheme? Edit View Insert Formatarrow_forwardProblem 5: Draw a Mealy FSM to model a LAN adapter. Serial data packets entering the FSM are analyzed. The start of a packet is indicated by the arrival of two consecutive 0's on the input line . The next three bits are the machine address. The targeted addresses are 100 or 110 where an output = 1 is generated. Any other addresses produce a zero at the output. A separate reset mechanism will put the machine in the initial state (i.e, you should never return to the initial state in your design).arrow_forward
- Consider a half-duplex point-to-point link using a stop-and-wait scheme, in which a series of messages is sent, with each message segmented into a number of frames. Ignore errors and frame overhead. A. What is the effect on line utilization of increasing the message size so that fewer messages will be required? Other factors remain constant. B. What is the effect on line utilization of increasing the number of frames for a constant message size? C. What is the effect on line utilization of increasing frame size?arrow_forward2. As we saw in class, pipelining with 3 packets increased utilization by a factor of 3. Assuming all packets are the same size, as the number of packets in a pipeline, n, increases, at what point does the utilization become less than n times the utilization of one packet?arrow_forwardNAKs 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_forward
- A frame containing http request is sent from Computer (A) [in whichever subnet it is now, make sure to show it in your figure], to the access point it is associated with. Draw the address fields (1, 2, and 3) of the frame travelling from Computer A to AP and the source and destination addresses of the frame travelling from AP to R1. The MAC addresses of AP1, AP2, and AP3 are M1, M2, and M3 respectively, and the Router R1’s MAC address connected to this Switch/AP is MRA. IP address values are already given, and the port addresses could also be used as given. The Router’s MAC address facing WAN side is MRW.arrow_forwardConsider a full-duplex 256 Kbps satellite link with a 240 millisecond end-to-end delay. The data frames carry a useful payload of size 12,000 bits. Assume that both ACK and data frames have 320 bits of header information, and that ACK frames carry no data. What is the effective data throughput When using sliding windows with a sender window size of W = 5 data frames?arrow_forwardFor NAT Network Address Translation Scenario: Jenny Bello is a small business owner selling and making customized computer peripherals. She has been finding it difficult to track her sales and inventories, however recently after an expert's advice, she adopted a Point of Sale (PoS) server. So, she can now track her sales and inventories at the store. However, she ran into another issue, the server can only be accessed within the store, because it has been assigned a private IPv4 address, it is not publicly accessible via the Internet. a) Why is not having the PoS server accessible over the Internet a problem for the business? b) What caused this problem? c) Propose a solution for the problem and explain how the solution works.arrow_forward
- Frames of 1000 bits are sent over a 106 bps duplex link between two hosts. The propagation time is 25 ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). 1.1 What is the minimum number of bits (1) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.arrow_forwardConsider the switch shown below. Suppose that all datagrams have the same fixed length, that the switch operates in a slotted, synchronous manner, and that in one time slot a datagram can be transferred from an input port to an output port. The switch fabric is a crossbar so that at most one datagram can be transferred to a given output port in a time slot, but different output ports can receive datagrams from different input ports in a single time slot. What is the minimal number of time slots needed to transfer the packets shown from input ports to their output ports, assuming any input queue scheduling order you want (i.e., it need not have HOL blocking)? What is the largest number of slots needed, assuming the worst-case scheduling order you can devise, assuming that a non-empty input queue is never idle? Output port X → Switch fabric Output port Y Output port Z →arrow_forwardAs another example, consider a circuit-switched network that connects computers in two remote offices of a private company. The offices are connected using a T-1 line leased from a communication service provider. There are two 4 × 8 (4 inputs and 8 outputs) switches in this network. For each switch, four output ports are folded into the input ports to allow communication between computers in the same office. Four other output ports allow communication between the two offices. Figure shows the situationarrow_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 Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable 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