No strings found!

Source strings

196 Strings
100%
Browse Translate
11,337 Words
100%
68,856 Characters
100%
This translation is being used as source strings within this component.

Strings status

Strings Words Characters
196 11,337 68,856
All strings Browse Translate Zen
196 11,337 68,856
Read-only strings Browse Translate Zen
5 707 4,278
Strings with any failing checks Browse Translate Zen
1 135 815
Failing check: Unpluralised Browse Translate Zen
4 572 3,463
Failing check: Ellipsis Browse Translate Zen

Summary

Project website www.computer-networking.info
Project maintainers2 User avatar obonaventureUser avatar qdeconinck
Translation license Creative Commons Attribution Share Alike 3.0 Unported
Translation process
  • Translations can be made directly.
  • Translation suggestions can be made.
  • Any authenticated user can contribute.
  • The translation uses bilingual files.
Source code repository https://github.com/cnp3/ebook
Repository branch master
Last remote commit Merge pull request #159 from bhesmans/docker-build 5d27036
Olivier Bonaventure authored 7 months ago
Last commit in Weblate Merge pull request #159 from bhesmans/docker-build 5d27036
Olivier Bonaventure authored 7 months ago
Weblate repository https://weblate.info.ucl.ac.be/git/cnp3-ebook/index/
File mask locale/*/LC_MESSAGES/principles/network.po
Translation file Download locale/pot/principles/network.pot
Last change Sept. 17, 2022, 1:14 a.m.
Last change made by None
Language English
Language code en
Text direction Left to right
Case sensitivity Case-sensitive
Number of speakers 1,728,003,224
Number of plurals 2
Plural type One/other
Plurals Singular 1
Plural 0, 2, 3, 4, 5, 6, 7, 8, 9, 10, …
Plural formula n != 1
3 weeks ago

String statistics

Strings percent Hosted strings Words percent Hosted words Characters percent Hosted characters
Total 196 11,337 68,856
Translated 100% 196 100% 11,337 100% 68,856
Needs editing 0% 0 0% 0 0% 0
Read-only 100% 196 100% 11,337 100% 68,856
Failing checks 2% 5 6% 707 6% 4,278
Strings with suggestions 0% 0 0% 0 0% 0
Untranslated strings 0% 0 0% 0 0% 0
Last 12 months Previous

Activity in last 12 months

0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes 0 changes
JanFebMarAprMayJunJulAugSepOctNovDec

Quick numbers

11,337
Hosted words
196
Hosted strings
100%
Translated
0
Contributors
and previous 30 days

Trends of last 30 days

+98%
Hosted words
+100%
+100%
Hosted strings
—
+100%
Translated
—
—
Contributors
—
User avatar None

Resource updated
File “locale/pot/principles/network.pot” was added. 3 years ago
User avatar None

String updated in the repository
When a link is reported in the LSP of only one of the attached routers, routers consider the link as having failed and they remove it from the directed graph that they compute from their LSDB. This is called the `two-way connectivity check`. This check allows link failures to be quickly flooded as a single LSP is sufficient to announce such bad news. However, when a link comes up, it can only be used once the two attached routers have sent their LSPs. The `two-way connectivity check` also allows for dealing with router failures. When a router fails, all its links fail by definition. These failures are reported in the LSPs sent by the neighbors of the failed router. The failed router does not, of course, send a new LSP to announce its failure. However, in the graph that represents the network, this failed router appears as a node that only has outgoing edges. Thanks to the `two-way connectivity check`, this failed router cannot be considered as a transit router to reach any destination since no outgoing edge is attached to it.
When a link is reported in the LSP of only one of the attached routers, routers consider the link as having failed and they remove it from the directed graph that they compute from their LSDB. This is called the `two-way connectivity check`. This check allows link failures to be quickly flooded as a single LSP is sufficient to announce such bad news. However, when a link comes up, it can only be used once the two attached routers have sent their LSPs. The `two-way connectivity check` also allows for dealing with router failures. When a router fails, all its links fail by definition. These failures are reported in the LSPs sent by the neighbors of the failed router. The failed router does not, of course, send a new LSP to announce its failure. However, in the graph that represents the network, this failed router appears as a node that only has outgoing edges. Thanks to the `two-way connectivity check`, this failed router cannot be considered as a transit router to reach any destination since no outgoing edge is attached to it.
3 years ago
User avatar None

String updated in the repository
In this pseudo-code, `LSDB(r)` returns the most recent `LSP` originating from router `r` that is stored in the `LSDB`. `newer(lsp1, lsp2)` returns true if `lsp1` is more recent than `lsp2`. See the note below for a discussion on how `newer` can be implemented.
In this pseudo-code, `LSDB(r)` returns the most recent `LSP` originating from router `r` that is stored in the `LSDB`. `newer(lsp1, lsp2)` returns true if `lsp1` is more recent than `lsp2`. See the note below for a discussion on how `newer` can be implemented.
3 years ago
User avatar None

String updated in the repository
LSP.Links[i].cost: cost of the link
LSP.Links[i].cost: cost of the link
3 years ago
User avatar None

String updated in the repository
LSP.Links[i].Id: identification of the neighbor
LSP.Links[i].Id: identification of the neighbor
3 years ago
User avatar None

String updated in the repository
LSP.Links[]: links advertised in the LSP. Each directed link is represented with the following information:
LSP.Links[]: links advertised in the LSP. Each directed link is represented with the following information:
3 years ago
User avatar None

String updated in the repository
Unfortunately, split-horizon is not sufficient to avoid all count to infinity problems with distance vector routing. Consider the failure of link `A-B` in the four routers network shown below.
Unfortunately, split-horizon is not sufficient to avoid all count to infinity problems with distance vector routing. Consider the failure of link `A-B` in the four routers network shown below.
3 years ago
User avatar None

String updated in the repository
At this point, all routers have a routing table allowing them to reach all other routers, except router `A`, which cannot yet reach router `B`. `A` recovers the route towards `B` once router `D` sends its updated distance vector :math:`[A=1,B=2,C=2,D=0,E=1]`. This last step is illustrated in figure below, which shows the routing tables on all routers.
At this point, all routers have a routing table allowing them to reach all other routers, except router `A`, which cannot yet reach router `B`. `A` recovers the route towards `B` once router `D` sends its updated distance vector :math:`[A=1,B=2,C=2,D=0,E=1]`. This last step is illustrated in figure below, which shows the routing tables on all routers.
3 years ago
User avatar None

String updated in the repository
the new route was learned over the same link as the current best route towards this destination `(R[d].link == l)`
the new route was learned over the same link as the current best route towards this destination `(R[d].link == l)`
3 years ago
User avatar None

String updated in the repository
the cost of the new route is smaller than the cost of the already known route `((V[d].cost + l.cost) < R[d].cost)`
the cost of the new route is smaller than the cost of the already known route `((V[d].cost + l.cost) < R[d].cost)`
3 years ago
Browse all translation changes