Algorithms for generalized round robin routing
type: Item
instance of: scholarly article
title: Algorithms for generalized round robin routing
zbMATH Open document ID: 0769.90034
DOI: 10.1016/0167-6377(92)90091-G
author: Yair Arian
author: Yonatan Levy
published in: Operations Research Letters
publication date: 1993-01-04T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 60K25
zbMATH DE Number: 86098
zbMATH Keywords: round robin routing
MaRDI profile type: Publication
cites work: The Proof of a Folk Theorem on Queuing Delay with Applications to Routing in Networks
cites work: Extremal Splittings of Point Processes
cites work: A golden ratio control policy for a multiple-access channel
cites work: Q5584435
cites work: New results on the single server queue with a batch markovian arrival process
full work available at URL: 0167-6377(92)90091-g
OpenAlex ID: W2049615950
Recommended article: An approximation algorithm for the general routing problem
Recommended article: Optimality of the round-robin routing policy
Recommended article: Dynamic Routing Schemes for General Graphs
Recommended article: An algorithm for node-capacitated ring routing
Recommended article: Algorithms – ESA 2005
Recommended article: ROUTING ALGORITHMS FOR DOUBLE LOOP NETWORKS
Recommended article: The generalized packet routing problem
Recommended article: An optimal distributed routing algorithm
Recommended article: Approximation algorithms for general cluster routing problem
description: scientific article; zbMATH DE number 86098