Large and unmanaged router buffers could lead to an increase in queuing delays in the Internet, which is a serious concern for network performance and quality of service. Our focus is to conduct a performance evaluation of Compound TCP (C-TCP), in a regime where the router buffer sizes are small (i.e., independent of the bandwidth-delay product), and the queue policy is Drop-Tail. In particular, we

As a multi-class variant of the classical egalitarian processor-sharing (EPS) discipline, discriminatory processor sharing (DPS) provides a suitable paradigm to model systems where share exists to control the service access of heterogeneous jobs. Although DPS is a more fine-grained scheduling discipline than EPS, the behavior of closed queueing networks (QNs) with DPS remains poorly understood. We

Storage is performance critical for the I/O intensive applications deployed in data centers. As one of the recent implementations, media-based cache (MBC) is designed to alleviate the performance bottleneck of hard disk drives (HDD). This paper is motivated by the performance analysis of MBC in HDD and a new queueing model called M/G[b]/1/K with multiple state-dependent vacations is developed to formulate

We develop a unified framework for analyzing and optimizing costs for systems of FCFS queues with batch arrivals, setup delays and a general nonlinear cost structure that includes costs associated with energy used, setup times and Quality of Service (QoS) measures. We focus on the MX/G/1 and GeoX/G/1 queues with i.i.d. service times, but our results hold also for arbitrary i.i.d. batch structures where

Stability and diversity of end-to-end routes are key properties of Internet that have a large effect on the design of networks and networked systems. As the Internet evolves and deploys new technologies, it is important to re-assess these properties in the face of the new realities. This paper evaluates the stability and diversity of Internet routes with emphasis on the impact of the widely deployed

The paper revisits the performance evaluation of caching in a Named Data Networking (NDN) router where the content store (CS) is supplemented by a pending interest table (PIT). The PIT aggregates requests for a given content that arrive within the download delay and thus brings an additional reduction in upstream bandwidth usage beyond that due to CS hits. We extend prior work on caching with non-zero

In this paper, we consider an MX/M/1/GSET-VARI queue, which is a single server queue with a variable service speed, batch arrivals and general setup times. The service speed of the server is proportional to the number of jobs in the system. Our model is motivated by power-aware servers in data centers where dynamic scaling techniques are used. In this paper, we obtain the necessary and sufficient condition

This paper investigates the performance of the numerical inverse Laplace transformation (ILT) method based on concentrated matrix exponential (CME) distributions, referred to as the CME method. The CME method does not generate overshoot and undershoot (i.e., avoids Gibbs oscillation), preserves monotonicity of functions, its accuracy is gradually improving with the order, and it is numerically stable

We consider a resource allocation problem in a geographically distributed cloud network, where the goal is to obtain the capacities of the servers across the network in order to minimize the overall cost. In this study, the system resources (servers) are subject to failures, due to occasional breakdowns or cyber attacks. As a result, the servers supply is of a stochastic nature. From an optimization