IP anycasting was considered to be non-scalable, until Katabi et al  proposed a scheme called GIA. This scheme makes two important assumptions. One, the anycast addresses have a specific format distinguisable from unicast address. Two, it is only necessary to reach the nearest anycast member only if there is a lot of traffic to the anycast group. In this paper, we propose an extension of GIA to achieve load balancing in the Internet. Our scheme builds upon GIA by adding load information exchange features. This enables the client to choose a member of the anycast group which is not just routing-wise nearest to it, but the one which actually improves its response time, by a proper balance of routing proximity and load. An advantage of our scheme is that it does on-demand routing information exchange, resulting in less overhead. We evaluate the performance of our design through simulation, and show that it achieves better load balancing, compared to GIA, which sends packets to the nearest server, irrespective of the load. © Springer-Verlag Berlin Heidelberg 2003.