Performance analysis of multimedia based web traffic with QoS constraints

During the recent years, there has been a tremendous growth in the development and deployment of multimedia based networked applications such as video streaming, IP telephony, interactive games, among others. These applications, in contrast to elastic applications such as email and data sharing, are delay and delay jitter sensitive but can tolerate certain level of packet loss. A vital element of end-to-end delay and delay jitter is the random queueing delays in network switches and routers. Analysis of robust mechanisms for buffer management at network routers needs to be carried out in order to reduce end-to-end delay for traffic generated by multimedia applications. In this context, a threshold based buffer management scheme for accommodating multiple class multimedia traffic in network routers has been analysed. This technique effectively controls the allocation of buffer to various traffic classes according to their delay constraints. The forms of the joint state probabilities, as well as basic performance measures such as blocking probabilities are analytically established at equilibrium. Typical numerical experiments are included to illustrate the credibility of the proposed mechanism in the context of different quality of service (QoS) grades for various network traffic classes. This model, therefore, can be used as a powerful tool to provide a required grade of service to a particular class of multimedia based web traffic in any heterogeneous network.     

Techniques for pipelined broadcast on ethernet switched clusters

By splitting a large broadcast message into segments and broadcasting the segments in a pipelined fashion, pipelined broadcast can achieve high performance in many systems. In this paper, we investigate techniques for efficient pipelined broadcast on clusters connected by multiple Ethernet switches. Specifically, we develop algorithms for computing various contention-free broadcast trees that are suitable for pipelined broadcast on Ethernet switched clusters, extend the parametrized LogP model for predicting appropriate segment sizes for pipelined broadcast, show that the segment sizes computed based on the model yield high performance, and evaluate various pipelined broadcast schemes through experimentation on Ethernet switched clusters with various topologies. The results demonstrate that our techniques are practical and efficient for contemporary fast Ethernet and Giga-bit Ethernet clusters.     

Bandwidth Efficient All-to-All Broadcast on Switched Clusters

Clusters of workstations employ flexible topologies: regular, irregular, and hierarchical topologies have been used in such systems. The flexibility poses challenges for developing efficient collective communication algorithms since the network topology can potentially have a strong impact on the communication performance. In this paper, we consider the all-to-all broadcast operation on clusters with cut-through and store-and-forward switches. We show that near-optimal all-to-all broadcast on a cluster with any topology can be achieved by only using the links in a spanning tree of the topology when the message size is sufficiently large. The result implies that increasing network connectivity beyond the minimum tree connectivity does not improve the performance of the all-to-all broadcast operation when the most efficient topology specific algorithm is used. All-to-all broadcast algorithms that achieve near-optimal performance are developed for clusters with cut-through and clusters with store-and-forward switches. We evaluate the algorithms through experiments and simulations. The empirical results confirm our theoretical finding.     

Potentiometric urea biosensor based on BSA embedded surface modified polypyrrole film

A potentiometric biosensor based on bovine serum albumin (BSA) embedded surface modified polypyrrole has been developed for the quantitative estimation of urea in aqueous solution. The enzyme, urease (Urs), was covalently linked to free amino groups present over the BSA embedded modified surface of the conducting polypyrrole film electrochemically deposited onto an indium–tin-oxide (ITO) coated glass plate. The biosensor has been characterized by UV–visible, infrared spectroscopy and SEM. Potentiometric and spectrophotometric response of the enzyme electrode (Urs/BSA-PPy/ITO) were measured as a function of urea concentration in Tris–HCl buffer (pH 7.0). It has been found that the electrode responds to low urea concentration with wider range of detection. The electrode showed a linear response range of 6.6 × 10⁻⁶ to 7.5 × 10⁻⁴ M urea. The response time is about 70–90 s reaching to a 95% steady-state potential value and 75% of the enzyme activity is retained for about 2 months. These results indicate an efficient covalent linkage of enzyme to free amino groups of the BSA molecules over the surface of polypyrrole film, which leads to high enzyme loading, an increased lifetime stability of the electrode and an improved wide range of detection of low urea concentration in aqueous solution.     

A Cooperative Game Theoretical Technique for Joint Optimization of Energy Consumption and Response Time in Computational Grids

With the explosive growth in computers and the growing scarcity in electric supply, reduction of energy consumption in large-scale computing systems has become a research issue of paramount importance. In this paper, we study the problem of allocation of tasks onto a computational grid, with the aim to simultaneously minimize the energy consumption and the makespan subject to the constraints of deadlines and tasks' architectural requirements. We propose a solution from cooperative game theory based on the concept of Nash Bargaining Solution. In this cooperative game, machines collectively arrive at a decision that describes the task allocation that is collectively best for the system, ensuring that the allocations are both energy and makespan optimized. Through rigorous mathematical proofs we show that the proposed cooperative game in mere O(n mlog(m)) time (where n is the number of tasks and m is the number of machines in the system) produces a Nash Bargaining Solution that guarantees Pareto-optimally. The simulation results show that the proposed technique achieves superior performance compared to the Greedy and Linear Relaxation (LR) heuristics, and with competitive performance relative to the optimal solution implemented in LINDO for small-scale problems.     

Optimal Packet Loss Protection of Progressively Compressed 3-D Meshes

We consider a state-of-the-art system that uses layered source coding and forward error correction with Reed-Solomon codes to efficiently transmit 3-D meshes over lossy packet networks. Given a transmission bit budget, the performance of this system can be optimized by determining how many layers should be sent, how each layer should be packetized, and how many parity bits should be allocated to each layer such that the expected distortion at the receiver is minimum. The previous solution for this optimization problem uses exhaustive search, which is not feasible when the transmission bit budget is large. We propose instead an exact algorithm that solves this optimization problem in linear time and space. We illustrate the advantages of our approach by providing experimental results for the compressed progressive meshes (CPM) mesh compression technique.     

Effect of molecular anisotropy on backscattered ultraviolet radiance

The effect of molecular anisotropy on backscattered UV (BUV) radiances is computed by accounting for it in both Rayleigh optical thickness and the scattering-phase matrix. If the effect of molecular anisotropy is included only in the optical thickness and not in the phase matrix, then for high sun (θ(0) ～ 0°), the nadir radiance (I(0)) leaving the top of the atmosphere is approximately 1.8% higher than the radiance (I(op)) computed with the effect included in the phase matrix. For very low sun (θ(0) > 80°), I(0) is approximately 2.3% lower than I(op). For off-nadir radiances the relative increase (decrease) depends on both the local zenith angle as well as the azimuth angle. Also, an increase in the surface reflectivity decreases the effect of molecular anisotropy on the upwelling radiances. Exclusion of the anisotropy factor in the Rayleigh-phase matrix has very little effect (<1%) on ozone retrieval from the BUV-type instruments. This is because of the ratio technique used in the retrieval algorithm, which practically cancels out the anisotropy effect.     

Improved aquila optimization-based parameter evaluation framework and meta-heuristic algorithm in radio-over-fiber SpatialMux multi-input multi-output long-term evolution system

In heterogeneous access network, Multiple-Input Multiple-Output (MIMO) radio-over-fiber (RoF) system is an efficient approach for multiple signal transmission with low cost and complexity. The performance of RoF fronthaul system in MIMO system will be varied with different nonlinear effects. By adjusting various transmission parameters, such as the input signal power or the laser bias current, the nonlinear impacts produced by the RoF system can be reduced. In this paper, a novel algorithm Improved Aquila Optimization (IAO) is proposed to optimize transmission circumstances of MIMO RoF system. It determines the appropriate bias current for both lasers and Radio Frequency (RF) signal power in a short period. The input signals are wavelength multiplexed with Intensity Modulation and Direct Detection (IM/DD) applied. The carrier as well as transmission frequency is governed by the MIMO-Long-Term Evolution (LTE) standard. The proposed system is implemented in MATLAB, and the performance is evaluated. The experimental results show that fast convergence and trade-off between noise and nonlinearity are obtained with varying bandwidth. In the experimental scenario, the maximum Error Vector Magnitude (EVM) of 1.88, 3.14, and signal-to-noise ratio (SNR) of 3.204, and 2.698 was attained for both quadrature phase shift keying (QPSK) and quadrature amplitude modulation (QAM) modulation. [Correction added on 24 April 2023, after first online publication: the SNR values were corrected in the preceding sentence.] For 100 iterations, the processing time was reduced to 0.137 s. When compared with the conventional state-of-the-art approaches, the accuracy and computational complexity of the proposed approach are improved.     

Unital Design Based Location Service for Subterranean Network Using Long Range Topology

Wireless Personal Communications - Wireless Underground Networks comprise the ability to constantly monitor several physical parameters such as ground temperature, water level and soil condition,...     

An Improvement Energy Consumption Policy Using Communication Reduction in Wireless Body Sensor Network

Dedicated short-range communications (DSRC) is an important wireless technology for current and future automotive safety and mitigation of traffic jams. In this work, we have designed a Coplanar waveguide microstrip patch antenna with linear, upper and bottom and side slots for application in DSRC. The patch antenna was designed using glass epoxy substrate (FR4). Various parametric analyses such as the current distribution, reflection coefficient, radiation pattern on E- and H-plane as well as the realized gain (dB) were performed. The results were obtained by simulation using high-frequency structure simulator tool. The proposed antenna covers a frequency band of 5.8–5.9 GHz which is highly dedicated to the DSRC wireless communication technology for enhancement of safety of the automotive transport system. The designed antenna shows a good return loss of ??19 dB at 5.9 GHz.The designed antenna shows a promising gain, return loss and radiation pattern for use in DSRC for automotive transport systems.