|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
B.J. Likhttsinder, A. Yu. Privalov, “Generalization of formulas for queue length moments under nonordinary poissonian arrivals for batch queues in telecommunication systems”, Probl. Peredachi Inf., 59:4 (2023), 32–37  |
| 2. |
B.J. Likhttsinder, A. Yu. Privalov, V. I. Moiseev, “Batch poissonian arrival models of multiservice network traffic”, Probl. Peredachi Inf., 59:1 (2023), 71–79 |
1
|
|
2011 |
| 3. |
A. Yu. Privalov, A. V. Blagov, “About some self-similar telecommunication traffic models used in traffic simulation”, Matem. Mod., 23:7 (2011), 114–128  |
1
|
|
2007 |
| 4. |
A. Yu. Privalov, Kh. Sohraby, “Jitter Smoothing in a Constant-Bit-Rate Flow after One
or Several Nodes”, Probl. Peredachi Inf., 43:2 (2007), 85–111  ; Problems Inform. Transmission, 43:2 (2007), 143–166   |
3
|
|
2000 |
| 5. |
A. Yu. Privalov, “Two-Point Jitter in a Network with Periodic Flows under Maximal Load”, Probl. Peredachi Inf., 36:2 (2000), 96–111 ; Problems Inform. Transmission, 36:2 (2000), 180–194 |
|
1993 |
| 6. |
B. S. Tsybakov, A. Yu. Privalov, “Packet Delay in a DQDB Network”, Probl. Peredachi Inf., 29:4 (1993), 67–93 ; Problems Inform. Transmission, 29:4 (1993), 358–380 |
|
1992 |
| 7. |
B. S. Tsybakov, A. Yu. Privalov, “Lower Bound on Delay in an RMA System with $N$-Conflicts and Errors”, Probl. Peredachi Inf., 28:4 (1992), 69–85 ; Problems Inform. Transmission, 28:4 (1992), 360–374 |
| 8. |
B. S. Tsybakov, A. Yu. Privalov, “The Throughput of the Stack Algorithm in a Channel with $N$-Conflicts”, Probl. Peredachi Inf., 28:2 (1992), 78–85 ; Problems Inform. Transmission, 28:2 (1992), 168–174 |
|
| Organisations |
|
| |
|
|
Contact us: