The complexity of deciding stability under FFS in the adversarial queueing model (Q2390263)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The complexity of deciding stability under FFS in the adversarial queueing model
scientific article

    Statements

    The complexity of deciding stability under FFS in the adversarial queueing model (English)
    0 references
    0 references
    21 July 2009
    0 references
    graph algorithms
    0 references
    packet-switched interconnection networks
    0 references
    interconnection networks
    0 references
    adversarial queueing theory
    0 references
    greedy scheduling protocols
    0 references
    network stability
    0 references

    Identifiers