It is well-known that adding extra capacity to queues in networks where individuals choose their own route can sometimes severely degrade performance, rather than improving it. We will discuss some simple examples of queueing networks where this is the case under probabilistic routing, but where under state-dependent routing the worst case performance is no longer seen. This raises the question of whether giving arrivals more information about the state of the network leads to better performance more generally. This is joint work with Heti Afimeimounga, Lisa Chen, Mark Holmes, Bill Solomon, and, latterly, Niffe Hermansson and Elena Yudovina. (Jointly sponsored by the Mathematics and ECE Departments.)