Find distribution - expected value and variance, Advanced Statistics

Assignment Help:

We are installing a router for our network.

We believe that the time between the arrival of packets will be exponentially distributed with parameter R = 2 packets/second, and that these times are independent given R. We believe that each packet, independently, will either go to the server (with probability S = 0.4), the laser printer (with prob. 0.2), or to one of computers (with prob. 0.4).

We believe that each packet's size in kilobytes, independently, has a Normal(1, 0.01) distribution.

1. A tasty byte

a) Consider the total size of the next ten packets in kilobytes. Find its distribution, expected value and variance, and the probability it is less than 9.5 kilobytes.

b) Consider the largest and the smallest of the next ten packets. Find their distributions and, for each, the probability it is less than 1.01 kilobytes.

c) Consider how many of the next ten packets are less than 1.02 kilobytes. Find its distribution, expected value and variance.

d) Consider how many of the next thousand packets are less than 1.02 kilobytes. Find its expected value and variance, and approximate its distribution and the probability that at least 575 of those packets are less than 1.02 kilobytes.

e) Consider the next three packets to arrive. Find the probability that the first is at least 0.1 kilobytes larger than the average of the other two.


Related Discussions:- Find distribution - expected value and variance

Particlefilters, Particlefilters is a simulation method for tracking movin...

Particlefilters is a simulation method for tracking moving target distributions and for reducing computational burden of the dynamic Bayesian analysis. The method uses a Markov ch

Dendro gram, A term commonly encountered in the application of the agglomer...

A term commonly encountered in the application of the agglomerative hierarchical clustering techniques, where it refers to the 'tree-like' diagram illustrating the series of steps

Petersen''s factor theorem, Suppose the graph G is n-connected, regular of ...

Suppose the graph G is n-connected, regular of degree n, and has an even number of vertices. Prove that G has a one-factor. Petersen's 2-factor theorem (Theorem 5.40 in the note

Obuchowski and rockette method, Obuchowski and Rockette method  is an alter...

Obuchowski and Rockette method  is an alternative to the Dorfman-Berbaum-Metz technique for analyzing multiple reader receiver operating curve data. Instead of the modelling the ja

Collector''s problem, Collector's problem : A problem which derives from th...

Collector's problem : A problem which derives from the schemes in which packets of a particular brand of coffe, cereal etc., are sold with coupons, cards, or other tokens. There ar

Oracle property, Oracle property is a name given to techniques for estimat...

Oracle property is a name given to techniques for estimating the regression parameters in the models fitted to high-dimensional data which have the property that they can correctl

Product-limit estimator, Product-limit estimator is a method for estimatin...

Product-limit estimator is a method for estimating the survival functions for the set of survival times, some of which might be censored observations. The logic behind the procedu

Disease clusters, An unusual aggregation of the health events, real or perc...

An unusual aggregation of the health events, real or perceived. The events might be grouped in the particular region or in some short period of time, or they might happen among the

Distribution free methods, The statistical methods for estimation and infer...

The statistical methods for estimation and inference which are based on a function of sample observations, probability distribution of which does not rely upon a complete speci?cat

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd