Performance Evaluation of In-Packet Membership Querying Algorithm for Large-Scale Networks

The membership querying algorithm provides a key component of any network routing and forwarding schemes that successful source in-packet multicast forwarding protocols. Source multicast forwarding protocols (a.k.a., stateless multicast routing) such as Code-Oriented eXplicit multicast (COXcast) which based on Chinese Remainder Theorem (CRT), and Line Speed Publish/ Subscribe Inter-Networking (LIPSIN) which based on Bloom Filter (BF), were both proposed recently as alternatives to retain advantages of traditional multicast while eliminating their shortcomings especially for small-group applications in IP networks. Most of these protocols avoid the routing state in intermediate routers and leave the burden of scalability management to the multicast source and end-hosts. However, they still have some drawbacks especially in the group size limitation. This paper is subjected to the two prominent and popular source multicast routing protocols-COXcast and LIPSIN, with identical conditions and evaluates their relative performance with respect to the two performance metrics: space and time efficiency. From the detailed comparative results and analysis with various simulation scenarios, a suitable in-packet multicast routing protocol can be chosen for specified network environments and service goals.