Answer Happy

Consider sending a file of F = M-L bits over a path of Q links. Each link transmits at R bps. The network is lightly loaded so that there are no queuing delays. When a form of packet switching is used, the M. L bits are broken up into M packets, each packet with L bits. Propagation delay is negligible. Answer all three questions below. 1. Suppose the network is a packet-switched virtual circuit network. Denote the setup time of the virtual circuit by ts seconds. Suppose the sending layers add a total of h bits of header to each packet. How long does it take to send the file from source to destination? 2. Suppose the network is a packet-switched datagram network and a connectionless service is used. Now suppose each packet has 2h bits of header. How long does it take to send the file? 3. Finally, suppose that the network is a circuit-switched network. Further suppose that the transmission rate of the circuit between source and destination is R bps. Assuming to seconds of setup time and h bits of header appended to the entire file, how long does it take to send the file?

A Cyclic code word is received as 1011110, which may or may not be erroneous. Assuming generator polynomial )= x³ + x + 1, determine if the received Cyclic code word is valid or invalid. Show any calculations you carried out to reach your conclusion of whether the code word is valid or invalid. An answer with no work will receive no credit.