Probability-driven routing in a datapath environment

DOI10.1016/S0167-9260(02)00024-XMaRDI QIDQ4545097zbMATH OpenFDO

Authors Suresh Raman, Sachin S. Sapatnekar, Charles J. Alpert

Publication date 13 August 2002

Published in Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-9260(02)00024-X

zbMATH Keywords

congestiondatapathmulticommodity flowprobabilitysimultaneous routing

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Nonnumerical algorithms (68W05)

Recommendations

• A new algorithm for standard cell global routing
• Multiterminal global routing: A deterministic approximation scheme
• A Provably Good Algorithm for the Two Module Routing Problem
• scientific article; zbMATH DE number 3898776
• A provably tight delay-driven concurrently congestion mitigating global routing algorithm

Cited in

(2)

• A combinatorial congestion estimation approach with generalized detours
• Escape probability based routing for ad hoc networks

This page was built for publication: Probability-driven routing in a datapath environment

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