Suppose hosts A and B are connected by a link. Host A continuously transmits the current time from a high-precision clock, at a regular rate, fast enough to consume all the available bandwidth. Host B reads these time values and writes them each paired with its own time from a local clock synchronized with A's. Give qualitative examples of B's output assuming the link has (a) High bandwidth, high latency, low jitter. (b) Low bandwidth, high latency, high jitter. (c) High bandwidth, low latency, low jitter, occasional lost data. For example, a link with zero jitter, a bandwidth high enough to write on every other clock tick, and a latency of 1 tick might yield something like (0000,0001), (0002, 0003), (0004, 0005).

Suppose hosts A and B are connected by a link. Host A continuously transmits the current time from a high-precision clock, at a regular rate, fast enough to consume all the available bandwidth. Host B reads these time values and writes them each paired with its own time from a local clock synchronized with A's. Give qualitative examples of B's output assuming the link has (a) High bandwidth, high latency, low jitter. (b) Low bandwidth, high latency, high jitter. (c) High bandwidth, low latency, low jitter, occasional lost data. For example, a link with zero jitter, a bandwidth high enough to write on every other clock tick, and a latency of 1 tick might yield something like (0000,0001), (0002, 0003), (0004, 0005).

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

In cdma2000 reverse link, a user stream of 9.6kbps is sent to an encoder r = 14 (4 coded bit for every 1 information bit), K = 9. and then through a symbol repetition (2x) (repeats the encoded bits twice). What coded data rate after repetition is obtained? What Walsh code length should you use to spread that stream into a typical 1.2288Mcps CDMA channel?
Frames of 1000 bits are sent over a 106 bps duplex link between two hosts. The propagation time is 25 ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). 1.1 What is the minimum number of bits (1) that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.
Write a program to simulate the behavior of the CSMA/CD protocol over Ethernet when ther are N stations ready to transmit while a frame is being transmitted. Your program should report the times when each station successfully starts sending its frame. Assume that a clock tick occurs every slot time (51.2 microsec) and a collison detection and sending of a jamming sequence takes one slot time. All frames are the maximum length allowed.
A digitized voice channel is made by digitizing a 4-kHz bandwidthanalog voice signal. We need to sample the signal at twice the highestfrequency. We assume that each sample requires 16 bits. What is therequired bit rate?
Computer A uses the Go-back-N ARQ protocol to send a 110 Mbytes file to computer B with a window size of 15. Given each frame carries 100K bytes data. How long does it take to send the whole file (the total time taken from A sending the first bit of the file until A receiving the last acknowledgment)? Given that the transmission rate of the link is 500 Mbps and the propagation time between A and B is 15ms. Assume no data or control frame is lost or damaged and ignore the overhead due to header and trailer.
Consider the following scenario: Frames of 12000 bits are sent over a 400kbps channel using a satellite whose propagation delay is 270ms. Acknowledgements are always piggybacked onto data frames. (That is, in the case of stop-and-wait, the next frame cannot be transmitted until the entire frame containing the acknowledgement is received.) Five-bit sequence numbers are used. What is the maximum achievable channel utilization for (a) Stop-and-wait. (b) Protocol 5 (i.e., Go Back N). (c) Protocol 6 (i.e., Selective Repeat)
4. In this problem, you will derive the efficiency of a CSMA/CD-like multiple access protocol. In this protocol, time is slotted and all adapters are synchronized to the slots. Unlike slotted ALOHA, however, the length of a slot (in seconds) is much less than a frame time (the time to transmit a frame). Let S be the length of a slot. Suppose all frames are of
A computer user finds that his wireless router transmits data at a rate of 75 Mbps (megabits per second). Compare the average time to transmit one bit of data with the time difference between the wifi signal reaching an observer's cell phone directly and by bouncing back to the observer from a wall 8.00 m past the observer.
Suppose a frame (F) experiences collision forth time on a shared Ethernet link of I Mbps: What is the maximum possible value of K in this case Suppose maximum value of K is taken, compute backoff bit time for frame F Convert bit time into absolute time (second or fraction of a second)
Let a cluster of stations share 48Kbps of pure Aloha channel. Every station outputs frames of length 1024bits on an average of every 50seconds. Then what is the maximum value of no. of stations? Attempt if you are 100% sure .
A large population ALOHA user manages to generate 50 request/sec, including both originals and retransmissions. Time is slotted in units of 40 ms:a. What is the chance of success at the first time?b. What is the probability of exactly k collisions and then a success?c. What is the expected number of transmissions attempts needed?
Consider a full-duplex 256 Kbps satellite link with a 240 millisecond end-to-end delay. The data frames carry a useful payload of size 12,000 bits. Assume that both ACK and data frames have 320 bits of header information, and that ACK frames carry no data. What is the effective data throughput When using sliding windows with a sender window size of W = 5 data frames?