Vyacheslav M. Abramov

Orcid: 0000-0002-9859-100X

According to our database1, Vyacheslav M. Abramov authored at least 18 papers between 2000 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Evaluating the sum of positive series.
CoRR, 2021

2020
Extension of the Bertrand-De Morgan Test and Its Application.
Am. Math. Mon., 2020

2019
Resource Provisioning for a Multi-Layered Network.
IEEE Access, 2019

2016
Validation of multi-layer network optimization.
Proceedings of the 18th International Conference on Transparent Optical Networks, 2016

2013
Characterization theorem on losses in <i>G</i><i>I</i><sup><i>X</i></sup>/<i>G</i><i>I</i><sup><i>Y</i></sup>/1/<i>n</i> queues.
Oper. Res. Lett., 2013

Bounds of the Overflow Priority Classification for Blocking Probability Approximation in OBS Networks: Errata.
JOCN, 2013

Bounds of the Overflow Priority Classification for Blocking Probability Approximation in OBS Networks.
JOCN, 2013

2012
Computation of Blocking Probability for Large Circuit Switched Networks.
IEEE Commun. Lett., 2012

2008
Continuity theorems for the <i>M</i> / <i>M</i> /1/ <i>n</i> queueing system.
Queueing Syst. Theory Appl., 2008

2006
Analysis of multiserver retrial queueing system: A martingale approach and an algorithm of solution.
Ann. Oper. Res., 2006

2004
Asymptotic methods for queueing systems and networks with application to telecommunications
PhD thesis, 2004

Asymptotic Behavior of the Number of Lost Messages.
SIAM J. Appl. Math., 2004

On Existence of Limiting Distribution for Time-Nonhomogeneous Countable Markov Process.
Queueing Syst. Theory Appl., 2004

A Large Closed Queueing Network Containing Two Types of Node and Multiple Customer Classes: One Bottleneck Station.
Queueing Syst. Theory Appl., 2004

2002
Non-cooperative routing in loss networks.
Perform. Evaluation, 2002

Asymptotic Analysis of the <i>GI/M/</i>1<i>/n</i> Loss System as <i>n</i> Increases to Infinity.
Ann. Oper. Res., 2002

2001
Some Results for Large Closed Queueing Networks with and without Bottleneck: Up- and Down-Crossings Approach.
Queueing Syst. Theory Appl., 2001

2000
A large closed queueing network with autonomous service and bottleneck.
Queueing Syst. Theory Appl., 2000


  Loading...