Research Article Open Access

Scalable and Efficient Tree based Memory Mapping in Virtual Routers

Abstract

Many well liked algorithms for fast packet forwarding and filtering rely on the tree facts and figures structure. Examples are the triebased IP lookup and package classification algorithms. With the latest interest in mesh virtualization, the ability to run multiple virtual router examples on a common personal router stage is absolutely vital. A significant climbing issue is the number of virtual router examples that can run on the platform. One limiting factor is the allowance of high-speed recollection and caches available for storing the packet forwarding and filtering data organizations. A perfect goal is to accomplish good climbing while sustaining total isolation amidst the virtual routers. Although total isolation requires sustaining distinct facts and figures structures in high speed memory for each virtual router. In this paper, we study the case where some sharing of the forwarding and filtering facts and figures organizations is permissible and evolve algorithms for blending tries used for IP lookup and packet classification expressly, we evolve a means called trie braiding that allows us to blend tries from the facts and figures organizations of different virtual routers into just one compact trie. Two optimal braiding algorithms and a faster heuristic algorithm are offered, and the effectiveness is demonstrated utilizing the real-world facts and figures sets.

Deepika V, Geetha SK and Varunkumarr CV

To read the full article Download Full Article | Visit Full Article