Dont dont dont dont post copied content sure strict action skip if dont know A new architecture, with N layers, is proposed. User application at the top layer generates a message of Mbytes. At each layer, an H bytes header is added. The second layer of that architecture also adds T bytes trailer.In this architecture, the message M is not divided into smaller packets at any layer.• What is the size of the final message (in bytes) transferred by the lower layer?• If we consider the headers and trailers to be an overhead, what is the percentage of such overhead tothe total size of the final message?

A new architecture, with N layers, is proposed. User application at the top layer generates a message of M bytes. At each layer, an H bytes header is added. The second layer of that architecture also adds T bytes traile

A new architecture, with N layers, is proposed. User application at the top layer generates a message of M bytes. At each layer, an H bytes header is added. The second layer of that architecture also adds T bytes traile

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 8P

See similar textbooks

Similar questions

Consider sending a file of F bits over a path of Q links. Each link transmits at R bits per second (bps). The network is lightly loaded so that there are no queueing delays. When a form of packet switching is used, the F bits are broken up into packets, each packet with L bits, of which h bits of it are header. Propagation delay is negligible. Let F = 5x104, Q = 20, R = 1 Mbps, L = 1000, and h = 10. b) Suppose the network is a packet-switched datagram network and a connectionless service is used. How long does it take to send the file?
This elementary problem begins to explore propagation delay and transmission delay, two central concepts in data networking. Consider two hosts, A and B, connected by a single link of rate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagation speed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B. a. Express the propagation delay, dprop, in terms of m and s.b. Determine the transmission time of the packet, dtrans, in terms of L and R.c. Ignoring processing and queuing delays, obtain an expression for the end-to-end delay.d. Suppose Host A begins to transmit the packet at time t = 0. At time t = dtrans, where is the last bit of the packet?e. Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit of the packet?f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit of the packet?g. Suppose s = 2.5 * 108 meters/sec, L = 120 bits, and R = 0.112 Mbps. Find the distance m…
. Suppose we have two network entities, A and B. B has a supply of data messages that will be sent to A according to the following conventions. When A gets a request from the layer above to get the next data (D) message from B, A must send a request (R) message to B on the A-to-B channel. Only when B receives an R message can it send a data (D) message back to A on the B-to-A channel. A should deliver exactly one copy of each D message to the layer above. R messages can be lost (but not corrupted) in the A-to-B channel; D messages, once sent, are always delivered correctly. The delay along both channels is unknown and variable. Design (give an FSM description of) a protocol that incorporates the appropriate mechanisms to compensate for the loss-prone A-to-B channel and implements message passing to the layer above at entity A, as discussed above. Use only those mechanisms that are absolutely necessary
In a bit-oriented link-layer protocol, the start and end of a frame are each marked by a flag, which is a sequence of exactly 6 consecutive 1 bits. Bit stuffing is used during the rest of the frame: after sending 5 consecutive 1 bits, a 0 is added. The bits below contain an example frame, with the leftmost bit received first. The content of the frame is a sequence of bytes, sent most significant bit first. Put the values of the first four bytes of the frame content, in order, in the four answer boxes below. You may enter the values in either decimal (e.g. 76, 123) or hexadecimal (e.g. 2a, f7). 00101011111010001111110011100111110000111101111101010110100010010011111101101100100 57−240−123−229
This elementary problem begins to explore propagation delay and transmission delay, twocentral concepts in data networking. Consider two hosts, A and B, connected by a single link ofrate R bps. Suppose that the two hosts are separated by m meters, and suppose the propagationspeed along the link is s meters/sec. Host A is to send a packet of size L bits to Host B.a. Express the propagation delay, dprop, in terms of m and s.b. Determine the transmission time of the packet, dtrans, in terms of Land R.c. Ignoring processing and queuing delays, obtain an expression for the endto-end delay.d. Suppose Host A begins to transmit the packet at time t = 0. At time t = dtrans,where is the last bit of the packet?e. Suppose dprop is greater than dtrans. At time t = dtrans, where is the first bit ofthe packet?f. Suppose dprop is less than dtrans. At time t = dtrans, where is the first bit ofthe packet?g. Suppose s = 2.5 · 108, L = 120 bits, and R = 56 kbps. Find the distance mso that dprop equals…
In a byte-oriented link layer protocol, the receiver adds all the bytes between the start and end marker bytes (not including those markers) modulo 239, and expects to get a result of 0 if there have been no errors. The byte immediately before the end marker is a checksum, chosen at the transmitter to make this possible. The probability of an error in any received bit is 0.00075 . The total length of the frame is 205 bytes (including start and end markers). Estimate the probability of errors occurring in the received frame but not being detected. You need to consider what combinations of bit errors could cause the error detection system to fail (i.e, conclude that there are no errors). As you are asked for an estimate, you need only consider the most likely scenarios - it is safe to ignore events that could only occur with much lower probability. Round your answer to three significant figures. As the probability will be very low in some cases, you may have to enter up to 7 digits after…
In this example, assume that the fixed path is used to transport a packet from a source to an address at the other end of the network. List the many components of delay as well: Approximately how many delays are continuous for how long, and approximately how many are timedependent?
Consider the task of developing a reliable protocol. If we assume the CRC code used is capable of detecting any errors (in our lifetime), we can implement reliability by tagging data packets and acknowledgments with sequence numbers. What is the minimum number of bits needed for these sequence numbers? Explain briefly.
please answer with proper explanation and step by step solution. Question: Consider a fictional six-layer protocol hierarchy where layer 1 is the lowest layer, and layer 6 is the highest layer. Therefore, an application sends a message M by passing it to layer 6. All the even-numbered layers attach a trailer Ti (i = 2, 4, 6) to their payload, and all the odd-numbered layers attach a header Hi (i = 1, 3, 5) to their payload. Draw the headers, trailers, and original message M in the order they are sent out.
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B.a. Express the propagation delay, ????? , in terms of m and s.b. Determine the transmission time of the packet, ?????? , in terms of L and R.c. Ignoring processing and queuing delays, obtain an expression for the end to-enddelay
A network system has 5 protocol layers. Applications generate messages of length M bytes. At each of the layers, an h-byte header is added. What fraction of the network bandwidth is filled with headers? a. 5h/(5h+M) b. M/(5h+M) c. M/(4h+M) d. 4h/(4h+M)
This elementary problem begins to explore propagation delay andtransmission delay, two central concepts in data networking. Consider two hosts, Aand B, connected by a single link of rate R bps. Suppose that the two hosts areseparated by m meters, and suppose the propagation speed along the link is smeters/sec. Host A is to send a packet of size L bits to Host B. d. Suppose Host A begins to transmit the packet at time t=0 . At time t= ?????? ,where is the last bit of the packet? e. Suppose ????? is greater than ?????? . At time t= ??????, where is the first bit of the packet?f. Suppose ????? is less than ??????. At time t= ?????? , where is the first bit of thepacket?