An efficient network-wide broadcasting based on hop-limited shortest-path trees (Q2377894)
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 5494934
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient network-wide broadcasting based on hop-limited shortest-path trees |
scientific article; zbMATH DE number 5494934 |
Statements
An efficient network-wide broadcasting based on hop-limited shortest-path trees (English)
0 references
20 January 2009
0 references
flooding
0 references
shortest path tree
0 references
P2P
0 references
routing
0 references
wired networks
0 references
0.677754819393158
0 references
0.6740584969520569
0 references
0.6724731922149658
0 references
0.66538006067276
0 references
0.6645853519439697
0 references
