当前期刊: Performance Evaluation Go to current issue    加入关注    本刊投稿指南
显示样式:        排序: IF: - GO 导出
  • Global stability of the Rate Control Protocol (RCP) and some implications for protocol design
    Perform. Eval. (IF 1.567) Pub Date : 2020-11-05
    Thomas Voice; Abuthahir Abdulrahman; Gaurav Raina

    Global stability is an important aspect associated with the analysis and performance of closed-loop systems with feedback delays. The presence of time delays in the feedback makes the system infinite-dimensional. Establishing conditions for global stability of delay models is a non-trivial task when the system is non-linear, and the feedback delays are heterogeneous. In this paper, at the level of

  • Solving Poisson’s equation for birth–death chains: Structure, instability, and accurate approximation
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-21
    José Niño-Mora

    Poisson’s equation plays a fundamental role as a tool for performance evaluation and optimization of Markov chains. For continuous-time birth–death chains with possibly unbounded transition and cost rates as addressed herein, when analytical solutions are unavailable its numerical solution can in theory be obtained by a simple forward recurrence. Yet, this may suffer from numerical instability, which

  • RealWear: Improving performance and lifetime of SSDs using a NAND aging marker
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-19
    Myungsuk Kim; Myoungjun Chun; Duwon Hong; Yoona Kim; Geonhee Cho; Dusol Lee; Jihong Kim

    Although NAND flash memory has revolutionized how we manage data in modern digital systems, significant improvements are needed in flash-based storage systems to meet the requirements of emerging data-intensive applications. In this paper, we address the problem of NAND aging markers that represent the wearing degree of NAND cells. Since all flash operations are affected by the wearing status of NAND

  • Design and performance evaluation of contention-based transmission schemes for URLLC services
    Perform. Eval. (IF 1.567) Pub Date : 2020-08-24
    Patrick Brown; Salah Eddine Elayoubi; Matha Deghel; Ana Galindo-Serrano

    We investigate in this paper uplink transmission schemes for 5G Ultra-Reliable Low Latency Communications (URLLC) traffic. The URLLC class of services has been defined for applications requiring extremely stringent latency and reliability. We show that, in systems with episodic traffic and many users compared with the number of transmission resources, randomly transmitting multiple copies of a packet

  • Delay cycle analysis of finite-buffer M/G/1 queues and its application to the analysis of M/G/1 priority queues with finite and infinite buffers
    Perform. Eval. (IF 1.567) Pub Date : 2020-08-21
    Kilhwan Kim

    In this paper, we develop a new type of delay cycle analysis for single-class finite-buffer M/G/1 queues, and then analyze M/G/1 priority queues with a finite buffer for high-priority customers and an infinite buffer for low-priority customers using the proposed delay cycle analysis. For this type of priority queues, we derive the waiting time distributions of high- and low-priority customers, as well

  • Fair caching networks
    Perform. Eval. (IF 1.567) Pub Date : 2020-09-28
    Yuezhou Liu; Yuanyuan Li; Qian Ma; Stratis Ioannidis; Edmund Yeh

    We consider caching networks in which the routing cost for serving a content request can be reduced by caching the requested content item in cache nodes closer to the users. We refer to the cost reduction enabled by caching as the caching gain, and the product of the caching gain of a content request and its request rate as caching gain rate. We aim to study fair content allocation strategies through

  • On multi-resource procurement in internet access markets: Optimal strategies and market equilibrium
    Perform. Eval. (IF 1.567) Pub Date : 2020-09-28
    Lianjie Shi; Xin Wang; Richard T.B. Ma

    With the increasing popularity and significance of content delivery services, especially video streaming, stringent Quality of Service (QoS) requirements have been placed upon Internet content providers (CPs). As a result, CPs have strong incentives to pay for resources such as premium peering bandwidth and cache capacity that ameliorate service quality. In this paper, we study an Internet access market

  • Frequency scaling in multilevel queues
    Perform. Eval. (IF 1.567) Pub Date : 2020-09-28
    Maryam Elahi; Andrea Marin; Sabina Rossi; Carey Williamson

    In this paper, we study a variant of PS+PS multilevel scheduling, which we call the PS+IS queue. Specifically, we use Processor Sharing (PS) at both queues, but with linear frequency scaling on the second queue, so that the latter behaves like an Infinite Server (IS) queue. The goals of the system are low response times for small jobs in the first queue, and reduced power consumption for large jobs

  • Optimal multiserver scheduling with unknown job sizes in heavy traffic
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-12
    Ziv Scully; Isaac Grosof; Mor Harchol-Balter

    We consider scheduling to minimize mean response time of the M/G/k queue with unknown job sizes. In the single-server k=1 case, the optimal policy is the Gittins policy, but it is not known whether Gittins or any other policy is optimal in the multiserver case. Exactly analyzing the M/G/k under any scheduling policy is intractable, and Gittins is a particularly complicated policy that is hard to analyze

  • Asymptotically optimal load balancing in large-scale heterogeneous systems with multiple dispatchers
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-08
    Xingyu Zhou; Ness Shroff; Adam Wierman

    We consider the load balancing problem in large-scale heterogeneous systems with multiple dispatchers. We introduce a general framework called Local-Estimation-Driven (LED). Under this framework, each dispatcher keeps local (possibly outdated) estimates of the queue lengths for all the servers, and the dispatching decision is made purely based on these local estimates. The local estimates are updated

  • On the throughput optimization in large-scale batch-processing systems
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-08
    Sounak Kar; Robin Rehrmann; Arpan Mukhopadhyay; Bastian Alt; Florin Ciucu; Heinz Koeppl; Carsten Binnig; Amr Rizk

    We analyze a data-processing system with n clients producing jobs which are processed in batches by m parallel servers; the system throughput critically depends on the batch size and a corresponding sub-additive speedup function. In practice, throughput optimization relies on numerical searches for the optimal batch size, a process that can take up to multiple days in existing commercial systems. In

  • Prefetching and caching for minimizing service costs: Optimal and approximation strategies
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-07
    Guocong Quan; Atilla Eryilmaz; Jian Tan; Ness Shroff

    Strategically prefetching data has been utilized in practice to improve caching performance. Apart from caching data items upon requests, they can be prefetched into the cache before requests actually occur. The caching and prefetching operations compete for the limited cache space, whose size is typically much smaller than the number of data items. A key question is how to design an optimal prefetching

  • heSRPT: Parallel scheduling to minimize mean slowdown
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-06
    Benjamin Berg; Rein Vesilo; Mor Harchol-Balter

    Modern data centers serve workloads which are capable of exploiting parallelism. When a job parallelizes across multiple servers it will complete more quickly, but jobs receive diminishing returns from being allocated additional servers. Because allocating multiple servers to a single job is inefficient, it is unclear how best to allocate a fixed number of servers between many parallelizable jobs.

  • Scalable load balancing in the presence of heterogeneous servers
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-06
    Kristen Gardner; Jazeem Abdul Jaleel; Alexander Wickeham; Sherwin Doroudi

    Heterogeneity is becoming increasingly ubiquitous in modern large-scale computer systems. Developing good load balancing policies for systems whose resources have varying speeds is crucial in achieving low response times. Indeed, how best to dispatch jobs to servers is a classical and well-studied problem in the queueing literature. Yet the bulk of existing work on large-scale systems assumes homogeneous

  • On the exact analysis of an idealized quantum switch
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-06
    Gayane Vardoyan; Saikat Guha; Philippe Nain; Don Towsley

    We study an entanglement distribution switch that serves k users in a star topology. The function of the switch is to facilitate end-to-end bipartite entangled state generation for pairs of users. We study a simple variant of this problem, wherein all links connecting the users to the switch are identical, the effects of state decoherence are negligible, and the switch can store an arbitrary number

  • Infer user preferences from aggregate measurements: A novel message passing algorithm for privacy attack
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-05
    Du Su; Yi Lu

    Social media platforms, such as Facebook and TikTok, have triggered debates on privacy. The recent transformation of social media into an increasingly centralized service, exemplified by TikTok, only exacerbates the matter. While aggregation has been deemed an effective way to combat privacy infringement, a high degree of centralization can make aggregation ineffective. We present a randomized article-push

  • Revenue sharing on the Internet: A case for going soft on neutrality regulations
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-03
    Fehmina Malik; Manjesh K. Hanawal; Yezekael Hayel; Jayakrishnan Nair

    Revenue sharing contracts between Content Providers (CPs) and Internet Service Providers (ISPs) can act as leverage for enhancing the infrastructure of the Internet. ISPs can be incentivised to make investments in network infrastructure that improve Quality of Service (QoS) for users if attractive contracts are negotiated between them and CPs. The idea here is that part of the revenue of CPs is shared

  • Incentive analysis of Bitcoin-NG, revisited
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-02
    Jianyu Niu; Ziyu Wang; Fangyu Gai; Chen Feng

    Bitcoin-NG is among the first blockchain protocols to approach the near-optimal throughput by decoupling blockchain operation into two planes: leader election and transaction serialization. Its decoupling idea has inspired a new generation of high-performance blockchain protocols. However, the existing incentive analysis of Bitcoin-NG has several limitations. First, the impact of network capacity is

  • Heavy traffic analysis of approximate max-weight matching algorithms for input-queued switches
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-02
    Yu Huang; Longbo Huang

    In this paper, we propose a class of approximation algorithms for the max-weight matching (MWM) policy for input-queued switches, called expected 1-APRX. We establish the state space collapse (SSC) result for expected 1-APRX, and characterize its queue length behavior in the heavy-traffic limit. Our results indicate that expected 1-APRX can approximately approach the optimal queue length scaling in

  • Network speed scaling
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-02
    Rahul Vaze; Jayakrishnan Nair

    Speed scaling for a network of servers represented by a directed acyclic graph is considered. Jobs arrive at a source server, with a specified destination server, and are defined to be complete once they are processed by all servers on any feasible path between the source and the corresponding destination. Each server has variable speed, with power consumption function P, a convex increasing function

  • Incentivizing stable path selection in future Internet architectures
    Perform. Eval. (IF 1.567) Pub Date : 2020-10-01
    Simon Scherrer; Markus Legner; Adrian Perrig; Stefan Schmid

    By delegating path control to end-hosts, future Internet architectures offer flexibility for path selection. However, there is a concern that the distributed routing decisions by end-hosts, in particular load-adaptive routing, can lead to oscillations if path selection is performed without coordination or accurate load information. Prior research has addressed this problem by devising path-selection

  • Modeling multi-site computation offloading in unreliable cloud environments
    Perform. Eval. (IF 1.567) Pub Date : 2020-09-23
    Marzieh Ranjbar Pirbasti; Olivia Das

    Offloading heavy computations from a mobile device to cloud servers can reduce the power consumption of the mobile device and improve the response time of the mobile application. However, the gains of offloading can be significantly affected by failures of cloud servers and network links. In this paper, we propose a fault-aware, multi-site computation offloading model capable of finding a near-optimal

  • Generating functions and Owen value in cooperative network cover game
    Perform. Eval. (IF 1.567) Pub Date : 2020-09-19
    Vladimir V. Mazalov; Vasily V. Gusev

    We consider a cooperative game based on a network in which nodes represent players and the characteristic function is defined using a maximal covering by the pairs of connected nodes. Problems of this form arise in many applications such as mobile communications, patrolling, logistics and sociology. The Owen value, which describes the significance of each node in the network, is derived. We show that

  • Optimal control of admission in service in a queue with impatience and setup costs
    Perform. Eval. (IF 1.567) Pub Date : 2020-09-17
    Emmanuel Hyon; Alain Jean-Marie

    We consider a single server queue in continuous time, in which customers must be served before some limit sojourn time of exponential distribution. Customers who are not served before this limit leave the system: they are impatient. The fact of serving customers and the fact of losing them due to impatience induce costs. The fact of holding them in the queue also induces a constant cost per customer

  • Bounding the delays of the MPPA network-on-chip with network calculus: Models and benchmarks
    Perform. Eval. (IF 1.567) Pub Date : 2020-07-29
    Marc Boyer; Amaury Graillat; Benoît Dupont de Dinechin; Jörn Migge

    The Kalray MPPA2-256 processor integrates 256 processing cores and 32 management cores on a chip. These cores are grouped into clusters and clusters are connected by a high-performance network on chip (NoC). This NoC provides hardware mechanisms (ingress traffic limiters) that can be configured to offer service guarantees. This paper introduces a network calculus formulation, designed to configure

  • Analysis of the Task Assignment based on Guessing Size policy
    Perform. Eval. (IF 1.567) Pub Date : 2020-06-30
    Eitan Bachmat, Josu Doncel, Hagit Sarfati

    We study the Task Assignment based on Guessing Size (TAGS) policy in a parallel and homogeneous server system. The policy parameters are the number of servers h and a set of cutoffs s1

  • A semi-product-form for a pair of queues with finite batches: Equilibrium state probabilities and response time densities
    Perform. Eval. (IF 1.567) Pub Date : 2020-06-11
    P.G. Harrison

    A Markovian network of two queues, with finite size batch Poisson arrivals and departures, is solved approximately, but to arbitrary accuracy, for its equilibrium state probabilities. Below a pair of thresholds on the queue lengths, a modification of the Spectral Expansion Method is used to construct a semi-product-form at all lengths of one queue in a finite lattice strip defined by the threshold

  • Analyzing the distribution fit for storage workload and Internet traffic traces
    Perform. Eval. (IF 1.567) Pub Date : 2020-06-11
    Muhammad Wajahat, Aditya Yele, Tyler Estro, Anshul Gandhi, Erez Zadok

    Understanding workloads and modeling their performance is important for optimizing systems and services. A useful first step towards understanding the characteristics of workloads is to analyze their inter-arrival times and service requirements. If these characteristics are found to follow certain probability distributions, then corresponding stochastic models can be employed to efficiently estimate

  • Resource Allocation in One-dimensional Distributed Service Networks with Applications
    Perform. Eval. (IF 1.567) Pub Date : 2020-06-01
    Nitish K. Panigrahy, Prithwish Basu, Philippe Nain, Don Towsley, Ananthram Swami, Kevin S. Chan, Kin K. Leung

    We consider assignment policies that allocate resources to users, where both resources and users are located on a one-dimensional line [0,∞). First, we consider unidirectional assignment policies that allocate resources only to users located to their left. We propose the Move to Right (MTR) policy, which scans from left to right assigning nearest rightmost available resource to a user, and contrast

  • Vectorization cost modeling for NEON, AVX and SVE
    Perform. Eval. (IF 1.567) Pub Date : 2020-05-13
    Angela Pohl, Biagio Cosenza, Ben Juurlink

    Compiler optimization passes employ cost models to determine if a code transformation will yield performance improvements. When this assessment is inaccurate, compilers apply transformations that are not beneficial, or refrain from applying ones that would have improved the code. We analyze the accuracy of the cost models used in LLVM’s and GCC’s vectorization passes for three different instruction

  • Loyalty programs in the sharing economy: Optimality and competition
    Perform. Eval. (IF 1.567) Pub Date : 2020-05-11
    Zhixuan Fang; Longbo Huang; Adam Wierman

    Loyalty programs are important tools for sharing platforms seeking to grow supply. Online sharing platforms use loyalty programs to heavily subsidize resource providers, encouraging participation and boosting supply. As the sharing economy has evolved and competition has increased, the design of loyalty programs has begun to play a crucial role in the pursuit of maximal revenue. In this paper, we first

  • On transient queue-size distribution in a finite-buffer model with threshold waking and early setup policy
    Perform. Eval. (IF 1.567) Pub Date : 2020-05-08
    Wojciech M. Kempa, Kamil Książek

    A finite-buffer queueing system with threshold waking and early setup policy is investigated. The arrival stream is governed by a Poisson process while service times are assumed to be generally distributed. The natural FIFO processing discipline is used. Every time when the system empties, a type-specific energy saving policy is initialized that is a mixture of the classical N-type policy and an early

  • Revenue maximization in optical router nodes
    Perform. Eval. (IF 1.567) Pub Date : 2020-05-07
    Murtuza Ali Abidini, Onno Boxma, Cor Hurkens, Ton Koonen, Jacques Resing

    In this paper, a few models for optical router nodes are considered. The stations (ports) of such a node try to transmit packets. Successful transmission of a packet of type j at station i gives a profit γij, but there is also a positive probability that such a packet is dropped, causing a penalty θij. Consider one fixed cycle (frame), in which each station is assigned some visit time. The goal is

  • Right buffer sizing matters: Some dynamical and statistical studies on Compound TCP
    Perform. Eval. (IF 1.567) Pub Date : 2020-03-09
    Debayani Ghosh, Krishna Jagannathan, Gaurav Raina

    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

  • Fluid approximation of closed queueing networks with discriminatory processor sharing
    Perform. Eval. (IF 1.567) Pub Date : 2020-02-25
    Lulai Zhu, Giuliano Casale, Iker Perez

    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

  • On M/G[b]/1/K queue with multiple state-dependent vacations: A real problem from media-based cache in hard disk drives
    Perform. Eval. (IF 1.567) Pub Date : 2020-02-06
    Mingzhou Xie, Li Xia, Jun Xu

    Storage is performance critical for 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

  • On value functions for FCFS queues with batch arrivals and general cost structures
    Perform. Eval. (IF 1.567) Pub Date : 2020-01-23
    Esa Hyytiä, Rhonda Righter, Jorma Virtamo, Lauri Viitasaari

    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

  • On the stability and diversity of Internet routes in the MPLS era
    Perform. Eval. (IF 1.567) Pub Date : 2020-01-20
    Zakaria Al-Qudah, Ibrahim Jomhawy, Mohammad Alsarayreh, Michael Rabinovich

    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

  • On the effectiveness of the PIT in reducing upstream demand in an NDN router
    Perform. Eval. (IF 1.567) Pub Date : 2020-01-17
    Mahdieh Ahmadi, James Roberts, Emilio Leonardi, Ali Movaghar

    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

  • Analysis of a variable service speed single server queue with batch arrivals and general setup time
    Perform. Eval. (IF 1.567) Pub Date : 2020-01-16
    Moeko Yajima, Tuan Phung-Duc

    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

  • Numerical inverse Laplace transformation using concentrated matrix exponential distributions
    Perform. Eval. (IF 1.567) Pub Date : 2019-11-22
    Gábor Horváth, Illés Horváth, Salah Al-Deen Almousa, Miklós Telek

    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

  • Resource allocation in the cloud with unreliable resources
    Perform. Eval. (IF 1.567) Pub Date : 2019-11-22
    Eliran Sherzer, Hanoch Levy

    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

  • Whittle index approach to opportunistic scheduling with partial channel information
    Perform. Eval. (IF 1.567) Pub Date : 2019-11-08
    Samuli Aalto, Pasi Lassila, Ianire Taboada

    Opportunistic scheduling in wireless cellular systems utilizes random channel quality variations in time by favoring the users with good channel conditions. However, the success of such schedulers is heavily depending on the accuracy of the available information on the channel states of users. In this paper, we consider the opportunistic scheduling problem of downlink data traffic with partial channel

  • Network utility maximization revisited: Three issues and their resolution
    Perform. Eval. (IF 1.567) Pub Date : 2019-10-21
    Akhil P.T., Rajesh Sundaresan

    Distributed and iterative network utility maximization algorithms, such as the primal–dual algorithms or the network-user decomposition algorithms, often involve trajectories where the iterates may be infeasible, convergence to the optimal points of relaxed problems different from the original, or convergence to local maxima. In this paper, we highlight the three issues with iterative algorithms. We

  • Clustering and evolutionary approach for longitudinal web traffic analysis
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-30
    Andrea Morichetta, Marco Mellia

    In recent years, data-driven approaches have attracted the interest of the research community. Considering network monitoring, unsupervised machine learning solutions such as clustering are particularly appealing to let the network analysts observe patterns, and track the evolution of traffic over time. In this paper, we present a novel unsupervised methodology to automatically process and analyze

  • Statistical delay bounds for automatic repeat request protocols with pipelining
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-26
    Mark Akselrod, Markus Fidler

    The recent trend towards low-latency wireless communication requires a notion of non-ergodic capacity that deals with delays. Significant research has contributed such results for relevant physical layer aspects. Less attention has been paid to actual implementations of link layer automatic repeat request protocols. Instead, error-free transmission using instantaneous channel state information, simple

  • Prices and subsidies in the sharing economy
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-26
    Zhixuan Fang, Longbo Huang, Adam Wierman

    The growth of the sharing economy is driven by the emergence of platforms, e.g., Uber and Lyft, that match owners looking to share their resources with customers looking to rent them. The design of such platforms is a complex mixture of economics and engineering, and how to optimally design such platforms is still an open problem. In this paper, we focus on the design of prices and subsidies in sharing

  • On the utility of unregulated IP DiffServ Code Point (DSCP) usage by end systems
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-26
    Runa Barik, Michael Welzl, Ahmed Elmokashfi, Thomas Dreibholz, Safiqul Islam, Stein Gjessing

    DiffServ was designed to implement service provider quality of service (QoS) policies, where routers change and react upon the DiffServ Code Point (DSCP) in the IP header. However, nowadays, applications are beginning to directly set the DSCP themselves, in the hope that this will yield a more appropriate service for their respective video, audio and data streams. WebRTC is a prime example of such

  • Exploring mixed integer programming reformulations for virtual machine placement with disk anti-colocation constraints
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-22
    Xiaoying Zheng, Ye Xia

    One of the important problems for datacenter resource management is to place virtual machines (VMs) to physical machines (PMs) such that certain cost, profit or performance objective is optimized, subject to various constraints. In this paper, we consider an interesting and difficult VM placement problem with disk anti-colocation constraints: a VM’s virtual disks should be spread out across the physical

  • Diffusion limits for networks of Markov-modulated infinite-server queues
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-22
    H.M. Jansen, M. Mandjes, K. De Turck, S. Wittevrongel

    This paper studies the diffusion limit for a network of infinite-server queues operating under Markov modulation, meaning that the system’s parameters depend on an autonomously evolving Markov chain, called the background process. In previous papers on single-node queues with Markov modulation, two variants were distinguished. In the first variant the arrival rate and the server speed are modulated

  • Simulation and performance evaluation of mission critical dispatching systems
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-20
    Esa Hyytiä, Rhonda Righter

    Dispatching systems, where jobs are routed to servers immediately upon arrival, appear frequently in parallel computing systems of different scales. With a dynamic dispatching policy, the system is generally analytically intractable and performance evaluation is carried out by means of Monte Carlo simulations. A typical performance metric is the mean response time which is often easy to estimate. In

  • Near-optimal dispatching policy for energy-aware server clusters
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-19
    Samuli Aalto, Pasi Lassila

    A server cluster can be modeled as a set of parallel queues, and the dispatcher decides to which queue the arriving jobs are routed. We consider an energy-aware dispatching system in a Markovian setting, where each server, upon becoming empty, enters a sleep mode to save energy, and to activate the server after sleep incurs an additional setup delay cost. We seek to optimize the performance-energy

  • Analysis of a 2-state discrete-time queue with stochastic state-period lengths and state-dependent server availability and arrivals
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-19
    Freek Verdonck, Herwig Bruneel, Sabine Wittevrongel

    In this work we study a discrete-time multiserver queueing system with an infinite storage capacity and deterministic service times equal to 1 slot. Specific to the model under study is that the system is assumed to be in one of two different states (state-1 or state-2) and that both the distribution of the number of available servers and the arrival process depend on the system state. State changes

  • A large deviation analysis of retrial models with constant and classic retrial rates
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-14
    Evsey Morozov, Ksenia Zhukova

    In this paper, a large deviation analysis of the retrial systems is developed. We consider both classical and constant retrial rate models. We focus on the (overflow) probability that the orbit size in the single-server system reaches a high level N within a regeneration period. Under natural assumptions, it is shown that, as N→∞, the overflow probability has an exponential decay rate. We find a lower

  • Tandem queues with impatient customers
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-14
    Jianfu Wang, Hossein Abouee-Mehrizi, Opher Baron, Oded Berman

    This paper studies a Markovian two-station tandem queueing network with impatient customers. Queueing networks with abandonment are common in many industries, e.g., call centers and healthcare. Therefore, their management has received much attention. The resulting model is a level-dependent quasi-birth-and-death (LDQBD) process. Such models are considered analytically intractable and require numerical

  • Analysis of a batch-service queue with variable service capacity, correlated customer types and generally distributed class-dependent service times
    Perform. Eval. (IF 1.567) Pub Date : 2019-08-09
    Jens Baetens, Bart Steyaert, Dieter Claeys, Herwig Bruneel

    Queueing models with batch service have been studied frequently, for instance in the domain of telecommunications or manufacturing. Although the batch server’s capacity may be variable in practice, only a few authors have included variable capacity in their models. We analyse a batch server with multiple customer classes and a variable service capacity that depends on both the number of waiting customers

  • Spatial–temporal routing for supporting end-to-end hard deadlines in multi-hop networks
    Perform. Eval. (IF 1.567) Pub Date : 2019-07-30
    Xin Liu, Weichang Wang, Lei Ying

    We consider the problem of routing packets with end-to-end hard deadlines in multihop communication networks. This is a challenging problem due to the complex spatial–temporal correlation among flows with different deadlines. To tackle this problem, we introduce the concepts of virtual links and virtual routes to incorporate end-to-end deadline constraints into routing and propose a novel virtual queue

  • An analytical model for thread-core mapping for tiled CMPs
    Perform. Eval. (IF 1.567) Pub Date : 2019-06-20
    Marco Pranzo, Somnath Mazumdar

    Modern computing chips are composed of multiple, simple, low-power processing cores. Increasing the number of processing cores in a single chip brings the opportunity to exploit the inherent massive level of thread parallelism and further improved performance. However, efficient allocation of applications (threads) to available cores is a complicated process. Failing to do so, the mapping can be the

  • Performance analysis and stability of multiclass orbit queue with constant retrial rates and balking
    Perform. Eval. (IF 1.567) Pub Date : 2019-06-13
    Evsey Morozov, Alexander Rumyantsev, Sweta Dey, T.G. Deepak

    In this paper, we consider a single-server retrial model with multiple classes of customers. Arrival of customers follow independent Poisson rule. A new customer, facing a busy server upon his arrival, may join the corresponding (class-dependent) orbit queue with a class-dependent probability, or leaves the system forever (balks). The orbit queues follow constant retrial rate discipline, that is, only

  • The M/PH/1+D queue with Markov-renewal service interruptions and its application to delayed mobile data offloading
    Perform. Eval. (IF 1.567) Pub Date : 2019-06-10
    Ken’ichi Kawanishi, Tetsuya Takine

    Motivated by delayed mobile data offloading in cellular networks, we consider an M/PH/1 queue with deterministic impatience times (i.e., the M/PH/1+D queue), where the server takes ON and OFF states alternately and does not serve any customers in the OFF states. We assume that the state of the server is governed by an alternating Markov renewal process. For this queue, we analyze various performance

Contents have been reproduced by permission of the publishers.
Springer 纳米技术权威期刊征稿
ACS ES&T Engineering
ACS ES&T Water
ACS Publications填问卷