Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
goSDN
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Iterations
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Terraform modules
Analyze
Contributor analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
danet
goSDN
Commits
a69d87e4
Commit
a69d87e4
authored
4 years ago
by
Martin Stiemerling
Browse files
Options
Downloads
Patches
Plain Diff
playing with md and superset typography
parent
f0e86d35
No related branches found
No related tags found
3 merge requests
!90
Develop
,
!62
Resolve "Update database in order to achieve the long-term goals of the project"
,
!53
V.0.1.0 Codename Threadbare
Pipeline
#51666
passed
4 years ago
Stage: test
Changes
1
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
documentation/design/05-implementation.md
+5
-4
5 additions, 4 deletions
documentation/design/05-implementation.md
with
5 additions
and
4 deletions
documentation/design/05-implementation.md
+
5
−
4
View file @
a69d87e4
...
@@ -19,9 +19,10 @@ the network for a longer time, i.e., multiple minutes or even longer.
...
@@ -19,9 +19,10 @@ the network for a longer time, i.e., multiple minutes or even longer.
### Topology Inventories
### Topology Inventories
Every network has one given physical topology and on top of this at least one
Every network has one given physical topology (G
<sub>
physical
</sub>
) and on
logical topology. There may be multiple logical topologies on top logical
top of this at least one logical topology (G
<sub>
logical1
</sub>
). There may be
topologies, i.e., a recursion.
multiple logical topologies (G
<sub>
n+1
</sub>
) on top logical topologies
(G
<sub>
n
</sub>
), i.e., a recursion.
A topology consists out of interfaces, which are attached to their respective
A topology consists out of interfaces, which are attached to their respective
network elements, and links between these interfaces.
network elements, and links between these interfaces.
...
@@ -30,7 +31,7 @@ Mathematically, such a topology can be described as a directed graph, whereas
...
@@ -30,7 +31,7 @@ Mathematically, such a topology can be described as a directed graph, whereas
the interfaces of the network elements are the nodes and the links are
the interfaces of the network elements are the nodes and the links are
the edges.
the edges.
G
<sub>
physical
</sub>
ist a superset of G
<sub>
logical1
</sub>
.
G
<sub>
physical
</sub>
ist a superset of G
<sub>
logical1
</sub>
.
### Potential other Inventories
### Potential other Inventories
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment