Skip to main content

2017 | Buch

Distributed Computer and Communication Networks

20th International Conference, DCCN 2017, Moscow, Russia, September 25–29, 2017, Proceedings

insite
SUCHEN

Über dieses Buch

This book constitutes the refereed proceedings of the 20th International Conference on Distributed and Computer and Communication Networks, DCCN 2017, held in Moscow, Russia, in September 2017.

The 39 full papers and the two short papers were carefully reviewed and selected from 176 submissions. The papers cover the following topics: computer and communication networks architecture optimization; control in computer and communication networks; performance and QoS/QoE evaluation in wireless networks; analytical modeling and simulation of next-generation communications systems; queueing theory and reliability theory applications in computer networks; wireless 4G/5G networks, cm- and mm-wave radio technologies; RFID technology and its application in intellectual transportation networks; Internet of Things, wearables, and applications of distributed information systems; probabilistic and statistical models in information systems; mathematical modeling of high-tech systems; mathematical modeling and control problems; distributed and cloud computing systems, big data analytics.

Inhaltsverzeichnis

Frontmatter
Modeling the Process of Dynamic Resource Sharing Between LTE and NB-IoT Services

The Internet of Things (IoT) undergoes fundamental changes, expanding its infrastructure with more advanced and mobile devices. As the IoT develops, the existing cellular communication technologies often do not provide sufficient coverage while modern IoT terminals are often expensive and characterized by a short battery life. To address these issues, in Release 13 (LTE Advanced Pro) published in 2016, 3GPP consortium has proposed the Narrow-Band IoT (NB-IoT) technology as an efficient way to provide a wide range of new capabilities and services in a wireless cellular network. Having specified three operational regimes, 3GPP did not provide guidelines on the way resource sharing has to be done between LTE and NB-IoT traffic. In this paper, the in-band NB-IoT service model is presented, where a certain amount of LTE radio resources are exclusively allocated to LTE and NB-IoT users while the rest are shared between them. We analyze the proposed system for performance metrics of interest including NB-IoT and LTE session drop probabilities and resource utilization.

Vyacheslav Begishev, Andrey Samuylov, Dmitri Moltchanov, Konstantin Samouylov
Nonparametric Analysis of Extremes on Web Graphs: PageRank Versus Max-Linear Model

We analyze the cluster structure in large networks by means of clusters of exceedances regarding the influence characteristics of nodes. As the latter characteristics we use PageRank and the Max-Linear model and compare their distributions and dependence structure. Due to the heaviness of tail and dependence of PageRank and Max-Linear model observations, the influence indices appear by clusters or conglomerates of nodes grouped around influential nodes. The mean size of such clusters is determined by a so called extremal index. It is related to the tail index that indicates the heaviness of the distribution tail. We consider graphs of Web pages and partition them into clusters of nodes by their influence.

Natalia M. Markovich, Maxim Ryzhov, Udo R. Krieger
Prototyping Minimal Footprint NFC-Based User Access Control System for IoT Applications

User access control systems have become a standard part of security systems in many consumer as well as industrial applications. The majority of these systems utilize tokens to gain an access into restricted areas such as buildings, garages, and workplaces. They are available in different shapes and sizes, but their communication interface often utilizes NFC technology ensuring compatibility throughout a variety of distinct tokens. Main goal of this paper is to share most important hands-on experience acquired during the development of NFC-based user access control system with minimal deployment footprint. Common handheld/wearable devices like smartphones or smartwatches have been used to eliminate the need for another item to be carried by a user. In our Android-based implementation, users are authenticated via server application and their accounts can be managed by the user interface called Locker. Further, MySQL database acts as a storage for user data and for authentication purposes as well.

Martin Stusek, Jiri Pokorny, Krystof Zeman, Jaroslav Hajek, Pavel Masek, Jiri Hosek
On-Line Traffic Management in New Generation Computer Networks

The problem of traffic management of different classes of service in NGN computer networks is considered. This problem is formulated as a rerouting problem of different classes flows under failures of channels and nodes while preserving the quality of service (QoS). The mathematical model of this problem is constructed and the algorithm of its solution is suggested. Experimental investigations of the suggested traffic management algorithm were carried out and its efficiency estimated.

Helen Zaychenko, Yuriy Zaychenko
Performance Modelling of Transmissions in Very Large Network Topologies

Transient state queueing models help us to understand better the dynamics of internet transmissions and the performance of traffic control algorithms. Fluid flow approximation, due its simplicity, as it is based on first-order differential equations, is popular and frequently used – but even it, if applied to large topologies, is time and space consuming. Its algorithm is based on iterative calculations on large mutually interdependent structures. In consequence, the bottleneck of the method lies not in numerical computations but in storing and selection of data. This is why we investigate an approach in which a database (SAP HANA) and its language are used to implement the method. The model logic is represented by ETL (Extract, Transform and Load) customizable and user-friendly processes. The numerical examples are based on a real topology having over 100 000 nodes.

Monika Nycz, Tomasz Nycz, Tadeusz Czachórski
Multiservice Queueing System with MAP Arrivals for Modelling LTE Cell with H2H and M2M Communications and M2M Aggregation

The paper address resource allocation in an LTE call with both human-to-human and machine-to-machine (M2M) communications. M2M aggregation and access barring are considered as a means to reduce congestion due to the nature of M2M traffic. The cell is modelled as a multiservice queueing system with streaming and elastic customers. Resources for M2M communications are allocated in batches of fixed size; requests for them arrive according to a Markovian arrival process. We obtain the stationary probability distribution of the system and formulas for its performance measures and propose an algorithm for their computation.

V. M. Vishnevsky, K. E. Samouylov, V. A. Naumov, A. Krishnamoorthy, N. Yarkina
Hidden Markov Models in Long Range Dependence Traffic Modelling

Hidden Markov Models (HMM) have been widely used in several areas of computer science. Conventional HMMs are well-known for their efficiency in modeling short-term dependencies between adjacent elements, but some researchers concluded that they cannot grasp long-range interactions between distant elements. Long-range dependence (LRD) of data refers to temporal similarity present in the data. Various studies demonstrated the presence of LRD at network traffic on several levels of communications protocols. This paper concerns the HMM-traffic source capability to capture the LRD appeared in real network traffic. We used several estimators of Hurst parameter to evaluate the LRD. Not all LRD processes mandatorily have a definable Hurst parameter, but the value of H between 0.5 and 1 is usually considered the standard measure of LRD.

Joanna Domańska, Adam Domański, Tadeusz Czachórski
Integration Data Model for Continuous Service Delivery in Cloud Computing System

New data model and approach are proposed to integrate monitoring events, incident management, problem management, change management, and other ITIL processes, which are usually managed by separate operations departments and tools in a big International IT Company. New integration architecture and monitoring applications are introduced, allowing provisioning a full-cycle continuous delivery of telecommunication services in a globally distributed cloud computing system.

V. V. Efimov, S. V. Mescheryakov, D. A. Shchemelinin
A Retrial Queueing System with Abandonment and Search for Priority Customers

We consider a single server retrial queueing model with two types of customers, abandonment of customers and search for priority customers. Two types of customers namely type I and type II arrive according to two independent Poisson processes and upon arrival, if the server is busy, join orbits I and II respectively. Orbit I is of finite capacity while orbit II is of Infinite capacity. Retrial attempts are made by both types of customers at constant rates and each unsuccessful retrial attempt is followed by abandonment of customers from the respective orbits with some probability. Type I customer has higher priority over type II customers. Search for customers in orbit 1 is introduced to reduce their waiting time and also to minimize the loss of such customers due to abandonment. Condition for stability is established and the system state distribution is computed. Several performance measures of the system that influences the efficiency are derived and are illustrated graphically/numerically.

A. Krishnamoorthy, V. C. Joshua, Ambily P. Mathew
Usage of Video Codec Based on Multichannel Wavelet Decomposition in Video Streaming Telecommunication Systems

The amount of transmitted video content is rising sharply in modern telecommunication systems. This is especially true for streaming video. In this regard, the requirements are increased not only in terms of the compression ratio and the quality of the transmitted image, but also in terms of video codec performance.The usage of multichannel wavelet transform may be a way to increase the compression ratio while maintaining the same quality of reconstructed images.Therefore, the aim of the study is to implement multichannel wavelet decomposition based video codec and to make use of it in real-time mode.Multichannel wavelet video codec based on new filter banks specially designed for wavelet decomposition of images into a certain number of channels has been implemented within the research.Video compression results for various number of decomposition channels are presented in the efficiency evaluation of multichannel wavelet video codec.

Kirill Bystrov, Alexander Dvorkovich, Viktor Dvorkovich, Gennady Gryzov
Automated Classification of a Calf’s Feeding State Based on Data Collected by Active Sensors with 3D-Accelerometer

The paper deals with the problem of time series classification for the feeding state of calves by means of features evaluated for acceleration real-time data sets. The eartags equipped with an active sensor were developed for location and animal activity identification. Video records synchronized with a sensor data were collected from three calves. After the data preprocessing including the reconstruction of lost information, filtering and frequency stabilization, new time series were used to develop a machine-learning algorithm with equidistant and non-equidistant time series segmentation method based on a modified Kolmogorov-Smirnov statistic. The proposed classification method has achieved a good recognition quality for the feeding state with a best overall accuracy of approximately 94%. Thus this methodology is useful in identifying the feeding state and we may expect the possibility to generalize it to the multi-state case as well. The further improvement of the algorithm is a subject of our future research.

Valentin Sturm, Dmitry Efrosinin, Natalia Efrosinina, Leonie Roland, Michael Iwersen, Marc Drillich, Wolfgang Auer
Bounding the Risk Probability

For some safety–critical applications, it is important to calculate the probability that a discrete time autoregressive (AR) process leaves a given interval at least once during a certain period of time. For example, such AR process can be interpreted as a temporally correlated safety indicator and the interval as a target zone of the process. It is assumed that the safety of the system under surveillance is compromised if the above-mentioned probability becomes too important. This problem has been previously studied in the case of known distributions of the innovation process. Let us assume now that the distributions of the innovation and initial state are unknown but some special bounds for the cumulative distribution functions and/or for the probability density functions are available. Numerical methods to calculate the bounds for the above-mentioned probability are considered in the paper.

Igor Nikiforov
Simulation of Finite-Source Retrial Queueing Systems with Collisions and Non-reliable Server

The aim of the present paper is to build a simulation program to investigate finite-source retrial queuing system with collision of the customers where the server is subject to random breakdowns and repairs depending on whether it is idle or busy. All the random variables involved in the model construction are assumed to be independent and generally distributed. The novelty of the investigation is to carry sensitivity analysis of the performance measures using various distributions. Several figures show the effect of different distributions on the performance measures such as mean and variance of number of customers in the system, mean and variance of response time, mean and variance of time a customer spent in service, mean and variance of sojourn time in the orbit.

Ádám Tóth, Tamás Bérczes, János Sztrik, Anna Kvach
Retrial Tandem Queue with BMAP-Input and Semi-Markovian Service Process

We consider a tandem queueing system consisting of two stations. The input flow at the single-server first station is described by a BMAP (batch Markovian arrival process). If a customer from this flow meets the busy server, it goes to the orbit of infinite size and tries its luck later on in exponentially distributed random time. The service time distribution at the first station is assumed to be semi-Markovian. After service at the first station a customer proceeds to the second station which is described by a multi-server queue without a buffer. The service time by the server of the second station is exponentially distributed. We derive the condition for the stable operation of the system and determine the stationary distribution of the system states. Some key performance measures are calculated and illustrative numerical results are presented.

Valentina Klimenok, Olga Dudina, Vladimir Vishnevsky, Konstantin Samouylov
On Search Services for Internet of Things

The Internet of Things (IoT) data services are designed to be available to other services and users by demand. In other words, in practice, the services should be available at any time and at any location. But the big question here is how the other parties become aware of existing services. Sure, for some use cases we could have a static map of available services. But of course, it does not cover all the possible IoT deployment scenarios. So, the search (discovery) should be one of the keys for Internet of Things. And we can see here the whole analogue with the Internet itself. But for Internet of things, we will face a lot of challenges for search services. For example, we will see a lot of resources (billions of devices), heterogeneity, dynamic nature of services, streaming data, etc. In this paper, we discuss existing approaches for implementing IoT search, as well as approaches for setting standards in this area.

Dmitry Namiot, Manfred Sneps-Sneppe
Some Features of a Finite-Source M/GI/1 Retrial Queuing System with Collisions of Customers

In this paper a finite-source M/GI/1 retrial queuing system with collisions of customers is considered. The definition of throughput of the system as average number of customers, which are successfully served per unit time is introduced. It is shown that at some combinations of system parameter values and probability distribution of service time of customers the throughput can be arbitrarily small, and at another values of parameters throughput can be greater than the service intensity. Applying method of asymptotic analysis under the condition of unlimited growing number of sources it is proofed that limiting distribution of the number of retrials/transitions of the customer into the orbit is geometric and the sojourn/waiting time of the customer in the orbit follows a generalized exponential distribution. In addition, the mean sojourn time of the customer under service is obtained.

Anatoly Nazarov, János Sztrik, Anna Kvach
Infinite–Server Tandem Queue with Renewal Arrivals and Random Capacity of Customers

A tandem of two queues with infinite number of servers is considered. Customers arrive at the first stage of the tandem according to a renewal process, and, after the completion of their services, go to the second stage. Each customer carries a random quantity of work (capacity of the customer). In this study service time does not depend on the customer capacities; the latter are used just to fix some additional features of the system evolution. It is shown that the two-dimensional probability distribution of the total capacities at the stages of the system is two-dimensional Gaussian under the asymptotic condition of a high arrival rate. Numerical experiments and simulations allow us to determine the applicability area for the asymptotic result.

Ekaterina Lisovskaya, Svetlana Moiseeva, Michele Pagano
Application of Splitting to Failure Estimation in Controllable Degradation System

We consider a regenerative degradation process composed by a sum of the successive phases, where preventive repair is used to prevent an instantaneous failure. For an optimal control of such a systems, calculation of the failure probability, the average length of the regeneration cycle with or without failure, etc., is critically important. If the degradation process is Markovian, then the required steady-state performance measures are analytically available, however in is not the case if the process is non-Markov, in which case simulation is used to estimate the unknown parameters of the system. In this work, the regenerative structure of the degradation process is used to calculate the mentioned above steady-state parameters. Moreover, provided the failure within a regeneration cycle is a rare event, we apply a regenerative variant of the splitting method to estimate the failure probability. It is shown that this approach is much less time-consuming in comparison with crude Monte Carlo simulation. The efficiency of the approach is demonstrated by a detailed analysis of the degradation process generated by the i.i.d. exponential phases. The explicit analytical results for this case are then compared with the corresponding simulation results obtained by crude Monte Carlo and splitting method.

Alexandra Borodina, Dmitry Efrosinin, Evsey Morozov
A Token Based Parallel Processing Queueing System with Priority

We consider a single server queueing model with two parallel queues in which one is finite buffer and the other is infinite. Customers arrive according to two independent Poisson processes and service time follows phase type distribution. Customers receive service on the basis of a token system. Customers in the infinite queue are ordinary customers and the customers in the finite queue are priority customers. Customer priority may be either by paying a cost or by any other means. Priority customers have the right to make the strategic decision regarding the queue to which he or she may join. Priority customers are provided service on the basis of token issued to such customers to access the service according to the rule: when $$ N-1 $$ customers of lower priority are consecutively served, the next to be served is from the priority line, if there is one waiting, thus ensuring there reduced waiting time. However they can join the lower priority queue in the case they find the waiting time less. This strategy will be discussed in the paper. We perform the steady state analysis and establish the stability condition of the queueing model. Some performance measures are also evaluated. Control problem has been discussed. Some numerical illustrations are provided.

A. Krishnamoorthy, V. C. Joshua, Dhanya Babu
Optimal Method for Uplink Transfer of Power and the Design of High-Voltage Cable for Tethered High-Altitude Unmanned Telecommunication Platforms

The article proposes a method to calculate the design of a high-voltage conducting tether intended for transmission of power from the ground to a tethered high-altitude telecommunication platform. It also describes an approach to the evaluation of wave impedance and selection of an optimal number of lines in the conducting tether to ensure a maximum level of transmitted power. Besides, it provides an example of numerical calculations.

Vladimir Vishnevsky, Boris Tereschenko, Dmitriy Tumchenok, Artem Shirvanyan
Performance Modeling of Finite-Source Retrial Queueing Systems with Collisions and Non-reliable Server Using MOSEL

In this paper we investigate a single-server retrial queueing system with collision of the customer and an unreliable server. If a customer finds the server idle, he enters into service immediately. The service times are independent exponentially distributed random variables. During the service time the source cannot generate a new primary call. Otherwise, if the server is busy, an arriving (primary or repeated) customer involves into collision with customer under service and they both moves into the orbit. The retrial time of requests are exponentially distributed. We assume that the server is unreliable and could be break down. When the server is interrupted, the call being served just before server interruption goes to the orbit. Our interest is to give the main steady-state performance measures of the system computed by the help of the MOSEL tool. Several Figures illustrate the effect of input parameters on the mean response time.

Tamás Bérczes, János Sztrik, Ádám Tóth, Anatoly Nazarov
Estimation of High-Speed Performance of the Transport Protocol with the Mechanism of Forward Error Correction

We propose a model of a virtual connection controlled by the transport protocol with a forward error correction mechanism in the group failure mode with restrictions on the values of protocol parameters in the form of a Markov chain with discrete time. The analysis of the impact of protocol parameters window size and the duration of the timeout of waiting confirmation, the probability of distortion of the segments in the individual links of the transmission path data, the duration of the round trip delay, the parameters of the mechanism to restore the distorted segments on the throughput of the transport connection. In the area of protocol parameters, the characteristics of the transmission channel and parameters of the forward error correction mechanism found in the area of superiority of the control procedures of the transport protocol with forward error correction over the classic procedure with decision feedback on the criterion of the throughput of a transport connection. The expediency of applying of the method of forward error correction for transport links with large round-trip delay.

Pavel Mikheev, Sergey Suschenko, Roman Tkachyov
Optimal Methods of Storage, Transfer and Processing of DICOM Data in Medical Information Systems

This article describes the problems and possible solutions for optimization of medical images storing, providing stable and secure access, based on the distributed warehouse for huge volumes of data with different levels of access providing. The standard for working with medical images is the DICOM format, which allows storing images in good quality. The main problem of data storing in DICOM format is caused by the fact that one investigation can has more than one-gigabyte volume of data and consist of thousands of images. In Moldova in 2015 was launched “DICOM Network” project, whose goal is to provide access to investigations for medical staff with the appropriate access rights, as well as to patients to their personal radiography investigations. Now the system collects and processing more than 500 gigabytes of data every month. In the article, we describe and analyze possible solutions for optimizing data storing and processing workflows.

Alexandr Golubev, Peter Bogatencov, Grigore Secrieru
The Augmented Reality Service Provision in D2D Network

This paper is dedicated to the augmented reality service provision by using of D2D communications. We consider the service which may be provided by using of local data source such as panoramic view video camera or any other. Local source provide information useful for nearest users. We propose using of multicast service. Our approach allows reach high users density users near the source. The aim of the paper is to determine an appropriate bitrate for the multicast stream on the base on the distribution of users in the service area.

M. Makolkina, A. Vikulov, A. Paramonov
Measurement System Architecture for Measuring Network Parameters of e2e Services

In this article, we examine possible methods for measuring uplink, downlink throughput, and network latency RTT value between two devices operating at the level of communications providers’ “last mile" and propose various methods for measure uplink, downlink throughput, and network delay (RTD) value level based on various network protocols (HTTP / HTTPS, MQTT, XMPP, AMQP, WebSocket, CoAP, QUIC, etc.). Based on ITU-T Rec. Q.3960, the following was developed: the architecture of the hardware and software complex to be used for testing the quality of the provided communication services; a method for measuring network parameters between a last mile device and remote cloud service based on the developed software and hardware complex; a method for measuring network performance parameters between end nodes that operate behind NAT on the basis of the developed software and hardware complex. A protocol of data transmission for the developed software and hardware complex is described. The article also presents a concise study of the reasearch of the measurement system developed.

Vyacheslav Kulik, Ruslan Kirichek, Alexey Borodin, Andrey Koucheryavy
The Application of Classification Schemes While Describing Metadata of the Multidimensional Information System Based on the Cluster Method

Metadata of the multidimensional information system can be described through setting the options for the cells of the multidimensional cube. The cluster method can be used for the description of the sparse data cube structure. The core of this method is the formation of groups of members which are semantically connected with groups of members of other dimensions. Connected groups related to different dimensions describe the cluster of cells. Clusters can be merged into sets of cells. The term where such sets are combined by operations of set theory describes the structure of the multidimensional data cube. Classification schemes can be used while forming a cluster. Every classification scheme is a graph describing the hierarchy of members which are connected with a separate structural component of the observed phenomenon. The coupling between several classification schemes related to different structural components helps to describe the metadata of the multidimensional information system.

Maxim Fomin
Yet Another Method for Heterogeneous Data Fusion and Preprocessing in Proactive Decision Support Systems: Distributed Architecture Approach

In the multi-sensors environment, the crucial issue is collecting data from different sources. The paper considers the problem of data gathering from different data sources in the framework of proactive intelligent decision support systems design. The aim is to provide the invariate access to heterogeneous data stored in a data warehouse for further processing. There are two types of data sources are considered in the paper: machine or sensor data and video streams. We propose an ‘on-fly’ method of heterogeneous data fusion and preprocessing toward to minimisation of execution time of queries. A proposed method is implemented in the five-layer distributed architecture of the system based on Apache Kafka and Spark Streaming technology. The main conclusion is that in case of heterogeneous data (like video and loged data) and functional requirements for query execution over these data, the distributed data preprocessing might be efficient in comparison with batch processing.

Van Phu Tran, Maxim Shcherbakov, Tuan Anh Nguyen
Control and Safety of Operation of Duplicated Computer Systems

The subject of the research is a duplicated computer system, which contains means of operational and test control, and will be considered as a basic computer node for infocommunication systems of responsible meaning. There are different ways of organizing system control: testing of only one node, testing of only two nodes and testing whether one or two computer nodes. Besides the functional and the failed states of the system, there are dangerous conditions that may be not detected by control malfunction. The inbound flow of requests is heterogeneous - there are non-critical requests as well as critical, which require duplicated computations. The aim of the work is to choose a discipline of test control and define optimal intervals of testing initialization that ensure the maximum probability of the system’s readiness for safe implementation of functional requests for different flows of requests. Research method is based on constructing a Markov model.

Vladimir Bogatyrev, Maria Vinokurova
Fluid Limit for Switching Closed Queueing Network with Two Multi-servers

A closed network consists of two multi-servers with n customers. Service requirements of customers at a multi-server have a common cdf. State parameters of the network: for each multi-server empirical measure of the age of customers being serviced and for the queue the number of customers in it, all multiplied by $$n^{-1}$$.Our objective: asymptotics of dynamics as $$n\rightarrow \infty $$. The asymptotics of dynamics of a single multi-server and its queue with an arrival process as the number of servers $$n\rightarrow \infty $$ is currently studied by famous scientists K. Ramanan, W. Whitt et al. In the last publications the arrival process is generalized to time-dependent. We develop our previous asymptotics results for a network also in this direction: instead of a simple time dependence a markov swithching behavior of one multi-server is introduced. For the asymptotic process we in a rough way find equilibrium and prove convergence as $$n\rightarrow \infty $$.Motivation for studying such models: they represent call/contact centers, and switching expresses the changes of the system environment.

Svetlana Anulova
Analysis of Unreliable Open Queueing Network with Dynamic Routing

An open queuing network with m unreliable nodes is considered. The routing of jobs in a network is transformed depending on availability/unavailability of some nodes. If there is no direct transition from the node i to j due the node j failure, then jobs are redirecting to the node the most close to the j. In this way there is no blocking in a network. The initial probability $$r_ {ij}$$ in a transition matrix R is proportional divided between available nodes. The network dynamic is described by a continuous in time random process X(t) taking values from the state space enlarged by the ensemble $$G_N$$. $$G_N$$ contains all graphs (transition matrices), and described by the initial state $$R^0$$ and a given sequence of transition rates $$\{\alpha _i\}$$ and $$\{\beta _i\}$$, where $$\alpha _i$$ and $$\beta _i$$ are failure and recovery rates for the node i, $$i=1,\dots m$$.

Elmira Yu. Kalimulina
Coupling Method for Backward Renewal Process and Lorden’s Inequality

A scheme of using the coupling method to obtain strong bounds for the convergence rate of the distribution of the backward renewal process in the total variation distance is described. This scheme can be applied to a wide class of regenerative processes in queuing theory.

Galina Zverkina
Modified Cramer-Lundberg Models with On/Off Control and Hyperexponential Distribution of Demands Purchases Values

The paper contains research of modified Cramer-Lundberg models of inventory management with On/Off control and hyperexponential distribution of demands purchases values. In first model we assume that input product flow has piecewise-constant rate, which depends on some threshold value, the random part of demand is modeled as Poisson process with constant intensity. Hereby system control is to switch the rate of the input product flow if the stock level in the system is more than threshold. Second model is investigated under following conditions: the rate of input product flow is a constant, the random part of demand is modeled as Poisson process with piecewise-constant intensity. In this case the idea of control the system is similar to the first model. We find explicit expressions for the stationary distribution of the inventory level for each models. The results are discussed with illustrative numerical example.

Anatoly Nazarov, Valentina Broner
Dobrushin Mean-Field Approach for Queueing Large-Scale Networks with a Small Parameter

In this paper it is considered a system that consists of infinite number of servers with a Poisson input flow of requests of intensity $$N \lambda $$. Each requests arriving to the system randomly selects two servers and is instantly sent to the one with the shorter queue. In this case a share $$u_k (t)$$ of the servers that have the queues lengths with not less than k can be described using an infinite system of differential equations. It is possible to investigate Tikhonov type Cauchy problem for this system with small parameter $$\mu $$ for building the solutions $$u_k (t)$$. The evolution analysis of $$u_k (t)$$$$(k=1,2,\ldots )$$ be applied to application in queueing large-scale networks analysis.

Galina O. Tsareva, Sergey A. Vasilyev
Retrial Queue M/M/1 with Negative Calls Under Heavy Load Condition

In the paper, the retrial queueing system of M/M/1 type with negative calls is considered. The system of Kolmogorov equations for the system states process is derived. The method of asymptotic analysis is proposed for the system solving under the heavy load condition. The theorem about the gamma form of the asymptotic characteristic function of the number of calls in the orbit is formulated and proved. During the study, the expression for the system throughput is obtained. Also the exact characteristic function is derived. Numerical examples of comparison asymptotic and exact distributions are presented. The conclusion about the asymptotic method application area is made.

Mais Farkhadov, Ekaterina Fedorova
The Survey on Markov-Modulated Arrival Processes and Their Application to the Analysis of Active Queue Management Algorithms

The article is devoted to the application of Markov modulated arrival processes (Markov modulated Poisson process — MMPP, Markov modulated Bernoulli process — MMBP and Markov modulated fluid flow — MMFF) models to the analysis of Active Queue Management (AQM) algorithms (Random Early Detection (RED) family, for example). The main ideas and properties of Markov modulated arrival processes (MMAP) are presented as the brief description of RED-type AQM algorithms. A review of the main results obtained with the help of MMAP processes in the analysis of AQM algorithms models is made. The authors formulated problems that also can be solved with the help of MMAP processes when analysing the systems with RED-like algorithms.

Ivan Zaryadov, Anna Korolkova, Dmitriy Kulyabov, Tatiana Milovanova, Vladimir Tsurlukov
Control of System Dynamics and Constraints Stabilization

The equations of classical mechanics used for describing a dynamical process of controlled systems containing different elements. The method of constructing differential equations of known partial integrals is used to stabilize the constraints imposed on the mechanical system dynamics which is described by Lagrange equations and Hamilton equations. The problem of constructing the dynamics equations with known properties of motion in the class of Ito stochastic differential equations was investigated by Tleubergenov M.I., Azhymbaev D.T. Assuming that some of the properties of the motion are known and the random perturbing forces belong to the class of processes with independent increments, Lagrange functions, Hamilton functions and Birkhoff functions can be constructed. Stability conditions for solutions of equations of dynamics with respect to the constraint equations are obtained, and an algorithm for constructing equations of constraint perturbations that guarantees the stabilization of constraints in the course of numerical solution is proposed. The problem of controlling the rectilinear motion of a cart with inverted pendulum is solved.

Robert Garabshevich Mukharlyamov, Marat Idrisovich Tleubergenov
Multi-state Diagnostics for Distributed Radio Direction Finding System

We consider a distributed Radio Direction Finding System (RDFS) and the structure of its hardware. A classical diagnostic model of the distributed RDFS according to the binary criterion is presented, which includes diagnostic graphs and a set of tests. We propose a theoretical basis for diagnosing of the distributed RDFS according to the n-dimensional criterion. An example of implementation of the diagnostic approach to the distributed RDFS for states “failure”, “deterioration”, “normal” is presented.

Dmitry Aminev, Alexander Zhurkov, Dmitry Kozyrev
On Optimal Placement of Monotype Network Functions in a Distributed Operator Network

Many network operators use a large number of intermediate devices like firewalls or antiviruses implemented on the proprietary hardware. Installation and maintenance of this equipment are very expensive. Therefore the network function virtualization technology allowing flexible remote services management through a software is a promising option for organizing operator network architecture. Switching to software appliances instead of specialized hardware can optimize the administration of the network functions, significantly reducing its cost. However, a problem of determining a number of virtual network functions and their placement in a distributed network that optimizes operating costs and meets service level agreement is a complex mathematical problem. The paper deals with a problem of efficient monotype network functions placement in a distributed network in order to minimize the total cost, with restrictions on channel delays, throughput and node performance. NP-completeness of the problem is proved, the statement is given in terms of integer linear programming. A heuristic algorithm is proposed and its efficiency is shown on typical network topologies.

Ekaterina Svikhnushina, Andrey Larionov
SDN Approach to Control Internet of Thing Medical Applications Traffic

The article is devoted to study the processing of traffic generated by nanonetwork of real network and built on the basis of software defined network concepts. For a more realistic experiment is considered a model that describes interactions between a group of individuals that have a nanonetwork in their bodies and the medical services through the local network of a medical institution, built based on software defined network concepts.

Artem Volkov, Ammar Muhathanna, Rustam Pirmagomedov, Ruslan Kirichek
Backmatter
Metadaten
Titel
Distributed Computer and Communication Networks
herausgegeben von
Vladimir M. Vishnevskiy
Konstantin E. Samouylov
Dmitry V. Kozyrev
Copyright-Jahr
2017
Electronic ISBN
978-3-319-66836-9
Print ISBN
978-3-319-66835-2
DOI
https://doi.org/10.1007/978-3-319-66836-9