Question: Q1. We have discussed the non-persistent HTTP and rdt FSMs, and please try to draw two HTTP finite state machines (one for HTTP client and


Q1. We have discussed the non-persistent HTTP and rdt FSMs, and please try to draw two HTTP finite state machines (one for HTTP client and one for HTTP server) Assume we only consider a simplified HTTP that only defines the following five messages (i.e., events): GET, 200 OK. 301 Moved Permanently, 404 Not Found, and 500 Internal Server Error, I provide an example of HTTP FSMs as following that have only two events (i.e., GET' and '200 OK) for your reference. You may extend them to make your own version of FSMs (that support all five messages), and you can add any function in your FSMs (as long as the function name is easy for TA to understand) Note that we assume the underlying TCP is reliable so no HTTP message will be lost or corrupted. You may ignore regular HTTP headers (except for Location header in 301 response message) HTTP Chent FSM user input (u send Saver top rcv Chttp_r Q1. We have discussed the non-persistent HTTP and rdt FSMs, and please try to draw two HTTP finite state machines (one for HTTP client and one for HTTP server) Assume we only consider a simplified HTTP that only defines the following five messages (i.e., events): GET, 200 OK. 301 Moved Permanently, 404 Not Found, and 500 Internal Server Error, I provide an example of HTTP FSMs as following that have only two events (i.e., GET' and '200 OK) for your reference. You may extend them to make your own version of FSMs (that support all five messages), and you can add any function in your FSMs (as long as the function name is easy for TA to understand) Note that we assume the underlying TCP is reliable so no HTTP message will be lost or corrupted. You may ignore regular HTTP headers (except for Location header in 301 response message) HTTP Chent FSM user input (u send Saver top rcv Chttp_r
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
