Consider a communication network with the following architecture. Client host X is connected to a server host Y via three communication links: a client access link with transmission bit rate Ry=R bit/s, a backbone link with transmission bit rate R = 10R bills, and a server access link with transmission bit rate R3 = R bills. That is there are two routers between host X and host Y. Each access link has a distance (length) of d meters, while the backbone link has a length of 20d meters. The routers interconnecting the communication links have unlimited buffer capacity and negligible nodal processing delay in the following sub-problems a), b), and c), we examine the transmission of a file of size Ebits with different transmission protocols over the described network architecture Aside from our examined transmission of the file of size Fbits, there are no other traffic flows in the considened network b) Consider packet switching, i.e. the file is broken up into packets, each packet with P information bits, ie. there are F/P packets (whereby we assume that F/P is an integer). Packet header bits are negligible How long does it take to transmit the file? Consider packet transmission without window- based flow congestion control, i.e. the client host can send an unlimited number of packets into the network How long does it take to transmit the file? c) Consider packet switching, Le the file is broken up into packets, each packet with P information bits, le., there are F/P packets (whereby we assume that F/P is an integer). Packet header bits are negligible Consider packet transmission with a window-based flow congestion control with a window size of one packet ie, the client host can send only one packet into the rhytwork before it has to stop to wait for an acknowledgement from the server. There are no packet losses in the network, and acknowledgements have negligible transmission delay (but incur the propagation delays) How long does it take to transmit the file? Consider a communication network with the following architecture. Client host X is connected to a server host Y via three communication links: a client access link with transmission bit rate Ry=R bit/s, a backbone link with transmission bit rate R = 10R bills, and a server access link with transmission bit rate R3 = R bills. That is there are two routers between host X and host Y. Each access link has a distance (length) of d meters, while the backbone link has a length of 20d meters. The routers interconnecting the communication links have unlimited buffer capacity and negligible nodal processing delay in the following sub-problems a), b), and c), we examine the transmission of a file of size Ebits with different transmission protocols over the described network architecture Aside from our examined transmission of the file of size Fbits, there are no other traffic flows in the considened network b) Consider packet switching, i.e. the file is broken up into packets, each packet with P information bits, ie. there are F/P packets (whereby we assume that F/P is an integer). Packet header bits are negligible How long does it take to transmit the file? Consider packet transmission without window- based flow congestion control, i.e. the client host can send an unlimited number of packets into the network How long does it take to transmit the file? c) Consider packet switching, Le the file is broken up into packets, each packet with P information bits, le., there are F/P packets (whereby we assume that F/P is an integer). Packet header bits are negligible Consider packet transmission with a window-based flow congestion control with a window size of one packet ie, the client host can send only one packet into the rhytwork before it has to stop to wait for an acknowledgement from the server. There are no packet losses in the network, and acknowledgements have negligible transmission delay (but incur the propagation delays) How long does it take to transmit the file