Browsing by Subject "Multiplexing equipment"
Now showing 1 - 4 of 4
Results Per Page
Sort Options
Item Open Access Dual-frequency division de-multiplexer based on cascaded photonic crystal waveguides(Elsevier, 2012-02-28) Akosman, Ahmet E.; Mutlu, Mehmet; Kurt, H.; Özbay, EkmelA dual-frequency division de-multiplexing mechanism is demonstrated using cascaded photonic crystal waveguides with unequal waveguide widths. The de-multiplexing mechanism is based on the frequency shift of the waveguide bands for the unequal widths of the photonic crystal waveguides. The modulation in the waveguide bands is used for providing frequency selectivity to the system. The slow light regime of the waveguide bands is utilized for extracting the desired frequency bands from a wider photonic crystal waveguide that has a relatively larger group velocity than the main waveguide for the de-multiplexed frequencies. In other words, the wider spatial distribution of the electric fields in the transverse direction of the waveguide for slow light modes is utilized in order to achieve the dropping of the modes to the output channels. The spectral and spatial de-multiplexing features are numerically verified. It can be stated that the presented mechanism can be used to de-multiplex more than two frequency intervals by cascading new photonic crystal waveguides with properly selected widths.Item Open Access Markov modulated periodic arrival process offered to an ATM multiplexer(IEEE, 1993-11-12) Akar, Nail; Arıkan, ErdalWhen a superposition of on/off sources is offered to a deterministic server, a particular queueing system arises whose analysis has a significant role in ATM based networks. Periodic cell generation during active times is a major feature of these sources. In this paper a new analytical method is provided to solve for this queueing system via an approximation to the transient behavior of the nD/D/1 queue. The solution to the queue length distribution is given in terms of a solution to a linear differential equation with variable coefficients. The technique proposed here has close similarities with the fluid flow approximations and is amenable to extension for more complicated queueing systems with such correlated arrival processes. A numerical example for a packetized voice multiplexer is finally given to demonstrate our results.Item Open Access Markov modulated periodic arrival process offered to an ATM multiplexer(Elsevier BV * North-Holland, 1995-04) Akar, N.; Arıkan, E.When a superposition of on/off sources is offered to a deterministic server, we are faced with a particular queueing system, the analysis of which has a significant role in ATM networks. Periodic cell generation during active times is a major feature of these sources. We provide an analytical approach to solve for this queueing system via an approximation to the transient behavior of the nD/D/1 queue. The solution to the queue length distribution is given in terms of a solution to a linear differential equation with variable coefficients. The technique proposed here has close similarities with the fluid flow approximation and is amenable to extension for more complicated queueing systems with such correlated arrival processes. A numerical example for a packetized voice multiplexer is finally given to demonstrate our results.Item Open Access Matrix-geometric solutions of M/G/1-type Markov chains: A unifying generalized state-space approach(1998) Akar, N.; Oǧuz, N.C.; Sohraby, K.In this paper, we present an algorithmic approach to find the stationary probability distribution of M/G/1-type Markov chains which arise frequently in performance analysis of computer and communication networ ks. The approach unifies finite- and infinite-level Markov chains of this type through a generalized state-space representation for the probability generating function of the stationary solution. When the underlying probability generating matrices are rational, the solution vector for level k, x k, is shown to be in the matrix-geometric form x k+1 = gF k H, k ≥ 0, for the infinite-level case, whereas it takes the modified form x k+1 = g 1F 1 kH 1 + g 2F 2 K-k-1 H 2, 0 ≤ k < K, for the finite-level case. The matrix parameters in the above two expressions can be obtained by decomposing the generalized system into forward and backward subsystems, or, equivalently, by finding bases for certain generalized invariant subspaces of a regular pencil λE - A. We note that the computation of such bases can efficiently be carried out using advanced numerical linear algebra techniques including matrix-sign function iterations with quadratic convergence rates or ordered generalized Schur decomposition. The simplicity of the matrix-geometric form of the solution allows one to obtain various performance measures of interest easily, e.g., overflow probabilities and the moments of the level distribution, which is a significant advantage over conventional recursive methods.