Eight data terminals statistically share the capacity of an outgoing link. Traffic iscombined from the eight terminals and then served first-come first served. An(M/M/1) queue with infinite buffer is assumed. Find the expected number ofpackets in the system and the expected waiting time in the following cases:a) A terminal generates a packet every 10 seconds, the link speed is1024 bits/sec, and packet length = 512 bits.b) Repeat (a) using finite buffer k=10 and compare your results to the infinitebuffer caseA;=1/10=1024 bits/512 bits = 28 terminalsOut1=(1/10)*8 = 0.81

The Handwritten Solution is given below:

Answered: Eight data terminals statistically…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. Consider the following protocol for adding money to a debit card. (i) User inserts debit card into debit card machine. (ii) Debit card machine determines current value of card (in dollars), which is stored in variable x. (iii) User inserts dollars into debit card machine and the value of the inserted dollars is stored in variable y. (iv) User presses enter button on debit card machine. (v) Debit card machine writes value of x + y dollars to debit card and ejects card. Recall the discussion of race conditions. This particular protocol has a race condition. a. What is the race condition in this protocol? b. Describe a possible attack that exploits the race condition. c. How could you change the protocol to eliminate the race condition, or at least make it more difficult to exploit?
4. a) Consider designing an ATM network with a leaky-bucket policer that ensures a virtual circuit does not send more cells than expected. Suppose a link has a first-in-first-out (FIFO) queue and carries traffic for two virtual circuits. The traffic on the first virtual circuit follows a leaky- bucket policer (with a bucket depth of 9 cells and a token rate of 100 cells/second) and can settle for best-effort service. The traffic on the second virtual circuit follows a leaky-bucket policer (with a bucket depth of one cell and a token rate of 100 cells/second) that cannot tolerate more than 100 milliseconds of delay in delivering each cell. Suppose the propagation delay on the link is 50 milliseconds. Analyse the smallest transmission rate R, in cells per second, that can satisfy the delay constraint, given that the link serves cells in FIFO order.
Consider a TCP connection with the following parameters: a) Initial ssthreshold = 4 segmentsb) Round Trip Time (RTT) = 10 millisecondsc) Timeout period = 40 millisecondsd) Segment size = 3900 bytesThe TCP connection was used to transfer 17 data segments. While sendingthe segments, data segment 7 and data segment 15 were lost the first timethey were sent (but arrived at the receiver properly when retransmitted).There were no other segment losses apart from the aforementioned. Assumethat data segments received out-of-order are buffered at the receiver. Whatis the average throughput obtained in sending all the data segments (inbytes/sec) including draw a diagram to show the communication process in detail.
Consider the following network with given line speeds and lengths: Assume the speed of light is 2×10^8 m/s, and that the processing and queuing delays are negligible. Node A sends a 1400-byte frame to node C through node B. Suppose Node A starts sending the first bit of the frame at t=0. Answer the following questions: a. At what time (t=?) node B receives the frame in full (i.e. the last bit)? b. After node B receives the frame in full, then it will start sending the frame to node C. Determine the time (t=?) when node C receives the frame in full. c. Suppose at this time node C sends a small acknowledgment back to node A. The transmission time for the acknowledgment is negligible. Calculate at what times (t=?) the acknowledgment arrives at nodes B and A. d. Assume after sending its frame, node A wait for the acknowledgment back from node C before sending the next frame. What is the average throughput (number of transmitted bits per second) of the data flow from node A to…
Calculate the total time required to transfer a 1.5-MB file in the following cases, assuming an RTT of 80 ms, a packet size of 1 KBdata, and an initial 2 RTT handshake before data is sent: The link allows infinitely fast transmit, but limits bandwidth such that only 20 packets can be sent per RTT. The bandwidth is infinite, but during the first RTT we can send one packet, during the second RTT we can send two packets, during the third we can send four, etc.
3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A = 850 and u 1000. Find the smallest value of B such that P(N > B) < e = 10¬4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B. 4. Consider the M/M/1 queue from Problem 3. (a) Find an expression for E[N], i.e., the average number of packets in the system in steady- state. For the values of A and µ specified in Problem 4(b), compute the value of E[N]. What happens when A→ µ? (b) Find an expression for Var[N], i.e., the variance…
6. Delays. A user in Madagascar, connected to the internet via a 100 Mb/s (b-bits) connection retrieves a 250 KB (B-bytes) web page from a server in Tokyo, where the page references three images of 500 KB each. Assume that the one-way propagation delay is 82 ms and that the user's access link is the bandwidth bottleneck for this connection. a. Approximately how long does it take for the page (including images) to appear on the user's screen, assuming non-persistent HTTP using a single connection at a time? (For this part, you should ignore queueing delay and transmission delays at other links in the network) How long does it take if the connection uses persistent HTTP (single connection)? b. c. Suppose that user's access router has a 4 MB buffer (B-byte) on the link from the router to the user. How much delay does this buffer add during periods when the buffer is full? d. Assume a cache rate of 45% on the information received by the user in Madagascar from the Tokyo server. How does…
Computer A is sending a 10 MByte long file to Computer B via packet-switching over two consecutive 100 Mbps links of 2000 km length each.Assume that the signal propagation speed on both links is 2 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1480 bytes and that Computer A fills each packet to the max, if possible. How long (in seconds) does it take Computer A to send out one packet of maximum length on the first link?
Given a M/M/1 queue, if the average inter-arrival time is Z seconds, the average packet service time is P, find: a. The probability an arriving packet has to wait in the queue b. The variance (o}) of the inter-arrival time The variance (o) of the packet service time d. The average number of packets in the system (i.e., in the queue + in the NIC) c.
Assume the following parameters for Go-Back-N (GBN): a) N = 5 b) Round Trip Time (RTT) = 10 milliseconds c) Retransmission Timeout period = 40 milliseconds d) Segment Size = 3300 bytes. Suppose that a sender sent 15 data segments, numbered 1 through 15, to a receiver using the GBN mechanism. Suppose that data segment 4 and data segment 10 were lost the first time the sender sent the segments (but reached the receiver correctly when retransmitted). Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all the data segments (in bytes/sec)? Draw a diagram to show the communication of the segments in detail.
as a possible congestion control mechanism in a subnet using virtual circuits internally, a router could refrain from acknowledging a received packet until (1) it knows its last transmission along the virtual circuit was received successfully and (2) it has a free buffer. for simplicity, assume that the routers use a stop-and-wait protocol and that each virtual circuit has one buffer dedicated to it for each direction of traffic. if it takes 7 sec to transmit a packet (data or acknowledgement) and there are n routers on the path, what is the rate at which packets are delivered to the destination host? assume that transmission errors are rare and that the host-router connection is infinitely fast.
In a two-phase, total-order multicast system, messages are sent in the following sequence from node S to G1 and G2. G1 and G2 are the members of the group. S sends m1 to G1 S sends m1 to G2 S sends m2 to G2 S sends m2 to G1 Use the basic implementation of the Lamport clock. The clock s at each node start at: S: 4, G1: 6, G2: 1. Show the exchange of messages and their acknowledgments in a clock diagram using the basic implementation of Lamport's clock. In which order and at what times are m1 and m2 delivered?

SEE MORE QUESTIONS

Recommended textbooks for you

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

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

SEE MORE TEXTBOOKS