ACCESS NETWORKs WITH THE RELATIVE PRIORITY

• Main Author: A. G. Kostukovsky
• Format: Article
• Language: Russian
• Published: Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
• Series: Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki
• Subjects: системы массового обслуживания; сети доступа; уровни обслуживания; качество обслуживания qos; схемы приоритета; среднесетевые задержки
• Online Access: https://doklady.bsuir.by/jour/article/view/346

The engineering method of calculation of an average waiting time on priority classes a non-preemptive priority model of the exponential server as tool base of measurement of quality of service in networks with switching of packages is developed. It is established that on access networks with the dominating service Triple Play (Three in one) the simple scheme of a priority has advantage over a complex system of traffic control at an exponential server load factor q < 0.3. The simplified formula of calculation the average network latency for the scheme with 3 classes of a priority is received. Numerical experiment which confirmed existence of some nominal operating mode of the exponential server with the scheme with 3 classes of a priority is executed. The inflection point in dependence of an average waiting time on coefficient of loading of the exponential server is established at q = 0.2 which laid down in a basis of creation of a nominal operating mode of the exponential server with the scheme with 3 classes of a priority.