On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints

DOI10.1142/S0129054103001868zbMath1075.68551OpenAlexW1984011655WikidataQ116677329 ScholiaQ116677329MaRDI QIDQ5696924

William C. Grimmell, Nageswara S. V. Rao

Publication date: 19 October 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054103001868

zbMATH Keywords

routingcommunications protocolsquickest pathsdynamic bandwidths

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (1)

Probabilistic quickest path algorithm

Cites Work

• Fast data transmission and maximal dynamic flow.
• Unnamed Item

This page was built for publication: On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints