Martingale dynamics and optimal routing in a network (Q1113666): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0096-3003(88)90079-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968205005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of Optimal Stochastic Control Laws / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point processes and queues. Martingale dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple dynamic routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Basic Dynamic Routing Problem and Diffusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Transforming a Certain Class of Stochastic Processes by Absolutely Continuous Substitution of Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4168506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows in Queueing Networks: A Martingale Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5515873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of the shortest line discipline / rank
 
Normal rank

Latest revision as of 10:24, 19 June 2024

scientific article
Language Label Description Also known as
English
Martingale dynamics and optimal routing in a network
scientific article

    Statements

    Martingale dynamics and optimal routing in a network (English)
    0 references
    0 references
    1988
    0 references
    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.
    0 references
    queueing
    0 references
    store and forward computer communication network
    0 references
    message allocation
    0 references
    0 references

    Identifiers