Everything about Bucket queue
Data structure for integer priorities
A bucket queue is a data structure that implements the priority queue abstract data type: it maintains a dynamic collection of elements with numerical priorities and allows quick access to the element with minimum priority. In the bucket queue, the priorities must be integers, and it is particularly suited to applications in which the priorities have a small range. A bucket queue has the form of an array of buckets: an array data structure, indexed by the priorities, whose cells contain collections of items with the same priority as each other. With this data structure, insertion of elements and changes of their priority take constant time. Searching for and removing the minimum-priority element takes time proportional to the number of buckets or, by maintaining a pointer to the most recently found bucket, in time proportional to the difference in priorities between successive operations. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Bucket queueA 5-minute orientation
- Skim a recent paper: Analisis Quality of Service Jaringan Internet Banten Menggunakan Metode Per-Connection Queue dan Hierarchical Token BucketInfluential work since 2022
- Pick up a classic book: Data Communications and NetworkingThe most-reprinted book on the subject
- Read the landmark paper: Performance analysis of priority leaky bucket scheme with queue-length-threshold scheduling policyCited 13 times
- Go sideways: Monotone priority queueA closely related topic
- Go sideways: Priority queueA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Performance analysis of priority leaky bucket scheme with queue-length-threshold scheduling policy
PERFORMANCE ANALYSIS OF THE LEAKY BUCKET SCHEME WITH QUEUE LENGTH DEPENDENT ARRIVAL RATES
Perbandingan Manajemen Bandwidth Menggunakan Metode PCQ (Per Connection Queue) dan HTB (Hirarchical Token Bucket)
RED-DTB: A dual token bucket based queue management algorithm
Analisa Qos dengan Simple Queue, Queue Tree, dan Hierarchical Token Bucket (Studi Kasus Pro Net Bangkinang)
A Bucket-Based Priority Queue for Bounded-Suboptimal and Anytime A* Search
Comparative Analysis of Hierarchical Token Bucket and Per Connection Queue Methods in Video Conferences
TINJAUAN LITERATUR: IMPLEMENTASI MANAJEMEN BANDWIDTH HIERARCHICAL TOKEN BUCKET (HTB) DAN PER CONNECTION QUEUE (PCQ)
🆕 Influential since 2022
Analisis Quality of Service Jaringan Internet Banten Menggunakan Metode Per-Connection Queue dan Hierarchical Token Bucket
ANALISIS INTEGRASI METODE SIMPLE QUEUE DAN HIERARCHICAL TOKEN BUCKET(HTB) DALAM OPTIMALISASI MANAJEMEN BANDWIDTH PADA MORA
Analisis Perbandingan Manajemen Bandwidth Menggunakan Router Mikrotik RB951Ui-2HnD dengan Metode Queue Tree dan Hierarchical Token Bucket
Analisis Performansi Jaringan dengan Metode Per Connection Queue (PCQ) dan Hierarchical Token Bucket (HTB) di SMK Latanro Enrekang
Implementasi Manajemen Bandwidth dengan Metode Hierarchical Token Bucket (Htb), Per Connection Queue (Pcq), dan Layer 7 Protokol Menggunakan Router Mikrotik
📚 Books worth reading
Data Communications and NetworkingBehrouz A. Forouzan, Catherine Ann Coombs · 2000- 📕International queer art & activism zineMiyuki Baker · 2012
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Data structures and algorithms in JavaAdam Drozdek · 2001
Algorithm designMichael T. Goodrich, Roberto Tamassia · 2001
Data Structures and Algorithms in JavaMichael T. Goodrich, Roberto Tamassia · 2014
Data structures, algorithms, and performanceDerick Wood · 1992
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Monotone priority queue In computer science, a monotone priority queue is a variant of the priority queue abstract data type in which the priorities of extracted items are required…
- Priority queue In computer science, a priority queue is an abstract data type similar to a regular queue where each element has an associated priority determining its…
- Van Emde Boas tree A van Emde Boas tree (Dutch pronunciation: [vɑn ˈɛmdə ˈboːɑs]), also known as a vEB tree or van Emde Boas priority queue, is a tree data structure which…
- Double-ended queue Input Input Output Output as a queue as a stack In computer science, a double-ended queue (abbreviated as deque — /dɛk/ DEK), is an abstract data type…
- Heap (data structure) In computer science, a heap is a tree-based data structure that satisfies the heap property: In a max heap, for any given node C, if P is the parent node…
- Dijkstra's algorithm Dijkstra's algorithm (/ˈdaɪk.strəz/, DYKE-strəz) is an algorithm for finding the shortest paths between nodes in a weighted graph, which may represent…
- Sequence container (C++) In C++, sequence containers or sequence collections refer to a group of container class templates in the standard library that implement storage of data…
- List of data structures This is a list of well-known data structures. For a comparison of running times for a subset of this list see comparison of data structures. Boolean, true…