Efficient Trie Braiding in Scalable Virtual Routers

Many popular algorithms for fast packet forwarding and filtering rely on the tree data structure. Examples are the trie-based IP lookup and packet classification algorithms. With the recent interest in network virtualization, the ability to run multiple virtual router instances on a common physical...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking 2012-10, Vol.20 (5), p.1489-1500
Hauptverfasser:	Haoyu Song, Kodialam, M., Fang Hao, Lakshman, T. V.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Braiding Classification Data structures Dynamic programming Filtering Filtration Heuristic algorithms IP networks Memory management Packets (communication) Product introduction Routers Routing Routing protocols Studies trie braiding Virtual private networks virtual router
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!