scientific article; zbMATH DE number 2079411

zbMATH Open1092.68507MaRDI QIDQ4471371FDOQ4471371

Authors Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén, William Aiello 

Publication date 28 July 2004

zbMATH Keywords

Adversarial Queuing Theory

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 4025135
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• Dynamic Routing in Fully Connected Networks
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• The network as a storage device: dynamic routing with bounded buffers
• scientific article; zbMATH DE number 786519
• Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks
• Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
• Dynamic routing for computer queueing networks
• Deterministic routing with bounded buffers: turning offline into online protocols

Cited In (9)

• Approximation algorithms for time-constrained scheduling on line networks
• Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing
• Finite buffer polling models with routing
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Competitive weighted throughput analysis of greedy protocols on DAGs
• Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
• The network as a storage device: dynamic routing with bounded buffers
• Improved competitive performance bounds for CIOQ switches
• Online packet-routing in grids with bounded buffers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471371)