Question $9$

$==========$

a$)$ Consider the concurrent logical channels protocol. Could you add something

similar to part $($a$)$ above to the concurrent logical channels $($without major

modifications to the protocol$)?$ Explain why yes or why no$.$

b$)$ Consider again the concurrent logical channels protocol. Can we eliminate the

bit in the acknowledgment? I.e$.,$ can ack's be simply ack$($n$),$ where n is the

channel number? $($i$.$e$.$ no bit$).$ Of course, there are a few small changes to the

code e$.$g$.,$ the seneder$\text{'}$s receive action now would be

when receive ack$($n$)$ then

ab$[$n$]$ :$=$ ab$[$n$]+1$ mod $2$

and the receiver would send ack$($n$)$ instead of ack$($n$,$b$)$

Would this work? $($Note: the frames remain as they are, frame$($n$,$b$,$body$),$ they

don't change$)$