ALGORITHMS OF THE ROUTE SEARCH BASED ON CRITERIA OF MINIMUM DELAY FOR DATA CENTER

Abstract

This paper is devoted to the problem of increasing of services provisioning speed in networks with cloud technology. Under the services provisioniong speed it is meant ensuring of the lowest service provisioning latency, i.e. decreasing processing time of the requests, which are arriving for the service to the data-center. Data-center hast to ensure a unified information resource with guaranteed levels of authenticity, availability and security of the data. In cloud networks data-centers contain not only the storage servers but also a physical servers, which provide services and process requests. Each such server can contain from one to a few virtual machines, which are able to satisfy requests using appropriate components or applications for service provisioning. Redirection of the requests to the other logical or sometimes physical channels will impact on the general service provisioning time. In order to decrease serving time of the requests that arrive to the data-center and considering the data-centers topology structure the algorithm of the route search based on criteria of minimal processing time is proposed. The algorithm calculates optimal transferring route based on the information about information spreading and network topology changes. This algorithm allows taking into consideration not only the load in each channel but also a total latency of the interfaces, what allows increasing optimal route search speed under the changeable network structure. This in turn will cause decreasing requests processing time for users under the dynamic changing structure of the data-center.

Authors and Affiliations

Bohdan Strykhalyuk, Olha Shpur, Marian Seliuchenko, Taras Andrukhiv

Keywords

Related Articles

ANALYSIS OF THE ENERGY BALANCE OF OPTICAL TRANSPORT NETWORK BASED ON THE TECHNOLOGICAL AND ARCHITECTURAL APPROACHES

In this paper presents the main approaches to improve energy efficiency of telecommunications network. The main attention is focused on technological and architectural approaches to reduce power consumption. Shown the co...

METHOD OF SUBSCRIBER NETWORK LOAD BALANCING IN CELULAR NETWORK

This paper is devoted to the solving the problem which occurs in cellular networks at times of peak busy hour when the radio resources are ended in one or more cells. Proposed method increases the availability of radio r...

TEST RELIABLE MATHEMATICAL MODEL OF A TECHNICAL RENEWABLE SYSTEM AND COMPARING THE METHODS OF ITS SOLUTIONS

The mathematical model of a non-rezerved renewable technical system developed in this paper can serve as a test model for debugging programs for the automated construction of reliable models of corresponding technical sy...

Comparison results of sensing nqr using continuous wave and pulsed nqr - fft spectrometers

Traditional continuous wave methods of observation of NMR and NQR is now almost completely superseded by pulse Fourier transform spectroscopy. Compared with the method of continuous frequency scanning, pulse Fourier tran...

FORMATION OF SERVER CLUSTER NODES ENERGY CONSUMPTION MODELS FOR ENERGY EFFICIENT COMPUTING

In this paper the approach of server cluster nodes energy models forming is described. The approach is based on idea of each node’s power consumption from central processor utilization individual dependencies defining an...

Download PDF file
  • EP ID EP459736
  • DOI -
  • Views 126
  • Downloads 0

How To Cite

Bohdan Strykhalyuk, Olha Shpur, Marian Seliuchenko, Taras Andrukhiv (2014). ALGORITHMS OF THE ROUTE SEARCH BASED ON CRITERIA OF MINIMUM DELAY FOR DATA CENTER. Вісник Національного університету "Львівська політехніка", серія "Радіоелектроніка та телекомунікації", 796(2014), 176-181. https://europub.co.uk./articles/-A-459736