UNIVERSITY OF MASSACHUSETTS, AMHERST – Department of Electrical and Computer Engineering 23 Outline  Routing and the BMP (Best Matching Prefix) problem  Basic scheme: binary search of hash tables  Refinements: asymmetric trees, mutated binary search and ropes  Implementation: building the tree  Performance and comparison study
{}