Internet multicast communication services are very useful tools for internet applications.

Anycast is a new communication service defined in IPv6 (Internet Protocol Version 6 for next generation). An anycast message is the one that is delivered to one "nearest" member in a group of designated recipients. Anycast and multicast mechanisms may be integrated together to provide even better services.

Little research has been done on anycast routing algorithms and none on integration of routing protocols for multicast and anycast messages. This research aims to:

1. design reliable and dynamic anycast routing algorithms for efficient transmission of anycast messages to a group of servers;
2. use the core-based tree technique to build a multicast tree and establishing new multicast routing algorithms in conjunction with anycast routing;
3. investigate the combination metrics of scalability and fault-tolerance for dynamic multicast and anycast routing algorithms; and
4. prototype the reliable multicast and anycast routing algorithms with efficiency and implement it into an experimental protocol.