Little research has been done to date on scalable routing algorithms for large numbers of groups. This project aims to design novel scalable and global anycast routing algorithms for a large number of groups. To enhance routing efficiency, a hybrid routing approach will be applied by invoking proactive advertisements and a reactive searching strategy. The research will tackle the complexity problems of the scalable algorithms and derive theoretical properties of delay calculation for multiple-domain scalable anycast routing.

Specifically, the research will:

1. design multiple anycast group routing and connection algorithms for providing efficient registration and connection for a large number of anycast groups in terms of internal, popular and unpopular group classifications;
2. investigate the integrated proactive advertisements and the reactive searching scheme for anycast routing with different kinds of groups;
3. study related theoretical results for the stability and scalability of the anycast routing; and
4. prototype the protocol into an experimental system and investigate the fitness of the protocol for industrial use.