Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
5,261
Hierarchical Packet Fair Queueing Algorithms
- IEEE/ACM Transactions on Networking
, 1997
"... In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H-GPS ..."
Abstract
-
Cited by 341 (7 self)
- Add to MetaCart
In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-effort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H
Adapting Packet Fair Queueing Algorithms to Wireless Networks
, 1998
"... Bit errors are fairly common during transmission in a wireless network. As a result, a straight-forward application of existing packet fair queueing (PFQ) algorithms from wireline to wireless networks results in an inefficient use of the limited wireless bandwidth. In this paper, we propose a simple ..."
Abstract
-
Cited by 87 (2 self)
- Add to MetaCart
Bit errors are fairly common during transmission in a wireless network. As a result, a straight-forward application of existing packet fair queueing (PFQ) algorithms from wireline to wireless networks results in an inefficient use of the limited wireless bandwidth. In this paper, we propose a
Abstract Hierarchical Packet Fair Queueing Algorithms
"... In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-e ort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H-GPS ..."
Abstract
- Add to MetaCart
In this paper, we propose to use the idealized Hierarchical Generalized Processor Sharing (H-GPS) model to simultaneously support guaranteed real-time, rate-adaptive best-e ort, and controlled link-sharing services. We design Hierarchical Packet Fair Queueing (H-PFQ) algorithms to approximate H
Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors
"... Abstract — While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in wireless networks sessions can experience location-dependent channel errors. This may lead to situatio ..."
Abstract
- Add to MetaCart
Abstract — While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in wireless networks sessions can experience location-dependent channel errors. This may lead
Packet fair queueing algorithms for wireless networks with location-dependent errors
, 2000
"... ..."
Packet Fair Queueing Algorithms for Wireless Networks with Location-Dependent Errors
"... Abstract — While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in wireless networks sessions can experience location-dependent channel errors. This may lead to situatio ..."
Abstract
- Add to MetaCart
Abstract — While Packet Fair Queueing (PFQ) algorithms provide both bounded delay and fairness in wired networks, they cannot be applied directly to wireless networks. The key difficulty is that in wireless networks sessions can experience location-dependent channel errors. This may lead
Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks
, 2000
"... Packet Fair Queueing (PFQ) algorithms have been extensively studied for provision of Quality of Service (QoS) guarantees in Integrated Services Networks. Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitatious on the range of QoS that can be supported ..."
Abstract
- Add to MetaCart
Packet Fair Queueing (PFQ) algorithms have been extensively studied for provision of Quality of Service (QoS) guarantees in Integrated Services Networks. Because of the fixed weight assignment, the inherent in PFQ delay-bandwidth coupling imposes limitatious on the range of QoS that can
Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks
- IN IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, 2000
, 2002
"... In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been propo ..."
Abstract
-
Cited by 8 (2 self)
- Add to MetaCart
In integrated services networks, the provision of Quality of Service (QoS) guarantees depends critically upon the scheduling algorithm employed at the network layer. In this work we review fundamental results on scheduling, and we focus on Packet Fair Queueing (PFQ) algorithms, which have been
Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture
"... Abstract—To support the Internet’s explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneously provide high capacity switching and advanced QoS. Unfortunately, these two goals are largely believed to be con ..."
Abstract
- Add to MetaCart
to be contradictory in nature. To support QoS, sophisticated packet scheduling algorithms, such as Fair Queueing, are needed to manage queueing points. However, the bulk of current research in packet scheduling algorithms assumes an output buffered switch architecture, whereas most high performance switches (both
Implementing Distributed Packet Fair Queueing in a Scalable Switch Architecture
, 1998
"... To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneously provide high capacity switching and advanced QoS. Unfortunately, these two goals are largely believed to be contrad ..."
Abstract
-
Cited by 68 (1 self)
- Add to MetaCart
to be contradictory in nature. To support QoS, sophisticated packet scheduling algorithms, such as Fair Queueing, are needed to manage queueing points. However, the bulk of current research in packet scheduling algorithms assumes an output buffered switch architecture, whereas most high performance switches (both
Results 1 - 10
of
5,261
