Enhancing router QoS through job scheduling with weighted shortest processing time-adjusted

Authors:
Nong Ye;Zhibin Yang;Ying-Cheng Lai;Toni Farley
Affiliations:
Information and Systems Assurance Laboratory, Arizona State University, P.O. Box 875906, Tempe, AZ;Information and Systems Assurance Laboratory, Arizona State University, P.O. Box 875906, Tempe, AZ;Information and Systems Assurance Laboratory, Arizona State University, P.O. Box 875906, Tempe, AZ;Information and Systems Assurance Laboratory, Arizona State University, P.O. Box 875906, Tempe, AZ
Venue:
Computers and Operations Research
Year:
2005

Citing 13
Cited 0

Delay jitter control scheme for packet-switching internetworks

Computer Communications - Special issue on multimedia communications
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Open issues and challenges in providing quality of service guarantees in high-speed networks

ACM SIGCOMM Computer Communication Review
Supporting best-effort traffic with fair service curve

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Internet performance survival guide: QoS strategies for multiservice networks

Internet performance survival guide: QoS strategies for multiservice networks
Hard Real-Time Systems

Hard Real-Time Systems
Delay jitter bounds and packet scale rate guarantee for expedited forwarding

IEEE/ACM Transactions on Networking (TON)
QoS-Centric Stateful Resource Management in Information Systems

Information Systems Frontiers
The Quality of Service Model and High Assurance

HASE '97 Proceedings of the 2nd High-Assurance Systems Engineering Workshop
Jitter Control in QoS Networks

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Taxomomy of QoS Specifications

WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Providing end-to-end performance guarantees using non-work-conserving disciplines

Computer Communications
Congestion control mechanisms and the best effort service model

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.01

Visualization

Abstract

Most routers on the Internet employ a first-in-first-out (FIFO) scheduling rule to determine the order of serving data packets. This scheduling rule does not provide quality of service (QoS) with regards to the differentiation of services for data packets with different service priorities and the enhancement of routing performance. We develop a scheduling rule called Weighted Shortest Processing Time-Adjusted (WSPT-A), which is derived from WSPT (a scheduling rule for production planning in the manufacturing domain), to enhance router QoS. We implement a QoS router model based on WSPT-A and run simulations to measure and compare the routing performance of our model with that of router models based on the FIFO and WSPT scheduling rules. The simulation results show superior QoS performance when using the router model with WSPT-A.