734 search results - page 43 / 147 » Multiprocess Time Queue |
80
Voted
WSC
2000
14 years 11 months ago
2000
Discrete event simulations often require a future event list structure to manage events according to their timestamp. The choice of an efficient data structure is vital to the per...
INFOCOM
1993
IEEE
15 years 2 months ago
1993
IEEE
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
INFOCOM
2006
IEEE
15 years 4 months ago
2006
IEEE
— Traditionally, network buffer resources have been used at routers to queue transient packets to prevent packet drops. In contrast, we propose a scheme for large multi-hop netwo...
INFOCOM
1997
IEEE
15 years 2 months ago
1997
IEEE
Current high-speed packet switching systems, ATM in particular, have large port bu ering requirements. The use of highly integrated ASIC technology for implementing high-degree an...
JACM
2000
14 years 10 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...