Scalable and Efficient Tree based Memory Mapping in Virtual Routers

Abstract

The growing demand for easy mesh customization and discovery has led to expanded interest in building virtual systems [1–4]. Establishing these virtual networks needs the use of virtual routers that proceed individually of sharing widespread physical resources. An example of the need for differing routing purposes on the same stage, akin to virtualization, is the case of ipv4-toipv6 migration [5,6]. Since the migration can only occur incrementally, the so-called dualstack router needs to support both ipv4 and ipv6 routing simultaneously. In each such router, packets are classified based on the IP type and then forwarded utilizing the corresponding forwarding benches [7].This is alike to having two virtual routers on the same stage.

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{V2015ScalableAE, title={Scalable and Efficient Tree based Memory Mapping in Virtual Routers}, author={Deepika V and Geetha}, year={2015} }