Show simple item record

Carry-Over Round Robin: A Simple Cell Scheduling Mechaniasm for ATM Networks

dc.contributor.authorSaha, Debanjanen_US
dc.contributor.authorMukherjee, Sariten_US
dc.contributor.authorTripathi, Satish K.en_US
dc.description.abstractWe propose a simple cell scheduling mechanism for ATM networks. The proposed mechanism, named Carry-Over Round Robin (CORR), is an extension of weighted round robin scheduling. We show that albeit its simplicity, CORR achieves tight bounds on end-to-end delay and near perfect fairness. Using a variety of video traffic traces we show that CORR often outperforms some of the more complex scheduling disciplines such as Packet-by-Packet Generalized Processor Sharing (PGPS). (Also cross-referenced as UMIACS-TR-96-45)en_US
dc.format.extent1154600 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3658en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-96-45en_US
dc.titleCarry-Over Round Robin: A Simple Cell Scheduling Mechaniasm for ATM Networksen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record