Discovering Bounds of Performance of Self-Organizing Content Delivery Systems

Self-organizing methods can efficiently search, route and replicate content in complex, dynamic networks. Furthermore, they make the assumption that decisions of the nodes of the networks rely only on local information and therefore the global optimum is not known. For evaluation purposes, however,...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Szkaliczki, T., Sobe, A., Boszormenyi, L.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Dynamic Networks Evaluation Global Optimization Integer Linear Programming Self-organization
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!