**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

Related questions

Q: Give an example of a time when a user's complete denial of a service (when the user gets no response…

A: DoS: Denial of service A Denial of Service (DoS) prevents a resource (such as a website,…

Q: Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving…

A: Solution: The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356…

Q: computer system with three users: Alice, Bob, and Cindy. Alice owns file X, and Bob and Cindy can…

A: The question is asking to:Create an Access Control Matrix (ACM) for a computer system with three…

Q: 1. Alice picks a bit b at random. She picks b = 0 with probability p = 0.2, and she picks b = 1 with…

A: i) Message 1: {"Alice", K, RA}Bob, Message 2: RA, RB "Bob" who is authenticated to person "Alice"…

Q: 3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average…

A: The anwer is given below:-

Q: Consider the behavior of two machines in a distributed system. Both have clocks that are supposed to…

A: Actually, given information 1000 times per millisecond. 990 times per millisecond.

Q: Suppose there are three processes A, B and C. All clock runs at the same rate but initially A’s…

A: Answer (a): A will sends message to B from 10 to 0, but it takes 4 units. So it will receive on B's…

Q: A computing system is composed of two servers that are mirrors of each other (for redundancy, so if…

A: Import Libraries:The program starts by importing the NumPy library, which is used for generating…

Q: Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is currently serving…

A: Solution: The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356…

Q: Servers can be designed to limit the number of open connections. For example, a server may wish to…

A: The above question is solved in step 2 :-

Q: (a) Suppose a server S and client C are connected over the Internet. The one-way prop- agation delay…

A: Here is the solution with an explanation:-

Q: Consider a system that adjusts the degree of multiprogramming by monitoring the mean time between…

A: Multi Programming : Early PC frameworks were very costly to buy and to work. Tragically they…

Q: In computing, time scales usually store the current time as the number of seconds that have elapsed…

A: Given Data, For the year 2020, Number of seconds passed = 3665044 we know, number of seconds per day…

Q: In the scenario below, the left and right TCP clients communicate with a TCP server using TCP…

A: TCP multiplexing and demultiplexing are integral processes in networking, facilitating the efficient…

Q: What does the Lamport Timestamp mechanism do when receiving a message to ensure that the local…

A: Lamport Timestamp The Lamport timestamp algorithm is a basic logical clock algorithm that is used in…

Concept explainers

Network transmission cabling

A network is a collection of devices connected by communication links. A device can be a computer or any instrument capable of sending and receiving data or information formed by other nodes toward the network. A channel that connects people or things is known as a network. It sends the data from one place to another. It is the basic concept of a computer, network, and data communications.

Question

**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 ter ms 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.
** {r}
#do the necessary calculations for probabilities here

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!

SEE SOLUTION Check out a sample Q&A here

Introduction :

VIEW

Solution :

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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

Skype is a well‑known VoIP system used not only for peer‑to‑peer conversations but also for audio and video conferencing involving three or more callers. Assume a video conference with a central server on Skype has N callers, and each caller generates a constant data stream at rate r bps. How many bits per second does the call initiator need to send? How many bits does each of other N‑1 callers need to send?
Consider a system containing three periodic tasks: T1 = (10,3), T2 = (30,5), and T3 = (60,6), handled by Rate Monotonic. Solve the scheduling produced by a sporadic server with Ts = 20, Cs = 5, which is scheduled with the other tasks according to the RMA principle. Suppose there are three sporadic jobs S1 = (10,7,30) and S2 = (15,3,60), and S3 = (20,8,70). Work out a timing diagram showing the schedule of the system. Would any deadline be broken?
A computing system is composed of two servers that are mirrors of each other (forredundancy, so if one fails, it can be restored from the other). Assume that each serverhas an expected MTBF of 500 hours and its continuous uptimes (the average of whichis MTBF) follow an Exponential Distribution. Furthermore, assume that when a serverfails, it takes exactly 10 hours to restore the data from the mirror.(a) Write a program that generates synthetic data showing the failure and restorationtimes for each server over 20 years. You can assume it is always exact 24 hours per dayand exact 365 days per year.
Real-time scheduling: In a system consisting of two processes, P1 and P2, suppose process P1 has a period p1 of 50, an execution time t1 of 25, and a deadline that matches its period (50). Further, suppose that P2 has a period p2 of 75, an execution time t2 of 30, and a deadline that matches its period (75). Is this real-time system schedulable under rate-monotonic scheduling? Explain your answer using the concept of overall CPU utilization and schedulability.
3. Consider the M/M/1 queue discussed in class. Assume that packets arrive to a queue with average arrival rate A [pkts/s]. The average service rate of the queue is denoted by u [pkts/s]. (a) Write expressions for: (i) the mean time between packet arrivals to the queue, i.e., the average inter-arrival time; and (ii) the mean service time, i.e., the average time needed to transmit a packet onto the outgoing link. (b) Let N denote the number of packets in the system in steady-state. Suppose A = 850 and u 1000. Find the smallest value of B such that P(N > B) < e = 10¬4. Hint: Use MATLAB or some other computational tool (you could even use an Excel spreadsheet) to test different values of B. 4. Consider the M/M/1 queue from Problem 3. (a) Find an expression for E[N], i.e., the average number of packets in the system in steady- state. For the values of A and µ specified in Problem 4(b), compute the value of E[N]. What happens when A→ µ? (b) Find an expression for Var[N], i.e., the variance…
Suppose we're modelling an RC crane which is receiving a sequence of input commands, each of which is UP, DOWN, or BEEP. This crane has only two vertical positions, and starts in the high position. It should go into an ERROR end state if it is asked to go UP when it is in the high position or DOWN when it is in the low position. Once it is in the ERROR state, it stays in the ERROR state no matter what commands it receives. BEEP commands are legal at any point. Give a state diagram for this system, in which each edge corresponds to receiving a single command.
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
Suppose there are four processes (P1 - P4) with respective arrival times of 0, 10, 30, and 40, and burst times of 30, 20, 50, and 20 ms. These processes are scheduled from a ready queue on first come first served. The average waiting time is?
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?
25. When a file is transferred between two computers, two acknowledgement strategies are possible. In the first one, the file is chopped up into packets, which are individually acknowledged by the receiver, but the file transfer as a whole is not acknowledged. In the second one, the packets are not acknowledged individually, but the entire file is acknowledged when it arrives. Discuss these two approaches.
Give an example of a circumstance when a user's total denial of a service—that is, the user receives no answer from the computer—is a serious issue. Describe a different scenario in which a 10% denial of service (i.e., the user's computation happens 10% slower than usual) causes significant issues. Is it feasible that unauthorised access to a computer system might prevent legitimate users from receiving 10% of their services? If that's true, how would you go about doing that?
Consider the operation of a learning switch in the context of a network in which 6 nodes labeled A through F are star connected into an Ethernet switch. Suppose that (i) A sends a frame to C, (ii) C replies with a frame to A, (iii) B sends a frame to A, (iv) A replies with a frame to B. The switch table is initially empty. Show the state of the switch table before and after each of these events. For each of these events, identify the link(s) on which the transmitted frame will be forwarded, and briefly justify your answers.