**Q4**: suppose a worker is assigned to check the entire system failure and is responsible for handling it (again, by just resetting both routers). There is a one hour lunch break from 1 pm - 2 pm. what is the probability that the entire system will fail at least once within this lunch break time? Also, what is the probability that there will be no failure within the lunch break? ASsume that the system failures also follow a Poisson Process a) Describe what are the probabilities in question in terms of Pk(t) (probability of k events occurring during time t). You need to think carefully of various properties of the Poisson process. Answer Part a Here b\. calculate those probabilities using R and the total system failure sample (you will need to use the formula, no special R techniques here). e\^x is exp(x) in R. {1}... #do the necessary calculations for probabilities here

Q4: suppose a worker is assigned to check the entire system failure and is responsible for handling it (again, by just resetting both routers). There is a one hour lunch break from 1 pm - 2 pm. what is the probability that the entire system will fail at least once within this lunch break time? Also, what is the probability that there will be no failure within the lunch break? ASsume that the system failures also follow a Poisson Process a) Describe what are the probabilities in question in terms of Pk(t) (probability of k events occurring during time t). You need to think carefully of various properties of the Poisson process. Answer Part a Here b\. calculate those probabilities using R and the total system failure sample (you will need to use the formula, no special R techniques here). e\^x is exp(x) in R. {1}... #do the necessary calculations for probabilities here

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

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.003% 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).
Suppose we have four machines that are using the Berkeley algorithm for clock synchronization. The time daemon is running on machine MO. The other machines are named M1, M2, and M3. The time readings on the four machines are as follows wenty-four hour clocks are usedt. MO 09:10 M1: 08:30 M2 10:10 M3: 07:14 In the third step of the algorithm, what are the values that the time daemon sends to each machine? Assume that the time values are expressed in minutes. Below, these values are presented in a vector value sent to MO, value sent to MI, value sent to M2. value sent to M3I none of these O84, 44, 96, 321 O(24, 16, -84, 92) O192. 84, 16. -24 O-32, 76, 40
How does it effect a user if you refuse to provide a complete service (i.e., the computer does not reply to the user)? Tell us about a time when a 10% denial of service (i.e., a 10% slower rate of computation) caused a major problem for a user. If unauthorized individuals obtain access to a computer system, legitimate users may be refused service. If that's the case, what's the best way to go about it?
Given a M/M/1 queue, if the average inter-arrival time is Z seconds, the average packet service time is P, find: a. The probability an arriving packet has to wait in the queue b. The variance (o}) of the inter-arrival time The variance (o) of the packet service time d. The average number of packets in the system (i.e., in the queue + in the NIC) c.
Please solve it correctly and please provide explanation of your answers. Please answer parts g, h and i. A PC and a Web Server are communicating over a TCP connection. The PC had started the three way handshake with the initial sequence number of 3069 . The Web Server's initial sequence number is 4830 . The window size of the PC is 815 bytes and the window size of the Web Server is 463 bytes. Using the third TCP handshake ack segment the PC sends the http request of the size 396 bytes to the Web Server. Then the Web Server answers with 3 segments containing the requested data. The first segment size is 42 bytes and the second segment size is 276 bytes and the third segment size is 146 bytes respectively. The PC receives all three segments within the timer. But unfortunately the second segment was corrupted. So the PC immediately sends an acknowledgement segment. Assume that the PC uses Selective Repeat/Reject ARQ. g) The second segment from webserver was corrupted. So the PC…
The token bucket algorithm is a popular method for traffic shaping. A computer uses a token bucket with acapacity of 400 megabytes (MB) and a rate of 10 MB/sec. The computer continuously generates20 MB/sec for transmission from time 0. Assume the bucket’s water level is 200 MB at time 0.1a. How long will it take to send 1000 MB? Show the steps.1b. Draw a figure showing how the bucket’s water level evolves
Two computers A and B open a TCP connection between themselves. Consider the flow of data from A to B. B’s RWND as known to A is 25 MSS. A’s initial CT = 12 MSS. At time unit 7, one of A’s RTO timer goes off, at time unit 14 A receives three duplicate ACKs, and at time unit 20 A gets one more timeout of its RTO timers.Show in a graph the detailed changes of A’s congestion window (CWND) if TCP Reno is used.
There are many sensors on a wind turbine, based on each sensor's reading many alerts are generated as (start, end). For easier monitoring, our customer is asking to raise alerts on the turbine level instead of on each sensor. If any sensor is having an alert, there should be an alert for the entire wind turbine. Suppose the alerts created with two sensors readings are [(0,3),(5,10),(1,4),(10,15)], then the turbine level alert should be [(0,4),(5,15)]. Return the alerts sorted by the start timestamp. If there is no alert from the sensor level, return an empty array []. Code needs to be in Python?
Consider two (2) communication services for use in asynchronous distributed systems.In service A, messages may be lost, duplicated or delayed and checksums apply only to headers. In service B, messages may be lost, delayed or delivered too fast for the recipient to handle them, but those that are delivered arrive in order and with the correct contents.i. Describe the classes of failure (arbitrary or omission errors) exhibited by each service.ii. Can service B be described as a reliable communication service?
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).
We want to set up an ATM bank system for the withdrawal of money, instead of obligating the customers to come to the counter during the opening hours of the bank. Specifications: Distribution to any debit cardholder via a card reader and a cash dispenser. View account balance for bank customers Transactions are secured The ATM bank system must be reloaded once the amount of stored money reaches a minimum threshold. In fact, once it is reached, an automatic notification is sent to the a private company for the secured transportation of money to reload ATM bank system with cashes. The bank can have several ATM systems in the city. The customer can be also an employee of the bank or an employee for the private service. At the first, an authentication process for the customer is performed. If it is successful the ATM system displays the different options, like withdrawal of money, viewing account balance, and paying bills. If the required amount of money is superior to the available…
Draw a precedence network for 3 activities: A, B, and C; with durations of 9, 4, and 7 days; respectively, and connected with SS and FF relationships. Put a 2-day lag on every SS relationship and a 1-day lag on every FF relationship. Do the CPM calculations and mark the critical path: assuming that all activities are contiguous assuming that all activities are interruptible a- b-