计算机代考程序代写 scheme COMP 5416 Week 1 – cscodehelp代写

COMP 5416 Week 1
Exercise 1: Equilibrium of Two Competing Transmissions
User 1
User 2
Consider the problem discussed in the lecture, but change the utility as follows. Recompute (1) the transmission probability at equilibrium (if we do not allow pure strategy) (2) the average utility at equilibrium.
1¡¯s decision (1, 2) utility
2¡¯s decision
Transmit
Keep silent
Transmit
(-5,-5)
(0,15)
Keep silent
(15,0)
(0,0)
Still, user 1 transmits with probability p1 and user 2 with probability p2. The probabilities of the four outcomes are as follows.
(0,0) (1-p1)(1-p2)
Mean performance of user 1
U1=-5p1p2+15p1 (1-p2)+0(1-p1)p2+0(1-p1)(1-p2)= -5p1p2+15p1(1-p2)= (15-20 p2) p1 Mean performance of user 2
U2=-5p1p2+0p1 (1-p2)+15(1-p1)p2+0(1-p1)(1-p2)= -5p1p2+15(1-p1)p2= (15-20 p1) p2
1¡¯s decision (1, 2) utility
2¡¯s decision
Transmit p2
Keep silent 1-p2
Transmit p1
(-5,-5) p1p2
(15,0) p1(1-p2)
Keep silent 1-p1
(0,15) (1-p1)p2
Given p2, the optimal p1 is
1 if p2<3/4, Similarly, given p1, the optimal p2 is any value in [0,1] if p1=3/4 p2 p2 11 0, if p2>3/4,
any value in [0,1] if p2=3/4
1 if p1<3/4, 0, if p1>3/4,
p2
1
p2=1 if p1<3/4 p1=0 if p2>3/4
p1 in [0,1] if p2=3/4
p1=1 if p2<3/4 0 1p1 0 1p1 Three equilibria Pure strategy Mixed strategy Pure strategy p2 in [0,1] if p1=3/4 p2=0 if p1>3/4
p1=3/4 p2=3/4
0 1 p1
In the mixed strategy, p1=3/4, p2=3/4, with U1=0, U2=0
Unfortunately, the output utilities are still 0 even if we change the input parameters.
Exercise 2: Segmentation with overhead
A file of size F=300 Bytes is transmitted on an end-to-end connection over three links. The bit rate of all links is R=1000 bit/sec. Ignore the propagation delay. Assume that a header of 40 Bytes is added to each packet.
(1) How long does it take to transmit the file if the whole file is transmitted as a single packet and the nodes use the store-and-forward scheme?
(2) We would like to break the file into smaller packets to decrease the transmission time in the store-and-forward scheme. Assume that each time you break the file to make a new packet,

you have to add 40 Bytes as the header of the new packet. What should be the optimum size of the packets (including the header) to have the minimum transmission delay for the whole file? Find the total transmission delay.