In this paper, we propose an effective path virtualization system using Fountain code that provides the highest possible data rate with satisfactory delay and block loss rate constraints to enhance video quality. Basically, Fountain code and video codec H. 264 are tightly coupled to efficiently use the path diversity over existing heterogeneous wireless networks. Finally, the proposed system is...

We present an 8-bit field programmable gate arr (FPGA) implementation of 128-bit block and 128-bit k Advanced Encryption Standard (AES) Rijndael. The 8Rijndael encryption data path operates at 13.7MHz a consumes 226 clock cycles resulting in a throughput of 7.8 bits per second. The Rijndael decryption data path operates 8.8MHz and consumes 226 clock cycles resulting in throughput of 5 M bits pe...

In survivable optical networks, wavelength assignment is a major concern than assigning routes to the light path requests. Earlier wavelength assignment algorithm suffers from unbalanced utilization of wavelengths that leads to blocking probability for any connection request. This paper analyzes the performance of the wavelength assignment strategies to reduce the network block rate of the requ...

A hidden Markov model (HMM) is said to have path-mergeable states if for any two states i, j there exists a word w and state k such that it is possible to transition from both i and j to k while emitting w. We show that for a finite HMM with path-mergeable states the block estimates of the entropy rate converge exponentially fast. We also show that the path-mergeability property is asymptotical...

black saxaul (haloxylon aphyllum) is one of the best options for rehabilitating drought affected desert lands. the species is remarkably adapted to the central dry environment ofiran and a major source of raising pasture productivity of the areas. progenies of 25 randomly selected black saxaul trees from four populations of the species were studied in a randomized complete block design with thr...

Constraint-based path computation is a fundamental building block for traffic engineering systems such as Multiprotocol Label Switching (MPLS) and Generalized Multiprotocol Label Switching (GMPLS) networks. Path computation in large, multi-domain, multi-region, or multi-layer networks is complex and may require special computational components and cooperation between the different network domai...

The entropy of an ergodic finite-alphabet process can be computed from a single typical sample path x1 using the entropy of the k-block empirical probability and letting k grow with n roughly like logn. We further assume that the distribution of the process is a g-measure. We prove large deviation principles for conditional, non-conditional and relative k(n)-block empirical entropies.

We develop some asymptotic theory for applications of block bootstrap resampling schemes to multivariate integrated and cointegrated time series. It is proved that a multivariate, continuous-path block bootstrap scheme applied to a full rank integrated process, succeeds in estimating consistently the distribution of the least squares estimators in both, the regression and the spurious regressio...