Wyniki wyszukiwania - BazTech

1

Optimizing of the piezo-optic interaction geometry in SrB4O7 crystals

Buryy O., Demyanyshyn N., Mytsyk B., Andrushchak A.

Optica Applicata

|

2016

|

Vol. 46, nr 3

447--459

EN

The optimal geometries of the piezo-optic interaction are determined for SrB4O7 crystals by the extreme surfaces method. The goal functions of optimization are the change of optical path length and optical path difference, normalized on mechanical stress and crystal thickness, and the parameters of optimization are the spherical angles determining the directions of the light beam propagation and the uniaxial pressure action. It is shown that the maximal changes of optical path length for the orthogonal polarized waves are equal to 2.09 or 1.65 B (1 B = 1 brewster = 10–12 m2/N) and the maximal change of optical path difference is equal to 2.22 B respectively in transversal geometry of the piezo-optic interaction (for λ =633nm and T =20ºC).

2

Routing and Spectrum Assignment for Constant Bit Rate Connections in Spectrum Sliced Elastic Optical Path Networks

Olszewski I.

Przegląd Elektrotechniczny

|

2015

|

R. 91, nr 7

124-128

EN

In this paper a heuristic algorithm for finding an optical path in elastic optical path networks is proposed. The proposed algorithm for connection requests finds a spectrum required from an aggregated spectrum of the path belonging to a set of shortest paths measured by the number of links. It has been shown that the proposed algorithm rejects definitely fewer connection requests than the well-known algorithms solving the same problem.

PL

W pracy zaproponowano heurystyczny algorytm wyboru ścieżek w elastycznych sieciach optycznych. Zaproponowany algorytm zajmuje dla napływającego żądania wymagane pasmo w zagregowanym widmie ścieżki, należącej do zbioru najkrótszych ścieżek mierzonych liczbą łączy. W pracy wykazano, że algorytm ten odrzuca mniejszą liczbę żądań niż znane algorytmy minimalizujące rzeczywistą długość ścieżki.

3

Dynamic RSA Problem for Time-Varying Traffic in Spectrum Sliced Elastic Optical Path Network

Olszewski I.

International Journal of Electronics and Telecommunications

|

2015

|

Vol. 61, No. 2

179-184

EN

Service time-varying traffic flexible optical networks require a dynamic bandwidth allocation in order to follow the source transmission rate. The problem of service time-varying traffic, assuming that the set of connection requests is not known in advance, is considered in this work. Connection requests arrive randomly and have random durations. The considered dynamic RSA problem involves minimizing the probability of future connections blocking while maintaining spectrum continuity constraints and non-overlapping spectrum assignment constraints between spectrum-adjacent connections on the network links. The proposed algorithm determines the path with the required number of slots around the reference frequency for a connection request. An analysis of the network with time-varying traffic on the network connections was carried out on the basis of spectrum expansion/contraction schemes which allow to determine average blocking probability of the additional slot requests on these connections. The obtained results have been compared with those obtained by a well known algorithm that solves the dynamic RSA problem.