Algorithms for generalized round robin routing
From MaRDI portal
Recommendations
- An approximation algorithm for the general routing problem
- Optimality of the round-robin routing policy
- Dynamic Routing Schemes for General Graphs
- An algorithm for node-capacitated ring routing
- Algorithms – ESA 2005
- ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
- The generalized packet routing problem
- An optimal distributed routing algorithm
- Approximation algorithms for general cluster routing problem
Cites work
- scientific article; zbMATH DE number 3302960 (Why is no real title available?)
- A golden ratio control policy for a multiple-access channel
- Extremal Splittings of Point Processes
- New results on the single server queue with a batch markovian arrival process
- The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
Cited in
(6)- Optimization of template-driven scheduling mechanisms: Regularity measures and computational techniques
- ON THE OPTIMAL OPEN-LOOP CONTROL POLICY FOR DETERMINISTIC AND EXPONENTIAL POLLING SYSTEMS
- An M/G/1 queuing system with multiple vacations to assess the performance of a simplified deficit round robin model.
- Algorithms for routing around a rectangle
- scientific article; zbMATH DE number 2165697 (Why is no real title available?)
- Asymptotic optimality of the round-robin policy in multipath routing with resequencing
This page was built for publication: Algorithms for generalized round robin routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1195874)