Peel-the-box: a concept of switch-box routing and tractable problems

Abstract A switch-box is called tractable if there is a polynomial time algorithm (router) to complete the connection requirement. This paper presents classes of tractable switch-boxes that are readily recognizable and routed by a proposed switch-box router, or rather a principle, BOX-PEELER. It routes the currently outermost net one-by-one in a manner “peeling the switch-box”. BOX-PEELER is developed to be a general concept in switch-box routing as LEFT-EDGE-ROUTER has been in 2-side channel routing.

[1]  A. S. LaPaugh,et al.  ALGORITHMS FOR INTEGRATED CIRCUIT LAYOUT: AN ANALYTIC APPROACH , 1980 .

[2]  James P. Cohoon,et al.  BEAVER: a computational-geometry-based tool for switchbox routing , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Thomas G. Szymanski.  Dogleg Channel Routing is NP-Complete , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[4]  Shuji Tsukiyama,et al.  A Switch Box Router - Tree-Ring Switch-Box Router - , 1986 .

[5]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.