Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/26662Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Koukopoulos, D. | en |
| dc.contributor.author | Nikolopoulos, S. | en |
| dc.contributor.author | Palios, L. | en |
| dc.contributor.author | Spirakis, P. | en |
| dc.date.accessioned | 2015-12-11T13:23:13Z | - |
| dc.date.available | 2015-12-11T13:23:13Z | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/26662 | - |
| dc.rights | Default License | - |
| dc.subject | Packet-switched communication networks | en |
| dc.subject | Network stability | en |
| dc.subject | Linear algorithms | en |
| dc.subject | Graph theory | en |
| dc.subject | Intrusion detection | en |
| dc.subject | Adversarial queueing theory | en |
| dc.title | Optimal algorithms for detecting network stability | en |
| heal.type | bookChapter | - |
| heal.type.en | Book chapter | en |
| heal.type.el | Κεφάλαιο βιβλίου | el |
| heal.generalDescription | 188-199 σ. | el |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μηχανικών Η/Υ & Πληροφορικής | en |
| heal.publicationDate | 2008 | - |
| heal.bibliographicCitation | Βιβλιογραφία: σ. 198-199 | el |
| heal.abstract | A packet-switched network is universally stable if, for any greedy protocol and any adversary of injection rate less than 1, the number of packets in the network remains bounded at all times. A natural question that arises is whether there is a fast way to detect if a network is universally stable based on the network’s structure. In this work, we study this question in the context of Adversarial Queueing Theory which assumes that an adversary controls the locations and rates of packet injections and determines packet paths. Within this framework, we present optimal algorithms for detecting the universal stability (packet paths do not contain repeated edges but may contain repeated vertices) and the simple-path universal stability (paths contain neither repeated vertices nor repeated edges) of a network. Additionally, we describe an algorithm which decides in constant time whether the addition of a link in a universally stable network leads it to instability; such an algorithm could be useful in detecting intrusion attacks. | en |
| heal.publisher | Springer Berlin / Heidelberg | en |
| heal.fullTextAvailability | true | - |
| heal.bookName | - | en |
| Appears in Collections: | Μονογραφίες ( Κλειστές) | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Optimal Algorithms for Detecting Network Stability.pdf | 317.21 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
