Single-Source Stochastic Routing

DOI10.1007/11830924_10MaRDI QIDQ3595376zbMATH OpenOpenAlexFDO

Authors Shuchi Chawla, Tim Roughgarden

Publication date 28 August 2007

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11830924_10

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10)

Recommendations

• Stochastic unsplittable flows
• Single-path routing of stochastic flows in networks
• scientific article; zbMATH DE number 4057261
• Routing of uncertain traffic demands
• Optimal routing for minimizing the maximal link congestion

Cited in

(7)

• Stochastic unsplittable flows
• Routing strategies under demand uncertainty
• scientific article; zbMATH DE number 4077133 (Why is no real title available?)
• Randomized Single-Target Hot-Potato Routing
• Single-path routing of stochastic flows in networks
• Optimal routing for minimizing the maximal link congestion
• Single-layer channel routing and placement with single-sided nets

This page was built for publication: Single-Source Stochastic Routing

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