Little research has been done on anycast routing algorithms and none on integration routing protocols for both multicast and anycast messages has been reported. This proposal aims to design and prototype a reliable and efficient integrated routing protocol for both multicast and anycast communications on the Internet. It aims to:
- design reliable and dynamic anycast routing algorithms for efficient transmission of anycast messages over the Internet to a group of servers by using a core-based tree technique to build a multicast tree, and establishing new multicast routing algorithms taking advantage of anycast routing in exploring reliability, short delay and load sharing for multicast traffic; and
- investigate the combination metrics of connectivity, scalability and fault-tolerance for dynamic multicast and anycast routing systems.
The researchers' initial analytical and experimental results have shown that the benefits of anycast algorithms can be significant for reducing end-to-end packet delay, attaining load balance and fault-tolerance.
