A histogram-based model for video traffic behavior in an ATM multiplexer
IEEE/ACM Transactions on Networking (TON)
Computer Networks and ISDN Systems
A fast algorithm for single processor scheduling
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Scheduling real-time traffic in ATM networks
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
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Using Traffic Regulation to Meet End-to-End Deadlines in ATM Networks
IEEE Transactions on Computers
Wireless Networks - Selected Papers from Mobicom'99
Scheduling Multiclass Packet Streams to Minimize Weighted Loss
Queueing Systems: Theory and Applications
Internetworking between HIPERLAN/2 and UMTS
Wireless Personal Communications: An International Journal
Scheduling an active camera to observe people
Proceedings of the ACM 2nd international workshop on Video surveillance & sensor networks
Surveillance camera scheduling: a virtual vision approach
Proceedings of the third ACM international workshop on Video surveillance & sensor networks
Lex-Optimal Online Multiclass Scheduling with Hard Deadlines
Mathematics of Operations Research
Guaranteeing hard real-time traffic constraints with ATM networks
Integrated Computer-Aided Engineering
Combinatorial Reverse Auction based Scheduling in Multi-Rate Wireless Systems
IEEE Transactions on Computers
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Scheduling real-time traffic in ATM networks
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
Hi-index | 0.01 |
In this paper we study the problem of scheduling real-time traffic in high-speed ATM networks. Scheduling can be performed at different points in the ATM network, such as, at the multiplexers and switches. In our model the arriving traffic cells are assumed to have weights associated with them which determine their importance measure (for example, cells belonging to one traffic class may have different weights than cells belonging to another traffic class), Further, a cell is said to have been lost if its deadline is violated. We develop a simple procedure, S-OPT, to minimize the cell loss rate for single-class traffic. Using this procedure we develop an optimal algorithm, M-OPT, that minimizes the weighted loss rate at a network node. Finally, we provide a heuristic algorithm, M-HEUR, which significantly reduces the complexity of M-OPT and closely approximates its performance. In each case the scheduling decisions are based only on the current information in the queue. Using numerical results we show that our scheduling algorithms significantly outperform well known algorithms such as First-In-First-Out (FIFO) and Static Priority (SP).