Nov
26
Problem Statement A popular task in CCIE-level scenarios requires creating an access-list matching a set of prefixes using the minimum number of access-list entries. Typically, such scenarios were relatively easy, so figuring out a combination of subnet prefix and wildcard mask was more or less intuitive. However, a good question would be if there exist a generic algorithm for constructing such "minimal" access-lists. To give you a better feel of the problem, let's start with an example. Look... Read More

Subscribe to INE Blog Updates

New Blog Posts!