VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
Concurrent online tracking of mobile users
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
On-line scheduling in the presence of overload
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
IEEE Transactions on Computers
Decentralizing control and intelligence in network management
Proceedings of the fourth international symposium on Integrated network management IV
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract)
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Multi-agent Coordination Mechanism in Distributed Environment
EDCIS '02 Proceedings of the First International Conference on Engineering and Deployment of Cooperative Information Systems
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.24 |
The paper addresses the problem of designing efficient scheduling policies for the transmission of control messages by hierarchical network protocols. Such protocols encounter a tradeoff between the desire to forward a control message across the tree as soon as it is received, and the desire to reduce control traffic. Scheduling problems that arise in this context are defined and discussed. The paper mainly concentrates on minimizing the average extra delay encountered by the control messages under an upper bound on the number of outgoing messages a node can send during a fixed period of time. A polynomial-time algorithm is presented for the off-line version of the problem, and then several efficient on-line heuristics are presented and compared.