Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

123

Voted

NETWORKING
2000

88views Computer Networks» more NETWORKING 2000»

Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers

15 years 4 months ago

Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers

Download qosip.tmit.bme.hu

Róbert Szabó, Peter Barta, Felician

Real-time Traffic

NETWORKING 2000 | NETWORKING 2007 |

claim paper

Related Content

» ORCGPS Output RateControlled Scheduling Policy for Delay Guarantees

» A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks T...

» On Adaptive Bandwidth Sharing with Rate Guarantees

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	2000
Where	NETWORKING
Authors	Róbert Szabó, Peter Barta, Felician Németh, József Bíró

Comments (0)