1 / 12

Enhancing PIM with DRLB Algorithm for Load Balancing in Multicast Routing

This draft presents an update to the PIM DRLB (Dynamic Rendezvous Point Load Balancing) protocol, highlighting advancements in hashing algorithms for distributing multicast traffic among multiple candidate Designated Routers (GDRs). It compares the BSR and Modulo hash algorithms, demonstrating that while BSR minimizes stream interruption during failover, Modulo ensures even load distribution among GDRs. The draft proposes a new algorithm type system and introduces the option to use Router ID for hash calculations, optimizing network performance across different LANs.

ronda
Télécharger la présentation

Enhancing PIM with DRLB Algorithm for Load Balancing in Multicast Routing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. draft-ietf-pim-drlb

  2. Draft Status • First presented at IETF 82, Taipei, accepted as WG draft-ietf-pim-drlb-00 • Update History: • -02: Included BSR hashing to select GDR • -03: Proposal • Introduce hash algorithm selector • Introduce router Id

  3. Modulo Hash Algorithm • hashvalue_group=((Group_address &Group_hashmask)>>N) %M • M number of candidate GDRS • Because of the nature of algorithm it evenly distributes the load on candidate GDRs. • Works best when there are two DRs

  4. BSR Hash Algorithm • hashvalue_group=(1103515245*((1103515245*(Group_address & Group_hashmask)+12345) XOR GDR(i))+12345) mod 2^31 • Originally used in RP election process • It does not evenly distribute the load

  5. Testing setup • Tested on sequential group joins • 224.1.1.1-224.1.1.255 • Original 3 candidate GDRs • Failure of a candidate GDR • Addition of a candidate GDR • Ran test multiple times to get average numbers

  6. BSR vs. Modulo distribution

  7. Modulo Vs. BSR (Failover) Count of unaffected Groups Count of Reassigned Groups from GDR3 Count of Reassigned Groups from unaffected GDRs

  8. Modulo Vs. BSR(New CGDR) Distribution of new Candidate GDR

  9. Conclusion • Between the two, BSR provides the minimum interruption of streams in case of a failover when there are three or more routers. • On the other hand, Modulo has a even distribution when in comes to load balancing.

  10. Propose Update • Initial draft: Modulo • 2nd Version: BSR • Next Version: • Introduce a new “algorithm” type: • 0 for Modulo • 1 for BSR • Others for future developed algorithm if any • Only run DRLB if all LHR agree on the same algorithm, otherwise log error message, detail to be followed

  11. More • Suggestion to include “Interface ID” option in Hello • If “interface ID” option presents in Hello, use “Router ID”, instead of “interface IP address”, to calculate hash, so that same router is elected on different LANs to save uplink bandwidth • “Router ID” is more desired in BSR hash algorithm than in Modulo, because the BSR hash result is tricky to predict

  12. Comments ? • Thank you

More Related