Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.comnet.2005.08.005 Byline: Mingwei Gong, Carey Williamson Keywords: Web server performance; Scheduling; Fairness; Simulation; Performance analysis Abstract: This paper uses trace-driven simulation to study the unfairness properties of Web server scheduling strategies, such as Processor Sharing (PS) and Shortest Remaining Processing Time (SRPT). We use a general-purpose probe-based sampling approach to estimate the mean and variance of the job response time for different job sizes, for arbitrary arrival processes and service time distributions. The results illustrate two different aspects of unfairness called endogenous unfairness and exogenous unfairness. We quantify each, focusing on the mean and variance of slowdown conditioned on job size, for a range of system loads. Our work confirms recent theoretical results regarding the asymptotic convergence of scheduling policies with respect to slowdown, and illustrates typical performance results for a practical range of job sizes in an empirical workload. Finally, we show the sensitivities of SRPT and PS scheduling to selected characteristics of the arrival process and job size distribution. Author Affiliation: Department of Computer Science, University of Calgary, 2500 University Drive NW, Calgary, AB, Canada T2N 1N4 Article History: Received 25 January 2005; Revised 24 June 2005; Accepted 19 August 2005 Article Note: (miscellaneous) Responsible Editor: C.B. Westphall

This paper presents an analytical approach to model the bi-directional multi-channel IEEE 802.11 MAC protocols (Bi-MCMAC) for ad hoc networks. Extensive simulation work has been done for the performance evaluation of IEEE 802.11 MAC protocols. Since simulation has several limitations, this work is primarily based on the analytical approach. The objective of this paper is to show analytically the performance advantages of Bi-MCMAC protocol over the classical IEEE 802.11 MAC protocol. The distributed coordination function (DCF) mode of medium access control (MAC) is considered in the modeling. Two different channel scheduling strategies, namely, random channel selection and fastest channel first selection strategy are also presented in the presence of multiple channels with different transmission rates. M/G/1 queue is used to model the protocols, and stochastic reward nets (SRNs) are employed as a modeling technique as it readily captures the synchronization between events in the DCF mode of access. The average system throughput, mean delay, and server utilization of each MAC protocol are evaluated using the SRN formalism. We also validate our analytical model by comparison with simulation results. The results obtained through the analytical modeling approach illustrate the performance advantages of Bi-MCMAC protocols with the fastest channel first scheduling strategy over the classical IEEE 802.11 protocol for TCP traffic in wireless ad hoc networks. Copyright © 2010 John Wiley & Sons, Ltd. This paper presents an analytical approach to model the bi-directional multi-channel IEEE 802.11 MAC (Bi-MCMAC) protocols for ad hoc networks via stochastic reward nets. The objective is to show the performance advantages of Bi-MCMAC protocol over the classical IEEE 802.11 MAC protocol. Two different channel scheduling strategies are also presented in the presence of multiple channels with different transmission rates. The average system throughput, mean delay, and server utilization of each MAC protocol are evaluated using the SRN formalism. Copyright © 2010 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Technological advancements have led to increased confidence in the design of large-scale wireless networks that comprise small energy constraint devices. Despite the boost in technological advancements, energy dissipation and fault tolerance are amongst the key deciding factors while designing and deploying wireless sensor networks. This paper proposes a Fault-tolerant Energy-efficient Hierarchical Clustering Algorithm (FEHCA) for wireless sensor networks (WSNs), which demonstrates energy-efficient clustering and fault-tolerant operation of cluster heads (CHs). It treats CHs as no special node but equally prone to faults as normal sensing nodes of the cluster. The proposed scheme addresses some of the limitations of prominent hierarchical clustering algorithms, such as the randomized election of the cluster heads after each round, which results in significant energy dissipation; non-consideration of the residual energy of the sensing nodes while selecting cluster heads, etc. It utilizes the capability of vector quantization to partition the deployed sensors into an optimal number of clusters and ensures that almost the entire area to be monitored is alive for most of the network's lifetime. This supports better decision-making compared to decisions made on the basis of limited area sensing data after a few rounds of communication. The scheme is implemented for both friendly as well as hostile deployments. The simulation results are encouraging and validate the proposed algorithm. [ABSTRACT FROM AUTHOR]

Fog computing is an emerging computing paradigm that has come into consideration for the deployment of Internet of Things (IoT) applications amongst researchers and technology industries over the last few years. Fog is highly distributed and consists of a wide number of autonomous end devices, which contribute to the processing. However, the variety of devices offered across different users are not audited. Hence, the security of Fog devices is a major concern that should come into consideration. Therefore, to provide the necessary security for Fog devices, there is a need to understand what the security concerns are with regards to Fog. All aspects of Fog security, which have not been covered by other literature works, need to be identified and aggregated. On the other hand, privacy preservation for user's data in Fog devices and application data processed in Fog devices is another concern. To provide the appropriate level of trust and privacy, there is a need to focus on authentication, threats and access control mechanisms as well as privacy protection techniques in Fog computing. In this paper, a survey along with a taxonomy is proposed, which presents an overview of existing security concerns in the context of the Fog computing paradigm. Moreover, the Blockchain-based solutions towards a secure Fog computing environment is presented and various research challenges and directions for future research are discussed. [ABSTRACT FROM AUTHOR]

Accumulating evidence has reported the role of microRNA-21-3p (miR-21-3p) in sepsis, and our objective was to discuss the effect of the miR-21-3p/regulator of calcineurin 1 (Rcan1) axis on cardiomyocyte apoptosis of septic rats. miR-21-3p and Rcan1 expression in myocardial tissues of lipopolysaccharide (LPS)-treated rats and LPS-treated H9c2 cardiomyocytes was determined. The influences of downregulating miR-21-3p or upregulating Rcan1 in cardiomyocyte apoptosis of LPS-treated rats and LPS-treated H9c2 cardiomyocytes were then evaluated. The target relation between Rcan1 and miR-21-3p was verified. It was observed that miR-21-3p was elevated and Rcan1 was reduced in LPS-treated rats and LPS-treated H9c2 cardiomyocytes. Downregulating miR-21-3p or upregulating Rcan1 could suppress cardiomyocyte apoptosis of LPS-treated rats and LPS-treated H9c2 cardiomyocytes. Based on the dual-luciferase activity assay, miR-21-3p was directly targeted Rcan1 in H9c2 cardiomyocytes. In the rescue experiment, the LPS+miR-21-3p inhibitor+si-Rcan1 group enhanced the apoptosis of H9c2 cardiomyocytes in comparison to the LPS+miR-21-3p inhibitor+si-NC group. Together, our findings identify that the miR-21-3p/Rcan1 axis may affect apoptosis of cardiomyocytes in sepsis, which provides a new idea for understanding the potential mechanism of sepsis.