From dfd234d656871d4d340e87743027fbd83bf2baf6 Mon Sep 17 00:00:00 2001
From: niklas <niklas@niklas-Orion.(none)>
Date: Thu, 12 May 2011 13:07:09 +0200
Subject: [PATCH] Changed 2.7.2 to perfection!

---
 bibliography.bib | 20 ++++++++++++++++++++
 report.lyx       | 22 +++++++---------------
 2 files changed, 27 insertions(+), 15 deletions(-)

diff --git a/bibliography.bib b/bibliography.bib
index 80ee14b..888ccce 100644
--- a/bibliography.bib
+++ b/bibliography.bib
@@ -327,3 +327,23 @@ This paper details the motivations and design choices we made in Thrift, as well
  address = {New York, NY, USA},
  keywords = {property based testing, test automation},
 }
+
+@article{Gartner:1999:FFD:311531.311532,
+ author = {G\"{a}rtner, Felix C.},
+ title = {Fundamentals of fault-tolerant distributed computing in asynchronous environments},
+ journal = {ACM Comput. Surv.},
+ volume = {31},
+ issue = {1},
+ month = {March},
+ year = {1999},
+ issn = {0360-0300},
+ pages = {1--26},
+ numpages = {26},
+ url = {http://doi.acm.org/10.1145/311531.311532},
+ doi = {http://doi.acm.org/10.1145/311531.311532},
+ acmid = {311532},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+ keywords = {agreement problem, asynchronous system, consensus problem, failure correction, failure detection, fault models, fault tolerance, liveness, message passing, possibility detection, predicate detection, redundancy, safety},
+} 
+
diff --git a/report.lyx b/report.lyx
index 3e5577e..37be9e3 100644
--- a/report.lyx
+++ b/report.lyx
@@ -2812,9 +2812,9 @@ textbf{UUID}}{Universally Unique Identifier}
 \end_layout
 
 \begin_layout Standard
-Inside the GGS, everything has a unique identifier.
+Inside the GGS everything has a unique identifier.
  There are identifiers for players, tables and other resources.
- When players communicate amongst each other, or communicate with tables,
+ When players communicate amongst each other or communicate with tables,
  they need to be able to uniquely identify all of these resources.
  Within one machine, this is mostly not a problem.
  A simple system with a counter can be imagined, where each request for
@@ -2897,10 +2897,10 @@ Ds generated until 3400 A.D.
 \end_inset
 
 .
- This is accomplished by gathering several different sources of information,
- such as: time, MAC addresses of network cards, and operating system data,
- such as percentage of memory in use, mouse cursor position and process
- IDs.
+ The generation of a UUID is accomplished by gathering several different
+ sources of information, such as: time, MAC addresses of network cards,
+ and operating system data, such as percentage of memory in use, mouse cursor
+ position and process IDs.
  The gathered data is then 
 \emph on
 hashed
@@ -2930,15 +2930,7 @@ reference "fig:network-split"
 
 \end_inset
 
-, where 
-\emph on
-Site A
-\emph default
- is separated from 
-\emph on
-Site B
-\emph default
- by a faulty network (illustrated by the cloud and lightening bolt).
+, where an example of a network split is presented.
  When
 \emph on