aboutsummaryrefslogtreecommitdiff
path: root/content/en/docs/Concepts
diff options
context:
space:
mode:
authorSander Vrijders <[email protected]>2019-10-12 15:07:35 +0200
committerSander Vrijders <[email protected]>2019-10-12 15:07:35 +0200
commitb64144b5a6c8ac62dafee254fecf978fb0150645 (patch)
treecb99be8f612dc3109b35038832875967a90b1d5e /content/en/docs/Concepts
parentfd3f32b8b435803b7c0ecb6603b9f014b519f37d (diff)
downloadwebsite-b64144b5a6c8ac62dafee254fecf978fb0150645.tar.gz
website-b64144b5a6c8ac62dafee254fecf978fb0150645.zip
content: Fix several typos
Also removes the changelog everywhere, as that is tracked by git.
Diffstat (limited to 'content/en/docs/Concepts')
-rw-r--r--content/en/docs/Concepts/elements.md6
-rw-r--r--content/en/docs/Concepts/layers.md5
-rw-r--r--content/en/docs/Concepts/protocols.md10
-rw-r--r--content/en/docs/Concepts/what.md8
4 files changed, 2 insertions, 27 deletions
diff --git a/content/en/docs/Concepts/elements.md b/content/en/docs/Concepts/elements.md
index bfc7fab..a803065 100644
--- a/content/en/docs/Concepts/elements.md
+++ b/content/en/docs/Concepts/elements.md
@@ -88,9 +88,3 @@ these dependencies should never contain cycles (so a layer I should
not directly or indirectly depend on itself). The rank of a layer is
defined (either locally or globally) as the maximum depth of this
layer in the DAG.
-
----
-Changelog:
-
-2019 07 11: Initial version.<br>
-2019 07 23: Added dependency graph figure
diff --git a/content/en/docs/Concepts/layers.md b/content/en/docs/Concepts/layers.md
index e7c1441..e0bc98a 100644
--- a/content/en/docs/Concepts/layers.md
+++ b/content/en/docs/Concepts/layers.md
@@ -83,8 +83,3 @@ primitive. This allows to create *adjacencies* between network nodes.
An example of how to create a small two-node network is given in
[tutorial 2](/docs/tutorials/tutorial-2/)
-
----
-Changelog:
-
-2019-07-23: Initial version
diff --git a/content/en/docs/Concepts/protocols.md b/content/en/docs/Concepts/protocols.md
index 16c72cb..f5d1925 100644
--- a/content/en/docs/Concepts/protocols.md
+++ b/content/en/docs/Concepts/protocols.md
@@ -119,12 +119,4 @@ protocol]((https://www.osti.gov/biblio/5542785-delta-protocol-specification-work
which is a timer-based protocol that is a bit simpler in operation
than the equivalent functionalities in TCP. In contrast with TCP/IP,
Ouroboros does congestion control purely in the network protocol, and
-fragmentation and flow control purely in the transport protocol.
-
-
-
-
---- Changelog:
-
-2019 09 05: Initial version.<br>
-2019 09 06: Added section on transport protocol. \ No newline at end of file
+fragmentation and flow control purely in the transport protocol. \ No newline at end of file
diff --git a/content/en/docs/Concepts/what.md b/content/en/docs/Concepts/what.md
index bacd4d6..54a0ca8 100644
--- a/content/en/docs/Concepts/what.md
+++ b/content/en/docs/Concepts/what.md
@@ -100,7 +100,7 @@ __metric__ (distance function).
__Network discovery__: Ethernet switches learn where the endpoints are
through MAC learning, remembering the incoming interface when it sees
-a new SRC address; IP routers learn the network by exchanging
+a new soure address; IP routers learn the network by exchanging
informational packets about adjacency in a process called *routing*;
and a VPN proxy server relays packets as the central hub of a network
connected as a star between the VPN clients and the local area
@@ -138,9 +138,3 @@ functionality, but different in its choice of algorithm or
implementation. Sometimes the function is just not implemented
(there's no need for routing in a tunnel!), but logically it could be
there.
-
-
----
-Changelog:
-
-2019 07 09: Initial version. \ No newline at end of file