Table of Contents

• A two-class parallel queue with pure space sharing among rigid jobs and general service timesDimitrios Filippopoulos, Helen D. Karatza. 2 [doi]
• Zero-automatic networksThu-Ha Dao-Thi, Jean Mairesse. 3 [doi]
• Sojourn times in (discrete) time shared systems and their continuous time limitsArzad Alam Kherani. 4 [doi]
• Automated benchmarking and analysis toolTomás Kalibera, Jakub Lehotsky, David Majda, Branislav Repcek, Michal Tomcanyi, Antonin Tomecek, Petr Tuma, Jaroslav Urban. 5 [doi]
• A general performance model interchange formatPeter G. Harrison, Catalina M. Lladó, Ramón Puigjaner. 6 [doi]
• Modeling, analysis, measurement and experimentation with the Tangram-II integrated environmentEdmundo de Souza e Silva, Ana Paula Couto da Silva, Antonio Augusto de Aragão Rocha, Rosa M. M. Leão, Flávio P. Duarte, Fernando J. S. Filho, Guilherme D. G. Jaime, Richard R. Muntz. 7 [doi]
• The DISCO network calculator: a toolbox for worst case analysisJens B. Schmitt, Frank A. Zdarsky. 8 [doi]
• A novel approach to scalable CAC for real-time traffic in sink-tree networks with aggregate schedulingLuciano Lenzini, Linda Martorini, Enzo Mingozzi, Giovanni Stea. 9 [doi]
• Worst case burstiness increase due to arbitrary aggregate multiplexingJuan Echagüe, Vicent Cholvi. 10 [doi]
• Solving the single server semi-Markov queue with matrix exponential kernel matrices for interarrivals and servicesNail Akar, Khosrow Sohraby. 11 [doi]
• How to solve large scale deterministic games with mean payoff by policy iterationVishesh Dhingra, Stephane Gaubert. 12 [doi]
• Fast solvers for queueing systems with negative customersYou-Wei Wen, Wai-Ki Ching, Michael K. Ng. 13 [doi]
• Matrix-geometric algorithms for stochastic fluid flowsSoohan Ahn, V. Ramaswami. 14 [doi]
• Stability of multi-class queueing systems with state-dependent service ratesMatthieu Jonckheere, Sem C. Borst. 15 [doi]
• Analysis and optimal control of a discrete-time queueing system under the (m, N)-policyAlfredo García Hernández-Díaz, Pilar Moreno. 16 [doi]
• Performance of the MAP/G/1 queue under the dyadic control of workload and server idlenessHo Woo Lee, Sahng Hoon Cheon, Se-Won Lee. 17 [doi]
• Strongly efficient estimators for light-tailed sumsJose Blanchet, Peter W. Glynn. 18 [doi]
• Efficient heuristics for the simulation of population overflow in series and parallel queuesVictor F. Nicola, Tatiana S. Zaburnenko. 19 [doi]
• Importance sampling and efficient counting of 0-1 contingency tablesJose Blanchet. 20 [doi]
• Splitting with weight windows to control the likelihood ratio in importance samplingPierre L Ecuyer, Bruno Tuffin. 21 [doi]
• Optimizing an OBS scheduler bufferAndrew Zalesky. 22 [doi]
• Stability-constrained optimization for energy efficiency in polling-based wireless networksYi Xie, Rocky K. C. Chang. 23 [doi]
• An Erlang-like law for GPRS/EDGE engineering and its first validation on live trafficGeorges Nogueira, Bruno Baynat, Ahmed Ziram. 24 [doi]
• Capacity planning tools for web and grid environmentsSugato Bagchi, Eugene Hung, Arun Iyengar, Norbert G. Vogl, Noshir Wadia. 25 [doi]
• Dynamic estimation of CPU demand of web trafficGiovanni Pacifici, Wolfgang Segmuller, Mike Spreitzer, Asser N. Tantawi. 26 [doi]
• Load prediction models in web-based systemsMauro Andreolini, Sara Casolari. 27 [doi]
• A realistic simulation of internet-scale eventsSongjie Wei, Jelena Mirkovic. 28 [doi]
• A Monte Carlo simulator for evaluating server placement within network topology designsSami J. Habib. 29 [doi]
• StarBED and SpringOS: large-scale general purpose network testbed and supporting softwareToshiyuki Miyachi, Ken-ichi Chinen, Yoichi Shinoda. 30 [doi]
• Challenges and benefits of time-parallel simulation of wireless ad hoc networksLadislau Bölöni, Damla Turgut, Guoqiang Wang, Dan C. Marinescu. 31 [doi]
• Approximate closed-form aggregation of a fork-join structure in generalised stochastic petri netsNimrod Lilith, Jonathan Billington, Jörn Freiheit. 32 [doi]
• Backward coupling in petri netsAnne Bouillard, Bruno Gaujal. 33 [doi]
• Using UML state machines and petri nets for the quantitative investigation of ETCSJan Trowitzsch, Armin Zimmermann. 34 [doi]
• Analysis of Markov reward models using zero-suppressed multi-terminal BDDsKai Lampka, Markus Siegle. 35 [doi]
• Tail asymptotics for discrete event systemsMarc Lelarge. 36 [doi]
• Tail equivalence for some time-shared systemsSmruti Padhy, Arzad Alam Kherani. 37 [doi]
• M/M/C queues with Markov modulated service processesMelike Baykal-Gursoy, Zhe Duan. 38 [doi]
• Fairness considerations of scheduling in multi-server and multi-queue systemsDavid Raz, Benjamin Avi-Itzhak, Hanoch Levy. 39 [doi]
• Parametric delay differentiation between packet flows using multiple reserved spacesStijn De Vuyst, Sabine Wittevrongel, Herwig Bruneel. 40 [doi]
• Bandwidth and latency analysis of modified deficit round robin scheduling algorithmsLuciano Lenzini, Enzo Mingozzi, Giovanni Stea. 41 [doi]
• ODE methods for Markov chain stability with applications to MCMCG. Fort, E. Moulines, Sean P. Meyn, P. Priouret. 42 [doi]
• On the efficiency of adaptive MCMC algorithmsChristophe Andrieu, Y. F. Atchadé. 43 [doi]
• Monte Carlo simulation of killed diffusions with a single barrierBruno Casella, Gareth O. Roberts. 44 [doi]
• Exponential bounds and stopping rules for MCMC and general Markov chainsI. Kontoyiannis, Luis Alfonso Lastras-Montaño, Sean P. Meyn. 45 [doi]
• Heavy-traffic approximations for linear networks operating under alpha-fair bandwidth-sharing policiesP. Lieshout, Sem C. Borst, Michel Mandjes. 46 [doi]
• Mean value analysis for polling systems in heavy trafficRobert D. van der Mei, Erik M. M. Winands. 47 [doi]
• Reduced load approximations for large-scale optical WDM networks offering multiclass servicesKalyan Kuppuswamy, Daniel C. Lee. 48 [doi]
• Performance of ad hoc networks with two-hop relay routing and limited packet lifetimeAhmad Al Hanbali, Philippe Nain, Eitan Altman. 49 [doi]
• Performance evaluation of advanced routing algorithms for unstructured peer-to-peer networksMichele Amoretti, Francesco Zanichelli, Gianni Conte. 50 [doi]
• Thresholds for virus spread on networksMoez Draief, Ayalvadi J. Ganesh, Laurent Massoulié. 51 [doi]
• Analysis of traffic flow measurements by rate-interval curvesGiada Giorgi, Claudio Narduzzi. 52 [doi]
• A unified load generator based on formal load specification and load transformationJing Cong, Bernd E. Wolfinger. 53 [doi]
• Web graph analyzer toolKonstantin Avrachenkov, Danil Nemirovsky, Natalia Osipova. 54 [doi]
• TCP-Illinois: a loss and delay-based congestion control algorithm for high-speed networksShao Liu, Tamer Basar, R. Srikant. 55 [doi]
• Stability of multi-path dual congestion control algorithmsThomas Voice. 56 [doi]
• Insensitive queueing models for communication networksThomas Bonald. 57 [doi]
• A stochastic model for the throughput of non-persistent TCP flowsFrançois Baccelli, David R. McDonald. 58 [doi]
• Performance analysis using CPN toolsLisa Wells. 59 [doi]
• A tool for packaging and exchanging simulation resultsDragan A. Savic, Matevz Pustisek, Francesco Potorti. 60 [doi]
• OPEDo: a tool framework for modeling and optimization of stochastic modelsPeter Buchholz, Dennis Müller, Peter Kemper, Axel Thümmler. 61 [doi]
• Detailed cache simulation for detecting bottleneck, miss reason and optimization potentialitiesJie Tao, Wolfgang Karl. 62 [doi]
• Optimal control of admission to a station in a closed two queue systemTaposh Banerjee, Arzad Alam Kherani. 63 [doi]
• Performance measures of a call admission control in mobile networks using SWNLynda Mokdad, Mbaye Sene. 64 [doi]
• Relative stability analysis of multiple queuesSum Lam, Rocky K. C. Chang, Yi Xie. 65 [doi]
• Predicting queueing delays for multiclass call centersOualid Jouini, Yves Dallery. 66 [doi]
• An approximative method for calculating performance measures of Markov processesJuha Leino, Jorma T. Virtamo. 67 [doi]
• Loss ratio approximations in buffered systems with regulated inputsJózsef Bíró. 68 [doi]