Martingale dynamics and optimal routing in a network
type: Item
instance of: scholarly article
title: Martingale dynamics and optimal routing in a network
zbMATH Open document ID: 0661.68034
DOI: 10.1016/0096-3003(88)90079-3
author: Mou-Hsiung Chang
published in: Applied Mathematics and Computation
publication date: 1988-01-01T00:00:00Z
review text: A store and forward computer communication network with parallel non intersecting channels is studied to determine an optimal procedure for message allocation. The conclusion is logical in that messages should be sent along the channel which has the least number of queued messages.
Mathematics Subject Classification ID: 68M20
zbMATH DE Number: 4080903
zbMATH Keywords: queueing
zbMATH Keywords: store and forward computer communication network
zbMATH Keywords: message allocation
reviewed by: William Henderson
MaRDI profile type: Publication
full work available at URL: 0096-3003(88)90079-3
OpenAlex ID: W1968205005
cites work: Existence of Optimal Stochastic Control Laws
cites work: Point processes and queues. Martingale dynamics
cites work: A simple dynamic routing problem
cites work: A Basic Dynamic Routing Problem and Diffusion
cites work: On Transforming a Certain Class of Stochastic Processes by Absolutely Continuous Substitution of Measures
cites work: Q4168506
cites work: Flows in Queueing Networks: A Martingale Approach
cites work: Q5515873
cites work: Optimality of the shortest line discipline
description: scientific article; zbMATH DE number 4080903