research unit 1
 

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit Aigaion.nl.SourceForge.hetLogo

Publication

Type of publication:Inproceedings
Entered by:
TitlePerformance and Stability Bounds for Dynamic Networks
Bibtex cite IDRACTI-RU1-2004-65
Booktitle 7th International Conference on Parallel Architectures
Series Algorithms and Networks
Year published 2004
Abstract
In this work, we study the impact of dynamically changing link capacities on the delay bounds of LIS (Longest-In- System) and SIS (Shortest-In-System) protocols on specific networks (that can be modelled as Directed Acyclic Graphs- DAGs) and stability bounds of greedy contention-resolution protocols running on arbitrary networks under the Adversarial Queueing Theory. Especially, we consider the model of dynamic capacities, where each link capacity may take on integer values from [1, C] withC > 1, under a (w, ñ)- adversary.
Authors
Koukopoulos, Dimitrios
Mavronicolas, Marios
Spirakis, Paul
Topics
BibTeXBibTeX
RISRIS
Attachments
getPDF.pdf (main file)
 
Publication ID614