Given a link with a maximum transmission rate of 34.1 Mbps. Only two computers, X and Y, wish to transmit starting at time t = 0 seconds. Computer X sends fileX (19 MiB) and computer Y sends fileY (222 KiB), both starting at time t = 0. ● Statistical multiplexing is used, with details as follows • Packet Payload Size = 1000 Bytes • Packet Header Size = 24 Bytes (overhead) Ignore Processing and Queueing delays Assume partial packets (packets consisting of less than 1000 Bytes of data) are padded so that they are the same size as full packets. • Assume continuous alternating-packet transmission. Computer X gets the transmission medium first. At what time (t = ?) would Filey finish transmitting? Give answer in milliseconds, without units, and round to one decimal places (e.g. for an answer of 0.013777 seconds you would enter "13.8" without the quotes) 1.6

Given a link with a maximum transmission rate of 34.1 Mbps. Only two computers, X and Y, wish to transmit starting at time t = 0 seconds. Computer X sends fileX (19 MiB) and computer Y sends fileY (222 KiB), both starting at time t = 0. ● Statistical multiplexing is used, with details as follows • Packet Payload Size = 1000 Bytes • Packet Header Size = 24 Bytes (overhead) Ignore Processing and Queueing delays Assume partial packets (packets consisting of less than 1000 Bytes of data) are padded so that they are the same size as full packets. • Assume continuous alternating-packet transmission. Computer X gets the transmission medium first. At what time (t = ?) would Filey finish transmitting? Give answer in milliseconds, without units, and round to one decimal places (e.g. for an answer of 0.013777 seconds you would enter "13.8" without the quotes) 1.6

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

Pure ALOHA is used in a network with Poisson distributed traffic. The success probability, as defined in this given with P(successful access) = 0.05.a) How large is the normalised channel access rate G, and the normalised success rate S (alsosometimes called throughput)?b) From now, the maximum data rate C is considered with C = 96 kbit/s = 96·103 bit/s. Allpackets that are transmitted have a size of 64 byte and every sender in the network sends3 packets per minute on average. What is the average access rate g1 of a single sender?What is the average access rate g and the normalised access rate G on the channel if there are 50, 500, and 5000 senders connected?c) With the same values of part (b) above, what are the normalised success rates S50, S500, S500in the case of 50, 500, and 5000 senders?
Assume a 10Mbps Ethernet has two nodes, A and B, connected by a 360m cable with threerepeaters in between, and they each have one frame of 1,024 bits to send to each other. Further assumethat the signal propagation speed across the cable is 2*10^8 m/sec, CSMA/CD uses back-off intervals ofmultiples of 512 bits, and each repeater will insert a store-and-forward delay equivalent to 20-bittransmission time. At time t=0, both A and B attempt to transmit. After the first collision, A draws K = 0and B draws K = 1 in the exponential back-off protocol after sending the 48bits jam signal. a. What is the one-way propagation delay (including all repeater delays) between A and B inseconds? At what time is A's packet completely delivered at B? b. Now suppose that only A has a packet to send and that the repeaters are replaced with switches.Suppose that each switch has an 8-bit processing delay in addition to a store-and-forward delay.At what time, in seconds, is A's packet delivered at B?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. If transmission starts at time t=0, at which time (in seconds) does the first bit arrive at the switch connecting link 1 and link 2?
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. If transmission starts at time t=0, at which time (in seconds) does the first bit arrive at the switch connecting link 1 and link 2? (What is the propagation delay for link 1?)
Consider two nodes, A and B are attached to opposite ends of an 1200 meter cable with signal propagation speed is 2 x 10^8 m/sec. Frame size used by both nodes is 1500 bits including header and preambles. Assume transmission rate is 100 Mbps and there are four switches between node A and B each insert 20 bit delay as a processing time in addition to store and forward delay. If only A has packet to send, then the time taken to reach A's packet at B is?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How "long" (in meters) is one bit on link 1?
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 meters) is one bit on link 1?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. How many bytes will be contained in the last packet?
Computer A is sending a 100 kByte long file to Computer B via packet-switching over two consecutive 10 Mbps links of 1000 km length each.Assume that the signal propagation speed on both links is 2.5 x 108 m/s.Furthermore, assume that the maximum length of a packet is 1500 bytes and that Computer A fills each packet to the max, if possible. If transmission starts at time t=0, how long (in seconds) does it take until Computer B has received the last bit of the complete file transfer?Assume that the switch between link 1 and 2 is a "store-and-forward" switch. Furthermore, assume that processing and queuing delays are negligible and no other stations are using the links.
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 many bytes will be contained in the last packet?
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. g. Suppose ? = 2.5?108, L=1500 bytes, and R=10 Mbps. Find the distance m sothat ????? equals ??????.
1.4.12.2 End-to-end Delay. Consider again the network shown above. The links again have transmission rates of R1 = R2 = 100 Mbps (i.e., 100 x 106 bits per second), and each packet is 1 Mbit (106 bits) in size. Assume that the propagation delay is 1 msec per link. What is the end-to-end delay of a packet from when it first begins transmission at the sender, until it is received in full by the server at the end of the rightmost link. Assume store-and forward packet transmission. You can assume the queueing delay is zero. Answer choices: A. 2 x 106 msec b. 2.01 msec C. 1.1 msec D. 2.02 msec 1.4.12.3 Maximum Throughput. Consider again the network shown above. The links again have transmission rates of R1 = R2 = 100 Mbps Assume that the link R2 is fairly shared (as we've seen is done via TCP) between the two sessions. What is the maximum end-to-end throughput achieve by each session, assuming both sessions are sending at the maximum rate possible? Answer choices:…