A multi-tree generating routing scheme using acyclic orientations: Extended Abstract

Routing schemes often rely on local tables that associate with each destination node v a parent link on which to forward messages to v. The set of parent links form a directed tree to v. Such tables suffer from the fact that they do not provide a full representation of the entire network, and theref...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Annexstein, Fred S., Berman, Kenneth A., Swaminathan, Ram
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Forward Message Greedy Algorithm Longe Path Minimum Degree Vertex Cover Problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!