Frame-based priority scheduling in hybrid IP/ATM networks

Authors:
Y. -C. Chen;S. -C. Hu;C. -T. Chan;C. -L. Lee
Affiliations:
Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050, Taiwan;Telecommunication Laboratories, Chunghwa Telecom Co. Ltd, Taipei, Taiwan;Department of Computer Science and Information Engineering, National Chiao Tung University, Hsinchu 30050, Taiwan
Venue:
Computer Communications
Year:
1999

Citing 7
Cited 0

Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Latency-rate servers: a general model for analysis of traffic scheduling algorithms

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
IP and ATM integration perspectives

IEEE Communications Magazine

Quantified Score

Hi-index	0.24

Visualization

Abstract

The exploding growth of World Wide Web applications in recent years has overwhelmed the internet with multimedia traffic. A future performance concern is to keep pace with the quickly growing bandwidth requirements. IP over ATM is a way to relax such requirements. It provides a hybrid approach to support both layer 3 software forwarding and layer 2 ATM hardware switching. A switched virtual connection may be suitable for traffic involving large data transfers and QoS provision like Guarantee Service (GS) applications. In the hybrid IP/ATM networks, the packet-level instead of the cell-level behavior is the relevant measure of performance. In this paper, we propose a so-called Frame-based Priority Scheduling (FBPS) algorithm for GS applications. FBPS focuses on the packet-level performance while transmitting based on cells. The most attractive feature of FBPS is its simplicity. We provide a systematic analysis of FBPS scheduler and derive the bound on its fairness when the flow traffic is shaped by a leaky bucket. It shows that FBPS is competitive with certain complex scheduling disciplines such as PGPS. We also verify our analytical bounds by simulation.