Skip to search formSkip to main contentSkip to account menu

Priority queue

Known as: PQ, Priority traffic, Minimum priority queue 
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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
In wireless mesh networks, the end-to-end throughput of traffic flows depends on the path length, i.e., the higher the number of… 
Highly Cited
2008
Highly Cited
2008
Data generated in wireless sensor networks may not all be alike: some data may be more important than others and hence may have… 
Highly Cited
2007
Highly Cited
2007
The IEEE 802.16e standard is a rapidly developing technology for broadband wireless access system. Its PHY OFDMA mode defines two… 
2006
2006
Ethernet passive optical networks (EPONs) are being designed to deliver multiple services and applications, such as voice… 
Highly Cited
2004
Highly Cited
2004
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than… 
2004
2004
Quality of Service (QoS) describes the guaranteed delivery of applications based on the low delay and packet loss requirements. A… 
Highly Cited
2002
Highly Cited
2002
The cache oblivious model of computation is a two-level memory model with the assumption that the parameters of the model are… 
Highly Cited
2002
Highly Cited
2002
The existing IEEE 802.11 MAC protocol is not suitable for supporting multimedia and QoS-sensitive applications because of its… 
1999
1999
A transformation, referred to as depletion, is defined for comparison-based data structures that implement priority queue… 
1994
1994
The Fishspear priority queue algorithm is presented and analyzed. Fishspear is comparable to the usual heap algorithm in its…