Qualification routes messaging for dynamic systems using logical-probabilistic method
From MaRDI portal
Publication:5262442
zbMATH Open1316.68029MaRDI QIDQ5262442FDOQ5262442
Authors: V. V. Glazunov, M. A. Kurochkin, S. G. Popov 
Publication date: 15 July 2015
Full work available at URL: http://www.j-npcs.org/abstracts/vol2015/v18no1/v18no1p99.html
Recommendations
- scientific article; zbMATH DE number 3924478
- Optimal routing parameters for queueing networks: their determination methods
- Properties of the solutions to the task of routing in the network with virtual circuits
- On a bi-dimensional dynamic alternative routing method
- Route optimization by a dynamic programming technique
dynamic systemmobile objectlogical-probabilistic methodmesh-networkmessage delivery probability functionroute messaging
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
This page was built for publication: Qualification routes messaging for dynamic systems using logical-probabilistic method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262442)
