Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/10905
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKoukopoulos, D.en
dc.contributor.authorNikolopoulos, S. D.en
dc.date.accessioned2015-11-24T17:01:19Z-
dc.date.available2015-11-24T17:01:19Z-
dc.identifier.issn0302-9743-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/10905-
dc.rightsDefault Licence-
dc.subjectcontention-resolution protocolsen
dc.subjectadversarial queuing modelen
dc.subjectuniversal-stabilityen
dc.titleHeterogenous networks can be unstable at arbitrarily low injection ratesen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Ηλεκτρονικών Υπολογιστών και Πληροφορικήςel
heal.publicationDate2006-
heal.abstractA distinguishing feature of today's large-scale platforms for distributed computation and communication, such as the Internet, is their heterogeneity, predominantly manifested by the fact that a wide variety of communication protocols are simultaneously running over different distributed hosts. A fundamental question that naturally poses itself for such common settings of heterogeneous distributed systems concerns their ability to preserve or restore an acceptable level of performance during link failures. In this work, we address this question for the specific case of stability properties of greedy, contention-resolution protocols operating over a packet-switched communication network that suffers from link slowdowns. We focus on the Adversarial Queueing Theory framework, where an adversary controls the rates of packet injections and determines packet paths. In addition, the power of the adversary is enhanced to include the manipulation of link slowdowns. Within-this framework, we show that the composition of LIS (Longest-in-System) with any of SIS (Shortest-in-System), NTS (Nearest-to-Source) and FTG (Furthest-to-Go) protocols is unstable at rates p > 0 when the network size and the link slowdown take large values. These results represent the current record for instability bounds on injection rate for compositions of greedy protocols over dynamic adversarial models, and also suggest that the potential for instability incurred by the composition of two greedy protocols may be worse than that of some single protocol.en
heal.journalNameAlgorithms and Complexity, Proceedingsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά)

Files in This Item:
File Description SizeFormat 
nikolopoulos-2006-Heterogenous networks can be unstable at arbitrarily low injection rates.pdf539.94 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons