What are the steady-state throughputs of sessions a and b

Assignment Help Other Subject

Reference no: EM131466491

Question: The purpose of this problem is to illustrate how the relative throughputs of competing sessions can be affected by the priority rule used to serve them. Consider two sessions A and B sharing the first link L of their paths as shown in Fig. 6.28. Each session has an end to-end window of two packets. Permits for packets of A and B arrive dA and dB seconds, respectively, after the end of transmission on link L. We assume that dA is exponentially distributed with mean of unity, while (somewhat unrealistically) we assume that dB = 0. Packets require a transmission time on L which is exponentially distributed with mean of unity. Packet transmission times and permit delays are all independent. We assume that a new packet for A (B) enters the transmission queue of L immediately upon receipt of a permit for A (B).

(a) Suppose that packets are transmitted on L on a first-come first-serve basis. Argue that the queue of L can be represented by a Markov chain with the 10 queue states BB, BBA, BAB, ABB, BBAA, BABA, BAAB, ABBA, ABAB, and AABB (each letter stands for a packet of the corresponding session). Show that all states have equal steady-state probability and that the steady-state throughputs of sessions A and B in packets/sec are 0.4 and 0.6, respectively.

(b) Now suppose that transmissions on link L are scheduled on a round-robin basis. Between successive packet transmissions for session B, session A transmits one packet if it has one waiting. Draw the state transition diagram of a five-state Markov chain which models the queue of L. Solve for the equilibrium state probabilities. What are the steady-state throughputs of sessions A and B?

1992_6.28.png

(c) Finally, suppose that session A has nonpreemptive priority over session B at link L. Between successive packet transmissions for session B, session A transmits as many packets as it can. Session B regains control of the link only when A has nothing to send. Draw the state transition diagram of a five-state Markov chain which models L and its queue. Solve for the equilibrium state probabilities. What are the steady-state throughputs of sessions A and B?

Reference no: EM131466491

Questions Cloud

What role does the concept of exclusionary rule play : To what extent might one argue that the exclusionary rule has gone too far in protecting civil liberties at the expense of fighting crime?

Manufactures resins and molded plastic product : IPC manufactures resins and molded plastic products. Which PM policy provides the minimum cost strategy based on the information provided?

What is the current price of the stuck : Assuming a required return of 14%, what is the current price of the stuck?

Calculate stock as beta : Now suppose rRF (1) increases to 6% or (2) decreases to 4%. The slope of the SML remains constant. How would this affect rM and rUTI?

What are the steady-state throughputs of sessions a and b : The purpose of this problem is to illustrate how the relative throughputs of competing sessions can be affected by the priority rule used to serve them.

What is marketing with and without ethics : What is marketing with and without ethics?

What is involved in the revision process : What’s involved in the revision process? Is revision still necessary in a digital age when workplace messages fly back and forth in split seconds?

Expected constant growth rate of the dividend stream : The price of this stock today is $1130 and the required rate of return on the stock is l?%.

Construct a markov chain for the number of permits at source : Consider a window between an external source and the node by which that source is connected to the subnet. The source generates packets according to a Poisson.

User Account

All Pages