Add the rest of university notes

docs/lectures/acn/06_DTN_congestion_control.md

@@ -20,7 +20,7 @@ When deciding on the best carrier and the optimal number of messages, CAFREP dyn
 2. Predictive **node congestion** (node storage and in-network delays)
 3. Predictive **ego network congestion** 
 
-![img](/lectures/acn/img/g.png)
+![img](img/g.png)
 
 Each layer you go up, the more information is exchanged between the nodes.
 
@@ -34,7 +34,7 @@ $$
 Ret(X) = B_c(X) - \sum^N_{i=1} \space M^i_{size}(X)
 $$
 
-For a node $$X$$, it has buffer of size $$B_c(X)$$. When a message of size $$M^i_{size}$$ is sent to node $$X$$, it's buffer size is the total buffer minus the memory taken by the sum of all messages in the buffer.
+For a node $X$, it has buffer of size $B_c(X)$. When a message of size $M^i_{size}$ is sent to node $X$, it's buffer size is the total buffer minus the memory taken by the sum of all messages in the buffer.
 
 ###### Node Receptiveness
 
@@ -66,7 +66,7 @@ $$
 EN_{Ret}(X) = \frac{1}{N}\sum^N_{i=1}Ret(C_i(X))
 $$
 
-Gets the average of the retentiveness of node $$X$$ and it's neighbours $$c_i(X)$$
+Gets the average of the retentiveness of node $X$ and it's neighbours $c_i(X)$
 
 ###### Ego Network Receptiveness
 
@@ -88,9 +88,11 @@ $$
 #### Contents of CAFREP Node
 
 ![img](img/h.png)
+
 $$
 Replication\space rate = M \times \frac{TotalUtil(Y)}{TotalUtil(X) + TotalUtil(Y)}
 $$
+
 Total utility, changes constantly. The replication limit grows to take advantage of all available resources, and backs off when congestion increases.
 
 Social utility prevents replication at a high rate on free nodes that are not on the path to the destination.