Adversarial queuing on the multiple-access channel

We consider deterministic distributed broadcasting on multiple access channels in the framework of adversarial queuing. Packets are injected dynamically by an adversary that is constrained by the injection rate and the number of packets that may be injected simultaneously; the latter we call burstiness. A protocol is stable when the number of packets in queues at the stations stays bounded. The maximum injection rate that a protocol can handle in a stable manner is called the throughput of the protocol. We consider adversaries of injection rate 1, that is, of one packet per round, to address the question if the maximum throughput 1 can be achieved, and if so then with what quality of service. We develop a protocol that achieves throughput 1 for any number of stations against leaky-bucket adversaries. The protocol has O(n2 + burstiness) packets queued simultaneously at any time, where n is the number of stations; this upper bound is proved to be best possible. A protocol is called fair...

• Type: Conference
• Year: 2006
• Where: PODC
• Authors: Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki
• Keywords: Distributed And Parallel Computing, Injection Rate, Leaky-bucket Adversaries, PODC 2006, Stable