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

DOI10.1142/S0129054103001868MaRDI QIDQ5696924zbMATH OpenOpenAlexWikidataFDO

Authors William C. Grimmell, N. 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

communications protocolsdynamic bandwidthsquickest pathsrouting

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• Computational Science and Its Applications – ICCSA 2004
• Transmissions in a network with capacities and delays
• On the computation of fast data transmissions in networks with capacities and delays
• Probabilistic quickest path algorithm
• Fast data transmission and maximal dynamic flow.

Cites work

• Fast data transmission and maximal dynamic flow.
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)

Cited in

(6)

• Probabilistic quickest path algorithm
• scientific article; zbMATH DE number 1726628 (Why is no real title available?)
• Maximum delay computation under traffic matrix uncertainty and its application to interdomain path selection
• Computational Science and Its Applications – ICCSA 2004
• Optimal path selection for minimizing the differential delay in Ethernet-over-SONET
• Determining an appropriate sending rate over an underutilized network path

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696924)