A wireless fair service algorithm for packet cellular networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Efficient admission control of piecewise linear traffic envelopes at EDF schedulers
IEEE/ACM Transactions on Networking (TON)
Packet routing with arbitrary end-to-end delay requirements
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Scheduling real-time traffic with deadlines over a wireless channel
WOWMOM '99 Proceedings of the 2nd ACM international workshop on Wireless mobile multimedia
SCED: a generalized scheduling policy for guaranteeing quality-of-service
IEEE/ACM Transactions on Networking (TON)
Instability of FIFO in session-oriented networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The effects of temporary sessions on network performance
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
QoS provisioning and tracking fluid policies in input queueing switches
IEEE/ACM Transactions on Networking (TON)
Scheduling real-time traffic with deadlines over a wireless channel
Wireless Networks
Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks
Journal of VLSI Signal Processing Systems
Coordinated multihop scheduling: a framework for end-to-end services
IEEE/ACM Transactions on Networking (TON)
Optimal Traffic Shaping with Deterministic Guarantees Using GPS Scheduling
IDMS/PROMS 2002 Proceedings of the Joint International Workshops on Interactive Distributed Multimedia Systems and Protocols for Multimedia Systems: Protocols and Systems for Interactive Distributed Multimedia
A Simplified Guaranteed Service for the Internet
PIHSN '02 Proceedings of the 7th IFIP/IEEE International Workshop on Protocols for High Speed Networks
A network architecture for providing per-flow delay guarantees with scalable core
Journal of High Speed Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Instability of FIFO in session-oriented networks
Journal of Algorithms - Special issue: SODA 2000
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
Journal of Algorithms
Node delay assignment strategies to support end-to-end delay requirements in heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Schedulability criterion and performance analysis of coordinated schedulers
IEEE/ACM Transactions on Networking (TON)
Statistical admission control for real-time services under earliest deadline first scheduling
Computer Networks and ISDN Systems
EUROMICRO '05 Proceedings of the 31st EUROMICRO Conference on Software Engineering and Advanced Applications
Deterministic end-to-end delay guarantees with rate controlled EDF scheduling
Performance Evaluation
Delay-Sensitive Packet Scheduling for a Wireless Access Link
IEEE Transactions on Mobile Computing
Practical algorithms for scheduling video data in a local area network environment
The Journal of Supercomputing
A new scheduling scheme for high-speed packet networks: Earliest-virtual-deadline-first
Computer Communications
Downlink Wireless Packet Scheduling with Deadlines
IEEE Transactions on Mobile Computing
An energy-efficient real-time scheduling scheme on dual-channel networks
Information Sciences: an International Journal
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
ACM Transactions on Algorithms (TALG)
VoIP: A comprehensive survey on a promising technology
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of MAC based QoS implementations for WiMAX networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Uplink scheduling for supporting real time voice traffic in IEEE 802.16 networks
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Packet pacing in small buffer optical packet switched networks
IEEE/ACM Transactions on Networking (TON)
Statistical admission control for real-time services under earliest deadline first scheduling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Minimizing end-to-end delay in wireless networks using a coordinated EDF schedule
INFOCOM'10 Proceedings of the 29th conference on Information communications
Channel, deadline, and distortion (CD2) aware scheduling for video streams over wireless
IEEE Transactions on Wireless Communications
Efficient uplink scheduler architecture of subscriber station in IEEE 802.16 system
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Improving delay characteristics of real-time flows by adaptive early packet discarding
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
On the service differentiation capabilities of EY-NPMA and 802.11 DCF
WWIC'05 Proceedings of the Third international conference on Wired/Wireless Internet Communications
Efficient Quality of Service scheduling mechanism for WiMAX networks
Computer Communications
An integrated buffer management strategy for the TDD mode in IEEE 802.16 BWA networks
International Journal of Internet Protocol Technology
Hi-index | 754.84 |
This paper is motivated by the need to provide per-session quality of service guarantees in fast packet-switched networks. We address the problem of characterizing and designing scheduling policies that are optimal in the sense of minimizing buffer and/or delay requirements under the assumption of commonly accepted traffic constraints. We investigate buffer requirements under three typical memory allocation mechanisms which represent tradeoffs between efficiency and complexity. For traffic with delay constraints we provide policies that are optimal in the sense of satisfying the constraints if they are satisfiable by any policy. We also investigate the tradeoff between delay and buffer optimality, and design policies that are “good” (optimal or close to) for both. Finally, we extend our results to the case of “soft” delay constraints and address the issue of designing policies that satisfy such constraints in a fair manner. Given our focus on packet switching, we mainly concern ourselves with nonpreemptive policies, but one class of nonpreemptive policies which we consider is based on tracking preemptive policies. This class is introduced and may be of interest in other applications as well