A fast congestion estimator for routing with bounded detours

Congestion estimation is an important issue for the success of the VLSI layout. Fast congestion estimation provides an efficient means to adjust the placement and rontahility. A probabilistic model of interconnections enables designen to quickly predict routing congestion. We propose a powerful and fast estimation approach which allows wires to have hounded-length detours to bypass congestions. Our method is more realistic and precise than the previous work. It is much faster than a global router fro estimation purpose. The experimental results demonstrate the effectiveness of the method on routing benchmarks.