Wyniki wyszukiwania - BazTech

1

QoS Extensions for Flow-Awareness Networks

Kaczmarek Sylwester, Wolff Maciej

International Journal of Electronics and Telecommunications

|

2022

|

Vol. 68, No. 2

351--357

EN

The paper contains a description and research results of the proposal for distributed QoS extensions for Flow-Based Networking. These QoS extensions let the network accept or reject flows based on current network load and QoS promises for each of the flows. Proposed solution consists of two distributed components, each of them performing in every node, measurement system and access control. The solution could be applied in any network architecture that is able to distinguish flows and routers in this architecture contains flow state table. Proposed approach was verified by simulation, in FSA architecture. Verification was done for six different network structures servicing two traffic classes (MRS, ARS). The results of the simulation tests have confirmed that the average time delay and packet loss ratio in the network with proposed extensions are below thresholds and meet the requirements recommended by ITU-T.

2

A fast method for enumerating all minimal d-cut-sets in a flow network

Malinowski Jacek

Safety and Reliability of Systems and Processes

|

2020

|

Summer Safety and Reliability Seminar 2020

183--198

EN

A d-cut-set in a flow network is a set of components whose removal or blockage causes the maximum flow (MF) to fall below value d, provided that in fully operational network MF is greater or equal to d. A min-d-cutset is a d-cut set such that it does not contain any other d-cut-set. In turn, a cut-set is a set of components whose removal disconnects the source and the sink, which results in MF being equal to 0. A min-cut-set contains no other cut-set. The method works as follows: the min-cut-sets are ordered according to increasing flow capacities, then from every min-cut-set a number of d-cut-sets are generated and each of them is checked for being minimal and unique. The method features two different algorithms respectively applied if Φ(C) < 2d or Φ(C) ≥ 2d. C is the min-cut-set from which d-cut-sets are generated, and Φ(C) is the flow capacity of C. This distinction results in quick generation of min-d-cut-sets without finding many non-d-cut-sets or nonminimal d-cut-sets. Compared to the similar methods, the new one is highly efficient, due to several original solutions, e.g. an efficient method of checking the redundancy of candidates for min-d-cut-sets. Min-d-cut-sets have two main applications. First, they can be used to compute various reliability characteristics of flow networks. Second, the knowledge of these sets facilitates or even enables management and maintenance of various flow networks such as data transmission, water, power supply, or traffic networks, field drainage systems, etc.

3

Algorytm doboru parametrów swobodnego ciągnienia rur polietylenowych w bezwykopowej rekonstrukcji sieci przepływowej

Wróbel G., Rojek M., Szymiczek M.

Przetwórstwo Tworzyw

|

2009

|

[R.] 15, nr 5

209-215

PL

W artykule przedstawiono algorytm określający tok postępowania przy doborze poszczególnych parametrów materiałowo-technologicznych determinujących efektywność procesu ciasnego osadzania wykładzin polietylenowych w sieciach przepływowych.

EN

The article presents the algorithm for the selection procedure of the material - technological parameters needed for the determination efficiency of the process of thigt-fitting deposition of the polyethylene lining in flow networks.

4

Projektowanie topografii systemów VLSI. Cz. 3. Metody analityczne

Nagórny Z., Kos A.

Kwartalnik Elektroniki i Telekomunikacji

|

2006

|

Vol. 52, z. 4

669-695

PL

Niniejsza praca jest trzecią częścią przeglądu metod rozmieszczania modułów, stosowanych podczas projektowania topografii układów VLSI. W pracy szczegółowo został opisany algorytm zamiany parami oraz metody analityczne. Przedstawiono liczne modyfikacje algorytmu zamiany parami, łącznie z algorytmami wykorzystującymi metody relaksacyjne. Modyfikacje algorytmu zamiany parami oraz metody relaksacyjne są stosowane w programach rozmieszczania opartych na metodach analitycznych. Następnie, opisano podstawy zastosowania programowania kwadratowego i liniowego w rozmieszczaniu modułów. Ze względu na dużą liczbę rozwiązań stosowanych w metodach analitycznych, poszczególne rozwiązania szczegółowo przedstawiono na przykładzie wybranych programów rozmieszczania. W tym celu scharakteryzowano następujące programy rozmieszczania: GORDIAN / DOMINO, KraftWerk, FastPlace, mPL, PROUD, ATLAS, FAR, mFAR, BloBB, APlace. Przedstawiono również sposób zastosowania metody relaksacyjnej w układach o topografii swobodnej oraz możliwość optymalizacji topografii układu ze względu na aspekt termiczny.

EN

The design process of the VLSI circuits requires the use of computer aided design tools. This paper is the third part of the survey of the cell placement techniques for digital VLSI circuits. In this part of the survey, the pairwise interchange algorithm and some analytical methods are presented. The force-directed placement algorithm and some modifications of the pairwise interchange algorithm, which are used in analytical algorithms are described. Then, the nonlinear programming, quadratic programming and linear programming techniques are presented. An application of these techniques to the cell placement problem is described. Nowadays the tools used for the cell placement, which utilize the presented algorithms are characterized: GORDIAN, DOMINO, KraftWerk, FastPlace, mPL, PROUD, ATLAS, FAR, mFAR, BloBB, APlace. A force-directed placer for a building block design style is described. The principles of the multilevel optimization for the cell placement problem are presented. Applications of the flow network and branch and bound algorithm to the cell placement are characterized. Some conclusions concerning described techniques and tools are presented.