Solving the General's Problem (cont.) USING THE APPROACH THE TWO ARMIES WILL MOVE STEADILY TOWARD THE ENEMY IN A COORDINATED WAY UNTIL... BECAUSE EACH MESSAGE SENT: PROPOSES MOVING CLOSER CONFIRMS RECEIPT OF AND AGREEMENT TO THE PREVIOUS PROPOSAL FROM THE OTHER SIDE. NEITHER GENERAL KNOWS EXACTLY WHERE THE OTHER GENERAL IS, BUT BOTH KNOW THAT THE OTHER IS NO MORE THAN ONE STEP BEHIND.

The Web: Technologies and Techniques Links to other course pages: CS 105 Home Page CS 105 Lecture Schedule CS 105 On-line Discussion Group: All discussions Discussion relating to this lecture topic Williams College Department of Computer Science

This page is part of a section of lecture slides related to " Reliability and Connections " within the topic "Data Delivery Obstacles". Other slides within this section and other sections of slides for the topic "Data Delivery Obstacles" can be accessed using the links below. Retransmission Techniques Acknowledgements and Retransmission Retransmissions and Timeouts Sequence Numbers Sequence Numbers (cont.) Message Reordering Reliability and Connections A Reliable Delivery Problem Cautious Generals Solving the General's Problem Solving the General's Problem (cont.) Connections Establishing Connections Persistent HTTP Connections Network Congestion Packet Loss and Congestion Congestion and Transmission Rate Congestion and TCP Connections Finding the Bottleneck Rate TCP Transmission Rate Adjustment Error Detecting Codes Damagaged Data Symbols and Meaning Interpreting Binary Symbols Evaluating Codes Error Detecting Codes Parity Codes for Error Detection Multiple Bit Errors Interleaved Transmission Error Correcting Codes Any Guesses? Digital Recording on Compact Discs Two-dimensional Parity Bits Spatial Interleaving