Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Introduction to algorithms
The C programming language
The synchronization of periodic routing messages
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
The design and implementation of the 4.4BSD operating system
The design and implementation of the 4.4BSD operating system
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Hashed and hierarchical timing wheels: efficient data structures for implementing a timer facility
IEEE/ACM Transactions on Networking (TON)
Internet Routing Architectures
Internet Routing Architectures
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Scalable Timers for Soft State Protocols
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
| Hi-index | 0.00 |
Several network servers and routing and signalling protocols need a large number of events to be scheduled off timers. Some of these applications can withstand a bounded level of inaccuracy in when the timer is scheduled. In this paper we describe a novel mechanism called "scalable hierarchical coarse grained timers" which can handle the scheduling of a large number of events while incurring a minimum of cpu and memory overhead. The techniques presented here were implemented on a commercial IP routing system and are used by the routing stack to damp flapping BGP routes. The paper reflects our experiences in carrying out this implementation and the subsequent performance analysis.