1989
DOI: 10.1109/26.24597
|View full text |Cite
|
Sign up to set email alerts
|

Event driven topology broadcast without sequence numbers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
19
0

Year Published

1997
1997
2006
2006

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(20 citation statements)
references
References 12 publications
1
19
0
Order By: Relevance
“…In this respect, it is similar to other link-state algorithms (e.g., OSPF [20], SPTA [25], LVA [10], ALP [12]). …”
Section: Computingsupporting
confidence: 52%
“…In this respect, it is similar to other link-state algorithms (e.g., OSPF [20], SPTA [25], LVA [10], ALP [12]). …”
Section: Computingsupporting
confidence: 52%
“…The partial-topology dissemination algorithm (PDA) propagates enough link-state information in the network, so that each router has sufficient link-state information to compute shortest paths to all destinations. In this respect, it is similar to other link-state algorithms (e.g., OSPF [20], SPTA [25], LVA [10], ALP [12]). PDA combines the best features of LVA, ALP and SPTA.…”
Section: Computing D I Jmentioning
confidence: 56%
“…When there is fine granularity in link costs metric, perhaps for accuracy, there is less likelihood that multiple paths with equal distance exist between each source-destination pair, which means the full connectivity of the network is still not used for load-balancing. Also, OSPF and other algorithms based on topology-broadcast (e.g., [4,5]) incur too much communication overhead, which forces the network administrators to partition the network into areas connected by a backbone. This makes OSPF complex in terms of router configuration required.…”
Section: Multipath Routing and Quality Of Servicementioning
confidence: 99%