Packet forwarding using improved Bloom filters

摘要: Efficient IPv6 packet forwarding still is a major bottleneck in todays networks. Especially the internet core we face very large routing tables and high number of high-speed links. In addition, economical restrictions exist terms manufacturing operation costs routers. Resources are limited network providers reluctantly change their infrastructure. On other hand hosts keeps exploding. Not only PCs mobile computers, but all kinds devices want to connect internet. With low-cost end-user flatrates households connecting net also increases. Economically emerging countries do share. Unbalanced distribution IPv4 addresses leads local service shortages. The address space provides close getting exhausted. Demand for efficient mechanisms. last few years lot work has been done on hash summaries that allow compact representations constant lookup time. features sound attractive routing, however, no evaluation exists with millions entries applications known make use proposed data structures. Furthermore, structures usually designed fit generic applications. A survey considering applicability seems appropriate. addition will explore new ways exploiting harsh conditions prevailing design deployable structure specialized Our achieves an improvement size by factor 10. Moreover, it easily adjustable different cost functions behavior highly predictable.