This paper presents new upper bounds for channel routing of multiterminal nets, which answers the long-standing open question whether or not multiterminal problems really require channels two times wider than 2-terminal problems. We transform any multiterminal problem of density d into a so-called extended simple channel routing problem (ESCRP) of density 3d /2 + O√ d log d) . We then descibe routing algorithms for solving ESCRPs in three different models. The channel width w is ≤ 3d/2 +O(√d log d) in the knock-knee and unit-vertical-overlap models, and w ≤ 3d/2 + O√d log d) + O(ƒ) in the Manhattan model, where f is the flux of the problem. In all three cases, we improve the best-known upper bounds.