EBK COMPUTER NETWORKING
7th Edition
ISBN: 8220102955479
Author: Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Expert Solution & Answer
Chapter 1, Problem R13RQ
Explanation of Solution
The users share link with 2Mbps speed to transmit the required data.
- a) With the usage of circuit switching network, only two users can be supported because each user needs half of the bandwidth frequency.
- b) If two users transmit the data, the queuing delay will not arise because each user needs half of the bandwidth from the total...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Suppose users share a 2 Mbps link. Also suppose each user transmits continuously at 1 Mbps when transmitting, but each user transmits only 20 percent of the time. (See the discussion of statistical multiplexing in Section 1.3.)
a. When circuit switching is used, how many users can be supported?
b. For the remainder of this problem, suppose packet switching is used. Why will there be essentially no queuing delay before the link if two or fewer users transmit at the same time? Why will there be a queuing delay if three users transmit at the same time?
c. Find the probability that a given user is transmitting.
d. Suppose now there are three users. Find the probability that at any given time, all three users are transmitting simultaneously. Find the fraction of time during which the queue grows.
A data channel at 5 Gbps is shared by two users. Assume that each user is transmitting at 2.5Gbps data rate continuously. Each user only transmits only 30% of the time.
(a) If circuit switching is used, how many users can be supported?
(b) If packet switching is used, would there be queuing delay to accommodate these two users? If a third identical user is added will there be a queuing delay?
(c) What is the probability that a user is sending data?
(d) Now assume three users under packet switching. Compute the probability that at any given time all three are transmitting at the same time. What is the fraction of time when the queue is growing?
Suppose a system has 50 MB data to send on a network and transmit the data in burst at 8 Mbps, the maximum transmission rate across routers in the network is 6 Mbps, if system uses leaky bucket algorithm, the capacity (in MB) that bucket must hold so that no data is discarded is?.
Chapter 1 Solutions
EBK COMPUTER NETWORKING
Ch. 1 - What is the difference between a host and an end...Ch. 1 - The word protocol is often used to describe...Ch. 1 - Why are standards important for protocols?Ch. 1 - Prob. R4RQCh. 1 - Prob. R5RQCh. 1 - Prob. R6RQCh. 1 - Prob. R7RQCh. 1 - Prob. R8RQCh. 1 - Prob. R9RQCh. 1 - Prob. R10RQ
Ch. 1 - Prob. R11RQCh. 1 - What advantage does a circuit-switched network...Ch. 1 - Prob. R13RQCh. 1 - Prob. R14RQCh. 1 - Prob. R15RQCh. 1 - Prob. R16RQCh. 1 - Prob. R17RQCh. 1 - Prob. R18RQCh. 1 - Suppose Host A wants to send a large file to Host...Ch. 1 - Prob. R20RQCh. 1 - Prob. R21RQCh. 1 - Prob. R22RQCh. 1 - What are the five layers in the Internet protocol...Ch. 1 - Prob. R24RQCh. 1 - Prob. R25RQCh. 1 - Prob. R26RQCh. 1 - Prob. R27RQCh. 1 - Prob. R28RQCh. 1 - Equation 1.1 gives a formula for the end-to-end...Ch. 1 - Prob. P3PCh. 1 - Prob. P4PCh. 1 - Prob. P5PCh. 1 - This elementary problem begins to explore...Ch. 1 - Prob. P7PCh. 1 - Suppose users share a 3 Mbps link. Also suppose...Ch. 1 - Prob. P9PCh. 1 - Prob. P10PCh. 1 - In the above problem, suppose R1 = R2 = R3 = R and...Ch. 1 - Prob. P13PCh. 1 - Consider the queuing delay in a router buffer. Let...Ch. 1 - Prob. P15PCh. 1 - Prob. P16PCh. 1 - Prob. P17PCh. 1 - Prob. P20PCh. 1 - Prob. P21PCh. 1 - Prob. P22PCh. 1 - Prob. P23PCh. 1 - Prob. P24PCh. 1 - Prob. P25PCh. 1 - Prob. P26PCh. 1 - Prob. P27PCh. 1 - Prob. P28PCh. 1 - Prob. P29PCh. 1 - Prob. P30PCh. 1 - Prob. P31PCh. 1 - Prob. P32PCh. 1 - Prob. P33PCh. 1 - Prob. P34P
Knowledge Booster
Similar questions
- A packet switch receives a packet and determines the outbound link to which the packet should be forwarded. When the packet arrives, one other packet is halfway done being transmitted on this outbound link and four other packets are waiting to be transmitted. Packets are transmitted in order of arrival. Suppose all packets are 1,200 bytes and the link rate is 2 Mbps. What is the queuing delay for the packet? More generally, what is the queuing delay when all packets have length L, the transmission rate is R, x bits of the currently-being-transmitted packet have been transmitted, and n packets are already in the queue?arrow_forwarda. Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R. What is the average queuing delay for the N packets? b. Now suppose that N such packets arrive to the link every LN/R seconds. What is the average queuing delay of a packet?arrow_forwardConsider 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 arearrow_forward
- Consider a client and a server connected through one router. Assume the router can start transmitting an incoming packet after receiving its first 0.6 Mbits instead of the whole packet. Suppose that the transmission rate of each link is 6 Mb/s and that the client transmits one packet with a size of 2 Mbits to the server. Assume the propagation, processing, and queuing delays are negligible. Answer the following questions (use up to 4 significant digits if needed; e.g., yy.xxxx): What is the end-to-end delay?3D seconds What is the end-to-end delay if there are 2 routers between the client and the server?= secondsarrow_forwardConsider a datagram network in which a packet travels through two switches S1 and S2 from source to destination. Packet experiences wait at each switch before it is forwarded. Transmission time, propagation time and wait time at each node is 3 ms, 1.5 ms, and 0.25 ms respectively. Find the total delay.arrow_forward2. Consider a bus-topology network with five stations. A reservation access method is used. Each station has infinite data to transmit. Each reservation slot has 10 microseconds (note that 1 microsecond = 106 second). For each station, one data transmission sends 1000 bits. The transmission rate over the medium is 10 Mbps. For a station, which is its throughput (in unit "Mbps")?arrow_forward
- QUESTION 4 Consider a router buffer preceding an outbound link that has a transmission capacity of 1000 packets/second. Assume that the router is operating in a steady-state with no packet losses. Suppose packets arrive at the router an average rate of 600 packets/second to use the outbound link. Calculate the following values. The traffic intensity is A packet uses the outbound link for seconds. The average delay (queuing and transmission) experienced by a packet is seconds. The average number of packets in the router waiting to use or using the outbound link isarrow_forwardConsider 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?arrow_forwardSuppose users share a 2 Mbps link. Also suppose each user transmits continuously at 1 Mbps when transmitting, but each user transmits only 20 percent of the time. a. When circuit switching is used, how many users can be supported? b. For the remainder of this problem, suppose packet switching is used. Why will there be essentially no queuing delay before the link if two or fewer users transmit at the same time? Why will there be a queuing delay if three users transmit at the same time? c. Find the probability that a given user is transmitting. d. Suppose now there are three users. Find the probability that at any given time, all three users are transmitting simultaneously. Find the fraction of time during which the queue grows.arrow_forward
- A factor in the delay of a store-and-forward packet-switching system is how long it takes to store and forward a packet through a switch. If switching time is 10 usec, is this likely to be a major factor in the response of a client-server system where the client is in New York and the server is in California? Assume the propagation speed in copper and fiber to be 2/3 the speed of light in vacuum.arrow_forwardConsider a two-link network in which Host A has a 1 Mbps connection with a 10 ms propagation delay and the router has a 15 Mbps link with a 25 ms propagation delay. Host A sends Host B a 1500-byte packet. What is the packet transmission delay from the router to Host B (in milliseconds)?arrow_forwardConsider a broadcast channel with N nodes and a transmission rate of R bps. Suppose the broadcast channel uses polling (with an additional polling node) for multiple access. Suppose the amount of time from when a node completes transmission until the subsequent node is permitted to transmit (that is, the polling delay) is ?poll. Suppose that within a polling round, a given node is allowed to transmit at most Q bits. What is the maximum throughput of the broadcast channel?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Operations Research : Applications and AlgorithmsComputer ScienceISBN:9780534380588Author:Wayne L. WinstonPublisher:Brooks ColeSystems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Operations Research : Applications and Algorithms
Computer Science
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Brooks Cole
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning