2 research outputs found

    PRZECI膭呕ENIE I ZARZ膭DZANIE RUCHEM 殴R脫DE艁 WIADOMO艢CI O R脫呕NYCH PRIORYTETACH US艁UG

    Get PDF
    The scheme of dynamic management of traffic and activity of message sources with different priority of service is considered. The scheme is built on the basis of the neuroprognostic analysis model and the gradient descent method. For prediction and early detection of overload, the apparatus of the general theory of sensitivity with indirect feedback and control of activity of message sources is used. The control algorithm is started at the bottleneck of the network node. It uses a recursive prediction approach where the neural network output is referred to as many steps as defined by a given prediction horizon. Traffic with a higher priority is served without delay using the entire available bandwidth. Low-priority traffic will use the remaining bandwidth not used by higher-priority traffic. An algorithm for estimating the maximum available bandwidth of a communication node for traffic with a low service priority has been developed. This approach makes it possible to improve the efficiency of channel use without affecting the quality of service for high-priority traffic.Rozwa偶ono schemat dynamicznego zarz膮dzania ruchem i aktywno艣ci膮 藕r贸de艂 komunikat贸w o r贸偶nym priorytecie obs艂ugi. Schemat zbudowany jest w oparciu o model analizy neuroprognostycznej oraz metod臋 gradientu. Do prognozowania i wczesnego wykrywania przeci膮偶enia wykorzystuje si臋 aparatur臋 og贸lnej teorii wra偶liwo艣ci z po艣rednim sprz臋偶eniem zwrotnym i kontrol膮 aktywno艣ci 藕r贸de艂 komunikat贸w. Algorytm sterowania jest uruchamiany w w膮skim gardle w臋z艂a sieci. Wykorzystuje metod臋 predykcji rekurencyjnej, w kt贸rej dane wyj艣ciowe sieci neuronowej s膮 odnoszone do tylu krok贸w, ile okre艣lono w danym horyzoncie predykcji. Ruch o wy偶szym priorytecie jest obs艂ugiwany bez op贸藕nie艅 z wykorzystaniem ca艂ej dost臋pnej przepustowo艣ci. Ruch o niskim priorytecie b臋dzie wykorzystywa艂 pozosta艂膮 przepustowo艣膰 niewykorzystan膮 przez ruch o wy偶szym priorytecie. Opracowano algorytm szacowania maksymalnej dost臋pnej przepustowo艣ci w臋z艂a komunikacyjnego dla ruchu o niskim priorytecie us艂ugi. Takie podej艣cie umo偶liwia popraw臋 efektywno艣ci wykorzystania kana艂贸w bez wp艂ywu na jako艣膰 obs艂ugi ruchu o wysokim priorytecie

    OVERLOAD AND TRAFFIC MANAGEMENT OF MESSAGE SOURCES WITH DIFFERENT PRIORITY OF SERVICE

    Get PDF
    The scheme of dynamic management of traffic and activity of message sources with different priority of service is considered. The scheme is built on the basis of the neuroprognostic analysis model and the gradient descent method. For prediction and early detection of overload, the apparatus of the general theory of sensitivity with indirect feedback and control of activity of message sources is used. The control algorithm is started at the bottleneck of the network node. It uses a recursive prediction approach where the neural network output is referred to as many steps as defined by a given prediction horizon. Traffic with a higher priority is served without delay using the entire available bandwidth. Low-priority traffic will use the remaining bandwidth not used by higher-priority traffic. An algorithm for estimating the maximum available bandwidth of a communication node for traffic with a low service priority has been developed. This approach makes it possible to improve the efficiency of channel use without affecting the quality of service for high-priority traffic
    corecore