Errata
Notice
Some of these errata might have been corrected already in reprints of the book.
Please report errata to one of the authors or to Patrick Wüchner.
List of Errata
The following errata have been reported so far.
(Please note that the type setting in column "Problem Description" is limited. Please see the image linked in column "Correction"to view the proper layout.)
*QNMC2PS: The error was found by one of the co-authors or helping hands working on the Solution Book.
Page | Location | Quote | Problem Description | Correction | Reported by | |
---|---|---|---|---|---|---|
37 | Eq. (1.64) | details | Typo in the integral's start value: "o" should be "0". | details | Patrick Wüchner | |
38 | Table 1.5 | details | Use of the parameters for the Erlang and gamma distribution is inconsistent to earlier sections. Incomplete parameter list of the hyperexponential distribution. | details | Patrick Wüchner/ Christopher Auer | |
46 | Problem 1.1 | "is defined in (1.68)" | "Eq." missing. | "is defined in Eq. (1.68)" | QNMC2PS* | |
46 | Problem 1.2 | "is defined in (1.69)" | "Eq." missing. | "is defined in Eq. (1.69)" | QNMC2PS* | |
48 - 49 | Several | details | Inconsistent use of the parameters for the Erlang-distribution, compared to Section 1.3.1.2. | details | Christopher Auer | |
75 | Line 15 | "on both side of differential equation" | Typo | "on both sides of differential equation" | QNMC2PS* | |
75 | Line -10 | details | Typo - "Li" denotes a scalar element, not a vector. | details | QNMC2PS* | |
81 | Line -5 | details | Comma missing after "S". | details | QNMC2PS* | |
112 | Problem 2.1 | "With Definition 2.64" | There is no Definition 2.64, but an Eq. (2.64). | "With definition given by Eq. (2.64)" | QNMC2PS* | |
112 | Problem 2.2 | "With Definition 2.66" | There is no Definition 2.66, but an Eq. (2.66). | "With definition given by Eq. (2.66)" | QNMC2PS* | |
126 | Eq. (3.13) | details | Ensure that series does not converge to one. | details | Richard Holzer | |
126 | Line -12 | "We deal with multi-dimensional birth-death processes in Section 3.2 and in Chapter 7." | Typo in the chapter number. | "We deal with multi-dimensional birth-death processes in Section 3.2 and in Chapter 6." | QNMC2PS* | |
126 | Line -10 | "A special case of a birth-death process arises from M/M/1 queueing systems that will be treated in Chapter 7." | Typo in the chapter number. | "A special case of a birth-death process arises from M/M/1 queueing systems that will be treated in Chapter 6." | QNMC2PS* | |
132 | Eq. (3.33) | details | In the second summand (addend), the index of π needs to be one. | details | Patrick Wüchner | |
143 | Eq. (3.60) | details | Additional term. | details | QNMC2PS* | |
144 | Eq. (3.62) | details | Unnecessary term. | details | QNMC2PS* | |
144 | Eq. (3.63) | details | "z = 1" is inconsistent with Eq. (1.59). | details | QNMC2PS* | |
145 | Problem 3.6 | "interarrival time of 1 second" | Mean interarrival time should be greater than mean service time. | "interarrival time of 3 seconds" | QNMC2PS* | |
150 | Eq. (3.79) | details | "()" missing. | details | QNMC2PS* | |
151 | Problem 3.14 | "Rest period is constant at 1 second" details | The underlying (embedded) DTMC is not ergodic, because "λ * ( S + R ) = 1.2 > 1". Typo - "v0" denotes a scalar element, not a vector. | "Rest period is constant at 0.4 seconds" details | Dr. Gunter Bolch/ Christopher Auer | |
189 | Table 4.3 | details | Redundant "s". | details | Christopher Auer | |
189 | Line - 6 | details | Comma missing after "M - 1". | details | QNMC2PS* | |
206 | Eq. (4.32) | details | Eq. (4.32) is inconsistent with Table 4.5. | details | Christopher Auer | |
225 | Line -9 | "[n0x nI]" details | Incorrect dimension value. | "[nIx 1]" details | Patrick Wüchner/ Christopher Auer | |
226 | Eq. (5.48) | details | Second and third summand: The codomain of the index variable "J" needs to be less or equal "F - 1". | details | Christopher Auer | |
227 | Eq. (5.49) | details | Definition of "ΣFF" is missing. | details | Patrick Wüchner/ Christopher Auer | |
233 | Fig. 5.4 | details | Fig. 5.4 (a)-(b): All τ should be δ. Fig. 5.4 (b): All "x1iγ" should be "π∗1iγ" (i = 0,1,...,m). Fig. 5.4 (c): β should be α. | details | Patrick Wüchner/ Christopher Auer | |
234 | Line 2 | "i = 0,1,...2." details | Redundant "...". | "i = 0,1,2." details | Patrick Wüchner | |
234 | Line 10 | details | Incorrect numerator in first row, first column. | details | Christopher Auer | |
234 | Line -7 | details | "(0)" missing. | details | Christopher Auer | |
238 | Problem 5.8 | details | The integration bound "τ" should be "t". "τ" denotes in this issue the integration variable. | details | Christopher Auer | |
253 | Fig. 6.5 | details | Typo - "m" should be "M". | details | Patrick Wüchner | |
254 | Line 2 | "Such multidimensional state spaces, we modify the earlier notation for steady-state probabilities." | Word "for" is missing. | "For such multidimensional state spaces, we modify the earlier notation for steady-state probabilities." | QNMC2PS* | |
262 | Line -7 | details | Similar to the erratum on Page 38, Table 1.5, the parameters of the Erlang distribution should be made consistent to earlier sections. | details | QNMC2PS* | |
263 | Fig. 6.8 | details | Incomplete legend. | details | Patrick Wüchner | |
268 | Fig. 6.9 | "Appproximate" details | Typo. | "Approximate" details | Patrick Wüchner | |
285 | Line 15 | details | µmin and µmax have to be exchanged. | details | Patrick Wüchner | |
300 | Fig. 6.23 | details | The parameters µ and ν have to be exchanged. | details | QNMC2PS* | |
300 | Fig. 6.24 | details | An arrival in state (0,i) causes a transition to state (1,i), not to state (1,i-1). | details | QNMC2PS* | |
300 | Eqs. (6.187) - (6.189) | details | All "px,y" should be replaced by "πx,y" to ensure consistency. | details | QNMC2PS* | |
310 | Eq. (6.225) | details | "0" should be "D3" in first row, fourth column. | details | Patrick Wüchner | |
325 | Line -2 | "p0,js = The probability in an open network that a job from outside the network enters the jth node as a job of the sth class" details | Probability is used inconsistently. | "p0,js = The probability in an open network that a class-s job from outside the network enters the jth node" details | Richard Holzer | |
326 | Line 4-9 | details | Definition of "λr" is missing. | details | Richard Holzer | |
330 | Eq. (7.33) | (details) | Typo in the index variable. | details | Patrick Wüchner | |
338 | Fig. 7.11 | details | Typo in arc label from state (2,0,0) to state (1,1,0). | details | Osman Khalid, Patrick Wüchner | |
346 | Line 8 | details | Typo in the index variable. | details | Patrick Wüchner | |
346 | Line -1 | details | No error - helpful addition. | details | Patrick Wüchner | |
353 | Line 5 | "an allowed state in a queueing model" details | Misquotation - word "closed" is missing. | "an allowed state in a closed queueing model" details | Patrick Wüchner | |
355 | Eq. (7.71) | "2eir=" | Factor "2" is erroneous. | "eir=" | QNMC2PS* | |
359 | Eq. (7.77) | details | "Si" denotes a vector and should be bold-font. | details | Patrick Wüchner | |
362 | Line 6 | "The algorithm to determine the performance measures using the BCMP theorem can now be given in the following five steps:" | Holds only for open networks. | "The algorithm to determine the performance measures of open networks using the BCMP theorem can now be given in the following five steps:" | Patrick Wüchner | |
364 | Line 2 | "As shown in Example (7.7), the direct use of the BCMP theorem will require that all states of the network have to be considered in order to compute the normalization constant." | Not shown in Example (7.7). | "In general, the direct use of the BCMP theorem will require that all states of the network have to be considered in order to compute the normalization constant." | Patrick Wüchner | |
365 | Problem 7.4 | "with K = 3 nodes, N = 3 jobs" | Inconsistent usage of "K" and "N". | "with N = 3 nodes, K = 3 jobs" | QNMC2PS* | |
365 | Problem 7.4 | "p12 = 0.3, p12 = 0.1," | "p12" is given twice, "p13" is missing. | "p12 = 0.3, p13 = 0.1," | QNMC2PS* | |
366 | Problem 7.5 | -- | The Kendall's notation of the nodes is not given. | "All node types are M/M/1 - FCFS." | QNMC2PS* | |
394 | Eq. (8.46) | details | Argument "k" of "Tir(k)" should be bold-font: The argument must be the population vector. | details | Christopher Auer | |
419 | Problem 8.6 | "using the RECAL algorithm" | The RECAL algorithm is no longer introduced in the 2nd Edition. Use the MVA instead. | "using the MVA" | QNMC2PS* | |
428 | Step C3 | details | The "=" sign between "max" and its argument is needless. | details | Christopher Auer | |
432 | Step C1, Line 2 | "Compute using Eqs. (9.7)-(9.10),..." | Eq. (9.6) is also needed. | "Compute using Eqs. (9.6)-(9.10),..." | Svenja Lagershausen | |
438 | Step 2, Line 1 | "K = 2 jobs" | Should be "K - 1" jobs. | "K - 1 = 2 jobs" | Patrick Wüchner | |
438 | Step C2 | "K2(3) = 0.667" details | Typo - "K2(3)" should be "K2(2)". | "K2(2) = 0.667" details | Svenja Lagershausen | |
480 | Fig. 10.6 | details | "(λi,c2Bi)": Wrong coefficient of variation and index - should be: "(λi,c2Ai)". Coefficient of variation of the service time is missing - "(μi,c2Bi)". Index "D_i" should be "Di". | details | Patrick Wüchner | |
502 | Line -6 | "Eq. (10.186)" | Shown in Eq. (8.38). | "Eq. (8.38)" | QNMC2PS* | |
504 | Line 5 | -- | The routing probability p43 is missing. | "p43 = 0.1," | Svenja Lagershausen | |
505 | Eq. (10.89) | details | The "a" in the denominator has to be replaced by "ai". | details | QNMC2PS* | |
513 | Line 2 | "Eq. (8.31)" | Shown in Eq. (8.43). | "Eq. (8.43)" | Patrick Wüchner | |
541 | Fig. 10.35 | clic to view | Fig. 10.35 should be modified to be in line with Table 10.24. | details | QNMC2PS* | |
543 | Eq. (10.148) | details | "(M - 1)!" should be "(M - K)!". | details | QNMC2PS* | |
543 | Eq. (10.149) | details | "(M - 1)!" should be "(M - K)!". | details | QNMC2PS* | |
544 | Table 10.25 | details | The values for M = 50 are wrong. | details | QNMC2PS* | |
544 | Fig. 10.37 | "Disk n" details | Unclear "n". | "Disk U" details | Patrick Wüchner | |
545 | Line 12 | "as an simple M/G/1 queueing system" | Typo | "as a simple M/G/1 queueing system" | QNMC2PS* | |
546 | Step 2.4 | "any other product-form method method to calculate" | Redundant "method" | "any other product-form method to calculate" | QNMC2PS* | |
546 | Line -6 | "We assume ei = 1 for each node." | Unclear node definition. | "We assume ei = 1, i = 1,...,6, for each node (CPU and U = 5 disks)." | Patrick Wüchner | |
547 | Problem 10.5 | "Develop a stochastic reward net model for Example (10.17) and solve using SPNP." | Word "it" is missing. | "Develop a stochastic reward net model for Example (10.17) and solve it using SPNP." | QNMC2PS* | |
596 | Fig. 10.65 | details | Since m2=1, "2μ2" should be "μ2". | details | QNMC2PS* | |
704 | Line -4 | "the mean memory request time" details | Parameter "μi-1" is missing. | "the mean memory request time μi-1" details | Patrick Wüchner | |
704 | Line -2 | "In the absence of additional information, we assume pi = 1/n (i = 1,2,...,n)." details | Parameter "μ = 1" is missing. | "In the absence of additional information, we assume pi = 1/n (i = 1,2,...,n) and μ = 1." details | Patrick Wüchner | |
705 | Line -1 | "The mean service time at the processors is the mean time between the messages, and the mean service time at the network node N is the mean message delay at the network." | "N" should be removed - potential mix-up with number of nodes. | "The mean service time at the processors is the mean time between the messages, and the mean service time at the network node is the mean message delay at the network." | QNMC2PS* | |
706 | Fig. 13.4 | details | "N" should be removed - mix-up with number of nodes. | details | QNMC2PS* | |
706 | Line -6 | "The computing processors send I/O requests via the network N to the I/O processors and get the replies to these requests also via the network N." | "N" should be removed - potential mix-up with number of nodes. | "The computing processors send I/O requests via the network to the I/O processors and get the replies to these requests also via the network." | QNMC2PS* | |
707 | Fig. 13.5 | details |
| details | QNMC2PS* | |
714 | Table 13.5 | details | "q1" is undefined in this model. | details | QNMC2PS* | |
718 | Fig. 13.14 | details | Typo - "41345" should be "41435". | details | QNMC2PS* | |
719 | Problem 13.6 | "Verify the results of the communication system model just described using another queueing network package such as RESQ or QNAP2." | Problem needs to be rephrased since the RESQ and QNAP2 tools are no longer easily obtainable. | "Based on the model given in Fig. 13.14, verify the robustness property (see Section 10.1.4.1). For this, modify the model using M/M/m-FCFS and M/M/∞-IS nodes only. Then, evaluate the model using PEPSY and compare the results to Fig. 13.15." | QNMC2PS* | |
757 | Fig. 13.37 | details | Fig. 13.37 shows a wrong figure. | details | QNMC2PS* | |
757 | Table 10.38 | details | The values for "p60" and "p61" have to be exchanged. | details | QNMC2PS* | |
758 | Fig. 13.38 | details | Given source code is written in MOSEL, not in MOSEL-2. | click to download MOSEL-2 model | QNMC2PS* | |
761 | Fig. 13.41 | details | Typo - second "λ1" should be "λ2" and "λ2" should be "λ3". | details | QNMC2PS* | |
762 | Fig. 13.42 | details | Redundant token in P2R. | details | QNMC2PS* | |
763 | Line 16 | "Thus, in a polling system, as soon as a station transmits its message, it is ready to generate a new one after the reply to the last transmitted message has been received." | The single buffer polling system does not wait for the reply. | "Thus, in a polling system, as soon as a station transmits its message (i.e., is polled), it is ready to generate a new one." | Hoon Choi | |
763 | Line -20 | "We assume that the time until a client generates a request is exponentially distributed with mean 1/λ." | Description of μ is missing. | "We assume that the time until a client generates a request is exponentially distributed with mean 1/λ and the time to transmit this request is exponentially distributed with mean 1/μ." | Hoon Choi/ Patrick Wüchner | |
763 | Line -18 | "The time for the network to move from one station to the next station (polling time) is also assumed to be exponentially distributed with mean 1/γ." | Word "token" is missing. Another term for "polling time" is "walk time" (used in text later). | "The time for the network token to move from one station to the next station (polling time or walk time) is also assumed to be exponentially distributed with mean 1/γ." | Hoon Choi/ Patrick Wüchner | |
763 | Line -16 | "The processing time of a request at a server is exponentially distributed with mean 1/μ, and the time required for the server to process a request is assumed to be exponentially distributed with mean 1/β." | The processing time is denoted by η and the reply transfer time is denoted by β. | "The processing time of a request at a server is exponentially distributed with mean 1/η, and the time required for the server to transmit a reply message is assumed to be exponentially distributed with mean 1/β." | Hoon Choi/ Patrick Wüchner | |
763 | Line -3 | "The place PTA represents the condition that the network token has arrived." | PTA and PTS are mixed up. | "The place PTA represents the condition that the client's request is waiting for the network token to arrive. The place PTS represents the condition that the network token has arrived." | Hoon Choi/ Patrick Wüchner | |
764 | Line -15 | "This operation of the token ring network is called the single-token operation and is used in IEEE 802.5 token ring networks [Ibe87]." | The single- and multi-token operation is unclear. | "This operation of the token ring network is called the multiple-token operation and is slightly different from the single-token operation used in IEEE 802.5 token ring networks [Ibe87]." | Hoon Choi | |
764 | Line -11 | "In the case that the round-trip delay of the ring is lower than the transmission time, the two schemes become identical." | The term "the transmission time" is imprecise. | "In the case that the round-trip delay of the ring is lower than the packet transmission time, the two schemes become identical." | Hoon Choi | |
764 | Line -1 | " ... l* λ(0 ≤ l ≤ N - 1)." details | Formatting inconsistent to remainder of the book. | " ... l* λ, 0 ≤ l ≤ N - 1." details | Patrick Wüchner | |
765 | Fig. 13.45 | details | The arc from PC1 to the immediate transition s3 must be an inhibitor arc with multiplicity N-1. | details | Hoon Choi/ Patrick Wüchner | |
766 | Line 5 | "As soon as each member of the superclient subsystem has been polled, a PN token is deposited in both places PC1 and PC2." | Sentence should be more precise. | "Whenever a member of the superclient subsystem has been polled, a PN token is deposited in both places PC1 and PC2." | Hoon Choi/ Patrick Wüchner | |
766 | Line 14 | "This represents the condition that the network token leaves the superclient subsystem if fewer than N - 1 clients have been polled." | Word "not" is missing. | "This represents the condition that the network token does not leave the superclient subsystem if fewer than N - 1 clients have been polled." | Hoon Choi/ Patrick Wüchner | |
766 | Fig. 13.46 | details | The processing time is denoted by η (not λ). The transition from place PSI must be tsa(tta appears twice). | details | Hoon Choi/ Patrick Wüchner | |
767 | Line 1 | "The SRN for the subsystem is shown in Fig. 13.46." | Word "server" is missing. | "The SRN for the server subsystem is shown in Fig. 13.46." | Hoon Choi/ Patrick Wüchner | |
767 | Line 3 Line 5 | "A token in place PSI represents the condition that the server has received a request, while the place PTW (POW) represents the condition that a client from the superclient subsystem (the tagged client) is waiting for a reply to its request." | Without "PN" the word "token" is ambiguous. The terms "superclient subsystem" and "tagged client" are interchanged. |
| Hoon Choi | |
767 | Line 7 | "The firing rates of the timed transitions top, tss, and tsa are given by γ, β, and λ, respectively." | Typo - λ should be η. | "The firing rates of the timed transitions top, tss, and tsa are given by γ, β, and η, respectively." | Hoon Choi/ Patrick Wüchner | |
767 | Line 19 | "The tagged client's request cannot be replied to until requests from the superclient subsystem that arrived before it have been replied to, or stated differently." | Imprecise sentence. | "The tagged client's request cannot be replied to until requests from the superclient subsystem that arrived before it have been replied to." | Hoon Choi/ Patrick Wüchner | |
768 | Fig. 13.47 | details | The processing time is denoted by η (not λ). The transition after place PSI must be tsa(tta appears twice). The arc from PC1 to immediate transition s3 must be an inhibitor arc with multiplicity N-1. | details | Hoon Choi/ Patrick Wüchner | |
776 | Fig. 13.60 | details | Multiple inhibitor arc lacks "/". | details | Patrick Wüchner |