1. Exploring new methods of route aggregation Amirali Abdullah

2. What is the need for this research? Volume of traffic on internet increases every year. Hence, demand on routers also increases.

3. So an obvious conclusion is…… Faster routers are better!!

4. How to provide faster routing? Possible solutions: 1)Faster hardware 2)More optimized routing paths 3)Given a fixed data structure, reduce number of keys in routing table 4)Given a fixed number of keys, produce a better data structure for lookup.

5. Dynamic tree and Prefix expansion method work by: Making better data structures to handle keys Underlying this, the keys (prefixes of contiguous address) remain same

6. What if……. Instead of optimizing the data structure….. we reduce the amount of data it has to contain?

7. Example: Consider prefix 10.1.0 through to 10.1.255 map to destination A, except 10.1.243. If we expressed this through traditional method of common prefixes, we would have entries

8. PrefixDestination 10.1.0A 10.1.10A 10.1.110A 10.1.1110A 10.1.11111A 10.1.111101A 10.1.1111000A 10.1.11110010A

9. So essentially to show two pieces of information, we have stored eight!! The question being: Can we come up with a method of aggregation that is more efficient? That is what I aim to find out.