Wyniki wyszukiwania - BazTech

1

Model wielousługowego systemu kolejkowego z ruchem elastycznym

Hanczewski Sławomir, Weissenberg Joanna

Przegląd Telekomunikacyjny + Wiadomości Telekomunikacyjne

|

2019

|

nr 7

694--698, CD

PL

W artykule przedstawiony został model analityczny wielousługowego systemu kolejkowego z ruchem elastycznym. Ruch elastyczny należy do podstawowych typów ruchu występujących we współczesnych sieciach teleinformatycznych. Przedstawiony model pozwala na określenie podstawowych parametrów systemów kolejkowych. Rezultaty uzyskane na podstawie tego modelu zostały porównane z wynikami symulacji cyfrowej wielousługowego systemu kolejkowego z dyscypliną FIFO.

EN

The paper presents an analytical model of multi-service queueing system with elastic traffic. The elastic traffic belongs to the basic types of traffic that occurs in modern telecommunications networks. The presented model allows to calculate basic parameters of queueing system. The results of the analytical calculations are compared with the results of the simulation experiments of the multi-service system with FIFO queueing discipline.

2

Overflows of elastic traffic

Głąbowski M., Kmiecik D.

Image Processing & Communications

|

2017

|

Vol. 22, no. 1

13--26

EN

This article presents the results of a study on hierarchical multiservice trafﬁc overﬂow systems. The systems under investigation were composed of a number of primary resources and one alternative resource. Trafﬁc in the considered systems was generated with the assumption that tere was a ﬁnite number of trafﬁc sources in individual classes. Further assumption was that offered trafﬁc is elastic trafﬁc for which – with an increase of the load of the system – a change in the volume of allocated resources is possible followed by concurrent extension of their service time. The article includes the results that present the bloking probabilisty In The sample elastic trafﬁcoverﬂow systems. The study focuses on a determination of the inﬂuence of the trafﬁc intensity, volume of resources, degree of compression, resource with compression (primary resources, alternative resources)and the cardinality of trafﬁc sources on values of the blocking probability in individual call classes and on the number of calls that overﬂow to the alternative resource.

3

Fair and efficient network dimensioning with the reference point methodology

Goryczak W., Wierzbicki A., Milewski M.

Journal of Telecommunications and Information Technology

|

2006

|

nr 4

21-30

EN

The dimensioning of telecommunication networks that carry elastic traffic requires the fulfillment of two conflicting goals: maximizing the total network throughput and providing fairness to all flows. Fairness in telecommunication network design is usually provided using the so-called max-min fairness (MMF) approach. However, this approach maximizes the performance of the worst (most expensive) flows which may cause a large worsening of the overall throughput of the network. In this paper we show how the concepts of multiple criteria equitable optimization can be effectively used to generate various fair and efficient allocation schemes. We introduce a multiple criteria model equivalent to equitable optimization and we develop a corresponding reference point procedure for fair and efficient network dimensioning for elastic flows. The procedure is tested on a sample network dimensioning problem for elastic traffic and its abilities to model various preferences are demonstrated.

4

Fairness considerations with algorithms for elastic traffic routing

Cinkler T., Laborczi P., Pióro M.

Journal of Telecommunications and Information Technology

|

2004

|

nr 2

3-12

EN

The bit rate of modern applications typically varies in time. We consider the traffic elastic if the rate of the sources can be controlled as a function of free resources along the route of that traffic. The objective is to route the demands optimally in sense of increasing the total network throughput while setting the rates of sources in a fair way. We propose a new fairness definition the relative fairness that handles lower and upper bounds on the traffic rate of each source and we compare it with two other known fairness definitions, namely, the max-min and the proportional rate fairness. We propose and compare different routing algorithms, all with three types of fairness definitions. The algorithms are all a tradeoff between network throughput, fairness and computational time.

5

On multi-criteria approaches to bandwidth allocation

Ogryczak W., Wierzbicki A.

Control and Cybernetics

|

2004

|

Vol. 33, no 3

427-448

EN

Modern telecommunication networks face an increasing demand for services. Among these, an increasing number are services that can adapt to available bandwidth, and are therefore referred to as elastic traffic. Nominal network design for elastic traffic becomes increasingly significant. Typical resource allocation methods are concerned with the allocation of limited resources among competing activities so as to achieve the best overall performance of the system. In the network dimensioning problem for elastic traffic, one needs to allocate bandwidth to maximize service flows and simultaneously to reach a fair treatment of all the elastic services. Thus, both the overall efficiency (throughput) and the fairness (equity) among various services are important. In such applications, the so-called Max-Min Fairness (MMF) solution concept is widely used to formulate the resource allocation scheme. This approach guarantees fairness but may lead to significant losses in the overall throughput of the network. In this paper we show how the concepts of multiple criteria equitable optimization can be effectively used to generate various fair resource allocation schemes. We introduce a multiple criteria model ecluivalent to equitable optimization and we develop a corresponding reference point procedure to generate fair efficient bandwidth allocations. The procedure is tested on a sample network dimensioning problem and its abilities to model various preferences are demonstrated.