Analytical and Stochastic Modelling

Techniques and Applications 22nd

International Conference ASMTA 2015
Albena Bulgaria May 26 29 2015
Proceedings 1st Edition Marco
Gribaudo
Visit to download the full and correct content document:
https://textbookfull.com/product/analytical-and-stochastic-modelling-techniques-and-a
pplications-22nd-international-conference-asmta-2015-albena-bulgaria-may-26-29-20
15-proceedings-1st-edition-marco-gribaudo/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Analytical and Stochastic Modelling Techniques and

Applications 23rd International Conference ASMTA 2016
Cardiff UK August 24 26 2016 Proceedings 1st Edition
Sabine Wittevrongel
https://textbookfull.com/product/analytical-and-stochastic-
modelling-techniques-and-applications-23rd-international-
conference-asmta-2016-cardiff-uk-
august-24-26-2016-proceedings-1st-edition-sabine-wittevrongel/

Analytical and Stochastic Modeling Techniques and

Applications 21st International Conference ASMTA 2014
Budapest Hungary June 30 July 2 2014 Proceedings 1st
Edition Bruno Sericola
https://textbookfull.com/product/analytical-and-stochastic-
modeling-techniques-and-applications-21st-international-
conference-asmta-2014-budapest-hungary-
june-30-july-2-2014-proceedings-1st-edition-bruno-sericola/

End User Development 5th International Symposium IS EUD

2015 Madrid Spain May 26 29 2015 Proceedings 1st
Edition Paloma Díaz

https://textbookfull.com/product/end-user-development-5th-
international-symposium-is-eud-2015-madrid-spain-
may-26-29-2015-proceedings-1st-edition-paloma-diaz/

Agile Processes in Software Engineering and Extreme

Programming 16th International Conference XP 2015
Helsinki Finland May 25 29 2015 Proceedings 1st Edition
Casper Lassenius
https://textbookfull.com/product/agile-processes-in-software-
engineering-and-extreme-programming-16th-international-
conference-xp-2015-helsinki-finland-
ICT Systems Security and Privacy Protection 30th IFIP
TC 11 International Conference SEC 2015 Hamburg Germany
May 26 28 2015 Proceedings 1st Edition Hannes Federrath

https://textbookfull.com/product/ict-systems-security-and-
privacy-protection-30th-ifip-tc-11-international-conference-
sec-2015-hamburg-germany-may-26-28-2015-proceedings-1st-edition-
hannes-federrath/

Trust Management IX 9th IFIP WG 11 11 International

Conference IFIPTM 2015 Hamburg Germany May 26 28 2015
Proceedings 1st Edition Christian Damsgaard Jensen

https://textbookfull.com/product/trust-management-ix-9th-ifip-
wg-11-11-international-conference-ifiptm-2015-hamburg-germany-
may-26-28-2015-proceedings-1st-edition-christian-damsgaard-
jensen/

Nonlinear Dynamics of Electronic Systems 22nd

International Conference NDES 2014 Albena Bulgaria July
4 6 2014 Proceedings 1st Edition Valeri M. Mladenov

https://textbookfull.com/product/nonlinear-dynamics-of-
electronic-systems-22nd-international-conference-
ndes-2014-albena-bulgaria-july-4-6-2014-proceedings-1st-edition-
valeri-m-mladenov/

Computer Science and Its Applications 5th IFIP TC 5

International Conference CIIA 2015 Saida Algeria May 20
21 2015 Proceedings 1st Edition Abdelmalek Amine

https://textbookfull.com/product/computer-science-and-its-
applications-5th-ifip-tc-5-international-conference-
ciia-2015-saida-algeria-may-20-21-2015-proceedings-1st-edition-
abdelmalek-amine/

Codes Cryptology and Information Security First

International Conference C2SI 2015 Rabat Morocco May 26
28 2015 Proceedings In Honor of Thierry Berger 1st
Edition Said El Hajji
https://textbookfull.com/product/codes-cryptology-and-
information-security-first-international-
conference-c2si-2015-rabat-morocco-may-26-28-2015-proceedings-in-
 Marco Gribaudo
Daniele Manini
Anne Remke (Eds.)

Analytical and Stochastic

LNCS 9081

Modelling Techniques
and Applications
22nd International Conference, ASMTA 2015
Albena, Bulgaria, May 26–29, 2015
Proceedings

123
Lecture Notes in Computer Science 9081
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zürich, Zürich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology, Madras, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbrücken, Germany
More information about this series at http://www.springer.com/series/7408
Marco Gribaudo · Daniele Manini
Anne Remke (Eds.)

Analytical and Stochastic

Modelling Techniques
and Applications
22nd International Conference, ASMTA 2015
Albena, Bulgaria, May 26–29, 2015
Proceedings

ABC
Editors
Marco Gribaudo Anne Remke
Politecnico di Milano Universität Münster
Milano Münster
Italy Germany

Daniele Manini
Università degli Studi di Torino
Torino
Italy

ISSN 0302-9743 ISSN 1611-3349 (electronic)

Lecture Notes in Computer Science
ISBN 978-3-319-18578-1 ISBN 978-3-319-18579-8 (eBook)
DOI 10.1007/978-3-319-18579-8

Library of Congress Control Number: 2015937539

LNCS Sublibrary: SL2 – Programming and Software Engineering

Springer Cham Heidelberg New York Dordrecht London

c Springer International Publishing Switzerland 2015
This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broad-
casting, reproduction on microfilms or in any other physical way, and transmission or information storage
and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known
or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book
are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the
editors give a warranty, express or implied, with respect to the material contained herein or for any errors or
omissions that may have been made.

Printed on acid-free paper

Springer International Publishing AG Switzerland is part of Springer Science+Business Media
(www.springer.com)
 Preface

On behalf of the Chairs and the Technical Program Committee, it is our privilege to
welcome all of you to ASMTA 2015, the 22nd International Conference on Analyti-
cal & Stochastic Modelling Techniques & Applications, that took place in the city of
Albena (Varna) in Bulgaria.
The conference, thanks to its colocation with ECMS 2015 (the 29th European Con-
ference on Modeling and Simulation), featured three distinguished keynote speakers
who came from both the academia and the industry. Hans-Georg Zimmermann (Siemens
Corporate Technology) delivered a talk on Causality versus Predictability in Neural
Networks; Prof. Petko H. Petkov (Technical University of Sofia) presented studies
on design and implementation of robust control laws; and Prof. Alexander H. Levis
(George Mason University) introduced multi-formalism modeling of human organiza-
tions. We had 15 regular paper presentations composing the proceedings, which ap-
peared in the Springer Verlag Lecture Notes in Computer Science (LNCS) series.
Many people have contributed to the realization of ASMTA 2015. First of all, our
sincere thanks go to the authors who submitted their work to the conference. Special
thanks go to the Technical Program Committee for their high-quality reviews and to
the Program Chairs for their work in moderating the selection of the accepted papers.
We are grateful for their help to the organizers of the colocated event ECMS 2015
for taking care of all the logistic and practical aspects. In particular, we wish to thank
Martina M. Seidel for managing many aspects of the organization. We also wish to
thank Dieter Fiems and Khalid Al-Begain for their support and guidance during the
whole organization process.
We are grateful to our sponsor, The European Council for Modelling and Simula-
tion. Finally, we would like to thank the EasyChair team and Springer for the editorial
support of this conference series.
We do hope that you all find the conference a good opportunity for new experiences
both from research and personal points of view. Welcome to Albena and enjoy the
ASMTA 2015 program, the broader cooperation opportunity given by the colocation
with a larger event, and the location itself!

March 2015 Marco Gribaudo

Daniele Manini
Anne Remke
 Organization

Program Committee
Sergey Andreev Tampere University of Technology, Finland
Jonatha Anselmi Inria, France
Christel Baier Technical University of Dresden, Germany
Simonetta Balsamo Università Ca’ Foscari di Venezia, Italy
Davide Cerotti Politecnico di Milano, Italy
Lydia Chen IBM Research lab Zurich, Switzerland
Antonis Economou University of Athens, Section of Statistics
and OR, Greece
Dieter Fiems Ghent University, Belgium
Jean-Michel Fourneau Universite de Versailles St Quentin, France
Marco Gribaudo Politecnico di Milano, Italy
Yezekael Hayel LIA, University of Avignon, France
András Horváth University of Turin, Italy
Gábor Horváth Budapest University of Technology
and Economics, Hungary
Mauro Iacono Seconda Università degli Studi di Napoli, Italy
Helen Karatza Aristotle University of Thessaloniki, Greece
William Knottenbelt Imperial College London, UK
Julia Kuhn University of Queensland, Australia
Lasse Leskelä Aalto University, Finnland
Daniele Manini University of Turin, Italy
Andrea Marin University of Venice, Italy
Jose Nino-Mora Carlos III University of Madrid, Spain
Tuan Phung-Duc Tokyo Institute of Technology, Japan
Pietro Piazzolla Politecnico di Milano, Italy
Balakrishna J. Prabhu LAAS-CNRS, France
Marie-Ange Remiche University of Namur, Belgium
Anne Remke Westfaelische Wilhelms Universitaet Muenster,
Germany
Jacques Resing Eindhoven University of Technology,
The Netherlands
Marco Scarpa University of Messina, Italy
Filippo Seracini Microsoft, USA
Bruno Sericola Inria, France
Janos Sztrik University of Debrecen, Hungary
Miklos Telek Budapest University of Technology
and Economics, Hungary
Nigel Thomas Newcastle University, UK
VIII Organization

Dietmar Tutsch University of Wuppertal, Germany

Benny Van Houdt University of Antwerp, Belgium
Sabine Wittevrongel Ghent University, Belgium
Verena Wolf Saarland University, Germany
Katinka Wolter Freie Universitaet zu Berlin, Germany
Alexander Zeifman Vologda State University, Russia

Additional Reviewers
Angius, Alessio Kovacs, Peter
Dei Rossi, Gian-Luca Sandmann, Werner
Koops, David Telek, Miklos
 Contents

Optimal Analysis for M/G/1 Retrial Queue with Two-Way

Communication . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Amar Aissani and Tuan Phung-Duc

Use of Flow Equivalent Servers in the Transient Analysis of Product

Form Queuing Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
Alessio Angius, András Horváth, Sami M. Halawani, Omar Barukab,
Ab Rahman Ahmad, and Gianfranco Balbo

Model Checking of Open Interval Markov Chains . . . . . . . . . . . . . . . . . . . 30

Souymodip Chakraborty and Joost-Pieter Katoen

Performance Modeling of Cellular Systems with Finite Processor Sharing

Queues in Random Environment, Guard Policy and Flex Retrial Users . . . . . 43
Ioannis Dimitriou

Efficient Performance Evaluation of Wireless Networks with Varying

Channel Conditions. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 59
Ekaterina Evdokimova, Koen De Turck, Sabine Wittevrongel,
and Dieter Fiems

Mixed Networks with Multiple Classes of Customers and Restart . . . . . . . . 73

Jean-Michel Fourneau and Katinka Wolter

Interconnected Wireless Sensors with Energy Harvesting . . . . . . . . . . . . . . 87

Erol Gelenbe and Andrea Marin

Measuring the Distance Between MAPs and Some Applications . . . . . . . . . 100

Gábor Horváth

Task Delegation in a Peer-to-Peer Volunteer Computing Platform . . . . . . . . 115

Kristóf Attila Horváth and Miklós Telek

On Convergence Rate to Stationarity of Queues with General

Gaussian Input . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 130
Oleg Lukashenko and Evsey Morozov

Model-Based Quantitative Security Analysis of Mobile Offloading Systems

Under Timing Attacks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
Tianhui Meng, Qiushi Wang, and Katinka Wolter

Single-Server Systems with Power-Saving Modes. . . . . . . . . . . . . . . . . . . . 158

Tuan Phung-Duc
X Contents

Multiserver Queues with Finite Capacity and Setup Time . . . . . . . . . . . . . . 173

Tuan Phung-Duc

Power Consumption Analysis of Replicated Virtual Applications . . . . . . . . . 188

Pietro Piazzolla, Gianfranco Ciardo, and Andrew Miner

On the Influence of High Priority Customers on a Generalized Processor

Sharing Queue . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 203
Jasper Vanlerberghe, Joris Walraevens, Tom Maertens,
and Herwig Bruneel

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217

 Optimal Analysis for M/G/1 Retrial Queue
with Two-Way Communication

Amar Aissani1(B) and Tuan Phung-Duc2

1
RIIMA Laboratory, Department of Computer Science,
University of Sciences and Technology Houari Boumediene (USTHB),
BP 32, El Alia, 16 111 Bab-Ez-Zouar, Algiers, Algeria
aaissani@usthb.dz
2
Tokyo Institute of Technology, Ookayama, Meguro-ku, Tokyo 152-8552, Japan
tuan@is.titech.ac.jp

Abstract. We consider an M/G/1 retrial queue with two types of calls:

incoming calls (regular one’s) and outgoing calls (which are made when the
server is free). A blocked incoming call joins the orbit and retries for ser-
vice after some random time while an outgoing call is made by the server
after some random idle time. We assume that incoming and outgoing calls
have random amount of works which are processed by the server at two
distinct speeds. This assumption is suitable for evaluating the power con-
sumption that depends on the speed of the server. We obtain the joint
probability distribution of the server state and the number of requests in
the orbit in terms of Laplace and z- transforms. From these transforms, we
obtain some performance metrics of interest such as the probability that
the server is idle or busy by an incoming (outgoing) call and the mean num-
ber of requests in orbit. We propose two optimization problems to find the
optimal outgoing call rate and service speeds.

Keywords: Two way communication · QoS · Retrials · Performance-

energy trade-off · Stationary distribution · Cost optimization

1 Introduction
Retrial queueing systems are interesting stochastic modeling tools, particularly
in computer science. The blocked customer (or client, call, request) is allowed to
repeat successively his attempt until the server is able to provide service. Other-
wise, if the server is available, the arriving customer begins service immediately.
These retrial queueing models have been used in modeling switching networks,
wireless sensor networks, call centers and so on (see [3,4]).
The interested reader can find an extensive bibliography covering the 1990 −
1999 [3] and 2000 − 2009 periods [4], although the study of such problems begun
with the queueing theory itself. Artalejo and Phung-Duc [5] exhibit some situa-
tions (e.g. call centers) in which the server not only serves incoming calls (regular
one’s), but also has a chance to make outgoing phone calls while they are not

c Springer International Publishing Switzerland 2015
M. Gribaudo et al. (Eds.): ASMTA 2015, LNCS 9081, pp. 1–14, 2015.
DOI: 10.1007/978-3-319-18579-8 1
2 A. Aissani and T. Phung-Duc

engaged in conversation. This queueing feature is known as coupled switching or

models of two way communication. Outgoing calls can also be seen as vacations
or server breakdowns during which an incoming call cannot be served [1,2]. In
Artalejo and Phung-Duc [5], a stationary analysis of the queue length process is
carried out via embedded Markov chain and Markov renewal arguments. How-
ever, neither an analysis of optimality nor numerical results are presented by
Artalejo and Phung-Duc [5].
In this paper, we consider the energetic version of the model of Artalejo
and Phung-Duc [5] by assuming that each incoming or outgoing call requests a
random amount of work which is processed by the server at a constant speed.
This new interpretation is suitable for the computation of the power consumption
which depends on the speed of the server [11]. The current model is suitable for
a sensor node in wireless sensor networks. In wireless sensor network, a node
collects data and sends the data to a sink. Packets that the node receives could
be considered as incoming calls in the current model while data that the node
sends to the sink can be seen as outgoing calls in our model. Because sensor
node has a low capacity battery, the optimization of power consumption is an
important issue. Thus, our optimization problems proposed in this paper may
be useful in the design of such a system. Some other potential applications are
described in [1]. We present an alternative solution based on supplementary
variable method. We obtain the join stationary distribution of the number of
calls in the orbit and the state of the server in terms of generating function and
Laplace transform. These results are more general than those derived by Artalejo
and Phung-Duc [5] in the sense that the latter is easily obtained form the former.
We are able to derive some explicit formulae for the mean number of requests
in the orbit as well as the state probability of the server. Based on these results,
we propose two optimization problems to show the trade-off between power
consumption and the performance of the system and find the optimal outgoing
call rate and the service speeds of incoming and outgoing calls.
The rest of the paper is organized as follows. Section 2 describes the model
in details while the analysis is presented in Section 3. Section 4 presents some
performance measures and their numerical results. Section 5 proposes optimiza-
tion problems with subject to the outgoing call rate and the speeds of the server.
Finally, concluding remarks are presented in Section 6.

2 Model Description

We consider an M1 , M2 /G1 , G2 /1 retrial queue with two-way communication [5].

The flow generated by incoming calls forms a Poisson process with rate λ > 0. If
such an incoming call finds the server free then his service begins immediately.
During idle times, the server generates outgoing calls for other services.
We consider here the energetic interpretation of the service [1,2,9]. We con-
sider that the service of a call can be interpreted as the realization of some work
which needs some energy. Let Sn be the amount of work (speed or energy) to
serve the n-th incoming call. We assume that the sequence {Sn , n ≥ 1} consists of
 Optimal Analysis for M/G/1 Retrial Queue with Two-Way Communication 3

independent identically distributed random variables with common distribution

function H1 (x), H1 (0+) = 0 and Laplace-Stieltjes transform h1 (s), Re(s) ≥ 0;
the first and second order moments are denoted by h11 , h12 . Under this energetic
interpretation, the server works with a power (or speed) γ1 > 0 for an incoming
(resp. γ2 > 0 for an outgoing) call. If at time t an incoming primary or retrial
(resp. outgoing) call arrives with a required energy x and if the server is free,
then his service will be completed at time t + x/γ1 (resp. at time t + x/γ2 ), γ1 ,
γ2 > 0. Now, if an arriving incoming call finds the server blocked by a service
(of an incoming or an outgoing call), it becomes a source of secondary call and
returns later in an exponentially distributed time with mean 1/ν > 0 to try
again until it finds the server free; the collection of all secondary calls is called
“orbit” (a sort of queue).
Now, if the server is free, then it generates an outgoing call in an exponen-
tially distributed time with mean 1/α. The service times of the outgoing calls are
independent with common probability distribution function H2 (x), H2 (0+) = 0
and Laplace-Stieltjes transform h2 (s), Re(s) ≥ 0; the first and second order
moments are denoted by h21 and h22 . The arrival flows of incoming and out-
going calls, service times and inter-retrial times are assumed to be mutually
independent.
Consider the following random process ζ(t) = {α(t), R(t); ξ(t), t ≥ 0}, where
{R(t), t ≥ 0} is the number of customers in orbit at time t; α(t) = 0, if the server
is free at time t; α(t) = 1 (resp. α(t) = 2) if an incoming call (resp. an outgoing
call) is in service at time t. The last component ξ(t) is a positive real random
variable: ξ(t) = 0, if α(t) = 0 ; ξ(t) is the residual service time if α(t) = 0 .
It is not difficult to show that the stochastic process {ζ(t), t ≥ 0} is a
Markovian process with piecewise linear paths which describes the evolution
of the server state and the number of orbiting customers. We establish first the
ergodicity condition for such a process, then we obtain its stationary probability
distribution.

3 Analysis
3.1 Ergodicity Condition

Let
h11
ρ=λ , (1)
γ1
and
h21
σ=α . (2)
γ2
The following theorem gives a condition for the existence of a stationary regime.

Theorem 1. If
ρ < 1, (3)
4 A. Aissani and T. Phung-Duc

then the stochastic process {ζ(t), t ≥ 0} is ergodic and as a consequence there

exists a unique stationary distribution. If ρ > 1, then the limiting probability
distribution of {ζ(t), t ≥ 0} tends to 0, and the underlying process tends to ∞.
Proof. The proof is similar to that of [2,5] with slight modifications.

3.2 Joint Distribution of the Server State

and the Number of Calls in Orbit
In this section we derive the joint distribution of the server state and the number
of customers in orbit in steady-state by its transform.
Under the assumption ρ < 1, the stochastic process {ζ(t), t ≥ 0} is ergodic.
As a consequence, the ergodic stationary probabilities

P0 (m) = lim P {α(t) = 0, R(t) = m}, m ≥ 0,

t→∞

Pi (m, x) = lim P {α(t) = i, R(t) = m; ξ(t) < x},

t→∞
i = 1, 2, m ≥ 0, x ≥ 0,
are solutions of the following system of differential equations
dP1 (m, 0) dP2 (m, 0)
(λ + α + νm)P0 (m) = γ1 + γ2 , m ≥ 0,
dx dx
dP1 (m, x) dP1 (m, 0)
λP1 (m, x) = γ1 − γ1 + λ(1 − δ0m )P1 (m − 1, x)+
dx dx
+λP0 (m)H1 (x) + ν(m + 1)P0 (m + 1)H1 (x), m ≥ 0, x ≥ 0,
dP2 (m, x) dP2 (m, 0)
λP2 (m, x) = γ2 − γ2 + λ(1 − δ0m )P2 (m − 1, x)+
dx dx
+αP0 (m)H2 (x), m ≥ 0, x ≥ 0,
where δij is the Kronecker function. We introduce the partial generating func-
tions in z,
∞

Q0 (z) = z m P0 (m),
m=0
∞

Qi (z, x) = z m Pi (m, x), i = 1, 2.
m=0
Applying these transforms to the previous system, we obtain
dQ0 (z) ∂Q1 (z, 0) ∂Q2 (z, 0)
(λ + α)Q0 (z) + νz = γ1 + γ2 , (4)
dz ∂x ∂x

∂Q1 (z, x) ∂Q1 (z, 0) dQ0 (z)

(λ − λz)Q1 (z, x) = γ1 − γ1 + λQ0 (z)H1 (x) + ν H1 (x),
∂x ∂x dz
(5)
 Optimal Analysis for M/G/1 Retrial Queue with Two-Way Communication 5

∂Q2 (z, x) ∂Q2 (z, 0)

(λ − λz)Q2 (z, x) = γ2 − γ2 + αQ0 (z)H2 (x). (6)
∂x ∂x
We apply now the Laplace transform to the second argument of the obtained
partial generating functions in equations (5) and (6) and we get

∂Q1 (z, 0)  dQ0 (z) 

s(γ1 s − λ + λz)f1 (z, s) = γ1 − λQ0 (z) + ν h1 (s), (7)
∂x dz
∂Q2 (z, 0)
s(γ2 s − λ + λz)f2 (z, s) = γ2 − αQ0 (z)h2 (s), (8)
∂x
where fi (z, s) denotes the Laplace transform of Qi (z, x) (i = 1, 2), i.e.,
 ∞
fi (z, s) = e−sx Qi (z, x)dx, i = 1, 2.
0

The unknown functions ∂Q∂x i (z,0)

, i = 1, 2 can be determined as usual by
using the fact that the functions Qi (z, 0) are analytical functions in the domain
|z| ≤ 1. Consider for example equation (8) of the previous system of equations.
Since Q2 (z, 0) is analytic in the domain |z| ≤ 1, and since the left hand is equal
to zero for s = (λ − λz)/γ2 , then the right hand side must also be zero at this
point. As a result, we have the first condition

∂Q2 (z, 0) α  λ − λz 
= Q0 (z)h2 . (9)
∂x γ2 γ2

Similarly, Q1 (z, 0) is analytic in the domain |z| ≤ 1, and since the left right hand
is equal to zero for s = (λ − λz)/γ1 , then the right hand side must also be zero
at this point. As a result, we also have

∂Q1 (z, 0) 1 dQ0 (z)   λ − λz 

= λQ0 (z) + ν h1 . (10)
∂x γ1 dz γ1

Substituting now (9)-(10) in (7)-(8), we obtain the functions fi (z, s) (i = 1, 2)

under the following explicit form
  λ−λz  
h1 γ1 − h1 (s) [λQ0 (z) + ν dQdz 0 (z)
]
f1 (z, s) = , (11)
s(γ1 s − λ + λz)
 
h2 λ−λz
γ2 − h2 (s)
f2 (z, s) = α Q0 (z). (12)
s(γ2 s − λ + λz)
Now, substitution of (9)-(10) in equation (4) gives

dQ0 (z)  dQ0 (z)   λ − λz   λ − λz 

(λ+α)Q0 (z)+νz = λQ0 (z)+ν h1 +αQ0 (z)h2 ,
dz dz γ1 γ2
(13)
6 A. Aissani and T. Phung-Duc

or equivalently,

 λ − λz   λ − λz   λ − λz  dQ0 (z)
λ[1 − h1 ] + α[1 − h2 ] Q0 (z) = ν[h1 − z] .
γ1 γ2 γ1 dz
(14)
The solution of this homogeneous ordinary differential equation is of the form
  λ−λy    λ−λy 
λ z 1 − h 1 γ1 α z 1 − h 2 γ2
Q0 (z) = k0 exp   dy × exp   dy . (15)
ν 0 h1 λ−λy γ1 −y ν 0 h1 λ−λy γ1 −y

The constant k0 can be determined using the normalization condition and it will
be done in the next section.
So, we have the following result.
Theorem 2. If the condition ρ < 1 is fulfilled, then the joint distribution of the
server state, orbit size and residual work is given by it’s transform

  λ−λz     
h1 γ1 − h1 (s) λ(1 − z) + α 1 − h2 λ−λz γ2
f1 (z, s) =     Q0 (z), (16)
s(γ1 s − λ + λz) h1 λ−λz
γ1 −z
 
h2 λ−λz
γ2 − h2 (s)
f2 (z, s) = α Q0 (z) (17)
s(γ2 s − λ + λz)
where the function Q0 (z) is given in Theorem 3.
Proof. Using Tauberian theorem in formula (11), we get

Q1 (z, ∞) = limx→∞ Q1 (z, x) = lims→0+ sf1 (z, s) =

 
1 − h1 λ−λz
γ1  dQ0 (z) 
= λQ0 (z) + ν . (18)
λ − λz dz
Similarly, we obtain from (12)
 
1 − h2 λ−λzγ2
Q2 (z, ∞) = α Q0 (z). (19)
λ − λz
Using equation (15) we have
 
dQ0 (z) λ(1 − z) + α[1 − h2 λ−λz
γ2 ]
λQ0 (z) + ν =  λ−λz  Q0 (z). (20)
dz h1 γ 1
−z

Hence, by substituting (20) into (18), we obtain

    
1 − h1 λ−λz
γ1 α 1 − h2 λ−λz
γ2
Q1 (z, ∞) =  λ−λz  1+ Q0 (z). (21)
h 1 γ1 − z λ − λz
The relation (16) is obtained by substituting (18) into (11) and equation (17) is
just (12).
 Optimal Analysis for M/G/1 Retrial Queue with Two-Way Communication 7

3.3 Distribution of the Number of Calls in Orbit

Let qm = P {R(t) = m}, m = 0, 1, ... be the distribution of the number of calls

in orbit.
It is easy to see that

qm = P0 (m) + P1 (m, ∞) + P2 (m, ∞) (22)

The generating function of this distribution is
∞

Q(z) = qm z m = Q0 (z) + Q1 (z, ∞) + Q2 (z, ∞)
m=0

Theorem 3. If ρ = λh 11
γ1 < 1, then the generating function of the number of
calls in orbit is given by
  
λ − λz + α 1 − h2 λ−λz
γ2
Q(z) =     Q0 (z), (23)
λ h1 λ−λz
γ1 −z
where
   
1−ρ  λ  1 1 − h1 λ−λy   α  1 1 − h2 λ−λy 
γ1 γ2
Q0 (z) = exp  λ−λy  dy × exp  λ−λy  dy .
1 + αh21 /γ2 ν z h1 γ
1
−y ν z h1 γ
1
−y
(24)

Proof. Taking into account (15), (17) and (19), we obtain after some algebra
expression (23). From this formula we can obtain an explicit expression of the
constant k0 by using the normalization condition Q(1) = 1. Note that when
taking z = 1 in (23), we obtain an indeterminate form 0/0. This difficulty can
be overcome by using twice l’Hospital’s rule.

Remark 1. Note that if the energy γ1 = γ2 = 1, then we obtain the results by

Artalejo and Phung-Duc [5] for the temporal model with two-way communica-
tion.

Remark 2. We note that the ergodicity condition ρ < 1 appears here since the
constant k0 must be strictly positive.

4 Some Performance Metrics and Numerical Results

In this section we show how the results of the previous sections can be helpful
to derive several performance metrics of interest.
8 A. Aissani and T. Phung-Duc

4.1 Performance Metrics

From (15), (17), (23) and (24) we can obtain some performance metrics of inter-
est.

– The probability that the server is idle:

1 − λh11 /γ1
P0 = Q0 (1) = Q0 (z) |z=1 = . (25)
1 + αh21 /γ2
– The probability that the server is busy by incoming service:
λ
P1 = Q1 (1, ∞) = h11 . (26)
γ1
– The probability that the server is busy by outgoing service:

(1 − λh11 /γ1 )(αh21 /γ2 )

P2 = Q2 (1, ∞) = . (27)
1 + αh21 /γ2
– The mean number of calls in orbit:

 dQ(z) λαh22 /γ22 λ2 h12 /γ12

N1 = Q (1) = |z=1 = + +
dz 2(1 + αh21 /γ2 ) 2(1 − λh11 /γ1 )
λ(λh11 /γ1 + αh21 /γ2 )
+ (28)
ν(1 − λh11 /γ1 )
– The mean number of calls in orbit when the server is idle:
 dQ0 (z) λ λh11 /γ1 + αh21 /γ2
M1 = Q0 (1) = |z=1 = . (29)
dz ν 1 + (αh21 )/γ2
Remark 3. We note that the idle server probability is independent of the retrial
rate ν. Indeed, this probability depends only on σ = αh21 /γ2 (the traffic intensity
of outgoing calls) which is clearly independent of retrial rate and ρ = λh11 /γ1
(the traffic intensity of incoming calls) which is also independent of retrial rate
for linear retrial policy (in opposition to constant retrial policy). On the other
hand the ergodicity condition is the same as for the energetic M/G/1 FIFO [9]
queue since each incoming call must be served.

4.2 Numerical Examples

This subsection is devoted to the presentation of some examples and numerical
illustrations showing how to exploit the results of the previous sections. The
objective is to indicate to a practitioner how he can observe the influence of
given parameters upon given performance measures of interest.
Figure 1(i) illustrates the effect of service speed of outgoing calls γ2 on the
idle server probability P0 for different values of γ1 : 5, 10 and 20. We note that
P0 increases when both outgoing rate γ1 and γ2 increase. Figure 1(ii) shows
 Optimal Analysis for M/G/1 Retrial Queue with Two-Way Communication 9

1.0

Probability that the server is idle P0

0.8
Γ1 20

0.6
Γ1 10 0.6
20
P0 0.4
0.4 Γ1 5
0.2 15
0.0
0.2 10
5 Γ2

10
5
0.0 Γ1
0 2 4 6 8 10 15

Service speed of outgoing calls Γ2 20

0

Fig. 1. (i) Effect of speed of outgoing calls γ2 on the idle server probability P0 . (ii) Effect
of γ1 and γ2 on the idle server probability P0 .

30
Mean number of calls in orbit N1

25

20 Γ15,Γ25
3
15 Γ15,Γ210 2 30
N1
Γ110,Γ25 1
10
20
0

5 10 Γ2
20 10

0 30
0 10 20 30 40 50 Γ1
40
Outgoing rate Α 50
0

Fig. 2. (i) Effect of outgoing rate α for different values of γ1 and γ2 on N1 . (ii) Effect
of γ1 and γ2 on N1 .

the same evolution on a 3D graph. Some parameters are fixed as follow λ = 1,

α = 2, h11 = 2, h21 = 1, ν = 2.
In Figure 2(i) we show the effect of outgoing rate on the mean number of
calls in orbit N1 for fixed values of service speeds for both incoming and outgoing
calls (γ1 , γ2 ) = (5, 5), (5, 10) and (10, 5). As expected, the mean number of calls
in orbit linearly increases with increasing of the outgoing rate α. Figure 2(ii)
shows that N1 decreases when both γ1 and γ2 increase.
Finally, Figures 3(i) and 3(ii) illustrates the effect of retrial rate ν on the
mean number of calls in orbit N1 and mean number of calls in orbit when
the server idle M1 for different values of (γ1 , γ2 ) = (5, 5) (short dashed line),
(5, 10) (gray level line), (10, 5) (long dashed line). As expected both N1 and M1
decreases with decreasing of ν.

5 Optimization Problems
The energetic interpretation considered here leads to a new optimization prob-
lem trying to minimize the total cost of the system. In fact, there are two factors
that we want to minimize.
10 A. Aissani and T. Phung-Duc

6 6

Mean number of calls in orbit M1

Mean number of calls in orbit N1

5 5

4 4

3 3

2 2

1 1

0 0
0.0 0.5 1.0 1.5 2.0 0.0 0.5 1.0 1.5 2.0
Retrial rate Ν Retrial rate Ν

Fig. 3. (i) Effect of retrial rate ν on N1 . (ii) Effect of retrial rate ν on M1 .

1. the queue length (mean number of incoming calls in the orbit)

2. the power consumption of the server.

It is assumed that the power consumption of the server when it runs at speed γ1
is proportional to γ1β for some β > 0. Similarly, the power consumption of the
server when it runs at speed γ2 is proportional to γ2β [11].

5.1 Optimal Service Speeds

Consider the function
1
F (γ1 , γ2 ) = N1 + E(S), (30)
δ
which represents the total cost of the system, where E(S) = C × P0 + P1 × γ1β +
P2 ×γ2β and δ is the relative importance on power consumption and queue length
(QoS). So, we can suggest the following optimization problem.

minγ1 >0,γ2 >0 F (γ1 , γ2 ). (31)

In the following sections, we provide several numerical experiments showing

some non trivial values of γ1 and γ2 which minimize the total cost of the system
given by expression (31), where the constant P0 , P1 , P2 and N1 are given by
(25)-(28).

5.2 Optimal Idle Interval

We now consider the optimization problem subject to the mean idle interval.
In particular, we find the optimal α which minimizes the cost function while
keeping all other parameters constant.
This optimization problem is useful in the situation where we need to deter-
mine the timing to make an outgoing call. A large mean idle interval (1/α)
reduces the mean queue length. At the same time it increases the idle probabil-
ity resulting in the increase of useless energy consumption. It should be noted
that idle server consumes energy but does not process jobs.
 Optimal Analysis for M/G/1 Retrial Queue with Two-Way Communication 11

Because h21 , γ2 are constant, minimizing subject to α is equivalent to min-

imizing subject to σ which is the traffic intensity of outgoing calls. Taking the
derivative with respect to σ yields

dF (γ1 , γ2 ) A
=− + B,
dσ (1 + σ)2

where A and B are given by

(1 − ρ)C (1 − ρ)γ2β λh22 λ

A= − − , B= .
δ δ 2γ2 h21 ν(1 − ρ)

If A ≤ B, we have
dF (γ1 , γ2 )
>0
dσ
implying that the cost function is minimized at σ = 0. If A > B, the cost
function is minimized at 
∗ A
σ = − 1.
B

5.3 Examples and Numerical Illustrations

In this section, we illustrate the effect of different parameters on the cost function
in order to show performance-energy trade-off.
The parameters are fixed as follow λ = 2, α = 2, h11 = 2, h12 = 1, h21 = 1,
h22 = 2, ν = 2, C = 1, β = 2. Now we want to illustrate the effect of γ1 and γ2
on the cost function.
We present in Table 1 the optimal values of γ1 and γ2 and the corresponding
minimal cost for different values of δ. We see that the minimal value of the cost
function decreases when δ increases.
In Figures 4(i), 4(ii) and 5(i) we represent the effect of γ1 on the cost function
F (γ1 , γ2 ) for different special cases (δ = 0.1).

– γ1 = 10 × γ2 : short dashed line,

– γ1 = γ2 : Gray level line,
– γ1 = 0.1 × γ1 : long dashed line.

Note that due to the ergodicity condition, the range of γ1 is respectively

γ1 > 4, γ1 > 0.4 and γ1 > 40. Figure 5(ii) shows all graphs together. We note
that the Figure 4(i) is masked by Figure 5(i) in the left up corner on the graph
due to scaling.

Figures 6 and 7 show the effect of the retrial rate on the optimal σ ∗ for
different values of C and δ. The optimal σ ∗ increases when both δ and retrial
rate increase.
12 A. Aissani and T. Phung-Duc

Table 1. Optimal values of γ1∗ , γ2∗ and optimal cost F (γ1∗ , γ2∗ ) for different values of
δ: C = 1, ν = 2.

δ Optimal value γ1∗ , Optimal value γ2∗ Minimum cost F ∗ (γ1∗ ,γ2∗
0.1 4.03353 4.10481 × 106 16268.3
0.5 4.07498 4.93492 × 106 3319.91
1 4.10603 4.51583 × 106 1684.76
5 4.23706 4.39855 × 106 357.841
10 4.33521 2.58957 × 106 186.725
15 4.41049 1.20018 × 106 128.468
20 4.47393 883739 98.8672
30 4.58029 650642 68.7203
50 4.7488 350133 43.8979
100 5.05787 193073 24.3886
300 5.8268 51323.7 10.1471
500 6.35329 35950.9 6.91697
1000 7.31537 15547.9 4.21571
5000 11.3242 2887.86 1.47686
10000 14.2982 1633.86 0.97487

1000 1000

800 800

600 600
FΓ1 

FΓ1 

400 400

200 200

0 0
0 10 20 30 40 50 40 42 44 46 48 50
Γ1 Γ1

Fig. 4. (i) Cost function versus γ1 for γ1 = 10 × γ2 : C = 1, ν = 2. (ii) Cost function

versus γ1 for γ1 = 0.1 × γ2 : C = 1, ν = 2.

1000 1000

800 800

600 600110Γ2
FΓ1 

FΓ1 

400 400 Γ1Γ2 Γ10.1Γ2

200 200

0 0
10 20 30 40 50 10 20 30 40 50
Γ1 Γ1

Fig. 5. (i) Cost function versus γ1 for γ1 = γ2 : C = 1, ν = 2. (ii) All graphs together.
 Optimal Analysis for M/G/1 Retrial Queue with Two-Way Communication 13

30 30

25 Δ0.01 25 Δ0.01

20 20
Optimal Σ

Optimal Σ
15 Δ0.1 15 Δ0.1

10 10

5 Δ1 5 Δ1

0 0
0 5 10 15 20 25 30 0 5 10 15 20 25 30
Retrial rate Ν Retrial rate Ν

Fig. 6. (i) Effect of δ and retrial rate ν on the optimal value σ ∗ : C = 20, γ1 = 5, γ2 = 1
(ii) Effect of δ and retrial rate ν on the optimal value σ ∗ : C = 50, γ1 = 5, γ2 = 1.

30 30

25 Δ0.01 25 Δ0.01

20 20
Optimal Σ

Optimal Σ

15 Δ0.1 15 Δ0.1

10 10

5 Δ1 5 Δ1

0 0
0 5 10 15 20 25 30 0 5 10 15 20 25 30
Retrial rate Ν Retrial rate Ν

Fig. 7. (i) Effect of δ and retrial rate ν on the optimal value σ ∗ : C = 30, γ1 = 10,
γ2 = 5 (ii) Effect of δ and retrial rate ν on the optimal value σ ∗ : C = 50. γ1 = 10,
γ2 = 5.

6 Conclusion

In this work, we have provided an analysis of the energetic version of the M/G/1
retrial queue with two-way communication studied by Artalejo and Phung-
Duc [5]. In particular, we have made the conjecture that this energetic inter-
pretation leads to a new optimization problem trying to minimize the total cost
of the system. This conjecture was verified experimentally by showing the evo-
lution of the cost function for different values of the parameters. The next step
will be to provide an analytical proof of this conjecture. It will be interesting
also to study the influence of reliability and/or vacations.

Acknowledgments. This work was supported in parts by the Algerian ministry of high
education and scientific research through grants B00220100046 and B ∗ 00220140064.
It has been initiated during a visit of the first author at Tokyo Institute of Technology
(Japan) on behalf of 10th Workshop on Retrial Queues July 24 − 26, 2014. The authors
would like to thanks the anonymous referees for pertinent and helpful comments that
allow to improve the quality of the paper.
14 A. Aissani and T. Phung-Duc

References
1. Aissani, A.: An M X /G/1 Energetic retrial queue with vacations and it’s control.
Electronic Notes in Theoretical Computer Science (ENTCS) Elsevier 253(3), 33–44
(2009)
2. Aissani, A.: An M X /G/1 Energetic retrial queue with vacations and control. IMA
Journal of Management Mathematics 22, 13–32 (2011)
3. Artalejo, J.R.: Accessible bibliography on retrial queues: Progress in 1990–1999.
Mathematical and Computer Modelling 30, 1–6 (1999)
4. Artalejo, J.R.: Accessible bibliography on retrial queues: Progress in 2000–2009.
Mathematical and Computer Modelling 51(9), 1071–1081 (2009)
5. Artalejo, J.R., Phung-Duc, T.: Single server retrial queues with two way commu-
nication. Applied Mathematical Modelling 37, 1811–1822 (2013)
6. Artalejo, J.R., Phung-Duc, T.: Markovian retrial queues with two way communi-
cation. Journal of Industrial and Management Optimization 8, 781–806 (2012)
7. Artalejo, J.R., Gomez-Corall, A.: Retrial queueing systems: A computational app-
roach. Springer, Berlin (2008)
8. Falin, G.I., Templeton, J.G.: Retrial Queues. Chapman and Hill, New Jersey (1997)
9. Gnedenko, B.V., Kovalenko, I.N.: Introduction to Queueing Theory, 2nd edn.
Birkhauser, Boston (1989)
10. Krishnamoorthy, A., Gobakamarand, B., Viswanath, C.: A retrial queue with server
interruptions, resumption and restart of service. Operational Research 12, 133–149
(2012)
11. Lu, X., Aalto, S., Lassila, P.: Performance-energy trade-off in data centers:
Impact of switching delay. In: Energy Efficient and Green Networking (SSEEGN),
pp. 50–55 (2013)
Use of Flow Equivalent Servers in the Transient
Analysis of Product Form Queuing Networks

Alessio Angius1 , András Horváth1(B) , Sami M. Halawani2 , Omar Barukab2 ,

Ab Rahman Ahmad2 , and Gianfranco Balbo1,2
1
Dipartimento di Informatica, Università di Torino, Turin, Italy
{angius,horvath,balbo}@di.unito.it
2
Faculty of Computing and Information Technology, King Abdulaziz University,
Rabigh Branch, Rabigh, Kingdom of Saudi Arabia
{halawani,obarukab,abinahmad}@kau.edu.sa

Abstract. In this paper we deal with approximate transient analysis of

Product Form Queuing Networks. In particular, we exploit the idea of
flow equivalence to reduce the size of the model. It is well-known that
flow equivalent servers lead to exact steady state solution in many cases.
Our goal is to investigate the applicability of flow equivalence to transient
analysis. We show that exact results can be obtained even in the tran-
sient phase, but the definition of the equivalent server requires the anal-
ysis of the whole original network. We propose thus to use approximate
aggregate servers whose characterization demands much less computa-
tion. Specifically, the characterization corresponds to the steady state
equivalent server of the stations that we aim to aggregate and thus can
be achieved by analyzing the involved stations in isolation. This way,
approximations can be derived for any queuing network, but the preci-
sion of the results depends heavily on the topology and on the param-
eters of the model. We illustrate the approach on numerical examples
and briefly discuss a set of criteria to identify the cases when it leads to
satisfactory approximation.

1 Introduction
Queuing networks are widely used for the design and analysis of Discrete Event
Dynamic Systems [18]. The complexities of real systems translate in the com-
plexities of their models, thus making the understanding of their properties
and behaviors a computationally difficult task. Product Form Queuing Networks
(PFQNs) [6] are a restricted class of queuing networks with special features which
make them interesting for practical purposes. Many applications of PFQN can be
found in the literature for the analysis of Computer, Communication, and Man-
ufacturing Systems. The derivation of efficient computational algorithms for the
solution of their mathematical representations [10] has made them very popular
because of the possibility of analyzing very large models with limited computa-
tional effort. Still, given the ever increasing complexity of real systems, simpli-
fication techniques with which an entire sub-model (comprising many nodes -or

c Springer International Publishing Switzerland 2015
M. Gribaudo et al. (Eds.): ASMTA 2015, LNCS 9081, pp. 15–29, 2015.
DOI: 10.1007/978-3-319-18579-8 2
16 A. Angius et al.

servers- of the original network) can be identified within the model, analyzed in
isolation, and replaced with a single flow equivalent server are very attractive
because they reduce the computational complexity of the analysis of the whole
model. The characterization of the flow equivalent server and the exactness of
the substitution rely on the characteristics of the product form solution of the
original model [5,11,17]. Product form is a property of the stationary distribu-
tion of PFQN and holds only in very specific cases in the transient phase [8]. As
a consequence, the transient analysis of real systems gains little advantages when
these same systems can be modeled with PFQNs. Moreover, little is known about
the quality (approximation level) of the transient solution of a model computed
when subsystems are replaced by their flow equivalent counterparts.
In this paper we investigate the application of flow-equivalence for transient
analysis. We show that the transient solution of a model reduced by the concept
of steady state flow equivalence may yield a good approximation of the transient
behavior of the original model. We limit ourselves to an approximation because,
excluding very special cases, it appears unrealistic to devise an exact approach
that reduces the complexity of the transient analysis as it happens for the steady
state analysis of PFQNs. On the basis of these preliminary observations, we
suggest certain conditions that must be satisfied by the original model for the
method to apply in a satisfactory manner.
Transient analysis is a computationally difficult problem when the state space
is large (more than about 107 states) and not many techniques have been pro-
posed to solve it. Apart of the simplest cases [8], only approximate and simula-
tion based techniques are viable. Among the approximate approaches we have
moment closure techniques [19] and fluid approximations [14]. Methods based
on aggregation have also been developed, see, for example, [7]. Fewer techniques
maintain the original state space of the model and, as a consequence, allow one
to calculate also distributions. Among these, memory efficient approaches have
been proposed based on assuming that the transient probabilities are in a special
form, like product form [1], partial product form [20], or quasi product form [3].
A decomposition based technique has been proposed instead in [2].
The paper is organized as follows. In Section 2 we introduce the model and
summarize the methods used to compute the stationary distribution of PFQNs.
In Section 3 we describe the concept of flow equivalent server and show how to
restructure the model to accommodate the flow equivalent server. In Section 4
we discuss the difficulties that arise when using flow equivalence in a finite time
domain. In Section 5 we discuss the quality of the approximation by applying
the method to (relatively) large networks exhibiting different characteristics and
draw some general indications concerning both the cases in which the method
performs well as well as those where the results are not satisfactory. Finally, in
Section 6 we draw conclusions.

2 Model
We consider a closed network of M queues, N = {s1 , s2 , . . . , sM }, with a fixed
number N of statistically identical jobs circulating through the network at all
 Use of Flow Equivalent Servers in the Transient Analysis 17

times (single class network). Jobs (or customers) get service at the stations and
move from one station to another according to pre-fixed routing probabilities
denoted by ri,j with i, j ∈ {1, 2, ..., M } and globally represented by the routing
matrix R. Service times have exponential distributions which may be load depen-
dent (i.e. functions of the number jobs at the station) and the service discipline
is FIFO. The service intensity (rate) of queue i in the presence of n jobs at the
station is denoted by μi (n).
A given state of the model is a vector n = [n1 , ..., nM ] where ni denotes the
M
number of jobs at station i and i=1 ni = N . Accordingly, the state space is
defined as
  M

 

S(N, M ) = n = [n1 , ..., nM ]  ni ≥ 0, i = 1, ..., M ; ni = N (1)
i=1
N +M −1
and its cardinality is |S(N, M )| = M −1 .
The number of jobs at station i at time t is denoted by ni (t). The probability
that the system is in state n at time t is denoted by πn (t). The probabilities of the
whole state space are conveniently collected in a vector π(t) = [πn (t)]n∈S(N,M ) .
It has been proved by Gordon and Newell [16] that the equilibrium distribu-
tion of customers in a closed PFQN of this type is given by
M
1
πn = fi (ni ) (2)
G i=1

where G is a normalizing constant defined so that we have πn = 1, and the
function fi (often called service function of station i) is defined as

1 n=0
fi (n) = Vi (3)
µi (n) fi (n − 1) n ≥ 1

being V = [V1 , ..., VM ] a real positive solution of the eigenvector-like equation

V = VR (4)

The direct computation of the normalization constant G is of exponential

complexity, but, due to the pioneering work of Buzen [10], computationally effi-
cient algorithms have been devised [13] which obtain the desired quantity in
polynomial time. One such method, called the convolution algorithm, is based
on the definition of an auxiliary function g(n, m) that represents the normaliza-
tion constant computed for the network comprising the first m (≤ M ) stations
of the original network and in which only n (≤ N ) customers are present. This
quantity can be computed by a recursive method based on the convolution-type
summation
n
g(n, m) = fm (k) g(n − k, m − 1) (5)
k=0
18 A. Angius et al.

The normalization constant for the whole network with M jobs is given then by
G = g(N, M ), with g(n, 1) = f1 (n).
The method provides expressions for many standard performance indices of
the network that can be defined in terms of values obtained during the compu-
tation of G [10]. An important result, that was also originally derived by Buzen
in [10], concerns the marginal distribution of the customers at the ith station.
For the purposes of this paper, we can focus our attention on the distribution
of the customers in the last station of the network. The probability of having h
jobs at the M th station can be computed without considering all states of the
network as simply as

g(N − h, M − 1)
PM (h) = fM (h) (6)
g(N, M )

3 Flow-Equivalent Aggregation

On the basis of the results recalled in the previous section, we can now define
an equivalent server. Consider a PFQN N defined as before and let K = {s1 ,
s2 , . . . , sK }, si ∈ {1, ..., M }, be a subset of its stations. Let K be the comple-
mentary subset of stations of K so that K ∩ K = ∅ and K ∪ K = N . For sake of
simplicity, in the rest of this paper, unless when specified differently, we assume
that the stations of the network are ordered so that those of sub-network K are
the first K stations of the network N that in the rest of the paper will be often
referred to as the aggregated stations. The goal of the aggregation step is to char-
acterize the behavior of the sub-model K in order to replace it with an equivalent
server that will then interact with the other sub-model K without affecting its
behavior. This characterization of the equivalent server is performed with a con-
trolled experiment [11,12,15] which corresponds to solving the sub-model K in
isolation under a fixed load H = 1, ..., N . For this purpose let us assume N  to
be a queuing network having the same topology of N , but such that the stations
not in K have null service times (they are often referred to as “short-circuited”).
Denoting by π  the stationary distribution of the customers in the network N  ,
and with X a generic state of N 
 
 K
πn (H) = P r{X1 = n1 , ..., XK = nK , XK+1 = 0, ..., XM = 0  ni = H}
i=1

we can compute the stationary throughputs of all the stations of N  when H

customers are in the network as
H

χi (H) = Pi (h, H) μi (h) (7)
h=1

where Pi (h, H) is the marginal distribution of the customers in the ith station
(i = 1, ..., K), obtained from the proper summation of the distribution πn (H).
 Use of Flow Equivalent Servers in the Transient Analysis 19

The aggregated throughput of sub-network K can be written as

⎡ ⎤
 
χagg (H) = ⎣χi (H) ri,j ⎦ (8)
i∈K j∈K

Denoting with seq a load-dependent station with service intensity equal to

χagg (H), we can state the following theorem.
Theorem 1. If station seq is put in N in place of the stations that belong to K
in such a way that
(1) the routing probabilities from a station si ∈ K to seq are equal to the sum of
the routing probabilities from si to each station in K, i.e.

ri,eq = ri,l (9)
l∈K

(2) the routing probabilities from seq to a station sj ∈ K are equal to the weighted
sum of the routing probabilities from each station in K to sj ,

i∈K Vi ri,j
req,j =   (10)
l∈K  h∈K Vh rh,l

then the resulting new network (denoted by Neq ) has measures of interest equal
to those of N when time approaches infinity.
The result expressed by Theorem 1 is well-known for what concerns the char-
acterization of the equivalent server [4,5,11,15]. The proof usually focuses on
showing that the normalization constant of the original network N is identical
to that of the reduced network Neq .
Little is instead available in the literature for what concerns the modifications
that need to be introduced in the routing matrix of network N in order to
provide a detailed and precise specification of network Neq as defined by (9) and
(10) included in the statement Theorem 1. This is due to the fact that these
details are not relevant for the computation of the stationary distribution of
the whole network; they are instead needed for the transient analysis based on
flow equivalent servers that will be discussed later on in this paper. To check
the validity of the expressions represented by (9) and (10), it is sufficient to
show that the visit ratios computed for the stations that belong to K remain
identical when considered both within the original network N and within the
reduced network Neq .
Indeed, if we detail the expression represented by (4), and we perform a
simple manipulation we obtain
   
Vi

=

j∈K Vj rj,i +

h∈K Vh rh,i 
   i ∈ K (11)
l∈K Vl = j∈K Vj l∈K rj,l + h∈K Vh 1 − j∈K rh,j

Reorganizing the previous representation and defining (see also [4])


Veq = Vh rh,j (12)
j∈K h∈K
Another random document with
no related content on Scribd:
The Project Gutenberg eBook of Advice to a
wife and mother in two parts
 This ebook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this ebook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.

Title: Advice to a wife and mother in two parts

Embracing advice to a wife, and advice to a mother

Author: Pye Henry Chavasse

Release date: October 15, 2023 [eBook #71887]

Language: English

Original publication: Philadelphia: J. B. Lippincott & Co, 1881

Credits: Richard Tonsing, MFR, and the Online Distributed

Proofreading Team at https://www.pgdp.net (This file
was produced from images generously made available
by The Internet Archive)

*** START OF THE PROJECT GUTENBERG EBOOK ADVICE TO

A WIFE AND MOTHER IN TWO PARTS ***
Transcriber's Note:
New original cover art included with this eBook is
granted to the public domain.
 ADVICE
TO A

WIFE AND MOTHER.

IN TWO PARTS.
EMBRACING

ADVICE TO A WIFE,
AND

ADVICE TO A MOTHER.

BY
PYE HENRY CHAVASSE.

SEVENTEENTH EDITION.

PHILADELPHIA:
J. B. LIPPINCOTT & CO.
1881.
 ADVICE TO A WIFE
ON THE
MANAGEMENT OF HER OWN HEALTH,
AND ON THE
TREATMENT OF SOME OF THE COMPLAINTS
INCIDENTAL TO
PREGNANCY, LABOR, AND SUCKLING;
WITH AN
INTRODUCTORY CHAPTER ESPECIALLY ADDRESSED TO A YOUNG
WIFE.

BY

PYE HENRY CHAVASSE,

FELLOW OF THE ROYAL COLLEGE OF SURGEONS OF ENGLAND; FELLOW
OF THE OBSTETRICAL SOCIETY OF LONDON; FORMERLY PRESIDENT OF
QUEEN’S COLLEGE MEDICO-CHIRURGICAL SOCIETY, BIRMINGHAM;
AUTHOR OF “ADVICE TO A MOTHER ON THE MANAGEMENT OF HER
CHILDREN.”

“Thy wife shall be as the fruitful vine upon the walls of thine house.”

SEVENTEENTH EDITION.

PHILADELPHIA:
J. B. LIPPINCOTT & CO.

1881.
 TO

MY BIRMINGHAM PATIENTS,
MANY OF WHOM I HAVE ATTENDED FOR A PERIOD OF
UPWARDS OF THIRTY YEARS; SOME OF WHOM, HAVING
USHERED INTO THE WORLD, I AFTERWARD ATTENDED IN
THEIR OWN CONFINEMENTS; AND FROM ALL OF WHOM I
HAVE RECEIVED SO MUCH CONFIDENCE, COURTESY, AND
KINDNESS,

This little Volume is Dedicated,

BY THEIR SINCERE FRIEND,

PYE HENRY CHAVASSE

Priory House, Old Square,

Birmingham.
 PREFACE.

The sale of copies of this book is now to be reckoned by its tens of

thousands! The last, the Seventh Edition, comprising five thousand
copies, has been rapidly exhausted; a new Edition, the Eighth, is
now urgently called for; and as the sale of the work is so enormous,
and so extending, my worthy Publishers have deemed it advisable to
publish of this edition at once seven thousand copies,—thus making
of the two last editions alone twelve thousand copies; the two last
editions being, in fact, equal to twelve ordinary editions! Moreover,
this book has made me troops of friends, thus proving how much
such a work was needed, and how thoroughly my humble efforts
have been appreciated.
I have, in the Introductory Chapter especially addressed to a
Young Wife, had some plain and unpalatable truths to tell; but it is
absolutely necessary for a surgeon to probe a serious and deep-
seated wound to the bottom before he can perform a cure; he is
sometimes compelled to give pain before he can cure pain; he is
frequently obliged to administer bitter medicine before sweet health
can be restored. I have not shrunk from my duty; I have not uttered
an “uncertain sound:” but have, without fear or favor, boldly spoken
out, and have proclaimed what I have deemed to be the truth; the
vital importance of my subject must excuse my plain-speaking and
earnestness. When a person is on the edge of a precipice, and is
ready at any moment to topple over, the words of warning must not
be in the tones of a whisper, bland and gentle, but in the voice of
thunder, bold and decisive. I have had to discourse on matters of the
greatest moment to the well-being of wives; and have, therefore, in
order not to be misapprehended, had to call things by their right
names—the subject being of far too much importance to write in a
namby-pamby style, or to use any other language than that of the
plainest English.
 The Introductory Chapter is, I trust, greatly improved; many of the
quotations are either curtailed, or are altogether suppressed, in order
to make room, without materially increasing the size of the book, for
much new and important matter. The remaining pages have all been
carefully revised and corrected, and made more clear, and additional
advice, where needed, has been supplied. I therefore hope that this
edition will be still more worthy of its great and extending success,
and be the humble instrument of sowing broadcast through our land
advice most necessary for wives to know; and at the same time be the
means of dispelling prejudices which, in the lying-in room, are even,
in this our day, most rife and injurious.
Barren wives! delicate wives! unhealthy wives! are the order of the
day—are become institutions of the country—are so common as not
to be considered strange, but to be, as a matter of course, as part and
parcel of our everyday life! Should such things be? I emphatically say
No! But then a thorough change, a complete reformation, must take
place in the life and habits of a wife. It is no use blinking the
question; the truth, the whole truth, must come out, and the sooner
it is told the better. Oh! it is sad that the glorious mission of a wife
should, as it often does, end so ingloriously! Broken health, neglected
duties, a childless home, blighted hopes, misery, and discontent.
What an awful catalogue of the consequences of luxury, of
stimulants, of fashion, of ignorance, and of indolence—the five
principal wife and babe destroyers! Sure I am that the foregoing
melancholy results may, in the generality of cases, by timely and
judicious treatment, be prevented.
This is an age of stimulants—’tis the curse of the day; wine, in
excess, instead of being an element of strength, is one of weakness;
instead of encouraging fecundity, is one of its greatest preventives. A
lady who drinks daily five or six glasses of wine, is invariably weak,
low, hysterical, and “nervous,”—complaining that she can neither
eat, nor sleep, nor take exercise; she is totally unfit for the duties and
responsibilities of either wife or mother. I shall endeavor in the
following pages to prove the truth of these bold assertions.
Many young married ladies now drink as much wine in a day as
their grandmothers did in a week; and which I verily believe is one
cause of so few children, and of so much barrenness among them. It
is no use: the subject is too important to allow false delicacy to stand
in the way of this announcement; the truth must be told; the ulcer
which is eating into the vitals of society must be probed; the danger,
the folly, the wickedness of the system must be laid bare; the battle
must be fought; and as no medical man has come forward to begin
the conflict, I myself boldly throw down the gauntlet, and will, to the
best of my strength and ability, do battle in the cause.
It is the abuse and not the use of wine that I am contending
against. I am not advocating teetotal principles—certainly not. The
one system is as absurd and as wrong as the other; extremes, either
way, are most injurious to the constitution both of man and woman.
The advice of St. Paul is glorious advice: “Use a little wine for thy
stomach’s sake and thine often infirmities;” and again, when he says,
“be temperate in all things.” These are my sentiments, and which I
have, in the following pages, so earnestly contended for.
A lady who “eats without refreshment, and slumbers without
repose,” is deeply to be pitied, even though she be as rich as Crœsus,
or as beautiful as Venus! Nothing can compensate for the want of
either sleep or appetite; life without proper appetite and without
refreshing sleep will soon become a wearisome burden too heavy to
bear. It is high time, when there are so many of the Young Wives of
England, alas! too many, who daily “eat without refreshment,” and
who nightly “slumber without repose,” that the subject was
thoroughly looked into, and that proper means were suggested to
abate the calamity. One of the principal objects of this book is to
throw light upon the subject, and to counsel measures to remedy the
evil.
The large number of barren wives in England has, in these pages,
had my careful and earnest consideration. I have endeavored, to the
best of my ability, to point out, as far as the wives themselves are
concerned, many of the causes, and have advised remedies to abate
the same. It is quite time, when the health among the wives of the
higher classes is so much below par, and when children among them
are so few, that the causes should be thoroughly inquired into, and
that the treatment should be extensively made known. The subject is
of immense, indeed I might even say, of national importance, and
demands deep and earnest thought and careful investigation, as the
strength and sinews of a nation depend mainly upon the number and
healthfulness of her children.
 Barren land can generally, with care and skill, be made fertile; an
unfruitful vine can frequently, by an experienced gardener, be
converted into a fruit-bearing one; a childless wife can often, by
judicious treatment, be made a child-bearing one. Few things in this
world are impossible: “where there is a will there is generally a way;”
but if there be a will, it must be a determined and a persevering will;
if there be a way, the way, however rough and rugged, must be
trodden,—the rough and rugged path will, as she advances onward,
become smooth and pleasant.
It is not the poor woman, who works hard and who lives hard, that
is usually barren—certainly not: she has generally an abundance of
children; but it is the rich lady—the one who is indolent, who lives
luxuriously, and fares sumptuously every day—who leads a
fashionable, and therefore an unnatural life—who turns night into
day, who at night breathes suffocatingly hot rooms, who lives in a
whirl of excitement, who retires not to rest until the small hours of
the morning,—such a one is the one that is frequently barren; and
well she might be,—it would be most strange if she were not so. One
of the objects of this book will be to point out these causes, and to
suggest remedies for the same, and thus to stem the torrent, and in
some measure to do away with the curse of barrenness which in
England, at the present time, so fearfully prevails.
I have undertaken a responsible task, but have thrown my whole
energy and ability into it; I therefore have no excuse to make that I
have not thought earnestly and well upon the subject, or that I have
written unadvisedly; my thoughts and studies have for years been
directed to these matters. I earnestly hope, then, that I have not
written in vain, but that the seeds now sown will, in due time, bring
forth much fruit.
Although my two books—Advice to a Wife and Advice to a Mother
—are published as separate works, they might, in point of fact, be
considered as one volume—one only being the continuation of the
other. Advice to a Wife, treating on a mother’s own health, being, as
it were, a preparation for Advice to a Mother on the management of
her children’s health; it is quite necessary that the mother herself
should be healthy to have healthy children; and if she have healthy
offspring, it is equally important that she should be made thoroughly
acquainted how to keep them in health. The object of Advice to a
Wife and Advice to a Mother is for that end; indeed, the acquisition
and the preservation of sound health, of mother and of child, have, in
both my books, been my earnest endeavor, my constant theme, the
beginning and the ending, the sum and the substance of my
discourse, on which all else beside hinges.
I again resign this book into the hands of my fair readers, hoping
that it may be of profit and of service to them during the whole
period of their wifehood; and especially during the most interesting
part of their lives—in their hour of anguish and of trial; and that it
may be the humble means of making a barren woman “to be a joyful
mother of children.”
PYE HENRY CHAVASSE

Priory House, Old Square,

Birmingham.
 CONTENTS.

PAGES
Dedication iii
Preface to Eighth Edition v–x
Introductory Chapter 13–102

PART I.
On Menstruation 103–116

PART II.
On Pregnancy 117–198

PART III.
On Labor 199–254

PART IV.
On Suckling 255–300

Index 301–309
 Advice to a Wife.

A good wife is Heaven’s last, best gift to man—his angel and minister of graces
innumerable—his gem of many virtues—his casket of jewels. Her voice is sweet
music, her smiles his brightest day, her kiss the guardian of his innocence, her
arms the pale of his safety, the balm of his health, the balsam of his life; her
industry his surest wealth, her economy his safest steward, her lips his faithful
counselors, her bosom the softest pillow of his cares, and her prayers the ablest
advocate of Heaven’s blessings on his head.—Jeremy Taylor.

Of earthly goods, the best is a good Wife;

A bad, the bitterest curse of human life.—Simonides.
 INTRODUCTORY CHAPTER.

1. It may be well—before I enter on the subjects of menstruation, of

pregnancy, of labor, and suckling—to offer a few preliminary
observations, especially addressed to a Young Wife.
2. My subject is health—the care, the restoration, and the
preservation of health—one of the most glorious subjects that can be
brought before a human being, and one that should engross much of
our time and of our attention, and one that cannot be secured unless
it be properly attended to. The human frame is, as every one knows,
constantly liable to be out of order; it would be strange, indeed, if a
beautiful and complex instrument like the human body were not
occasionally out of tune:
“Strange that a harp with a thousand strings
Should keep in tune so long.”

3. The advice I am about to offer to my fair reader is of the greatest

importance, and demands her deepest attention. How many wives
are there with broken health, with feeble constitutions, and with
childless homes! Their number is legion! It is painful to contemplate
that, in our country, there are far more unhealthy than healthy
wives! There must surely be numerous causes for such a state of
things! A woman, born with every perfection, to be full of bodily
infirmities! It was ordained by the Almighty that wives should be
fruitful and multiply! Surely there must be something wrong in the
present system if they do not do so!
4. It will, in the following pages, be my object to point out many of
the causes of so much ill health among wives; ill health that
sometimes leads to barrenness; and to suggest remedies both for the
prevention and for the cure of such causes.
5. It is an astounding and lamentable fact, that one out of eight—
that twelve and a half per cent. of all the wives of England are barren,
are childless! A large majority of this twelve and a half per cent.
might be made fruitful, if a more judicious plan of procedure than is
at present pursued were adopted.
6. My anxious endeavors, in the following pages, will be to point
out remedies for the evil, and to lay down rules—rules which, I hope,
my fair reader will strenuously follow.
7. My theme, then, is Health—the Health of Wives—and the object
I shall constantly have in view will be the best means both of
preserving it and of restoring it when lost. By making a wife strong,
she will not only, in the majority of cases, be made fruitful, but
capable of bringing healthy children into the world. This latter
inducement is of great importance; for puny children are not only an
anxiety to their parents, but a misery to themselves, and a trouble to
all around! Besides, it is the children of England that are to be her
future men and women—her glory and her greatness! How desirable
it is, then, that her children should be hardy and strong!
8. A wife may be likened to a fruit tree, a child to its fruit. We all
know that it is as impossible to have fine fruit from an unhealthy tree
as to have a fine child from an unhealthy mother. In the one case, the
tree either does not bear fruit at all—is barren—or it bears
undersized, tasteless fruit,—fruit which often either immaturely
drops from the tree, or, if plucked from the tree, is useless; in the
other case, the wife either does not bear children—she is barren—or
she has frequent miscarriages—“untimely fruit”—or she bears puny,
sickly children, who often either drop into an early grave, or, if they
live, probably drag out a miserable existence. You may as well expect
“to gather grapes of thorns, or figs of thistles,” as healthy children
from unhealthy parents!
9. Unhealthy parents, then, as a matter of course have unhealthy
children; this is as truly the case as the night follows the day, and
should deter both man and woman so circumstanced from marrying.
There are numerous other complaints besides scrofula and insanity
inherited and propagated by parents. It is a fearful responsibility,
both to men and women, if they be not healthy, to marry. The result
must, as a matter of course, be misery!
10. If a wife is to be healthy and strong, she must use the means—
she must sow before she can reap; health will not come by merely
wishing for it! The means are not always at first agreeable; but, like
many other things, habit makes them so. Early rising, for instance, is
not agreeable to the lazy, and to one fond of her bed; but it is
essentially necessary to sound health. Exercise is not agreeable to the
indolent; but no woman can be really strong without it. Thorough
ablution of the whole body is distasteful and troublesome to one not
accustomed to much washing—to one laboring under a kind of
hydrophobia; but there is no perfect health without the daily
cleansing of the whole skin.
11. But all these processes entail trouble. True: is anything in this
world to be done without trouble? and is not the acquisition of
precious health worth trouble? Yes, it is worth more than all our
other acquisitions put together! Life without health is a burden; life
with health is a joy and gladness! Up, then, and arouse yourself, and
be doing! No time is to be lost if you wish to be well, to be a mother,
and to be a mother of healthy children. The misfortune of it is, many
ladies are more than half asleep, and are not aroused to danger till
danger stares them in the face; they are not cognizant of ill health
slowly creeping upon them, until, in too many cases, the time is gone
by for relief, and ill health has become confirmed—has become a part
and parcel of themselves; they do not lock the stable until the steed
be stolen; they do not use the means until the means are of no avail:
“Our remedies oft in ourselves do lie,
Which we ascribe to Heaven: the fated sky
Gives us free scope; only doth backward pull
Our slow designs, when we ourselves are dull.”[1]

12. Idleness is the mother of many diseases; she breeds them,

feeds them, and fosters them, and is, moreover, a great enemy to
fecundity. Idleness makes people miserable. I have heard a young
girl—surrounded with every luxury—bemoan her lot, and complain
that she was most unhappy in consequence of not having anything to
do, and who wished that she had been a servant, so that she might
have been obliged to work for her living. Idleness is certainly the
hardest work in the world.
13. It frequently happens that a lady, surrounded with every luxury
and every comfort, drags out a miserable existence; she cannot say
that she ever, even for a single day, really feels well and strong. This
is not to live—
 “For life is not to live, but to be well.”[2]

14. If a person be in perfect health, the very act of living is itself

thorough enjoyment, the greatest this world can ever bestow. How
needful it therefore is that all necessary instruction should be
imparted to every Young Wife, and that proper means should, in
every way, be used to insure health!
15. The judicious spending of the first year of married life is of the
greatest importance in the making and in the strengthening of a
wife’s constitution, and in preparing her for having a family. How
sad it is, then, that it is the first twelve months that is, as a rule,
especially chosen to mar and ruin her own health, and to make her
childless! The present fashionable system of spending the first few
months of married life in a round of visiting, of late hours, and in
close and heated rooms, calls loudly for a change. How many
valuable lives have been sacrificed to such a custom! How many
miscarriages, premature births, and still-born children, have resulted
therefrom! How many homes have been made childless—desolate—
by it! Time it is that common sense should take the place of such
folly! The present system is abominable, is rotten at the core, and is
fraught with the greatest danger to human life and human
happiness. How often a lady is, during the first year of her wifehood,
gadding out night after night,—one evening to a dinner party, the
next night to private theatricals, the third to an evening party, the
fourth to the theater, the fifth to a ball, the sixth to a concert, until in
some cases every night except Sunday night is consumed in this way,
—coming home frequently in the small hours of the morning,
through damp or fog, or rain or snow, feverish, flushed, and excited
—too tired until the morning to sleep, when she should be up, out,
and about. When the morning dawns she falls into a heavy,
unrefreshing slumber, and wakes not until noon, tired, and unfit for
the duties of the day! Night after night—gas, crowded rooms,
carbonic acid gas, late hours, wine, and excitement are her portion.
As long as such a plan is adopted the preacher preacheth but in vain.
Night after night, week after week, month after month, this game is
carried on, until at length either an illness or broken health
supervenes. Surely these are not the best means to insure health and
a family and healthy progeny! The fact is, a wife nowadays is too
artificial; she lives on excitement; it is like drinking no wine but