Approaching optimal compression with fast update for large scale routing tables

With the fast development of Internet, the size of routing tables in the backbone routers keeps a rapid growth in recent years. An effective solution to control the memory occupation of the ever-increased huge routing table is the Forwarding Information Base (FIB) compression. Existing optimal FIB c...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Tong Yang, Bo Yuan, Shenjiang Zhang, Ting Zhang, Ruian Duan, Yi Wang, Bin Liu
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithm design and analysis Complexity theory Compression algorithms Ear Nominations and elections Routing Solids
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!