Cell multiplexing in ATM networks
IEEE/ACM Transactions on Networking (TON)
Design and analysis of a congestion-free overlay on a high-speed network
IEEE/ACM Transactions on Networking (TON)
Minimizing service and operation costs of periodic scheduling
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The data broadcast problem with non-uniform transmission times
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation scheme for data broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Nearly optimal perfectly-periodic schedules
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Optimal Allocation Sequences of Two Processes Sharing aResource
Discrete Event Dynamic Systems
Nearly optimal perfectly periodic schedules
Distributed Computing - Special issue: Selected papers from PODC '01
Broadcast disks with polynomial cost functions
Wireless Networks
Efficient algorithms for periodic scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
Performance Evaluation
Message-Streams Oriented Hybrid Slot Allocation Protocol for Tactical Data Link System
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
Approximation algorithms for layered multicast scheduling
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 754.84 |
Consider n transmission stations sharing a single communication channel. Packets arrive at the stations according tonindependent renewal processes, possibly with different rates. The transmitters are assumed to be able to store an unlimited number of packets in their buffers. The stations transmit packets during time slots allocated to them according to a given {em conflict-free distributed protocol.} The cost criterion according to which protocols are evaluated is the long-run weighted average buffer occupancies. (The average waiting time is a special case of such a weighting.) A lower bound to the cost criterion under time division multiplexing (TDM) protocols is given, and the costs of two protocols are analyzed. The first protocol is the {em random-control} policy, and the second is the {em golden ratio} policy which is shown to achieve a cost close to the lower bound for realistic parameters.