1. Determine whether the following statements are true or false. d) A transmission of a frame by any one station in a bus topology can be heard by other stations. Answer: e) A compromise that attempts to reduce collisions, like nonpersistent, and reduce idle time, like 1-persistent, is p-persistent. Answer: f) The l-persistent algorithm with binary exponential backoff is efficient over a wide range of loads. Answer: g) With CSMA/CD, the amount of wasted capacity is reduced to the time it takes to detect a collision. Answer:

1. Determine whether the following statements are true or false. d) A transmission of a frame by any one station in a bus topology can be heard by other stations. Answer: e) A compromise that attempts to reduce collisions, like nonpersistent, and reduce idle time, like 1-persistent, is p-persistent. Answer: f) The l-persistent algorithm with binary exponential backoff is efficient over a wide range of loads. Answer: g) With CSMA/CD, the amount of wasted capacity is reduced to the time it takes to detect a collision. Answer:

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

4. Give a pushdown automaton (PDA) which accepts the following lan- guage: L₁ = {ue {a,b}* : |u|a 2* ub+ 3}
9. What routing algorithm is BGP based on? A) Bellman-Ford algorithm B) Diffusing update algorithm - DUAL C) Dijkstra's algorithm D) None of the above.
Consider the following augmentation of a remote-file- access protocol. Each client maintains a name cache that caches translations from file names to corresponding file handles. What issues should we take into account in implementing the name cache?
4. Lucy Zhu 4 min Edit Suppose that the underlying communication system guarantees FIFO ordering of messages. How will you exploit this feature to reduce the communication complexity of the vector clock algorithm? Give an expression for overhead savings if your scheme is used instead of the traditional vector clock algorithm. Assume that any process can send at most m messages. (Hint: You should use only O(n) storage at each process.) ge
pls solve all parts asap
Assume the following parameters for Selective Repeat (SR): a) N = 4 b) Round Trip Time (RTT) = 10 ms c) Timeout period = 40 ms d) Segment Size = 2200 bytes. Suppose that Bob sent 14 segments, numbered 1 to 14, to Alice using the SR mechanism. Suppose that Segment 4 and Segment 10 were lost the first time the segments were sent to Alice (but reached Alice correctly when retransmitted). Apart from the above, there were no other segment losses. What is the average throughput obtained in sending all the segments (in bytes/sec)? Draw a diagram to show the communication of the segments in detail.
Give a comparison of FIFO, LRU and OPTIMAL algorithms in term of Page faults with three and four frames in each case for the reference string of pages duly demanded in Main Memory. Reference String: 2, 3, 3, 2, 1, 4, 0, 0, 3, 2, 1, 1, 2, 3, 4
Consider a system that implements demand paging without a TLB. The single-level page table is held in memory, and we assume that there are no free frames. Each memory access requires 100 nanoseconds. It takes 6 additional milliseconds to handle a page fault if the victim page is not "dirty" or 12 additional milliseconds if the victim page is "dirty". Experiments show that the probability of page faulting is 0.00003 (i.e., 0.03% chance) and that the average memory access time is 400ns. What is the percent chance that a page is dirty at the time it is evicted? Hint: Call the "being dirty" probability d and write a simple equation that gives the average data access time as a function of d. Solve for d (the result should be a number between 0 and 1, which you then convert to a percentage).
i need the answer quickly
Give some details of how you might augment the sliding window protocol with flow control by having ACKs carry additional information that reduces the SWS as the receiver runs out of buffer space. Illustrate your protocol with a timeline for a transmission; assume the initial SWS and RWS are 4, the link speed is instantaneous, and the receiver can free buffers at the rate of one per second (i.e., the receiver is the bottleneck). Show what happens at T = 0, T = 1,...,T = 4 seconds.