UB Paderborn / Katalog / Suche / in CDI

Max-Min Fair Scheduling in Input-Queued Switches

IEEE transactions on parallel and distributed systems, 2008-04, Vol.19 (4), p.462-475

2008

Link zum Volltext
Volltext

Fair and efficient packet scheduling using Elastic Round Robin

IEEE transactions on parallel and distributed systems, 2002-03, Vol.13 (3), p.324-336

2002

Link zum Volltext
Volltext

On achieving fairness in the joint allocation of processing and bandwidth resources: principles and algorithms

IEEE/ACM transactions on networking, 2005-10, Vol.13 (5), p.1054-1067

2005

Link zum Volltext
Volltext

A New Distributed Algorithm for Even Coverage and Improved Lifetime in a Sensor Network

IEEE INFOCOM 2009, 2009, p.361-369

2009

Link zum Volltext
Volltext

Cooperative topology control with adaptation for improved lifetime in wireless ad hoc networks

2012 Proceedings IEEE INFOCOM, 2012, p.262-270

2012

Link zum Volltext
Volltext

On the relationship between absolute and relative fairness bounds

IEEE communications letters, 2002-01, Vol.6 (1), p.37-39

2002

Link zum Volltext
Volltext

Rate-limited EAFRP-a new improved model for high-speed network traffic

IEEE transactions on signal processing, 2005-02, Vol.53 (2), p.505-522

2005

Link zum Volltext
Volltext

Risk Factors of Development of Gangrenous Cholecystitis and Its Treatment Outcomes

Gastroenterology (New York, N.Y. 1943), 2011, Vol.140 (5), p.S-1046-S-1046

2011

Link zum Volltext

Verfügbarkeit prüfen

On the latency bound of deficit round robin

Proceedings. Eleventh International Conference on Computer Communications and Networks, 2002, p.548-553

2002

Link zum Volltext
Volltext

Evaluating compressive sampling strategies for performance monitoring of data centers

2012 IEEE Network Operations and Management Symposium, 2012, p.655-658

2012

Link zum Volltext
Volltext

Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources in switches and routers

Computer communications, 2005-11, Vol.28 (18), p.2105-2118

2005

Link zum Volltext

Verfügbarkeit prüfen

Pattern recognition analysis of bubbles impacting on tubes

Powder technology, 1992, Vol.70 (2), p.175-181

1992

Link zum Volltext

Verfügbarkeit prüfen

On achieving fairness in the joint allocation of processing and bandwidth resources

Lecture notes in computer science, 2003, p.97-114

2003

Link zum Volltext

Verfügbarkeit prüfen

Congestion control, differentiated services, and efficient capacity management through a novel pricing strategy

Computer communications, 2003-08, Vol.26 (13), p.1457-1469

2003

Link zum Volltext

Verfügbarkeit prüfen

Low-latency guaranteed-rate scheduling using Elastic Round Robin

Computer communications, 2002-09, Vol.25 (14), p.1315-1322

2002

Link zum Volltext

Verfügbarkeit prüfen

An evaluation of fair packet schedulers using a novel measure of instantaneous fairness

Computer communications, 2005-10, Vol.28 (17), p.1925-1937

2005

Link zum Volltext

Verfügbarkeit prüfen

Fair, efficient and low-latency packet scheduling using nested deficit round robin

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552), 2001, p.6-10

2001

Link zum Volltext
Volltext

On the latency and fairness characteristics of pre-order deficit round Robin

Computer communications, 2004-05, Vol.27 (7), p.664-678

2004

Link zum Volltext

Verfügbarkeit prüfen

IBM RS/6000 SP interconnection network topologies for large systems

Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205), 1998, p.620-627

1998

Link zum Volltext
Volltext

Greedy fair queueing: a goal-oriented strategy for fair real-time packet scheduling

RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003, 2003, p.345-356

2003

Link zum Volltext
Volltext

Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels

Journal of parallel and distributed computing, 2003-12, Vol.63 (12), p.1288-1299

2003

Link zum Volltext

Verfügbarkeit prüfen

An evaluation of timestamp-based packet schedulers using a novel measure of instantaneous fairness

Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003, 2003, p.443-450

2003

Link zum Volltext
Volltext

Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources

Conference Proceedings of the 2003 IEEE International Performance, Computing, and Communications Conference, 2003, 2003, p.495-504

2003

Link zum Volltext
Volltext

A novel, practical pricing strategy for congestion control and differentiated services

2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 2002, Vol.2, p.986-990 vol.2

2002

Link zum Volltext
Volltext

Fair, efficient and scalable scheduling without per-flow state

Conference Proceedings of the 2001 IEEE International Performance, Computing, and Communications Conference (Cat. No.01CH37210), 2001, p.181-187

2001

Link zum Volltext
Volltext

Menü

Weitere Dienste

Einstellungen

Max-Min Fair Scheduling in Input-Queued Switches

Fair and efficient packet scheduling using Elastic Round Robin

On achieving fairness in the joint allocation of processing and bandwidth resources: principles and algorithms

A New Distributed Algorithm for Even Coverage and Improved Lifetime in a Sensor Network

Cooperative topology control with adaptation for improved lifetime in wireless ad hoc networks

On the relationship between absolute and relative fairness bounds

Rate-limited EAFRP-a new improved model for high-speed network traffic

Risk Factors of Development of Gangrenous Cholecystitis and Its Treatment Outcomes

On the latency bound of deficit round robin

Evaluating compressive sampling strategies for performance monitoring of data centers

Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources in switches and routers

Pattern recognition analysis of bubbles impacting on tubes

On achieving fairness in the joint allocation of processing and bandwidth resources

Congestion control, differentiated services, and efficient capacity management through a novel pricing strategy

Low-latency guaranteed-rate scheduling using Elastic Round Robin

An evaluation of fair packet schedulers using a novel measure of instantaneous fairness

Fair, efficient and low-latency packet scheduling using nested deficit round robin

On the latency and fairness characteristics of pre-order deficit round Robin

IBM RS/6000 SP interconnection network topologies for large systems

Greedy fair queueing: a goal-oriented strategy for fair real-time packet scheduling

Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels

An evaluation of timestamp-based packet schedulers using a novel measure of instantaneous fairness

Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources

A novel, practical pricing strategy for congestion control and differentiated services

Fair, efficient and scalable scheduling without per-flow state

Suchergebnisse filtern