Bringing order to BGP: decreasing time and message complexity (Q1031040)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5622233
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bringing order to BGP: decreasing time and message complexity |
scientific article; zbMATH DE number 5622233 |
Statements
Bringing order to BGP: decreasing time and message complexity (English)
0 references
28 October 2009
0 references
routing protocols
0 references
BGP
0 references
convergence
0 references
path exploration
0 references
0.9730610847473145
0 references
0.808017909526825
0 references
0.7604377269744873
0 references
0.7523671984672546
0 references
0.72260981798172
0 references
