G. Varghese and A. Lauck, Hashed and Hierarchical Timing Wheels: Efficient Data Structures for Implementing a Timer Facility, IEE/ACM Transactions on Networking, Vol.5, No.6, page(s): 824-834, December 1997  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Channel Management, Message Representation and Event Handling of a .. - Zhang (Correct)
....for the message that was sent within a given period of time, then the protocol fires the event to retransmit the message. Sometimes the protocol may need to broadcast or multicast advertisements or solicitations periodically and scheduling relevant events are required. G. Varghese [22] introduces seven schemes for managing events. But only two of them are fundamental. The first is a scheme without the storage of events in a data structure and the second is a scheme with the storage of events in a data structure. With reference to the event handling concepts in [8] 22] three ....
....[22] introduces seven schemes for managing events. But only two of them are fundamental. The first is a scheme without the storage of events in a data structure and the second is a scheme with the storage of events in a data structure. With reference to the event handling concepts in [8][22], three sub features SimpleEventManager, DeltalistManager, and TimingwheelManager are implemented for the EventManager feature in PIX, with the SimpleEventManager being similar to the first fundamental scheme in [22] and the DeltalistManager and the TimingwheelManager belonging to the second ....
[Article contains additional citation context not shown here]
G. Varghese and A. Lauck, Hashed and Hierarchical Timing Wheels: Efficient Data Structures for Implementing a Timer Facility, IEE/ACM Transactions on Networking, Vol.5, No.6, page(s): 824-834, December 1997
Scalable Hierarchical Coarse-grained Timers - Dube (Correct)
....Level 1 module improves as most schedule and deschedule calls complete without requiring a Level 0 operation. VI. RELATED WORK Brown [1] and Davison [4] independently discovered calendar queues which are modeled after desk calendars and can be used to implement a timer facility. Varghese et al. [18] describe a way of building scalable timer implementations using cascaded timing wheels each of which is similar to a calendar queue. These techniques qualify as Level 0 in the hierarchy of figure 1 and have been used by multiple Unix like operating systems to implement the timeout facility [3] ....
G. Varghese and A. Lauck. Hashed and Hierarchical Timing Wheels: Efficient Data Structures for Impelementing a Timer Facility. IEEE/ACM Transactions on Networking, 5(6), 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC