figure 7.1 an example showing the first two phases of maekawa"s modified algorithm. process 2 sends an ack to 5 and a failed message to 1. but when 2 later receives a request with a time stamp 12, it sends an inquire message to 5 to find out if it indeed entered its cs.
Wordt vertaald, even geduld aub..
