Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,403,361 papers from all fields of science
Search
Sign In
Create Free Account
Priority queue
Known as:
PQ
, Priority traffic
, Minimum priority queue
Expand
In computer science, a priority queue is an abstract data type which is like a regular queue or stack data structure, but where additionally each…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Abstract data type
Array data structure
Best-first search
Bit array
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
FEBA: A Bandwidth Allocation Algorithm for Service Differentiation in IEEE 802.16 Mesh Networks
Claudio Cicconetti
,
I. Akyildiz
,
L. Lenzini
IEEE/ACM Transactions on Networking
2009
Corpus ID: 10025804
In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e., the higher the number of…
Expand
Highly Cited
2008
Highly Cited
2008
Mitigating Performance Degradation in Congested Sensor Networks
Raju Kumar
,
Riccardo Crepaldi
,
+4 authors
T. L. Porta
IEEE Transactions on Mobile Computing
2008
Corpus ID: 14976124
Data generated in wireless sensor networks may not all be alike: some data may be more important than others and hence may have…
Expand
Highly Cited
2007
Highly Cited
2007
A Cross-layer Packet Scheduling and Subchannel Allocation Scheme in 802.16e OFDMA System
Lihua Wan
,
Wenchao Ma
,
Zihua Guo
IEEE Wireless Communications and Networking…
2007
Corpus ID: 18311248
The IEEE 802.16e standard is a rapidly developing technology for broadband wireless access system. Its PHY OFDMA mode defines two…
Expand
2006
2006
Adaptive Fairness through intra-ONU Scheduling for Ethernet Passive Optical Networks
A. R. Dhaini
,
C. Assi
,
A. Shami
,
N. Ghani
IEEE International Conference on Communications
2006
Corpus ID: 9942038
Ethernet passive optical networks (EPONs) are being designed to deliver multiple services and applications, such as voice…
Expand
Highly Cited
2004
Highly Cited
2004
Engineering an External Memory Minimum Spanning Tree Algorithm
Roman Dementiev
,
P. Sanders
,
Dominik Schultes
,
J. F. Sibeyn
IFIP TCS
2004
Corpus ID: 7032958
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than…
Expand
2004
2004
Quality of Service in IP Networks
S. Kota
,
K. Pahlavan
,
P. Leppanen
2004
Corpus ID: 166623006
Quality of Service (QoS) describes the guaranteed delivery of applications based on the low delay and packet loss requirements. A…
Expand
Highly Cited
2002
Highly Cited
2002
Funnel Heap - A Cache Oblivious Priority Queue
G. Brodal
,
Rolf Fagerberg
International Symposium on Algorithms and…
2002
Corpus ID: 302162
The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are…
Expand
Highly Cited
2002
Highly Cited
2002
Starvation prevention and quality of service in wireless LANs
Wasan Pattara-Atikomt
,
Sujata Banerjee
,
Prashant Krishnamurthy
International Symposium on Wireless Personal…
2002
Corpus ID: 61446821
The existing IEEE 802.11 MAC protocol is not suitable for supporting multimedia and QoS-sensitive applications because of its…
Expand
1999
1999
A Priority Queue Transform
M. Fredman
Workshop on Algorithm Engineering
1999
Corpus ID: 41652539
A transformation, referred to as depletion, is defined for comparison-based data structures that implement priority queue…
Expand
1994
1994
Fishspear: a priority queue algorithm
M. Fischer
,
M. Paterson
JACM
1994
Corpus ID: 16945034
The Fishspear priority queue algorithm is presented and analyzed. Fishspear is comparable to the usual heap algorithm in its…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE