Prove that the minimal spanning tree in graph is unique

Reference no: EM1318401

To prove that the minimal spanning tree in graph is unique.

Suppose you have n video streams that need to be sent, one after another, over a communication link. Stream I consists of a total of b_i bits that need to be sent, at a constant rate, over a period of t_i seconds. You cannot send two streams at the same time, so you need to determine a schedule for the streams: an order in which to send them. Whichever order you choose, there cannot be any delays between the end of one stream and the start of the next. Suppose you schedule starts at time 0(and therefore ends at time ∑ⁿ_i=0t_{i ,}whichever order you chose).we assume that all the values b_iand t_iare positive integers.

Now, because you are just one user ,the link does not want you taking up too much bandwidth, so it imposes the following constraint ,using a fixed parameter r:

(*) for each natural number t>0,the total number of bits you send over the time interval from 0 to t cannot exceed rt.

Note that this constraint is only imposed for time intervals that start at 0, not for time intervals that start at any other value.

We say that a schedule is valid if it satisfies the constraint (*) imposed by the link.

The problem given a set of n streams, each specified by its number of bits b_iand its time durationt_{i ,}as well as the link parameter r, determine whether there exist a valid schedule.

Example: suppose we have n=3 streams, with

(b_1, t₁)=(2000,1) (b_2, t₂)=(6000,2) (b_3, t₃)=(2000,1)

and suppose the link's parameter is r=5000.then the schedule that n runs the streams in the order 1,2,3 is valid, since the constant (*) is satisfied:

t=1; the whole first stream has been sent, and 2000<5000

t=2 ; half of the second stream has also been sent and 2000+3000 <5000

Similar calculations hold for t=3 and t=4

consider the following claim :

there exists a valid schedule if and only if each stream I satisfies b_i_<= rt_i

Decide whether you think the claim is true or false and give a proof of either the claim or its negation.

Reference no: EM1318401

Questions Cloud

Discretionary right : Emma Employee works as a salesperson. Her company, International Widgets, implements sales incentive program: If any salesperson sells 100 units in July, they will receive a $12,000.00 bonus. International states that the program is discretionary ..

Hypothesis testing with one way anova : Describe appropriate treatment means μ1, μ2 and μ3. After that Test for statistically significant differences between these treatment means. Set α = 0.05.

Collection of the volatile data for investigation : Discuss with others what kinds of the data are considered volatile and the methods through which the investigators should collect and preserve the volatile data. Recognize the consequences of not collecting or preserving the volatile data to the i..

Confidence intervals for your data set : Construct the following confidence intervals for your data set:

Prove that the minimal spanning tree in graph is unique : To prove that the minimal spanning tree in graph is unique and Decide whether you think the claim is true or false and give a proof of either the claim or its negation.

Finding tc with confidence level and sample size : Find the t c for a 90% confidence level with a sample size of 18.

Propose three ways of mentor and new employee : Propose three ways that a mentor and a new employee orientation can assist employees with their career development.

Find the value of x at which the minimum or maximum occurs : Find the value of X at which the minimum or maximum occurs.

Estimating the mean length of time : A physician wanted to estimate the mean length of time µ that a patient had to wait to see him after arriving at the office.

User Account

All Pages