Vladimir Vishnevsky

Prof. Dr. Vladimir Vishnevsky

V.A. Trapeznikov Institute of Control Sciences
orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2020
Verified
Book
Closed access
ADAlexander N. Dudin
Alexander N. Dudin
VKValentina I. Klimenok
Valentina I. Klimenok
Vladimir VishnevskyVladimir Vishnevsky
Vladimir Vishnevsky

19 August 2017 in Automation and Remote Control
Verified
Journal Article
Closed access
PDF file
Vladimir VishnevskyVladimir Vishnevsky
Vladimir Vishnevsky
Alexander DudinAlexander Dudin
Alexander Dudin
We give a brief survey of literature devoted to studying queueing systems with Markovian and batch Markovian arrival processes and their application to modeling telecommunication networks.

21 November 2007 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
Vladimir VishnevskyVladimir Vishnevsky
Vladimir Vishnevsky
ALAndrey Lyakhov
Andrey Lyakhov
ASAlexander A. Safonov
Alexander A. Safonov
SMShaomin S. Mo
Shaomin S. Mo
AGAlexander D. Gelman
Alexander D. Gelman
Distributed media access control (MAC) architecture has many merits to make it a favorable candidate for high-data-rate wireless personal area networks (WPANs) with physical layer (PHY) based on ultrawideband (UWB) technology. This paper focuses on the WiMedia MAC, which is the first distributed MAC for WPANs, approved as a standard. In such a MAC, all devices transmit their beacons to provide timing reference and to broadcast control and reservation information, that is, to maintain device synchronization. We investigate problems related to beacon collisions, which occur when multiple devices join a piconet almost at the same time. To join a piconet or to resolve a collision, a device chooses a slot for its beacon randomly within some window. We show that an improper slot choice scheme leads to repeated collisions, increasing the time overhead to achieve device synchronization. It also leads devices into trouble in joining and collision resolution, even into deadlocks, when devices have no chance to escape repeated collisions. We develop an analytical model to evaluate the performance of various slot choice schemes for multihop WPANs. The model is employed to compare the efficiency of these choice schemes and to optimize their parameters to achieve the best performance.

1 November 2008
Verified
Conference Paper
Closed access
AVAlexey Vinel
Alexey Vinel
Vladimir VishnevskyVladimir Vishnevsky
Vladimir Vishnevsky
YKYevgeni Kourcheyavy
Yevgeni Kourcheyavy
Nowadays in Europe, USA, Japan and other countries many efforts are being made towards the development and ubiquitous deployment of active vehicular safety systems, which are based on car-to-car and car-to-infrastructure communications. International standard IEEE 802.11p defines low layers protocols for vehicular networks aimed to support Intelligent Transportation Systems (ITS) applications. Periodic broadcasting of short status messages (beacons) is foreseen as one of the key modes, which should be efficiently handled to provide active safety in vehicular networks. This paper presents a simple analytical method to compute the probability of successful message reception and mean message transmission delay in IEEE 802.11p vehicular ad-hoc network with periodic broadcasting of messages. We investigate the influence of beaconing period on the above performance metrics.

7 January 2021 in Mathematics
Verified
Journal Article
Open access
PDF file
Vladimir VishnevskyVladimir Vishnevsky
Vladimir Vishnevsky
OSOlga Semenova
Olga Semenova
The paper presents a review of papers on stochastic polling systems published in 2007–2020. Due to the applicability of stochastic polling models, the researchers face new and more complicated polling models. Stochastic polling models are effectively used for performance evaluation, design and optimization of telecommunication systems and networks, transport systems and road management systems, traffic, production systems and inventory management systems. In the review, we separately discuss the results for two-queue systems as a special case of polling systems. Then we discuss new and already known methods for polling system analysis including the mean value analysis and its application to systems with heavy load to approximate the performance characteristics. We also present the results concerning the specifics in polling models: a polling order, service disciplines, methods to queue or to group arriving customers, and a feedback in polling systems. The new direction in the polling system models is an investigation of how the customer service order within a queue affects the performance characteristics. The results on polling systems with correlated arrivals (MAP, BMAP, and the group Poisson arrivals simultaneously to all queues) are also considered. We briefly discuss the results on multi-server, non-discrete polling systems and application of polling models in various fields.

4 September 2020 in Mathematics
Verified
Journal Article
Open access
PDF file
VKValentina Klimenok
Valentina Klimenok
Alexander DudinAlexander Dudin
Alexander Dudin
Vladimir VishnevskyVladimir Vishnevsky
Vladimir Vishnevsky
In this paper, we analyze a multi-server queueing system with heterogeneous customers that arrive according to a marked Markovian arrival process. Customers of two types differ in priorities and parameters of phase type distribution of their service time. The queue under consideration can be used to model the processes of information transmission in telecommunication networks in which often the flow of information is the superposition of several types of flows with correlation of inter-arrival times within each flow and cross-correlation. We define the process of information transmission as the multi-dimensional Markov chain, derive the generator of this chain and compute its stationary distribution. Expressions for computation of various performance measures of the system, including the probabilities of loss of customers of different types, are presented. Output flow from the system is characterized. The presented numerical results confirm the high importance of account of correlation in the arrival process. The values of important performance measures for the systems with the correlated arrival process are essentially different from the corresponding values for the systems with the stationary Poisson arrival process. Measurements in many real world systems show poor approximation of real flows by such an arrival process. However, this process is still popular among the telecommunication engineers due to the evident existing gap between the needs of adequately modeling the real life systems and the current state of the theory of algorithmic methods of queueing theory.