Universal Stability Results for Greedy Contention-Resolution Protocols

In this paper, we analyze the behavior of communication networks in which packets are generated dynamically at the nodes and routed in discrete time steps across the edges. We focus on a basic adversarial model of packet generation and path determination for which the time

• Type: Conference
• Year: 1996
• Where: FOCS
• Authors: Matthew Andrews, Baruch Awerbuch, Antonio Fernández, Jon M. Kleinberg, Frank Thomson Leighton, Zhiyong Liu
• Keywords: Basic Adversarial Model, Discrete Time Steps, FOCS 1996, Theoretical Computer Science, Time­averaged Injection Rate