A communication line capable of transmitting at a rate of 50 Kbits/sec will be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min. Packet length are exponentially distributed with mean 1000 bits. For each session, find the average number of packets in queue, the average number in the system, and the average delay per packet when the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels; ii) statistical multiplexing

A communication line capable of transmitting at a rate of 50 Kbits/sec will be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min. Packet length are exponentially distributed with mean 1000 bits. For each session, find the average number of packets in queue, the average number in the system, and the average delay per packet when the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels; ii) statistical multiplexing

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter9: Computer Networks

Section: Chapter Questions

Problem 15VE

See similar textbooks

Similar questions

Copy from chegg == Report! A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing
Skype is a well‑known VoIP system used not only for peer‑to‑peer conversations but also for audio and video conferencing involving three or more callers. Assume a video conference with a central server on Skype has N callers, and each caller generates a constant data stream at rate r bps. How many bits per second does the call initiator need to send? How many bits does each of other N‑1 callers need to send?
Consider a network connecting two systems located 4000 kilometers apart. The bandwidth of the network is 500 x Mbps. The propagation speed of the media is 4 × 106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. What is the minimum size in bits of the sequence number field?
In a network, two systems are connected and the distance between the system is 5000 km. The propagation speed of the medium is 2 x 107 m/s. The bandwidth of the network is 500 MBps. If the average packet size is 108 bits and the network is used to its full capacity. The minimum size of the sequence number field is n bits. The processing delay at nodes is 0 ms. What is the value of n in case of Go-Back-N sliding window protocol?
Please dont copy your answer from other sourses i.e chegg A communication line capable of transmitting at a rate of 50 Kbits/secwill be used to accommodate 10 sessions each generating Poisson traffic at a rate 150 packets/min.Packet length are exponentially distributed with mean 1000 bits. For each session, find the averagenumber of packets in queue, the average number in the system, and the average delay per packetwhen the line is allocated to the sessions by using: i) 10 equal-capacity time-division multiplexed channels;ii) statistical multiplexing.
A link has a transmission speed of 106 bits/sec. It uses data packets of size 1000 bytes each. Assume that the acknowledgment has negligible transmission delay, and that its propagation delay is the same as the data propagation delay. Also assume that the processing delays at nodes are negligible. The efficiency of the stop- and-wait protocol in this setup is exactly 25%. The value of the one-way propagation delay (in milliseconds) is
Consider two hosts, A and B that are connected by a transmissions link of2.1 Mbps. Assume that packets are of length 2.0 Kb (Kilobits) and the length of the link is 100Km. a. What is the propagation delay from A to B, that is the amount of time from when the first bit of the packet is transmitted at A, until it is received at B? b. What is the transmission time of the packet at A (the time from when the first bit of the packet is sent into the wire and the time at which the last bit is sent into the wire). c. Suppose now that that length of the link is doubled. What is the propagation delay from A to B now and what is the transmission time? d. Now suppose that node C is connected to node B also by a 2 Mbps, 100 Km link. How long does it take from when the first bit is transmitted by A to when the last bit is received at C, assuming B operates in a store-and -forward manner?
Suppose nodes A and B are on the same 10 Mbps broadcast channel, and the propagation delay between the two nodes is 245 bit-times. Suppose A and B send Ethernet frames at the same time. Suppose the transmission time of the entire frame is 295 bit-times. So, the frames collide, and then A and B choose different values of K in the CSMA/CD algorithm. A node chooses the value of K at random from {0,1,2,...2n−1} where n is the number of collisions experienced on the channel – note n is set to 1 in this case). For Ethernet, the actual amount of time a node waits is K*512 bit times (i.e., K times the amount of time needed to send 512 bits into the Ethernet). Suppose A chooses a K value of 0 and B chooses a K value of 1. Assuming no other nodes are active, can the retransmissions from A and B collide? Justify your answer by showing all the intermediate steps of your calculations.
Data packets containing 100 bits are transmitted over a communication link. Given that the probability of a bit 1 in a data packet is p = 0.2, generate the random outcomes for 40 data packets. Find the occurrence of bit 1 and its relative frequency in each packet.
A link has a transmission speed of 1010 bits/sec. It uses data packets of size 2000 bytes each. The efficiency of the stop-and-wait protocol in this setup is exactly 30%. Determine the value of the one-way propagation delay in milliseconds. Assume that the acknowledgement has negligibletransmission delay, and its propagation delay is the same as the data propagation delay. Consider the same transmission speed and packet size for Go back-N protocol with window size 8 and find the channel utilization.
A router receives packets from a group of users transmitting in a multiple access system by time division (TDMA), in which everyone uses the same frequency and transmit in instants of time many different. Assuming the packets arrive accordingly with the Poisson process at the rate of one packet every 4 ms (milliseconds) and assuming that the instants of Packet transmission time is exponentially distributed with a mean of 3 ms. Given this scenario, calculate:a)The average of packets on the system.(b) The average total system delay. (c) What percentage increase in the arrival rate results in a doubling of the delay average total calculated in part (a)?
Consider two hosts S and R connected directly by a link. A link has a transmission speed of 107 bits/sec. It uses data packets of size 400 bytes. Data needed to transmitted is 400 bytes. Length of the link is 600 km and the propagation speed are 3 × 108 meter per second. T is the transmission delay and P is the propagation delay. The propagation delay in millisecond and transmission delay in microsecond respectively are