OpenAlex
PricingAboutJobs
Log inGet started
Work

A loop-free extended Bellman-Ford routing protocol without bouncing effect

HTML

Year: 1989
Type: conference-paper
Source: ACM SIGCOMM Conference (SIGCOMM)
DOI: 10.1145/75246.75269
Authors: C. Cheng, R. Riley, S. P. R. Kumar, J. J. Garcia-Luna-Aceves
Institutions: Northwestern University, SRI International
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: Bellman-Ford algorithm, routing protocols, loop-free paths, shortest path routing, dynamic topology, node and link failures, distributed algorithms, message complexity, time complexity

Open Access status: closed
OpenAlex ID: W1969057198
FWCI: 4.62
Cites: 20
Cited by: 215
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms