Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Assume that an end-to-end communications system is made up of three networks with date rate in Mbps ρ1, ρ2, and ρ3, respectively. Ignoring the other delay components, what is the total end-to-end delay to transmit a packet size of λ?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Host A and Host B are connected by a network with 2 store-and-forward switches. Each link has a bandwidth of 5 megabits/second and is 1,000 kilometers long. The network propagation speed is 200,000 kilometers/second. Host A sends 10,000- bit packets to Host B. Give proper units on each answer. (For these and other nu- merical problems it is required that you give a formula, using numbers from the problem, that can be evaluated to give the numerical answer.) a) What is the round-trip propagation delay between A and B? b) What is the transmission delay of a single packet from A to B? c) What is the bandwidth-delay product between A and B (RTT)?arrow_forwardA 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?arrow_forwardLet a denote the rate of packets arriving at a link in packets/sec, and let μ denote the link’s transmission rate in packets/sec. Based on the formula for the total delay (i.e., the queuing delay plus the transmission delay) derived in the previous problem, derive a formula for the total delay in terms of a and μ.arrow_forward
- I need the answer as soon as possiblearrow_forward14. The link length is 2000km, the data transmission rate is 1kbit/s, and the data that needs to be sent is 100bit. The data propagation rate on this link is 2x10 m/s. Suppose we can see the bits transmitted on the link, try to draw the bits on the line we see: a) When 100bit is just sent. b) After another 0.05sarrow_forwardQue.a) Consider a CSMA/CD network that transmits data at a rate of 400 x 106 bits per second. The maximum signal propagation time from one node to another node is 20 microseconds. The minimum size of a frame in the network is(. bytes).arrow_forward
- Consider a sender having an infinite number of frames to send, which we index as 0, 1, 2, .... Assume the transmission delay of each frame is 2t, the ACK transmission time is t, the propagation delay is 3t and symmetric on both directions, and the timeout value is T = 8 starting from the end of frame transmission onto the link. The first frame is sent out at time 0. Show Transcribed Text 3 Ĉ E. Explain what will happen if the sequence number space has exactly the same number of sequence numbers as the number of allowed maximum number of outstanding frames, e.g., when N = W = 10, and the sequence numbers available are only 0-9.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_forward10. For a 10 Mbps data link using 12,000-bit frames, and assuming that electrical signals propagate at 2.5 x 108 m/s: a. How long does it take to introduce a single frame onto the link? b. How long does it take for the trailing edge of the frame to travel 1,620 km? c. What is the total transmission time of this frame, from start to finish?arrow_forward
- Consider a full-duplex 512 kbps link with length 36,000Km connecting two hosts. The data frames carry a useful payload of size 6000 bits. Assume that both ACK and data frames have 400 bits of header information, and that ACK frames carry no data. The propagation speed along this link is 3×108 m/sec. a) What is the RTT on this link? b) What is the effective useful data throughput, in kbps, when using Stop-and-Wait?arrow_forward6. 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…arrow_forwarda) Consider a CSMA/CD network running at 20 Mb/s over 3-km cable with no repeaters. The signal speed in the cable is 2×108 m/s. Suppose station A starts transmitting a frame of size 400 bytes at time T. i. Can it happen that station A detects a collision at time T+10 us (micro seconds) if there was no collision detected between time T and T+10 μs? Justify your answer. Can it happen that the station detects a collision at time T+20 μs, if there was no collision detected between time T and T+20 us? Justify your answer. iii. Can it happen that the station detects a collision at time T+33 μs, if there was no collision detected between time T and T+33 us?? Justify your answer.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
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