Configurable cost-quality optimization of cloud-based VoIP

Tchernykh, Andrei; Cortés-Mendoza, Jorge M.; Bychkov, I. V.; Feoktistov, Alexander; Didelot, Loic; Bouvry, Pascal; Радченко, Глеб; Borodulin, Kirill

doi:10.1016/j.jpdc.2018.07.001

Cited by 5 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Results from previous studies related to uncertainty mitigation, data storage and transfer, clouds integration, and computation management for cloud computing are presented in [17][18][19][20][21].…”

Section: Related Workmentioning

confidence: 99%

Agent-based approach to hybrid modeling queuing systems

Feoktistov¹,

Kostromin²,

Basharina³

et al. 2021

1st International Workshop on Advanced Information and Computation Technologies and Systems 2020

View full text Add to dashboard Cite

Nowadays, the study of the behavior of social, economic, and technical queuing systems at different stages of their design and operation is a challenge for simulation modeling. The complexity of the dynamic structure of such systems is owing to a number of factors. Among them are a large number of system characteristics and relations between them, the existence of a large spectrum of distribution laws of random events, the need to collect and analyze current data on the system under study, and the presence of various constraints. Moreover, relations can be represented by functional, statistical, ambiguous, or other mappings. Unfortunately, simulation modeling tools are not widespread in designing and applying business processes, unlike other products of information and computation technologies (system of the office administration, warehouse management, etc.). In this regard, we present an approach to developing web-service for simulation modeling of queuing systems. Within the approach, we automate some stages of web-service development and use. To this end, we apply tools that support distributed computing with parameter variations in a heterogeneous environment, which includes virtualized resources. We provide a multi-agent management of computations. The practical use of the tools is shown on the example of developing a web-service for simulation modeling of a typical health and care institution.

show abstract

Section: Related Workmentioning

confidence: 99%

Agent-based approach to hybrid modeling queuing systems

Feoktistov¹,

Kostromin²,

Basharina³

et al. 2021

1st International Workshop on Advanced Information and Computation Technologies and Systems 2020

View full text Add to dashboard Cite

show abstract

“…Computational security for secret sharing schemes can be defined in more strong way [15]. It is based on the polynomial indistinguishability concept [16][17][18][19][20][21][22][23]. For any probability distribution ( , ), a secret sharing scheme is computationally secure if, for any pair of secrets (") , ($) and incomplete subsets of shares (") and ($) , the distributions N (") , (") V and N (") , (") Let = Pr N (") , (") V¡ = 1¡, = Pr N ($) , ($) V¡ = 1¡, = PrN N (") , (") V = 1V .…”

Section: T2x ›2$ X0)mentioning

confidence: 99%

Computationally secure threshold secret sharing scheme with minimal redundancy

Babenko¹,

Tchernykh²,

Golimblevskaia³

et al. 2020

The International Workshop on Information, Computation, and Control Systems for Distributed Environments

View full text Add to dashboard Cite

When designing and using distributed storage systems with cloud technology, the security issues become crucial. One of the promising mechanisms is the computationally secure threshold secret sharing scheme. We propose a computationally secure secret sharing scheme based on the minimally redundant modular code. It reduces the computational complexity of data encoding and decoding and reduce data redundancy. We show that it is computationally secure and provides data redundancy equivalent to the redundancy of the Rabin system. We demonstrate that the minimally redundant modular code does not satisfy the criterion of compactness of a sequence, but it can be used as an asymptotically ideal secret sharing scheme.

show abstract