Diff of the two buildlogs: -- --- b1/build.log 2024-06-11 10:24:43.277465619 +0000 +++ b2/build.log 2024-06-11 10:28:45.675140871 +0000 @@ -1,6 +1,6 @@ I: pbuilder: network access will be disabled during build -I: Current time: Mon Jun 10 22:19:50 -12 2024 -I: pbuilder-time-stamp: 1718101190 +I: Current time: Tue Jul 15 06:47:46 +14 2025 +I: pbuilder-time-stamp: 1752511666 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/trixie-reproducible-base.tgz] I: copying local configuration @@ -30,51 +30,83 @@ dpkg-source: info: applying texinfo-absolute-path.patch I: Not using root during the build. I: Installing the build-deps -I: user script /srv/workspace/pbuilder/3855249/tmp/hooks/D02_print_environment starting +I: user script /srv/workspace/pbuilder/3555129/tmp/hooks/D01_modify_environment starting +debug: Running on infom02-amd64. +I: Changing host+domainname to test build reproducibility +I: Adding a custom variable just for the fun of it... +I: Changing /bin/sh to bash +'/bin/sh' -> '/bin/bash' +lrwxrwxrwx 1 root root 9 Jul 14 16:47 /bin/sh -> /bin/bash +I: Setting pbuilder2's login shell to /bin/bash +I: Setting pbuilder2's GECOS to second user,second room,second work-phone,second home-phone,second other +I: user script /srv/workspace/pbuilder/3555129/tmp/hooks/D01_modify_environment finished +I: user script /srv/workspace/pbuilder/3555129/tmp/hooks/D02_print_environment starting I: set - BUILDDIR='/build/reproducible-path' - BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' - BUILDUSERNAME='pbuilder1' - BUILD_ARCH='amd64' - DEBIAN_FRONTEND='noninteractive' + BASH=/bin/sh + BASHOPTS=checkwinsize:cmdhist:complete_fullquote:extquote:force_fignore:globasciiranges:globskipdots:hostcomplete:interactive_comments:patsub_replacement:progcomp:promptvars:sourcepath + BASH_ALIASES=() + BASH_ARGC=() + BASH_ARGV=() + BASH_CMDS=() + BASH_LINENO=([0]="12" [1]="0") + BASH_LOADABLES_PATH=/usr/local/lib/bash:/usr/lib/bash:/opt/local/lib/bash:/usr/pkg/lib/bash:/opt/pkg/lib/bash:. + BASH_SOURCE=([0]="/tmp/hooks/D02_print_environment" [1]="/tmp/hooks/D02_print_environment") + BASH_VERSINFO=([0]="5" [1]="2" [2]="21" [3]="1" [4]="release" [5]="x86_64-pc-linux-gnu") + BASH_VERSION='5.2.21(1)-release' + BUILDDIR=/build/reproducible-path + BUILDUSERGECOS='second user,second room,second work-phone,second home-phone,second other' + BUILDUSERNAME=pbuilder2 + BUILD_ARCH=amd64 + DEBIAN_FRONTEND=noninteractive DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=12 ' - DISTRIBUTION='trixie' - HOME='/root' - HOST_ARCH='amd64' + DIRSTACK=() + DISTRIBUTION=trixie + EUID=0 + FUNCNAME=([0]="Echo" [1]="main") + GROUPS=() + HOME=/root + HOSTNAME=i-capture-the-hostname + HOSTTYPE=x86_64 + HOST_ARCH=amd64 IFS=' ' - INVOCATION_ID='f7e4567abf024fddb0b49abeef38e4be' - LANG='C' - LANGUAGE='en_US:en' - LC_ALL='C' - MAIL='/var/mail/root' - OPTIND='1' - PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' - PBCURRENTCOMMANDLINEOPERATION='build' - PBUILDER_OPERATION='build' - PBUILDER_PKGDATADIR='/usr/share/pbuilder' - PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' - PBUILDER_SYSCONFDIR='/etc' - PPID='3855249' - PS1='# ' - PS2='> ' + INVOCATION_ID=7a336b1dc3f04c26a0ed802d7be8c095 + LANG=C + LANGUAGE=et_EE:et + LC_ALL=C + MACHTYPE=x86_64-pc-linux-gnu + MAIL=/var/mail/root + OPTERR=1 + OPTIND=1 + OSTYPE=linux-gnu + PATH=/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path + PBCURRENTCOMMANDLINEOPERATION=build + PBUILDER_OPERATION=build + PBUILDER_PKGDATADIR=/usr/share/pbuilder + PBUILDER_PKGLIBDIR=/usr/lib/pbuilder + PBUILDER_SYSCONFDIR=/etc + PIPESTATUS=([0]="0") + POSIXLY_CORRECT=y + PPID=3555129 PS4='+ ' - PWD='/' - SHELL='/bin/bash' - SHLVL='2' - SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.2GsSXFS9/pbuilderrc_4ySR --distribution trixie --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.2GsSXFS9/b1 --logfile b1/build.log octave-queueing_1.2.8-1.dsc' - SUDO_GID='109' - SUDO_UID='104' - SUDO_USER='jenkins' - TERM='unknown' - TZ='/usr/share/zoneinfo/Etc/GMT+12' - USER='root' - _='/usr/bin/systemd-run' + PWD=/ + SHELL=/bin/bash + SHELLOPTS=braceexpand:errexit:hashall:interactive-comments:posix + SHLVL=3 + SUDO_COMMAND='/usr/bin/timeout -k 24.1h 24h /usr/bin/ionice -c 3 /usr/bin/nice -n 11 /usr/bin/unshare --uts -- /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.2GsSXFS9/pbuilderrc_MNqm --distribution trixie --hookdir /etc/pbuilder/rebuild-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/trixie-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.2GsSXFS9/b2 --logfile b2/build.log octave-queueing_1.2.8-1.dsc' + SUDO_GID=109 + SUDO_UID=104 + SUDO_USER=jenkins + TERM=unknown + TZ=/usr/share/zoneinfo/Etc/GMT-14 + UID=0 + USER=root + _='I: set' I: uname -a - Linux infom01-amd64 6.1.0-21-cloud-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.90-1 (2024-05-03) x86_64 GNU/Linux + Linux i-capture-the-hostname 6.7.12+bpo-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.7.12-1~bpo12+1 (2024-05-06) x86_64 GNU/Linux I: ls -l /bin - lrwxrwxrwx 1 root root 7 Jun 8 11:25 /bin -> usr/bin -I: user script /srv/workspace/pbuilder/3855249/tmp/hooks/D02_print_environment finished + lrwxrwxrwx 1 root root 7 Jul 11 17:46 /bin -> usr/bin +I: user script /srv/workspace/pbuilder/3555129/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy @@ -697,7 +729,7 @@ Get: 575 http://deb.debian.org/debian trixie/main amd64 texlive-base all 2023.20240207-1 [22.0 MB] Get: 576 http://deb.debian.org/debian trixie/main amd64 texlive-font-utils all 2023.20240207-1 [7046 kB] Get: 577 http://deb.debian.org/debian trixie/main amd64 texlive-plain-generic all 2023.20240207-1 [29.0 MB] -Fetched 323 MB in 9s (35.4 MB/s) +Fetched 323 MB in 3s (113 MB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package readline-common. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 19687 files and directories currently installed.) @@ -3079,7 +3111,11 @@ Building tag database... -> Finished parsing the build-deps I: Building the package -I: Running cd /build/reproducible-path/octave-queueing-1.2.8/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../octave-queueing_1.2.8-1_source.changes +I: user script /srv/workspace/pbuilder/3555129/tmp/hooks/A99_set_merged_usr starting +Not re-configuring usrmerge for trixie +I: user script /srv/workspace/pbuilder/3555129/tmp/hooks/A99_set_merged_usr finished +hostname: Name or service not known +I: Running cd /build/reproducible-path/octave-queueing-1.2.8/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games:/i/capture/the/path" HOME="/nonexistent/second-build" dpkg-genchanges -S > ../octave-queueing_1.2.8-1_source.changes dpkg-buildpackage: info: source package octave-queueing dpkg-buildpackage: info: source version 1.2.8-1 dpkg-buildpackage: info: source distribution unstable @@ -3484,6 +3520,76 @@ Checking package... Run the unit tests... Checking m files ... +[inst/qsmm1k.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsmm1k.m +***** test + lambda = mu = 1; + K = 10; + [U R Q X p0] = qsmm1k(lambda,mu,K); + assert( Q, K/2, 1e-7 ); + assert( U, 1-p0, 1e-7 ); +***** test + lambda = 1; + mu = 1.2; + K = 10; + [U R Q X p0 pK] = qsmm1k(lambda, mu, K); + prob = qsmm1k(lambda, mu, K, 0:K); + assert( p0, prob(1), 1e-7 ); + assert( pK, prob(K+1), 1e-7 ); +***** test + # Compare the result with the equivalent Markov chain + lambda = 0.8; + mu = 0.8; + K = 10; + [U1 R1 Q1 X1] = qsmm1k( lambda, mu, K ); + birth = lambda*ones(1,K); + death = mu*ones(1,K); + q = ctmc(ctmcbd( birth, death )); + U2 = 1-q(1); + Q2 = dot( [0:K], q ); + assert( U1, U2, 1e-4 ); + assert( Q1, Q2, 1e-4 ); +***** demo + ## Given a M/M/1/K queue, compute the steady-state probability pk + ## of having n requests in the systen. + lambda = 0.2; + mu = 0.25; + K = 10; + n = 0:10; + pn = qsmm1k(lambda, mu, K, n); + plot(n, pn, "-o", "linewidth", 2); + xlabel("N. of requests (n)"); + ylabel("p_n"); + title(sprintf("M/M/1/%d system, \\lambda = %g, \\mu = %g", K, lambda, mu)); +3 tests, 3 passed, 0 known failure, 0 skipped +[inst/qncsbsb.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsbsb.m +***** test + fail("qncsbsb(-1,0)", "N must be"); + fail("qncsbsb(1,[])", "nonempty"); + fail("qncsbsb(1,[-1 2])", "nonnegative"); + fail("qncsbsb(1,[1 2],[1 2 3])", "incompatible size"); + fail("qncsbsb(1,[1 2 3],[1 2 3],[1 2])", "incompatible size"); + fail("qncsbsb(1,[1 2 3],[1 2 3],[1 2 1])", "M/M/1 servers"); + fail("qncsbsb(1,[1 2 3],[1 2 3],[1 1 1],-1)", "nonnegative"); + fail("qncsbsb(1,[1 2 3],[1 2 3],[1 1 1],[0 0])", "scalar"); +***** test + S = [1 0.8 1.2 0.5]; + V = [1 2 2 1]; + D = S .* V; + N = 50; + tol = 1e-7; # compensate for numerical inaccuracies + for n=1:N + [U R Q X] = qncsmva(n, S, V); + Xs = X(1)/V(1); + Rs = dot(R,V); + [Xl Xu Rl Ru] = qncsbsb( n, D ); + assert( Xl <= Xs+tol ); + assert( Xu >= Xs-tol ); + assert( Rl <= Rs+tol ); + assert( Ru >= Rs-tol ); + endfor +2 tests, 2 passed, 0 known failure, 0 skipped [inst/qnsolve.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnsolve.m ***** test @@ -3596,438 +3702,233 @@ N = [ 2 1 ]; [U R Q X] = qnsolve( "closed", N, QQ, V ); 9 tests, 9 passed, 0 known failure, 0 skipped -[inst/qncsmva.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsmva.m -***** test - fail( "qncsmva()", "Invalid" ); - fail( "qncsmva( 10, [1 2], [1 2 3] )", "incompatible size" ); - fail( "qncsmva( 10, [-1 1], [1 1] )", "nonnegative" ); - fail( "qncsmva( 10.3, [-1 1], [1 1] )", "integer" ); - fail( "qncsmva( -0.3, [-1 1], [1 1] )", "nonnegative" ); -***** test - qncsmva(1,1,1,1); - qncsmva(1,1,1,-1); - qncsmva(1,1,1,2); - qncsmva(1,[1 1],[1 1],[-1 -1]); - qncsmva(1,[1 1],[1 1],[1 1]); - qncsmva(1,[1 1],[1 1],[2 2]); -***** test - N = 0; - S = [1 2 3 4]; - V = [1 1 1 4]; - [U R Q X] = qncsmva(N, S, V); - assert( U, 0*S ); - assert( R, 0*S ); - assert( Q, 0*S ); - assert( X, 0*S ); -***** test - N = 0; - S = [1 2 3 4]; - V = [1 1 1 4]; - m = [2 3 4 5]; - [U R Q X] = qncsmva(N, S, V, m); - assert( U, 0*S ); - assert( R, 0*S ); - assert( Q, 0*S ); - assert( X, 0*S ); -***** test - # Exsample 3.42 p. 577 Jain - S = [ 0.125 0.3 0.2 ]'; - V = [ 16 10 5 ]; - N = 20; - m = ones(1,3)'; - Z = 4; - [U R Q X] = qncsmva(N,S,V,m,Z); - assert( R, [ .373 4.854 .300 ], 1e-3 ); - assert( Q, [ 1.991 16.177 0.500 ], 1e-3 ); - assert( all( U>=0 ) ); - assert( all( U<=1 ) ); - assert( Q, R.*X, 1e-5 ); # Little's Law -***** test - # Exsample 3.42 p. 577 Jain - S = [ 0.125 0.3 0.2 ]; - V = [ 16 10 5 ]; - N = 20; - m = ones(1,3); - Z = 4; - [U R Q X] = qncsmva(N,S,V,m,Z); - assert( R, [ .373 4.854 .300 ], 1e-3 ); - assert( Q, [ 1.991 16.177 0.500 ], 1e-3 ); - assert( all( U>=0 ) ); - assert( all( U<=1 ) ); - assert( Q, R.*X, 1e-5 ); # Little's Law +[inst/dtmcbd.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcbd.m ***** test - # Example 8.4 p. 333 Bolch et al. - S = [ .5 .6 .8 1 ]; - N = 3; - m = [2 1 1 -1]; - V = [ 1 .5 .5 1 ]; - [U R Q X] = qncsmva(N,S,V,m); - assert( Q, [ 0.624 0.473 0.686 1.217 ], 1e-3 ); - assert( X, [ 1.218 0.609 0.609 1.218 ], 1e-3 ); - assert( all(U >= 0 ) ); - assert( all(U( m>0 ) <= 1 ) ); - assert( Q, R.*X, 1e-5 ); # Little's Law + birth = [.5 .5 .3]; + death = [.6 .2 .3]; + fail("dtmcbd(birth,death)","must be"); +***** demo + birth = [ .2 .3 .4 ]; + death = [ .1 .2 .3 ]; + P = dtmcbd( birth, death ); + disp(P) +1 test, 1 passed, 0 known failure, 0 skipped +[inst/qncmmvabs.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmmvabs.m ***** test - # Example 8.3 p. 331 Bolch et al. - # This is a single-class network, which however nothing else than - # a special case of multiclass network - S = [ 0.02 0.2 0.4 0.6 ]; - K = 6; - V = [ 1 0.4 0.2 0.1 ]; - [U R Q X] = qncsmva(K, S, V); - assert( U, [ 0.198 0.794 0.794 0.595 ], 1e-3 ); - assert( R, [ 0.025 0.570 1.140 1.244 ], 1e-3 ); - assert( Q, [ 0.244 2.261 2.261 1.234 ], 1e-3 ); - assert( X, [ 9.920 3.968 1.984 0.992 ], 1e-3 ); + S = [ 1 3 3; 2 4 3]; + V = [ 1 1 3; 1 1 3]; + N = [ 1 1 ]; + m = [1 ; 1 ]; + Z = [2 2 2]; + fail( "qncmmvabs(N,S,V,m,Z)", "m must be" ); + m = [1 ; 1 ; 1]; + fail( "qncmmvabs(N,S,V,m,Z)", "Z must be" ); ***** test - # Check bound analysis - N = 10; # max population - for n=1:N - S = [1 0.8 1.2 0.5]; - V = [1 2 2 1]; - [U R Q X] = qncsmva(n, S, V); - Xs = X(1)/V(1); - Rs = dot(R,V); - # Compare with balanced system bounds - [Xlbsb Xubsb Rlbsb Rubsb] = qncsbsb( n, S .* V ); - assert( Xlbsb<=Xs ); - assert( Xubsb>=Xs ); - assert( Rlbsb<=Rs ); - assert( Rubsb>=Rs ); - # Compare with asymptotic bounds - [Xlab Xuab Rlab Ruab] = qncsaba( n, S .* V ); - assert( Xlab<=Xs ); - assert( Xuab>=Xs ); - assert( Rlab<=Rs ); - assert( Ruab>=Rs ); - endfor + S = [ 1 3; 2 4]; + V = [ 1 1; 1 1]; + N = [ 1 1 ]; + m = ones(1,2); + [U R Q X] = qncmmvabs(N,S,V,m); + assert( Q, [ .192 .808; .248 .752 ], 1e-3 ); + Xc = ( X(:,1)./V(:,1) )'; + assert( Xc, [ .154 .104 ], 1e-3 ); + # Compute the (overall) class-c system response time + R_c = N ./ Xc; + assert( R_c, [ 6.508 9.614 ], 5e-3 ); ***** demo - S = [ 0.125 0.3 0.2 ]; - V = [ 16 10 5 ]; - N = 20; - m = ones(1,3); - Z = 4; - [U R Q X] = qncsmva(N,S,V,m,Z); - X_s = X(1)/V(1); # System throughput - R_s = dot(R,V); # System response time - printf("\t Util Qlen RespT Tput\n"); - printf("\t-------- -------- -------- --------\n"); - for k=1:length(S) - printf("Dev%d\t%8.4f %8.4f %8.4f %8.4f\n", k, U(k), Q(k), R(k), X(k) ); - endfor - printf("\nSystem\t %8.4f %8.4f %8.4f\n\n", N-X_s*Z, R_s, X_s ); + S = [ 1, 1, 1, 1; 2, 1, 3, 1; 4, 2, 3, 3 ]; + V = ones(3,4); + N = [10 5 1]; + m = [1 0 1 1]; + [U R Q X] = qncmmvabs(N,S,V,m); ***** demo - SA = [300 40]; - p = .9; P = [ 0 1; 1-p p ]; - VA = qncsvisits(P); - SB = [300 30]; - p = .75; P = [ 0 1; 1-p p ]; - VB = qncsvisits(P); - Z = 1800; - NN = 1:100; - XA = XB = XA_mva = XB_mva = zeros(size(NN)); - for n=NN - [nc XA(n)] = qncsbsb(n, SA, VA, 1, Z); - [U R Q X] = qncsmva(n, SA, VA, 1, Z); - XA_mva(n) = X(1)/VA(1); - [nc XB(n)] = qncsbsb(n, SB, VB, 1, Z); - [U R Q X] = qncsmva(n, SB, VB, 1, Z); - XB_mva(n) = X(1)/VB(1); - endfor - plot(NN, XA, ":k", "linewidth", 1, - NN, XA_mva, "-b", "linewidth", 1, - NN, XB, ":k", "linewidth", 1, - NN, XB_mva, "-r", "linewidth", 1); - idx = 40; - displ = 2e-4; - text( NN(idx), XA(idx)-displ, "A) Large cache of slow disks"); - text( NN(idx), XB(idx)+displ, "B) Small cache of fast disks"); - ax = axis(); - ax(3) = 0; - ax(4) = 1.2*max([XA XB]); - axis(ax); - xlabel("Number of jobs"); - ylabel("System throughput (jobs/s)"); -9 tests, 9 passed, 0 known failure, 0 skipped -[inst/qncmvisits.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmvisits.m -***** test - - ## Closed, multiclass network + ## The following code produces Fig. 7 from the paper: M. Marzolla, "A GNU + ## Octave package for Queueing Networks and Markov Chains analysis", + ## submitted to the ACM Transactions on Mathematical Software. - C = 2; K = 3; - P = zeros(C,K,C,K); - P(1,1,1,2) = 1; - P(1,2,1,1) = 1; - P(2,1,2,3) = 1; - P(2,3,2,1) = 1; - V = qncmvisits(P); - for c=1:C - for k=1:K - assert(V(c,k), sum(sum(V .* P(:,:,c,k))), 1e-5); - endfor - endfor -***** test + N = 300; # total number of jobs + S = [100 140 200 30 50 20 10; # service demands + 180 10 70 10 90 130 30; + 280 160 150 90 20 50 18]; + Z = [2400 1800 2100]; # mean duration of CPU burst + V = ones(size(S)); # number of visits + m = ones(1,columns(S)); # number of servers - ## Test multiclass network. Example from Schwetman (figure 7, page 9 of - ## http://docs.lib.purdue.edu/cstech/259/ - ## "Testing network-of-queues software, technical report CSD-TR 330, - ## Purdue University). + beta = linspace(0.1, 0.9, 50); # population mix + Xsys = Rsys = NA(length(beta), length(beta)); - C = 2; K = 4; - P = zeros(C,K,C,K); - # class 1 routing - P(1,1,1,1) = .05; - P(1,1,1,2) = .45; - P(1,1,1,3) = .5; - P(1,2,1,1) = 1; - P(1,3,1,1) = 1; - # class 2 routing - P(2,1,2,1) = .01; - P(2,1,2,3) = .5; - P(2,1,2,4) = .49; - P(2,3,2,1) = 1; - P(2,4,2,1) = 1; - V = qncmvisits(P); - for c=1:C - for i=1:K - assert(V(c,i), sum(sum(V .* P(:,:,c,i))), 1e-5); + pop = zeros(1,rows(S)); + tic; + for i=1:length(beta) + for j=1:length(beta) + pop(1) = round(beta(i)*N); + pop(2) = round(beta(j)*N); + pop(3) = N - pop(1) - pop(2); + if (all(pop > 0)) + [U R Q X] = qncmmvabs( pop, S, V, m, Z, 1e-5, 1000 ); + X1 = X(1,2) / V(1,2); + X2 = X(2,2) / V(2,2); + X3 = X(3,2) / V(3,2); + Xsys(i,j) = X1 + X2 + X3; + Rsys(i,j) = N / Xsys(i,j); + endif endfor endfor + toc; + minX = min(Xsys(:)); + maxX = max(Xsys(:)); + Xnew = Xsys; Xnew(isna(Xnew)) = maxX+1; + mycmap = jet; + mycmap(end,:) = 1; # make the last colormap entry white + imshow(Xnew, [minX, maxX], "Xdata", beta, "Ydata", beta, "colormap", mycmap); + colorbar; + hold on; + title("System throughput"); + xlabel("\\beta_2"); + ylabel("\\beta_1"); + [XX YY] = meshgrid(beta, beta); + contour(XX, YY, Xsys, "k", "linewidth", 1.5); + axis on; + hold off; +2 tests, 2 passed, 0 known failure, 0 skipped +[inst/qsammm.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsammm.m ***** test - - ## Network with class switching. - ## This is the example in figure 9 of - ## Schwetman, "Implementing the Mean Value Analysis - ## Algorithm fort the solution of Queueing Network Models", Technical - ## Report CSD-TR-355, Department of Computer Science, Purdue Univrsity, - ## Feb 15, 1982, http://docs.lib.purdue.edu/cstech/286/ - - C = 2; K = 3; - S = [.01 .07 .10; ... - .05 0.7 .10 ]; - P = zeros(C,K,C,K); - P(1,1,1,2) = .7; - P(1,1,1,3) = .2; - P(1,1,2,1) = .1; - P(2,1,2,2) = .3; - P(2,1,2,3) = .5; - P(2,1,1,1) = .2; - P(1,2,1,1) = P(1,3,1,1) = 1; - P(2,2,2,1) = P(2,3,2,1) = 1; - N = [3 0]; - V = qncmvisits(P); - VV = [10 7 2; 5 1.5 2.5]; # result given in Schwetman; our function computes something different, but that's ok since visit counts are actually ratios - assert( V ./ repmat(V(:,1),1,K), VV ./ repmat(VV(:,1),1,K), 1e-5 ); -***** test - - ## two disjoint classes: must produce two disjoing chains - - C = 2; K = 3; - P = zeros(C,K,C,K); - P(1,1,1,2) = 1; - P(1,2,1,1) = 1; - P(2,1,2,3) = 1; - P(2,3,2,1) = 1; - [nc r] = qncmvisits(P); - assert( r(1) != r(2) ); -***** test - - ## two classes, one chain - - C = 2; K = 3; - P = zeros(C,K,C,K); - P(1,1,1,2) = .5; - P(1,2,2,1) = 1; - P(2,1,2,3) = .5; - P(2,3,1,1) = 1; - [nc r] = qncmvisits(P); - assert( r(1) == r(2) ); -***** test - - ## a "Moebius strip". Note that this configuration is invalid, and - ## therefore our algorithm must raise an error. This is because this - ## network has two chains, but both chains contain both classes - - C = 2; K = 2; - P = zeros(C,K,C,K); - P(1,1,2,2) = 1; - P(2,2,1,1) = 1; - P(2,1,1,2) = 1; - P(1,2,2,1) = 1; - fail( "qncmvisits(P)", "different"); -***** test - - ## Network with two classes representing independent chains. - ## This is example in figure 8 of - ## Schwetman, "Implementing the Mean Value Analysis - ## Algorithm fort the solution of Queueing Network Models", Technical - ## Report CSD-TR-355, Department of Computer Science, Purdue Univrsity, - ## Feb 15, 1982, http://docs.lib.purdue.edu/cstech/286/ - - C = 2; K = 2; - P = zeros(C,K,C,K); - P(1,1,1,3) = P(1,3,1,1) = 1; - P(2,2,2,3) = P(2,3,2,2) = 1; - V = qncmvisits(P,[1,2]); - assert( V, [1 0 1; 0 1 1], 1e-5 ); -***** test - C = 2; - K = 3; - P = zeros(C,K,C,K); - P(1,1,1,2) = 1; - P(1,2,1,3) = 1; - P(1,3,2,2) = 1; - P(2,2,1,1) = 1; - [V ch] = qncmvisits(P); - assert( ch, [1 1] ); -***** test - C = 2; - K = 3; - P = zeros(C,K,C,K); - P(1,1,1,2) = 1; - P(1,2,1,3) = 1; - P(1,3,2,2) = 1; - P(2,2,2,1) = 1; - P(2,1,1,2) = 1; - [V ch] = qncmvisits(P); - assert( ch, [1 1] ); -9 tests, 9 passed, 0 known failure, 0 skipped -[inst/dtmcfpt.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcfpt.m -***** test - P = [1 1 1; 1 1 1]; - fail( "dtmcfpt(P)" ); -***** test - P = dtmcbd([1 1 1], [0 0 0] ); - fail( "dtmcfpt(P)", "absorbing" ); -***** test - P = [ 0.0 0.9 0.1; ... - 0.1 0.0 0.9; ... - 0.9 0.1 0.0 ]; - p = dtmc(P); - M = dtmcfpt(P); - assert( diag(M)', 1./p, 1e-8 ); + [U R Q X] = qsammm( 73,[10,15,20,20,25] ); + assert( U, 0.81, 1e-2 ); + assert( Q, 6.5278, 1e-4 ); +1 test, 1 passed, 0 known failure, 0 skipped +[inst/qncsmvablo.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsmvablo.m ***** test - P = [ 0 1 0 0 0; ... - .25 .0 .75 0 0; ... - 0 .5 0 .5 0; ... - 0 0 .75 0 .25; ... - 0 0 0 1 0 ]; - M = dtmcfpt(P); - assert( M, [16 1 2.6667 6.3333 21.3333; ... - 15 4 1.6667 5.3333 20.3333; ... - 18.6667 3.6667 2.6667 3.6667 18.6667; ... - 20.3333 5.3333 1.6667 4 15; ... - 21.3333 6.3333 2.6667 1 16 ], 1e-4 ); + fail( "qncsmvablo( 10, [1 1], [4 5], [0 1; 1 0] )", "capacity"); + fail( "qncsmvablo( 6, [1 1], [4 5], [0 1; 1 1] )", "stochastic"); + fail( "qncsmvablo( 5, [1 1 1], [1 1], [0 1; 1 1] )", "3 elements"); ***** test - sz = 10; - P = reshape( 1:sz^2, sz, sz ); - normP = repmat(sum(P,2),1,columns(P)); - P = P./normP; - M = dtmcfpt(P); - for i=1:rows(P) - for j=1:columns(P) - assert( M(i,j), 1 + dot(P(i,:), M(:,j)) - P(i,j)*M(j,j), 1e-8); - endfor - endfor + # This is the example on section v) p. 422 of the reference paper + M = [12 10 14]; + P = [0 1 0; 0 0 1; 1 0 0]; + S = [1/1 1/2 1/3]; + K = 27; + [U R Q X]=qncsmvablo( K, S, M, P ); + assert( R, [11.80 1.66 14.4], 1e-2 ); ***** test - P = zeros(9,9); - P(1,[2 4]) = .5; - P(2,[1 5 3]) = 1/3; - P(3,[2 6]) = .5; - P(4,[1 5 7]) = 1/3; - P(5,[2 4 6 8]) = 1/4; - P(6,[3 5 9]) = 1/3; - P(7,[4 8]) = .5; - P(8,[7 5 9]) = 1/3; - P(9,[6 8]) = .5; - M = dtmcfpt(P); - assert( M(1:9 != 5,5)', [6 5 6 5 5 6 5 6], 100*eps ); -6 tests, 6 passed, 0 known failure, 0 skipped -[inst/qsmmmk.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsmmmk.m + # This is example 2, i) and ii) p. 424 of the reference paper + M = [4 5 5]; + S = [1.5 2 1]; + P = [0 1 0; 0 0 1; 1 0 0]; + K = 10; + [U R Q X]=qncsmvablo( K, S, M, P ); + assert( R, [6.925 8.061 4.185], 1e-3 ); + K = 12; + [U R Q X]=qncsmvablo( K, S, M, P ); + assert( R, [7.967 9.019 8.011], 1e-3 ); ***** test - lambda = mu = m = 1; - k = 10; - [U R Q X p0] = qsmmmk(lambda,mu,m,k); - assert( Q, k/2, 1e-7 ); - assert( U, 1-p0, 1e-7 ); + # This is example 3, i) and ii) p. 424 of the reference paper + M = [8 7 6]; + S = [0.2 1.2 1.4]; + P = [ 0 0.5 0.5; 1 0 0; 1 0 0 ]; + K = 10; + [U R Q X] = qncsmvablo( K, S, M, P ); + assert( R, [1.674 5.007 7.639], 1e-3 ); + K = 12; + [U R Q X] = qncsmvablo( K, S, M, P ); + assert( R, [2.166 5.372 6.567], 1e-3 ); ***** test - lambda = [1 0.8 2 9.2 0.01]; - mu = lambda + 0.17; - k = 12; - [U1 R1 Q1 X1] = qsmm1k(lambda,mu,k); - [U2 R2 Q2 X2] = qsmmmk(lambda,mu,1,k); + # Network which never blocks, central server model + M = [50 50 50]; + S = [1 1/0.8 1/0.4]; + P = [0 0.7 0.3; 1 0 0; 1 0 0]; + K = 40; + [U1 R1 Q1] = qncsmvablo( K, S, M, P ); + V = qncsvisits(P); + [U2 R2 Q2] = qncsmva( K, S, V ); assert( U1, U2, 1e-5 ); assert( R1, R2, 1e-5 ); assert( Q1, Q2, 1e-5 ); - assert( X1, X2, 1e-5 ); - #assert( [U1 R1 Q1 X1], [U2 R2 Q2 X2], 1e-5 ); -***** test - lambda = 0.9; - mu = 0.75; - k = 10; - [U1 R1 Q1 X1 p01] = qsmmmk(lambda,mu,1,k); - [U2 R2 Q2 X2 p02] = qsmm1k(lambda,mu,k); - assert( [U1 R1 Q1 X1 p01], [U2 R2 Q2 X2 p02], 1e-5 ); -***** test - lambda = 0.8; - mu = 0.85; - m = 3; - k = 5; - [U1 R1 Q1 X1 p0] = qsmmmk( lambda, mu, m, k ); - birth = lambda*ones(1,k); - death = [ mu*linspace(1,m,m) mu*m*ones(1,k-m) ]; - q = ctmc(ctmcbd( birth, death )); - U2 = dot( q, min( 0:k, m )/m ); - assert( U1, U2, 1e-4 ); - Q2 = dot( [0:k], q ); - assert( Q1, Q2, 1e-4 ); - assert( p0, q(1), 1e-4 ); -***** test - # This test comes from an example I found on the web - lambda = 40; - mu = 30; - m = 3; - k = 7; - [U R Q X p0] = qsmmmk( lambda, mu, m, k ); - assert( p0, 0.255037, 1e-6 ); - assert( R, 0.036517, 1e-6 ); +5 tests, 5 passed, 0 known failure, 0 skipped +[inst/engset.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/engset.m ***** test - # This test comes from an example I found on the web - lambda = 50; - mu = 10; - m = 4; - k = 6; - [U R Q X p0 pk] = qsmmmk( lambda, mu, m, k ); - assert( pk, 0.293543, 1e-6 ); + fail("erlangb(1, -1)", "positive"); + fail("erlangb(-1, 1)", "positive"); + fail("erlangb(1, 0)", "positive"); + fail("erlangb(0, 1)", "positive"); + fail("erlangb('foo',1)", "positive"); + fail("erlangb(1,'bar')", "positive"); + fail("erlangb([1 1],[1 1 1])","common size"); +1 test, 1 passed, 0 known failure, 0 skipped +[inst/ctmctaexps.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmctaexps.m ***** test - # This test comes from an example I found on the web - lambda = 3; - mu = 2; - m = 2; - k = 5; - [U R Q X p0 pk] = qsmmmk( lambda, mu, m, k ); - assert( p0, 0.179334, 1e-6 ); - assert( pk, 0.085113, 1e-6 ); - assert( Q, 2.00595, 1e-5 ); - assert( R-1/mu, 0.230857, 1e-6 ); # waiting time in the queue + Q = [ 0 0.1 0 0; ... + 0.9 0 0.1 0; ... + 0 0.9 0 0.1; ... + 0 0 0 0 ]; + Q -= diag( sum(Q,2) ); + M = ctmctaexps(Q, [1 0 0 0]); + assert( sum(M), 1, 10*eps ); ***** demo - ## Given a M/M/m/K queue, compute the steady-state probability pn - ## of having n jobs in the systen. - lambda = 0.2; - mu = 0.25; - m = 5; - K = 20; - n = 0:10; - pn = qsmmmk(lambda, mu, m, K, n); - plot(n, pn, "-o", "linewidth", 2); - xlabel("N. of jobs (n)"); - ylabel("P_n"); - title(sprintf("M/M/%d/%d system, \\lambda = %g, \\mu = %g", m, K, lambda, mu)); -7 tests, 7 passed, 0 known failure, 0 skipped + lambda = 0.5; + N = 4; + birth = lambda*linspace(1,N-1,N-1); + death = zeros(1,N-1); + Q = diag(birth,1)+diag(death,-1); + Q -= diag(sum(Q,2)); + t = linspace(1e-5,30,100); + p = zeros(1,N); p(1)=1; + M = zeros(length(t),N); + for i=1:length(t) + M(i,:) = ctmctaexps(Q,t(i),p); + endfor + clf; + plot(t, M(:,1), ";State 1;", "linewidth", 2, ... + t, M(:,2), ";State 2;", "linewidth", 2, ... + t, M(:,3), ";State 3;", "linewidth", 2, ... + t, M(:,4), ";State 4 (absorbing);", "linewidth", 2 ); + legend("location","east"); legend("boxoff"); + xlabel("Time"); + ylabel("Time-averaged Expected sojourn time"); +***** demo + sec = 1; + min = sec*60; + hour = 60*min; + day = 24*hour; + + # state space enumeration {2, RC, RB, 1, 0} + a = 1/(10*min); # 1/a = duration of reboot (10 min) + b = 1/(30*sec); # 1/b = reconfiguration time (30 sec) + g = 1/(5000*hour); # 1/g = processor MTTF (5000 hours) + d = 1/(4*hour); # 1/d = processor MTTR (4 hours) + c = 0.9; # coverage + Q = [ -2*g 2*c*g 2*(1-c)*g 0 0; ... + 0 -b 0 b 0; ... + 0 0 -a a 0; ... + d 0 0 -(g+d) g; ... + 0 0 0 d -d]; + p = ctmc(Q); + printf("System availability: %f\n",p(1)+p(4)); + TT = linspace(0,1*day,101); + PP = ctmctaexps(Q,TT,[1 0 0 0 0]); + A = At = Abart = zeros(size(TT)); + A(:) = p(1) + p(4); # steady-state availability + for n=1:length(TT) + t = TT(n); + p = ctmc(Q,t,[1 0 0 0 0]); + At(n) = p(1) + p(4); # instantaneous availability + Abart(n) = PP(n,1) + PP(n,4); # interval base availability + endfor + clf; + semilogy(TT,A,";Steady-state;", ... + TT,At,";Instantaneous;", ... + TT,Abart,";Interval base;"); + ax = axis(); + ax(3) = 1-1e-5; + axis(ax); + legend("boxoff"); +1 test, 1 passed, 0 known failure, 0 skipped [inst/qsmmm.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsmmm.m ***** demo @@ -4108,451 +4009,71 @@ legend("boxoff"); title(sprintf("PMF of M/M/\\infty and M/M/m systems, \\lambda = %g, \\mu = %g", lambda, mu)); 3 tests, 3 passed, 0 known failure, 0 skipped -[inst/qncmmvabs.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmmvabs.m -***** test - S = [ 1 3 3; 2 4 3]; - V = [ 1 1 3; 1 1 3]; - N = [ 1 1 ]; - m = [1 ; 1 ]; - Z = [2 2 2]; - fail( "qncmmvabs(N,S,V,m,Z)", "m must be" ); - m = [1 ; 1 ; 1]; - fail( "qncmmvabs(N,S,V,m,Z)", "Z must be" ); -***** test - S = [ 1 3; 2 4]; - V = [ 1 1; 1 1]; - N = [ 1 1 ]; - m = ones(1,2); - [U R Q X] = qncmmvabs(N,S,V,m); - assert( Q, [ .192 .808; .248 .752 ], 1e-3 ); - Xc = ( X(:,1)./V(:,1) )'; - assert( Xc, [ .154 .104 ], 1e-3 ); - # Compute the (overall) class-c system response time - R_c = N ./ Xc; - assert( R_c, [ 6.508 9.614 ], 5e-3 ); -***** demo - S = [ 1, 1, 1, 1; 2, 1, 3, 1; 4, 2, 3, 3 ]; - V = ones(3,4); - N = [10 5 1]; - m = [1 0 1 1]; - [U R Q X] = qncmmvabs(N,S,V,m); -***** demo - ## The following code produces Fig. 7 from the paper: M. Marzolla, "A GNU - ## Octave package for Queueing Networks and Markov Chains analysis", - ## submitted to the ACM Transactions on Mathematical Software. - - N = 300; # total number of jobs - S = [100 140 200 30 50 20 10; # service demands - 180 10 70 10 90 130 30; - 280 160 150 90 20 50 18]; - Z = [2400 1800 2100]; # mean duration of CPU burst - V = ones(size(S)); # number of visits - m = ones(1,columns(S)); # number of servers - - beta = linspace(0.1, 0.9, 50); # population mix - Xsys = Rsys = NA(length(beta), length(beta)); - - pop = zeros(1,rows(S)); - tic; - for i=1:length(beta) - for j=1:length(beta) - pop(1) = round(beta(i)*N); - pop(2) = round(beta(j)*N); - pop(3) = N - pop(1) - pop(2); - if (all(pop > 0)) - [U R Q X] = qncmmvabs( pop, S, V, m, Z, 1e-5, 1000 ); - X1 = X(1,2) / V(1,2); - X2 = X(2,2) / V(2,2); - X3 = X(3,2) / V(3,2); - Xsys(i,j) = X1 + X2 + X3; - Rsys(i,j) = N / Xsys(i,j); - endif - endfor - endfor - toc; - minX = min(Xsys(:)); - maxX = max(Xsys(:)); - Xnew = Xsys; Xnew(isna(Xnew)) = maxX+1; - mycmap = jet; - mycmap(end,:) = 1; # make the last colormap entry white - imshow(Xnew, [minX, maxX], "Xdata", beta, "Ydata", beta, "colormap", mycmap); - colorbar; - hold on; - title("System throughput"); - xlabel("\\beta_2"); - ylabel("\\beta_1"); - [XX YY] = meshgrid(beta, beta); - contour(XX, YY, Xsys, "k", "linewidth", 1.5); - axis on; - hold off; -2 tests, 2 passed, 0 known failure, 0 skipped -[inst/qnom.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnom.m -***** test - fail( "qnom([1 1], [.9; 1.0])", "exceeded at center 1"); - fail( "qnom([1 1], [0.9 .9; 0.9 1.0])", "exceeded at center 2"); - #qnom([1 1], [.9; 1.0],[],2); # should not fail, M/M/2-FCFS - #qnom([1 1], [.9; 1.0],[],-1); # should not fail, -/G/1-PS - fail( "qnom(1./[2 3], [1.9 1.9 0.9; 2.9 3.0 2.9])", "exceeded at center 2"); - #qnom(1./[2 3], [1 1.9 0.9; 0.3 3.0 1.5],[],[1 2 1]); # should not fail -***** test - V = [1 1; 1 1]; - S = [1 3; 2 4]; - lambda = [3/19 2/19]; - [U R Q X] = qnom(lambda, S, diag( lambda / sum(lambda) ) * V ); - assert( U(1,1), 3/19, 1e-6 ); - assert( U(2,1), 4/19, 1e-6 ); - assert( R(1,1), 19/12, 1e-6 ); - assert( R(1,2), 57/2, 1e-6 ); - assert( Q(1,1), .25, 1e-6 ); - assert( Q, R.*X, 1e-5 ); # Little's Law -***** test - # example p. 138 Zahorjan et al. - V = [ 10 9; 5 4]; - S = [ 1/10 1/3; 2/5 1]; - lambda = [3/19 2/19]; - [U R Q X] = qnom(lambda, S, diag( lambda / sum(lambda) ) * V ); - assert( X(1,1), 1.58, 1e-2 ); - assert( U(1,1), .158, 1e-3 ); - assert( R(1,1), .158, 1e-3 ); # modified from the original example, as the reference above considers R as the residence time, not the response time - assert( Q(1,1), .25, 1e-2 ); - assert( Q, R.*X, 1e-5 ); # Little's Law -***** test - # example 7.7 p. 304 Bolch et al. Please note that the book uses the - # notation P(i,r,j,s) (i,j are service centers, r,s are job - # classes) while the queueing package uses P(r,i,s,j) - P = zeros(2,3,2,3); - lambda = S = zeros(2,3); - P(1,1,1,2) = 0.4; - P(1,1,1,3) = 0.3; - P(1,2,1,1) = 0.6; - P(1,2,1,3) = 0.4; - P(1,3,1,1) = 0.5; - P(1,3,1,2) = 0.5; - P(2,1,2,2) = 0.3; - P(2,1,2,3) = 0.6; - P(2,2,2,1) = 0.7; - P(2,2,2,3) = 0.3; - P(2,3,2,1) = 0.4; - P(2,3,2,2) = 0.6; - S(1,1) = 1/8; - S(1,2) = 1/12; - S(1,3) = 1/16; - S(2,1) = 1/24; - S(2,2) = 1/32; - S(2,3) = 1/36; - lambda(1,1) = lambda(2,1) = 1; - V = qnomvisits(P,lambda); - assert( V, [ 3.333 2.292 1.917; 10 8.049 8.415] ./ 2, 1e-3); - [U R Q X] = qnom(sum(lambda,2), S, V); - assert( sum(U,1), [0.833 0.442 0.354], 1e-3 ); - # Note: the value of K_22 (corresponding to Q(2,2)) reported in the book - # is 0.5. However, hand computation using the exact same formulas - # from the book produces a different value, 0.451 - assert( Q, [2.5 0.342 0.186; 2.5 0.451 0.362], 1e-3 ); -***** test - P = zeros(2,2,2,2); - P(1,1,1,2) = 0.8; P(1,2,1,1) = 1; - P(2,1,2,2) = 0.9; P(2,2,2,1) = 1; - S = zeros(2,2); - S(1,1) = 1.5; S(1,2) = 1.2; - S(2,1) = 0.8; S(2,2) = 2.5; - lambda = zeros(2,2); - lambda(1,1) = 1/20; - lambda(2,1) = 1/30; - [U1 R1 Q1 X1] = qnom(lambda, S, P); # qnom_cs - [U2 R2 Q2 X2] = qnom(sum(lambda,2), S, qnomvisits(P,lambda)); # qnom_nocs - assert( U1, U2, 1e-5 ); - assert( R1, R2, 1e-5 ); - assert( Q1, Q2, 1e-5 ); - assert( X1, X2, 1e-5 ); -***** demo - P = zeros(2,2,2,2); - lambda = zeros(2,2); - S = zeros(2,2); - P(1,1,2,1) = P(1,2,2,1) = 0.2; - P(1,1,2,2) = P(2,2,2,2) = 0.8; - S(1,1) = S(1,2) = 0.1; - S(2,1) = S(2,2) = 0.05; - rr = 1:100; - Xk = zeros(2,length(rr)); - for r=rr - lambda(1,1) = lambda(1,2) = 1/r; - [U R Q X] = qnom(lambda,S,P); - Xk(:,r) = sum(X,1)'; - endfor - plot(rr,Xk(1,:),";Server 1;","linewidth",2, ... - rr,Xk(2,:),";Server 2;","linewidth",2); - legend("boxoff"); - xlabel("Class 1 interarrival time"); - ylabel("Throughput"); -5 tests, 5 passed, 0 known failure, 0 skipped -[inst/dtmcisir.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcisir.m -***** test - P = [0 .5 0; 0 0 0]; - fail( "dtmcisir(P)" ); +[inst/ctmcmtta.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcmtta.m ***** test - P = [0 1 0; 0 .5 .5; 0 1 0]; - [r s] = dtmcisir(P); - assert( r == 0 ); - assert( max(s), 2 ); - assert( min(s), 1 ); + Q = [0 1 0; 1 0 1; 0 1 0 ]; Q -= diag( sum(Q,2) ); + fail( "ctmcmtta(Q,[1 0 0])", "no absorbing"); ***** test - P = [.5 .5 0; .2 .3 .5; 0 .2 .8]; - [r s] = dtmcisir(P); - assert( r == 1 ); - assert( max(s), 1 ); - assert( min(s), 1 ); -3 tests, 3 passed, 0 known failure, 0 skipped -[inst/qnosbsb.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnosbsb.m + Q = [0 1 0; 1 0 1; 0 0 0; 0 0 0 ]; + fail( "ctmcmtta(Q,[1 0 0])", "square matrix"); ***** test - fail( "qnosbsb( 0.1, [] )", "vector" ); - fail( "qnosbsb( 0.1, [0 -1])", "nonnegative" ); - fail( "qnosbsb( 0, [1 2] )", "lambda" ); - fail( "qnosbsb( -1, [1 2])", "lambda" ); + Q = [0 1 0; 1 0 1; 0 0 0 ]; + fail( "ctmcmtta(Q,[1 0 0])", "infinitesimal"); ***** test - [Xl Xu Rl Ru] = qnosbsb(0.1,[1 2 3]); - assert( Xl, 0 ); -2 tests, 2 passed, 0 known failure, 0 skipped -[inst/qsmminf.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsmminf.m + Q = [ 0 0.1 0 0; ... + 0.9 0 0.1 0; ... + 0 0.9 0 0.1; ... + 0 0 0 0 ]; + Q -= diag( sum(Q,2) ); + assert( ctmcmtta( Q,[0 0 0 1] ), 0 ); # state 4 is absorbing ***** test - fail( "qsmminf( [1 2], [1 2 3] )", "incompatible size"); - fail( "qsmminf( [-1 -1], [1 1] )", ">0" ); + Q = [-1 1; 0 0]; + assert( ctmcmtta( Q, [0 1] ), 0 ); # state 2 is absorbing + assert( ctmcmtta( Q, [1 0] ), 1 ); # the result has been computed by hand ***** demo - ## Given a M/M/inf and M/M/m queue, compute the steady-state probability pk - ## of having k requests in the systen. - lambda = 5; - mu = 1.1; - m = 5; - k = 0:20; - pk_inf = qsmminf(lambda, mu, k); - pk_m = qsmmm(lambda, mu, 5, k); - plot(k, pk_inf, "-o;M/M/\\infty;", "linewidth", 2, ... - k, pk_m, "-x;M/M/5;", "linewidth", 2); - xlabel("N. of requests (k)"); - ylabel("P_k"); - title(sprintf("M/M/\\infty and M/M/%d systems, \\lambda = %g, \\mu = %g", m, lambda, mu)); -1 test, 1 passed, 0 known failure, 0 skipped -[inst/qncsconvld.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsconvld.m -***** test - K=3; - S = [ 1 1 1; 1 1 1 ]; - V = [ 1 .667 .2 ]; - fail( "qncsconvld(K,S,V)", "size mismatch" ); -***** test - # Example 8.1 p. 318 Bolch et al. - K=3; - S = [ 1/0.8 ./ [1 2 2]; - 1/0.6 ./ [1 2 3]; - 1/0.4 ./ [1 1 1] ]; - V = [ 1 .667 .2 ]; - [U R Q X G] = qncsconvld( K, S, V ); - assert( G, [1 2.861 4.218 4.465], 5e-3 ); - assert( X, [0.945 0.630 0.189], 1e-3 ); - assert( Q, [1.290 1.050 0.660], 1e-3 ); - assert( R, [1.366 1.667 3.496], 1e-3 ); -***** test - # Example 8.3 p. 331 Bolch et al. - # compare results of convolution with those of mva - K = 6; - S = [ 0.02 0.2 0.4 0.6 ]; - V = [ 1 0.4 0.2 0.1 ]; - [U_mva R_mva Q_mva X_mva] = qncsmva(K, S, V); - [U_con R_con Q_con X_con G] = qncsconvld(K, repmat(S',1,K), V ); - assert( U_mva, U_con, 1e-5 ); - assert( R_mva, R_con, 1e-5 ); - assert( Q_mva, Q_con, 1e-5 ); - assert( X_mva, X_con, 1e-5 ); -***** test - # Compare the results of convolution to those of mva - S = [ 0.02 0.2 0.4 0.6 ]; - K = 6; - V = [ 1 0.4 0.2 0.1 ]; - m = [ 1 5 2 1 ]; - [U_mva R_mva Q_mva X_mva] = qncsmva(K, S, V); - [U_con R_con Q_con X_con G] = qncsconvld(K, repmat(S',1,K), V); - assert( U_mva, U_con, 1e-5 ); - assert( R_mva, R_con, 1e-5 ); - assert( Q_mva, Q_con, 1e-5 ); - assert( X_mva, X_con, 1e-5 ); -***** function r = S_function(k,n) - M = [ 1/0.8 ./ [1 2 2]; - 1/0.6 ./ [1 2 3]; - 1/0.4 ./ [1 1 1] ]; - r = M(k,n); -***** test - # Example 8.1 p. 318 Bolch et al. - K=3; - V = [ 1 .667 .2 ]; - [U R Q X G] = qncsconvld( K, @S_function, V ); - assert( G, [1 2.861 4.218 4.465], 5e-3 ); - assert( X, [0.945 0.630 0.189], 1e-3 ); - assert( Q, [1.290 1.050 0.660], 1e-3 ); - assert( R, [1.366 1.667 3.496], 1e-3 ); -5 tests, 5 passed, 0 known failure, 0 skipped -[inst/dtmcmtta.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcmtta.m -***** test - fail( "dtmcmtta(1,2,3)" ); - fail( "dtmcmtta()" ); -***** test - P = dtmcbd([0 .5 .5 .5], [.5 .5 .5 0]); - [t N B] = dtmcmtta(P); - assert( t, [0 3 4 3 0], 10*eps ); - assert( B([2 3 4],[1 5]), [3/4 1/4; 1/2 1/2; 1/4 3/4], 10*eps ); - assert( B(1,1), 1 ); - assert( B(5,5), 1 ); -***** test - P = dtmcbd([0 .5 .5 .5], [.5 .5 .5 0]); - [t N B] = dtmcmtta(P); - assert( t(3), 4, 10*eps ); - assert( B(3,1), 0.5, 10*eps ); - assert( B(3,5), 0.5, 10*eps ); -***** test - P = dtmcbd([0 .5 .5 .5 .5], [.5 .5 .5 .5 0]); - [t N B] = dtmcmtta(P); - assert( t(2:5), [4 6 6 4], 100*eps ); - assert( B(2:5,1), [.8 .6 .4 .2]', 100*eps ); - assert( B(2:5,6), [.2 .4 .6 .8]', 100*eps ); + mu = 0.01; + death = [ 3 4 5 ] * mu; + birth = 0*death; + Q = ctmcbd(birth,death); + t = ctmcmtta(Q,[0 0 0 1]) ***** demo - n = 6; - P = zeros(101,101); - for j=0:(100-n) - i=1:n; - P(1+j,1+j+i) = 1/n; - endfor - for j=(101-n):100 - P(1+j,1+j) = (n-100+j)/n; - endfor - for j=(101-n):100 - i=1:(100-j); - P(1+j,1+j+i) = 1/n; - endfor - Pstar = P; - ## setup snakes and ladders - SL = [1 38; ... - 4 14; ... - 9 31; ... - 16 6; ... - 21 42; ... - 28 84; ... - 36 44; ... - 47 26; ... - 49 11; ... - 51 67; ... - 56 53; ... - 62 19; ... - 64 60; ... - 71 91; ... - 80 100; ... - 87 24; ... - 93 73; ... - 95 75; ... - 98 78 ]; - for ii=1:rows(SL); - i = SL(ii,1); - j = SL(ii,2); - Pstar(1+i,:) = 0; - for k=0:100 - if ( k != i ) - Pstar(1+k,1+j) = P(1+k,1+j) + P(1+k,1+i); - endif - endfor - Pstar(:,1+i) = 0; - endfor - Pstar += diag( 1-sum(Pstar,2) ); - # spy(Pstar); pause - nsteps = 250; # number of steps - Pfinish = zeros(1,nsteps); # Pfinish(i) = probability of finishing after step i - pstart = zeros(1,101); pstart(1) = 1; pn = pstart; - for i=1:nsteps - pn = pn*Pstar; - Pfinish(i) = pn(101); # state 101 is the ending (absorbing) state + N = 100; + birth = death = ones(1,N-1); birth(1) = death(N-1) = 0; + Q = diag(birth,1)+diag(death,-1); + Q -= diag(sum(Q,2)); + t = zeros(1,N/2); + initial_state = 1:(N/2); + for i=initial_state + p = zeros(1,N); p(i) = 1; + t(i) = ctmcmtta(Q,p); endfor - f = dtmcmtta(Pstar,pstart); - printf("Average number of steps to complete 'snakes and ladders': %f\n", f ); - plot(Pfinish,"linewidth",2); - line([f,f],[0,1]); - text(f*1.1,0.2,["Mean Time to Absorption (" num2str(f) ")"]); - xlabel("Step number (n)"); - title("Probability of finishing 'snakes and ladders' before step n"); -***** test - P = zeros(9,9); - P(1,[2 4]) = .5; - P(2,[1 5 3]) = 1/3; - P(3,[2 6]) = .5; - P(4,[1 5 7]) = 1/3; - P(5,:) = 0; P(5,5) = 1; - P(6,[3 5 9]) = 1/3; - P(7,[4 8]) = .5; - P(8,[7 5 9]) = 1/3; - P(9,[6 8]) = .5; - t = dtmcmtta(P); - assert( t, [6 5 6 5 0 5 6 5 6], 10*eps ); + plot(initial_state,t,"+"); + xlabel("Initial state"); + ylabel("MTTA"); 5 tests, 5 passed, 0 known failure, 0 skipped -[inst/ctmcisir.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcisir.m -***** test - Q = [-.5 .5 0; 1 0 0]; - fail( "ctmcisir(Q)" ); -***** test - Q = [-1 1 0; .5 -.5 0; 0 0 0]; - [r s] = ctmcisir(Q); - assert( r == 0 ); - assert( max(s), 2 ); - assert( min(s), 1 ); -***** test - Q = [-.5 .5 0; .2 -.7 .5; .2 0 -.2]; - [r s] = ctmcisir(Q); - assert( r == 1 ); - assert( max(s), 1 ); - assert( min(s), 1 ); -3 tests, 3 passed, 0 known failure, 0 skipped -[inst/qnosaba.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnosaba.m -***** test - fail( "qnosaba( 0.1, [] )", "vector" ); - fail( "qnosaba( 0.1, [0 -1])", "nonnegative" ); - fail( "qnosaba( 0, [1 2] )", "lambda" ); - fail( "qnosaba( -1, [1 2])", "lambda" ); - fail( "qnosaba( 1, [1 2 3], [1 2] )", "incompatible size"); - fail( "qnosaba( 1, [1 2 3], [-1 2 3] )", "nonnegative"); -***** test - [Xl Xu Rl Ru] = qnosaba( 1, [1 1] ); - assert( Xl, 0 ); - assert( Ru, +inf ); -2 tests, 2 passed, 0 known failure, 0 skipped -[inst/qnmknode.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnmknode.m -***** test - fail( "qnmknode( 'pippo', 1 )", "must be one" ); - fail( "qnmknode( '-/g/1-ps', 1, 1, 1)", "Invalid call" ); -1 test, 1 passed, 0 known failure, 0 skipped -[inst/dtmcexps.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcexps.m -***** test - P = dtmcbd([1 1 1 1], [0 0 0 0]); - L = dtmcexps(P,[1 0 0 0 0]); - t = dtmcmtta(P,[1 0 0 0 0]); - assert( L, [1 1 1 1 0] ); - assert( sum(L), t ); -***** test - P = dtmcbd(linspace(0.1,0.4,5),linspace(0.4,0.1,5)); - p0 = [1 0 0 0 0 0]; - L = dtmcexps(P,0,p0); - assert( L, p0 ); -2 tests, 2 passed, 0 known failure, 0 skipped [inst/erlangc.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/erlangc.m ***** test fail("erlangc('foo',1)", "positive"); fail("erlangc(1,'bar')", "positive"); 1 test, 1 passed, 0 known failure, 0 skipped +[inst/ctmcfpt.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcfpt.m +***** demo + Q = [ -1.0 0.9 0.1; ... + 0.1 -1.0 0.9; ... + 0.9 0.1 -1.0 ]; + M = ctmcfpt(Q) + m = ctmcfpt(Q,1,3) +***** test + N = 10; + Q = reshape(1:N^2,N,N); + Q(1:N+1:end) = 0; + Q -= diag(sum(Q,2)); + M = ctmcfpt(Q); + assert( all(diag(M) < 10*eps) ); +1 test, 1 passed, 0 known failure, 0 skipped [inst/qncmmva.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmmva.m ***** test @@ -4907,81 +4428,96 @@ legend("boxoff"); legend("location", "east"); 17 tests, 17 passed, 0 known failure, 0 skipped -[inst/qncsconv.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsconv.m +[inst/qsmmmk.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsmmmk.m ***** test - # Example 8.1 p. 318 Bolch et al. - K=3; - S = [ 1/0.8 1/0.6 1/0.4 ]; - m = [2 3 1]; - V = [ 1 .667 .2 ]; - [U R Q X G] = qncsconv( K, S, V, m ); - assert( G, [1 2.861 4.218 4.465], 5e-3 ); - assert( X, [0.945 0.630 0.189], 1e-3 ); - assert( U, [0.590 0.350 0.473], 1e-3 ); - assert( Q, [1.290 1.050 0.660], 1e-3 ); - assert( R, [1.366 1.667 3.496], 1e-3 ); + lambda = mu = m = 1; + k = 10; + [U R Q X p0] = qsmmmk(lambda,mu,m,k); + assert( Q, k/2, 1e-7 ); + assert( U, 1-p0, 1e-7 ); ***** test - # Example 8.3 p. 331 Bolch et al. - # compare results of convolution to those of mva - S = [ 0.02 0.2 0.4 0.6 ]; - K = 6; - V = [ 1 0.4 0.2 0.1 ]; - [U_mva R_mva Q_mva X_mva G_mva] = qncsmva(K, S, V); - [U_con R_con Q_con X_con G_con] = qncsconv(K, S, V); - assert( U_mva, U_con, 1e-5 ); - assert( R_mva, R_con, 1e-5 ); - assert( Q_mva, Q_con, 1e-5 ); - assert( X_mva, X_con, 1e-5 ); - assert( G_mva, G_con, 1e-5 ); + lambda = [1 0.8 2 9.2 0.01]; + mu = lambda + 0.17; + k = 12; + [U1 R1 Q1 X1] = qsmm1k(lambda,mu,k); + [U2 R2 Q2 X2] = qsmmmk(lambda,mu,1,k); + assert( U1, U2, 1e-5 ); + assert( R1, R2, 1e-5 ); + assert( Q1, Q2, 1e-5 ); + assert( X1, X2, 1e-5 ); + #assert( [U1 R1 Q1 X1], [U2 R2 Q2 X2], 1e-5 ); ***** test - # Compare the results of convolution to those of mva - S = [ 0.02 0.2 0.4 0.6 ]; - K = 6; - V = [ 1 0.4 0.2 0.1 ]; - m = [ 1 -1 2 1 ]; # center 2 is IS - [U_mva R_mva Q_mva X_mva] = qncsmva(K, S, V, m); - [U_con R_con Q_con X_con G] = qncsconv(K, S, V, m ); - assert( U_mva, U_con, 1e-5 ); - assert( R_mva, R_con, 1e-5 ); - assert( Q_mva, Q_con, 1e-5 ); - assert( X_mva, X_con, 1e-5 ); -***** demo - n = [1 2 0]; - N = sum(n); # Total population size - S = [ 1/0.8 1/0.6 1/0.4 ]; - m = [ 2 3 1 ]; - V = [ 1 .667 .2 ]; - [U R Q X G] = qncsconv( N, S, V, m ); - p = [0 0 0]; # initialize p - # Compute the probability to have n(k) jobs at service center k - for k=1:3 - p(k) = (V(k)*S(k))^n(k) / G(N+1) * ... - (G(N-n(k)+1) - V(k)*S(k)*G(N-n(k)) ); - printf("Prob( n(%d) = %d )=%f\n", k, n(k), p(k) ); - endfor -3 tests, 3 passed, 0 known failure, 0 skipped -[inst/qnopen.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnopen.m + lambda = 0.9; + mu = 0.75; + k = 10; + [U1 R1 Q1 X1 p01] = qsmmmk(lambda,mu,1,k); + [U2 R2 Q2 X2 p02] = qsmm1k(lambda,mu,k); + assert( [U1 R1 Q1 X1 p01], [U2 R2 Q2 X2 p02], 1e-5 ); ***** test - # Example 34.1 p. 572 + lambda = 0.8; + mu = 0.85; + m = 3; + k = 5; + [U1 R1 Q1 X1 p0] = qsmmmk( lambda, mu, m, k ); + birth = lambda*ones(1,k); + death = [ mu*linspace(1,m,m) mu*m*ones(1,k-m) ]; + q = ctmc(ctmcbd( birth, death )); + U2 = dot( q, min( 0:k, m )/m ); + assert( U1, U2, 1e-4 ); + Q2 = dot( [0:k], q ); + assert( Q1, Q2, 1e-4 ); + assert( p0, q(1), 1e-4 ); +***** test + # This test comes from an example I found on the web + lambda = 40; + mu = 30; + m = 3; + k = 7; + [U R Q X p0] = qsmmmk( lambda, mu, m, k ); + assert( p0, 0.255037, 1e-6 ); + assert( R, 0.036517, 1e-6 ); +***** test + # This test comes from an example I found on the web + lambda = 50; + mu = 10; + m = 4; + k = 6; + [U R Q X p0 pk] = qsmmmk( lambda, mu, m, k ); + assert( pk, 0.293543, 1e-6 ); +***** test + # This test comes from an example I found on the web lambda = 3; - V = [16 7 8]; - S = [0.01 0.02 0.03]; - [U R Q X] = qnopen( lambda, S, V ); - assert( R, [0.0192 0.0345 0.107], 1e-2 ); - assert( U, [0.48 0.42 0.72], 1e-2 ); + mu = 2; + m = 2; + k = 5; + [U R Q X p0 pk] = qsmmmk( lambda, mu, m, k ); + assert( p0, 0.179334, 1e-6 ); + assert( pk, 0.085113, 1e-6 ); + assert( Q, 2.00595, 1e-5 ); + assert( R-1/mu, 0.230857, 1e-6 ); # waiting time in the queue +***** demo + ## Given a M/M/m/K queue, compute the steady-state probability pn + ## of having n jobs in the systen. + lambda = 0.2; + mu = 0.25; + m = 5; + K = 20; + n = 0:10; + pn = qsmmmk(lambda, mu, m, K, n); + plot(n, pn, "-o", "linewidth", 2); + xlabel("N. of jobs (n)"); + ylabel("P_n"); + title(sprintf("M/M/%d/%d system, \\lambda = %g, \\mu = %g", m, K, lambda, mu)); +7 tests, 7 passed, 0 known failure, 0 skipped +[inst/dtmctaexps.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmctaexps.m ***** test - V = [1 1; 1 1]; - S = [1 3; 2 4]; - lambda = [3/19 2/19]; - [U R Q] = qnopen(lambda, S, diag( lambda / sum(lambda) ) * V); - assert( U(1,1), 3/19, 1e-6 ); - assert( U(2,1), 4/19, 1e-6 ); - assert( R(1,1), 19/12, 1e-6 ); - assert( R(1,2), 57/2, 1e-6 ); - assert( Q(1,1), .25, 1e-6 ); -2 tests, 2 passed, 0 known failure, 0 skipped + P = dtmcbd([1 1 1 1], [0 0 0 0]); + p0 = [1 0 0 0 0]; + L = dtmctaexps(P,p0); + assert( L, [.25 .25 .25 .25 0], 10*eps ); +1 test, 1 passed, 0 known failure, 0 skipped [inst/qnos.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnos.m ***** test @@ -5062,6 +4598,187 @@ assert( R, [0.2 0.043 0.15 0.0625], 1e-3 ); assert( Q, [4, 0.429 1.5 0.25], 1e-3 ); 6 tests, 6 passed, 0 known failure, 0 skipped +[inst/qnomaba.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnomaba.m +***** test + fail( "qnomaba( [1 1], [1 1 1; 1 1 1; 1 1 1] )", "2 rows" ); +1 test, 1 passed, 0 known failure, 0 skipped +[inst/ctmcexps.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcexps.m +***** test + Q = [-1 1; 1 -1]; + L = ctmcexps(Q,10,[1 0]); + L = ctmcexps(Q,linspace(0,10,100),[1 0]); +***** test + Q = ctmcbd( [1 2 3], [3 2 1] ); + p0 = [1 0 0 0]; + t = linspace(0,10,10); + L1 = L2 = zeros(length(t),4); + # compute L using the differential equation formulation + ff = @(x,t) (x(:)'*Q+p0); + fj = @(x,t) (Q); + L1 = lsode( {ff, fj}, zeros(size(p0)), t ); + # compute L using ctmcexps (integral formulation) + for i=1:length(t) + L2(i,:) = ctmcexps(Q,t(i),p0); + endfor + assert( L1, L2, 1e-5); +***** demo + lambda = 0.5; + N = 4; + b = lambda*[1:N-1]; + d = zeros(size(b)); + Q = ctmcbd(b,d); + t = linspace(0,10,100); + p0 = zeros(1,N); p0(1)=1; + L = zeros(length(t),N); + for i=1:length(t) + L(i,:) = ctmcexps(Q,t(i),p0); + endfor + plot( t, L(:,1), ";State 1;", "linewidth", 2, ... + t, L(:,2), ";State 2;", "linewidth", 2, ... + t, L(:,3), ";State 3;", "linewidth", 2, ... + t, L(:,4), ";State 4;", "linewidth", 2 ); + legend("location","northwest"); legend("boxoff"); + xlabel("Time"); + ylabel("Expected sojourn time"); +***** demo + lambda = 0.5; + N = 4; + b = lambda*[1:N-1]; + d = zeros(size(b)); + Q = ctmcbd(b,d); + p0 = zeros(1,N); p0(1)=1; + L = ctmcexps(Q,p0); + disp(L); +2 tests, 2 passed, 0 known failure, 0 skipped +[inst/dtmc.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmc.m +***** test + P = [0.75 0.25; 0.5 0.5]; + p = dtmc(P); + assert( p*P, p, 1e-5 ); + assert( p, [0.6666 0.3333], 1e-4 ); +***** test + #Example 2.11 p. 44 Bolch et al. + P = [0.5 0.5; 0.5 0.5]; + p = dtmc(P); + assert( p, [0.5 0.5], 1e-3 ); +***** test + fail("dtmc( [1 1 1; 1 1 1] )", "square"); +***** test + a = 0.2; + b = 0.8; + P = [1-a a; b 1-b]; + plim = dtmc(P); + p = dtmc(P, 100, [1 0]); + assert( plim, p, 1e-5 ); +***** test + P = [0 1 0 0 0; ... + .25 0 .75 0 0; ... + 0 .5 0 .5 0; ... + 0 0 .75 0 .25; ... + 0 0 0 1 0 ]; + p = dtmc(P); + assert( p, [.0625 .25 .375 .25 .0625], 10*eps ); +***** test + P = zeros(9,9); + P(1,[2 4]) = 1/2; + P(2,[1 5 3]) = 1/3; + P(3,[2 6]) = 1/2; + P(4,[1 5 7]) = 1/3; + P(5,[2 4 6 8]) = 1/4; + P(6,[3 5 9]) = 1/3; + P(7,[4 8]) = 1/2; + P(8,[7 5 9]) = 1/3; + P(9,[6 8]) = 1/2; + p = dtmc(P); + assert( p, [1/12 1/8 1/12 1/8 1/6 1/8 1/12 1/8 1/12], 10*eps ); +***** demo + P = zeros(9,9); + P(1,[2 4] ) = 1/2; + P(2,[1 5 3] ) = 1/3; + P(3,[2 6] ) = 1/2; + P(4,[1 5 7] ) = 1/3; + P(5,[2 4 6 8]) = 1/4; + P(6,[3 5 9] ) = 1/3; + P(7,[4 8] ) = 1/2; + P(8,[7 5 9] ) = 1/3; + P(9,[6 8] ) = 1/2; + p = dtmc(P); + disp(p) +***** demo + a = 0.2; + b = 0.15; + P = [ 1-a a; b 1-b]; + T = 0:14; + pp = zeros(2,length(T)); + for i=1:length(T) + pp(:,i) = dtmc(P,T(i),[1 0]); + endfor + ss = dtmc(P); # compute steady state probabilities + plot( T, pp(1,:), "b+;p_0(t);", "linewidth", 2, ... + T, ss(1)*ones(size(T)), "b;Steady State;", ... + T, pp(2,:), "r+;p_1(t);", "linewidth", 2, ... + T, ss(2)*ones(size(T)), "r;Steady State;" ); + xlabel("Time Step"); + legend("boxoff"); +6 tests, 6 passed, 0 known failure, 0 skipped +[inst/qncmnpop.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmnpop.m +***** test + H = qncmnpop( [1 2 2] ); + assert( H, [1 1 0 0 0 0; 1 2 2 1 0 0; 1 3 5 5 3 1] ); +1 test, 1 passed, 0 known failure, 0 skipped +[inst/qsmm1.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsmm1.m +***** test + fail( "qsmm1(10,5)", "capacity exceeded" ); + fail( "qsmm1(1,1)", "capacity exceeded" ); + fail( "qsmm1([2 2], [1 1 1])", "incompatible size"); +***** test + [U R Q X P0] = qsmm1(0, 1); + assert( U, 0 ); + assert( R, 1 ); + assert( Q, 0 ); + assert( X, 0 ); + assert( P0, 1 ); +***** test + [U R Q X P0] = qsmm1(0.2, 1.0); + pk = qsmm1(0.2, 1.0, 0); + assert(P0, pk); +***** demo + ## Given a M/M/1 queue, compute the steady-state probability pk + ## of having k requests in the systen. + lambda = 0.2; + mu = 0.25; + k = 0:10; + pk = qsmm1(lambda, mu, k); + plot(k, pk, "-o", "linewidth", 2); + xlabel("N. of requests (k)"); + ylabel("p_k"); + title(sprintf("M/M/1 system, \\lambda = %g, \\mu = %g", lambda, mu)); +3 tests, 3 passed, 0 known failure, 0 skipped +[inst/qsmminf.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsmminf.m +***** test + fail( "qsmminf( [1 2], [1 2 3] )", "incompatible size"); + fail( "qsmminf( [-1 -1], [1 1] )", ">0" ); +***** demo + ## Given a M/M/inf and M/M/m queue, compute the steady-state probability pk + ## of having k requests in the systen. + lambda = 5; + mu = 1.1; + m = 5; + k = 0:20; + pk_inf = qsmminf(lambda, mu, k); + pk_m = qsmmm(lambda, mu, 5, k); + plot(k, pk_inf, "-o;M/M/\\infty;", "linewidth", 2, ... + k, pk_m, "-x;M/M/5;", "linewidth", 2); + xlabel("N. of requests (k)"); + ylabel("P_k"); + title(sprintf("M/M/\\infty and M/M/%d systems, \\lambda = %g, \\mu = %g", m, lambda, mu)); +1 test, 1 passed, 0 known failure, 0 skipped [inst/dtmcchkP.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcchkP.m ***** test @@ -5085,191 +4802,160 @@ P = P ./ repmat(sum(P,2),1,N); assert( dtmcchkP(P), N ); 5 tests, 5 passed, 0 known failure, 0 skipped -[inst/qncscmva.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncscmva.m -***** test - N=5; - S = [1 0.3 0.8 0.9]; - V = [1 1 1 1]; - [U1 R1 Q1 X1] = qncscmva( N, S(1:3), repmat(S(4),1,N), V ); - [U2 R2 Q2 X2] = qncsmva(N, S, V); - assert( X1, X2, 1e-5 ); - assert( U1, U2, 1e-5 ); - assert( R1, R2, 1e-5 ); - assert( Q1, Q2, 1e-5 ); -***** test - N=5; - S = [1 1 1 1 1; ... - 1 1 1 1 1; ... - 1 1 1 1 1; ... - 1 1/2 1/3 1/4 1/5]; - V = [1 1 1 1]; - [U1 R1 Q1 X1] = qncscmva( N, S(1:3,1), S(4,:), V ); - [U2 R2 Q2 X2] = qncsmvald(N, S, V); - assert( U1, U2, 1e-5 ); - assert( R1, R2, 1e-5 ); - assert( Q1, Q2, 1e-5 ); - assert( X1, X2, 1e-5 ); +[inst/qncsmva.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsmva.m ***** test - N=5; - S = [1 1 1 1 1; ... - 1 1 1 1 1; ... - 1 1 1 1 1; ... - 1 1/2 1/3 1/4 1/5]; - V = [1 2 1 1]; - Z = 3; - [U1 R1 Q1 X1] = qncscmva( N, S(1:3,1), S(4,:), V, Z ); - [U2 R2 Q2 X2] = qncsmvald(N, S, V, Z); - assert( U1, U2, 1e-5 ); - assert( R1, R2, 1e-5 ); - assert( Q1, Q2, 1e-5 ); - assert( X1, X2, 1e-5 ); -***** demo - maxN = 90; # Max population size - Rmva = Rconv = Rcmva = zeros(1,maxN); # Results - S = 4; Z = 10; m = 8; - old = warning("query","qn:numerical-instability"); - warning("off","qn:numerical-instability"); - for N=1:maxN - [U R] = qncsmva(N,S,1,m,Z); # Use MVA - Rmva(N) = R(1); - [U R] = qncsconv(N,[S Z],[1 1],[m -1]); # Use Convolution - Rconv(N) = R(1); - if ( N > m ) - Scmva = S ./ min(1:N,m); - else - Scmva = S ./ (1:N); - endif - [U R] = qncscmva(N,[],Scmva,1,Z); # Use CMVA - Rcmva(N) = R(1); - endfor - warning(old.state,"qn:numerical-instability"); - plot(1:maxN, Rmva, ";MVA;", ... - 1:maxN, Rconv, ";Convolution;", ... - 1:maxN, Rcmva, ";CNVA;", "linewidth",2); - xlabel("Population size (N)"); - ylabel("Response Time"); - ax=axis(); ax(3) = 0; ax(4) = 40; axis(ax); - legend("location","northwest"); legend("boxoff"); -3 tests, 3 passed, 0 known failure, 0 skipped -[inst/engset.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/engset.m + fail( "qncsmva()", "Invalid" ); + fail( "qncsmva( 10, [1 2], [1 2 3] )", "incompatible size" ); + fail( "qncsmva( 10, [-1 1], [1 1] )", "nonnegative" ); + fail( "qncsmva( 10.3, [-1 1], [1 1] )", "integer" ); + fail( "qncsmva( -0.3, [-1 1], [1 1] )", "nonnegative" ); ***** test - fail("erlangb(1, -1)", "positive"); - fail("erlangb(-1, 1)", "positive"); - fail("erlangb(1, 0)", "positive"); - fail("erlangb(0, 1)", "positive"); - fail("erlangb('foo',1)", "positive"); - fail("erlangb(1,'bar')", "positive"); - fail("erlangb([1 1],[1 1 1])","common size"); -1 test, 1 passed, 0 known failure, 0 skipped -[inst/erlangb.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/erlangb.m + qncsmva(1,1,1,1); + qncsmva(1,1,1,-1); + qncsmva(1,1,1,2); + qncsmva(1,[1 1],[1 1],[-1 -1]); + qncsmva(1,[1 1],[1 1],[1 1]); + qncsmva(1,[1 1],[1 1],[2 2]); ***** test - fail("erlangb(1, -1)", "positive"); - fail("erlangb(-1, 1)", "positive"); - fail("erlangb(1, 0)", "positive"); - fail("erlangb(0, 1)", "positive"); - fail("erlangb('foo',1)", "positive"); - fail("erlangb(1,'bar')", "positive"); - fail("erlangb([1 1],[1 1 1])","common size"); -1 test, 1 passed, 0 known failure, 0 skipped -[inst/qnmix.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnmix.m + N = 0; + S = [1 2 3 4]; + V = [1 1 1 4]; + [U R Q X] = qncsmva(N, S, V); + assert( U, 0*S ); + assert( R, 0*S ); + assert( Q, 0*S ); + assert( X, 0*S ); ***** test - lambda = [1 0 0]; - N = [1 1 1]; - S = V = [1 1 1; 1 1 1; 1 1 1]; - fail( "qnmix( lambda, N, S, V)", "same time"); - N = [0 0 1]; - fail( "qnmix( lambda, N, S, V)", "open nor closed" ); - N = [0 1 2]; - m = [ 1 1 2 ]; - fail( "qnmix( lambda, N, S, V, m)", "single-server and delay" ); - S = V = [1 1 1; 1 1 1]; - fail( "qnmix( lambda, N, S, V)", "rows" ); + N = 0; + S = [1 2 3 4]; + V = [1 1 1 4]; + m = [2 3 4 5]; + [U R Q X] = qncsmva(N, S, V, m); + assert( U, 0*S ); + assert( R, 0*S ); + assert( Q, 0*S ); + assert( X, 0*S ); ***** test - # Example p. 148 Zahorjan et al. - lambda = [1 1/2 0 0]; - N = [0 0 1 1]; - V = [1 1; 1 1; 1 1; 1 1]; - S = [1/4 1/6; 1/2 1; 1/2 1; 1 4/3]; - [U R Q X] = qnmix(lambda, N, S, V ); - assert( Q(3,1), 4/19, 1e-4 ); - assert( Q(3,2), 15/19, 1e-4 ); - assert( Q(4,1), 5/19, 1e-4 ); - assert( Q(4,2), 14/19, 1e-4 ); + # Exsample 3.42 p. 577 Jain + S = [ 0.125 0.3 0.2 ]'; + V = [ 16 10 5 ]; + N = 20; + m = ones(1,3)'; + Z = 4; + [U R Q X] = qncsmva(N,S,V,m,Z); + assert( R, [ .373 4.854 .300 ], 1e-3 ); + assert( Q, [ 1.991 16.177 0.500 ], 1e-3 ); + assert( all( U>=0 ) ); + assert( all( U<=1 ) ); assert( Q, R.*X, 1e-5 ); # Little's Law ***** test - # Example 8.6 p. 345 Bolch et al. - lambda = [0.5 0.25 0 0]; - N = [0 0 1 1]; - V = [2 1; 2.5 1.5; 1 0.5; 1 0.4]; - S = [0.4 0.6; 0.8 1.6; 0.3 0.5; 0.5 0.8]; - [U R Q X] = qnmix( lambda, N, S, V ); - assert( U([1 2],:), [0.4 0.3; 0.5 0.6], 1e-3 ); - assert( R([3 4],:), [4.829 6.951; 7.727 11.636], 1e-3 ); - assert( Q([3 4],:), [0.582 0.418; 0.624 0.376], 1e-3 ); - assert( Q([1 2],:), [8.822 5.383; 11.028 10.766], 1e-3 ); - assert( R([1 2],:), [8.822 10.766; 17.645 28.710], 1e-3 ); - assert( X(3,1)/V(3,1), 0.120, 1e-3 ); - assert( X(4,1)/V(4,1), 0.081, 1e-3 ); + # Exsample 3.42 p. 577 Jain + S = [ 0.125 0.3 0.2 ]; + V = [ 16 10 5 ]; + N = 20; + m = ones(1,3); + Z = 4; + [U R Q X] = qncsmva(N,S,V,m,Z); + assert( R, [ .373 4.854 .300 ], 1e-3 ); + assert( Q, [ 1.991 16.177 0.500 ], 1e-3 ); + assert( all( U>=0 ) ); + assert( all( U<=1 ) ); assert( Q, R.*X, 1e-5 ); # Little's Law ***** test - ## example figure 10 p. 26 Schwetman, "Implementing the Mean Value - ## Analysis for the Solution of Queueing Network Models", Technical - ## Report CSD-TR-355, feb 15, 1982, Purdue University. - S = [.25 0; .25 .10]; - V = [1 0; 1 1]; - lambda = [1 0]; - N = [0 3]; - [U R Q X] = qnmix( lambda, N, S, V ); - assert( U(1,1), .25, 1e-3 ); - assert( X(1,1), 1.0, 1e-3 ); - assert( [R(1,1) R(2,1) R(2,2)], [1.201 0.885 0.135], 1e-3 ); + # Example 8.4 p. 333 Bolch et al. + S = [ .5 .6 .8 1 ]; + N = 3; + m = [2 1 1 -1]; + V = [ 1 .5 .5 1 ]; + [U R Q X] = qncsmva(N,S,V,m); + assert( Q, [ 0.624 0.473 0.686 1.217 ], 1e-3 ); + assert( X, [ 1.218 0.609 0.609 1.218 ], 1e-3 ); + assert( all(U >= 0 ) ); + assert( all(U( m>0 ) <= 1 ) ); assert( Q, R.*X, 1e-5 ); # Little's Law -4 tests, 4 passed, 0 known failure, 0 skipped -[inst/ctmcchkQ.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcchkQ.m -***** test - Q = [0]; - [result err] = ctmcchkQ(Q); - assert( result, 1 ); - assert( err, "" ); -***** test - N = 10; - Q = ctmcbd(rand(1,N-1),rand(1,N-1)); - [result err] = ctmcchkQ(Q); - assert( result, N ); - assert( err, "" ); -***** test - Q = [1 2 3; 4 5 6]; - [result err] = ctmcchkQ(Q); - assert( result, 0 ); - assert( index(err, "square") > 0 ); -***** test - N = 10; - Q = ctmcbd(rand(1,N-1),rand(1,N-1)); - Q(2,1) = -1; - [result err] = ctmcchkQ(Q); - assert( result, 0 ); - assert( index(err, "infinitesimal") > 0 ); ***** test - N = 10; - Q = ctmcbd(linspace(1,N-1,N-1),linspace(1,N-1,N-1)); - Q(1,1) += 7; - [result err] = ctmcchkQ(Q); - assert( result, 0 ); - assert( index(err, "infinitesimal") > 0 ); -5 tests, 5 passed, 0 known failure, 0 skipped -[inst/ctmcbd.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcbd.m + # Example 8.3 p. 331 Bolch et al. + # This is a single-class network, which however nothing else than + # a special case of multiclass network + S = [ 0.02 0.2 0.4 0.6 ]; + K = 6; + V = [ 1 0.4 0.2 0.1 ]; + [U R Q X] = qncsmva(K, S, V); + assert( U, [ 0.198 0.794 0.794 0.595 ], 1e-3 ); + assert( R, [ 0.025 0.570 1.140 1.244 ], 1e-3 ); + assert( Q, [ 0.244 2.261 2.261 1.234 ], 1e-3 ); + assert( X, [ 9.920 3.968 1.984 0.992 ], 1e-3 ); ***** test - birth = [ 1 1 1 ]; - death = [ 2 2 2 ]; - Q = ctmcbd( birth, death ); - assert( ctmc(Q), [ 8/15 4/15 2/15 1/15 ], 1e-5 ); -1 test, 1 passed, 0 known failure, 0 skipped + # Check bound analysis + N = 10; # max population + for n=1:N + S = [1 0.8 1.2 0.5]; + V = [1 2 2 1]; + [U R Q X] = qncsmva(n, S, V); + Xs = X(1)/V(1); + Rs = dot(R,V); + # Compare with balanced system bounds + [Xlbsb Xubsb Rlbsb Rubsb] = qncsbsb( n, S .* V ); + assert( Xlbsb<=Xs ); + assert( Xubsb>=Xs ); + assert( Rlbsb<=Rs ); + assert( Rubsb>=Rs ); + # Compare with asymptotic bounds + [Xlab Xuab Rlab Ruab] = qncsaba( n, S .* V ); + assert( Xlab<=Xs ); + assert( Xuab>=Xs ); + assert( Rlab<=Rs ); + assert( Ruab>=Rs ); + endfor +***** demo + S = [ 0.125 0.3 0.2 ]; + V = [ 16 10 5 ]; + N = 20; + m = ones(1,3); + Z = 4; + [U R Q X] = qncsmva(N,S,V,m,Z); + X_s = X(1)/V(1); # System throughput + R_s = dot(R,V); # System response time + printf("\t Util Qlen RespT Tput\n"); + printf("\t-------- -------- -------- --------\n"); + for k=1:length(S) + printf("Dev%d\t%8.4f %8.4f %8.4f %8.4f\n", k, U(k), Q(k), R(k), X(k) ); + endfor + printf("\nSystem\t %8.4f %8.4f %8.4f\n\n", N-X_s*Z, R_s, X_s ); +***** demo + SA = [300 40]; + p = .9; P = [ 0 1; 1-p p ]; + VA = qncsvisits(P); + SB = [300 30]; + p = .75; P = [ 0 1; 1-p p ]; + VB = qncsvisits(P); + Z = 1800; + NN = 1:100; + XA = XB = XA_mva = XB_mva = zeros(size(NN)); + for n=NN + [nc XA(n)] = qncsbsb(n, SA, VA, 1, Z); + [U R Q X] = qncsmva(n, SA, VA, 1, Z); + XA_mva(n) = X(1)/VA(1); + [nc XB(n)] = qncsbsb(n, SB, VB, 1, Z); + [U R Q X] = qncsmva(n, SB, VB, 1, Z); + XB_mva(n) = X(1)/VB(1); + endfor + plot(NN, XA, ":k", "linewidth", 1, + NN, XA_mva, "-b", "linewidth", 1, + NN, XB, ":k", "linewidth", 1, + NN, XB_mva, "-r", "linewidth", 1); + idx = 40; + displ = 2e-4; + text( NN(idx), XA(idx)-displ, "A) Large cache of slow disks"); + text( NN(idx), XB(idx)+displ, "B) Small cache of fast disks"); + ax = axis(); + ax(3) = 0; + ax(4) = 1.2*max([XA XB]); + axis(ax); + xlabel("Number of jobs"); + ylabel("System throughput (jobs/s)"); +9 tests, 9 passed, 0 known failure, 0 skipped [inst/qncmpopmix.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmpopmix.m ***** demo @@ -5298,12 +4984,64 @@ f = qncmpopmix( 2, N ); assert( f, [2 0; 1 1] ); 4 tests, 4 passed, 0 known failure, 0 skipped -[inst/qncmnpop.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmnpop.m +[inst/qncsconvld.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsconvld.m ***** test - H = qncmnpop( [1 2 2] ); - assert( H, [1 1 0 0 0 0; 1 2 2 1 0 0; 1 3 5 5 3 1] ); -1 test, 1 passed, 0 known failure, 0 skipped + K=3; + S = [ 1 1 1; 1 1 1 ]; + V = [ 1 .667 .2 ]; + fail( "qncsconvld(K,S,V)", "size mismatch" ); +***** test + # Example 8.1 p. 318 Bolch et al. + K=3; + S = [ 1/0.8 ./ [1 2 2]; + 1/0.6 ./ [1 2 3]; + 1/0.4 ./ [1 1 1] ]; + V = [ 1 .667 .2 ]; + [U R Q X G] = qncsconvld( K, S, V ); + assert( G, [1 2.861 4.218 4.465], 5e-3 ); + assert( X, [0.945 0.630 0.189], 1e-3 ); + assert( Q, [1.290 1.050 0.660], 1e-3 ); + assert( R, [1.366 1.667 3.496], 1e-3 ); +***** test + # Example 8.3 p. 331 Bolch et al. + # compare results of convolution with those of mva + K = 6; + S = [ 0.02 0.2 0.4 0.6 ]; + V = [ 1 0.4 0.2 0.1 ]; + [U_mva R_mva Q_mva X_mva] = qncsmva(K, S, V); + [U_con R_con Q_con X_con G] = qncsconvld(K, repmat(S',1,K), V ); + assert( U_mva, U_con, 1e-5 ); + assert( R_mva, R_con, 1e-5 ); + assert( Q_mva, Q_con, 1e-5 ); + assert( X_mva, X_con, 1e-5 ); +***** test + # Compare the results of convolution to those of mva + S = [ 0.02 0.2 0.4 0.6 ]; + K = 6; + V = [ 1 0.4 0.2 0.1 ]; + m = [ 1 5 2 1 ]; + [U_mva R_mva Q_mva X_mva] = qncsmva(K, S, V); + [U_con R_con Q_con X_con G] = qncsconvld(K, repmat(S',1,K), V); + assert( U_mva, U_con, 1e-5 ); + assert( R_mva, R_con, 1e-5 ); + assert( Q_mva, Q_con, 1e-5 ); + assert( X_mva, X_con, 1e-5 ); +***** function r = S_function(k,n) + M = [ 1/0.8 ./ [1 2 2]; + 1/0.6 ./ [1 2 3]; + 1/0.4 ./ [1 1 1] ]; + r = M(k,n); +***** test + # Example 8.1 p. 318 Bolch et al. + K=3; + V = [ 1 .667 .2 ]; + [U R Q X G] = qncsconvld( K, @S_function, V ); + assert( G, [1 2.861 4.218 4.465], 5e-3 ); + assert( X, [0.945 0.630 0.189], 1e-3 ); + assert( Q, [1.290 1.050 0.660], 1e-3 ); + assert( R, [1.366 1.667 3.496], 1e-3 ); +5 tests, 5 passed, 0 known failure, 0 skipped [inst/qncspb.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncspb.m ***** test @@ -5349,354 +5087,60 @@ assert( Ru >= Rs-tol ); endfor 3 tests, 3 passed, 0 known failure, 0 skipped -[inst/qnomaba.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnomaba.m -***** test - fail( "qnomaba( [1 1], [1 1 1; 1 1 1; 1 1 1] )", "2 rows" ); -1 test, 1 passed, 0 known failure, 0 skipped -[inst/qncsvisits.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsvisits.m -***** test - P = [-1 0; 0 0]; - fail( "qncsvisits(P)", "invalid" ); - P = [1 0; 0.5 0]; - fail( "qncsvisits(P)", "invalid" ); - P = [1 2 3; 1 2 3]; - fail( "qncsvisits(P)", "square" ); - P = [0 1; 1 0]; - fail( "qncsvisits(P,0)", "range" ); - fail( "qncsvisits(P,3)", "range" ); +[inst/qnosbsb.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnosbsb.m ***** test - - ## Closed, single class network - - P = [0 0.3 0.7; 1 0 0; 1 0 0]; - V = qncsvisits(P); - assert( V*P,V,1e-5 ); - assert( V, [1 0.3 0.7], 1e-5 ); + fail( "qnosbsb( 0.1, [] )", "vector" ); + fail( "qnosbsb( 0.1, [0 -1])", "nonnegative" ); + fail( "qnosbsb( 0, [1 2] )", "lambda" ); + fail( "qnosbsb( -1, [1 2])", "lambda" ); ***** test - - ## Test tolerance of the qncsvisits() function. - ## This test builds transition probability matrices and tries - ## to compute the visit counts on them. - - for k=[5, 10, 20, 50] - P = reshape(1:k^2, k, k); - P = P ./ repmat(sum(P,2),1,k); - V = qncsvisits(P); - assert( V*P, V, 1e-5 ); - endfor -***** demo - P = [0 0.3 0.7; ... - 1 0 0 ; ... - 1 0 0 ]; - V = qncsvisits(P) -3 tests, 3 passed, 0 known failure, 0 skipped -[inst/dtmcbd.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcbd.m + [Xl Xu Rl Ru] = qnosbsb(0.1,[1 2 3]); + assert( Xl, 0 ); +2 tests, 2 passed, 0 known failure, 0 skipped +[inst/erlangb.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/erlangb.m ***** test - birth = [.5 .5 .3]; - death = [.6 .2 .3]; - fail("dtmcbd(birth,death)","must be"); -***** demo - birth = [ .2 .3 .4 ]; - death = [ .1 .2 .3 ]; - P = dtmcbd( birth, death ); - disp(P) + fail("erlangb(1, -1)", "positive"); + fail("erlangb(-1, 1)", "positive"); + fail("erlangb(1, 0)", "positive"); + fail("erlangb(0, 1)", "positive"); + fail("erlangb('foo',1)", "positive"); + fail("erlangb(1,'bar')", "positive"); + fail("erlangb([1 1],[1 1 1])","common size"); 1 test, 1 passed, 0 known failure, 0 skipped -[inst/qnosvisits.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnosvisits.m +[inst/dtmcexps.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcexps.m ***** test - fail( "qnosvisits([0 .5; .5 0],[0 -1])", "contains negative" ); - fail( "qnosvisits([1 1 1; 1 1 1], [1 1])", "square" ); + P = dtmcbd([1 1 1 1], [0 0 0 0]); + L = dtmcexps(P,[1 0 0 0 0]); + t = dtmcmtta(P,[1 0 0 0 0]); + assert( L, [1 1 1 1 0] ); + assert( sum(L), t ); ***** test - - ## Open, single class network - - P = [0 0.2 0.5; 1 0 0; 1 0 0]; - lambda = [ 0.1 0.3 0.2 ]; - V = qnosvisits(P,lambda); - assert( V*P+lambda/sum(lambda),V,1e-5 ); -***** demo - p = 0.3; - lambda = 1.2 - P = [0 0.3 0.5; 1 0 0; 1 0 0]; - V = qnosvisits(P,[1.2 0 0]) -***** demo - P = [ 0 0.4 0.6 0; ... - 0.2 0 0.2 0.6; ... - 0 0 0 1; ... - 0 0 0 0 ]; - lambda = [0.1 0 0 0.3]; - V = qnosvisits(P,lambda); - S = [2 1 2 1.8]; - m = [3 1 1 2]; - [U R Q X] = qnos( sum(lambda), S, V, m ) + P = dtmcbd(linspace(0.1,0.4,5),linspace(0.4,0.1,5)); + p0 = [1 0 0 0 0 0]; + L = dtmcexps(P,0,p0); + assert( L, p0 ); 2 tests, 2 passed, 0 known failure, 0 skipped -[inst/qsmm1.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsmm1.m -***** test - fail( "qsmm1(10,5)", "capacity exceeded" ); - fail( "qsmm1(1,1)", "capacity exceeded" ); - fail( "qsmm1([2 2], [1 1 1])", "incompatible size"); -***** test - [U R Q X P0] = qsmm1(0, 1); - assert( U, 0 ); - assert( R, 1 ); - assert( Q, 0 ); - assert( X, 0 ); - assert( P0, 1 ); -***** test - [U R Q X P0] = qsmm1(0.2, 1.0); - pk = qsmm1(0.2, 1.0, 0); - assert(P0, pk); -***** demo - ## Given a M/M/1 queue, compute the steady-state probability pk - ## of having k requests in the systen. - lambda = 0.2; - mu = 0.25; - k = 0:10; - pk = qsmm1(lambda, mu, k); - plot(k, pk, "-o", "linewidth", 2); - xlabel("N. of requests (k)"); - ylabel("p_k"); - title(sprintf("M/M/1 system, \\lambda = %g, \\mu = %g", lambda, mu)); -3 tests, 3 passed, 0 known failure, 0 skipped -[inst/qncmaba.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmaba.m +[inst/dtmcisir.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcisir.m ***** test - fail("qncmaba([],[])", "nonempty"); - fail("qncmaba([1 0], [1 2 3])", "2 rows"); - fail("qncmaba([1 0], [1 2 3; 4 5 -1])", "nonnegative"); - fail("qncmaba([1 2], [1 2 3; 4 5 6], [1 2 3])", "2 x 3"); - fail("qncmaba([1 2], [1 2 3; 4 5 6], [1 2 3; 4 5 -1])", "nonnegative"); - fail("qncmaba([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1])", "3 elements"); - fail("qncmaba([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 2])", "not supported"); - fail("qncmaba([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 2 3])", "2 elements"); - fail("qncmaba([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 -2])", "nonnegative"); + P = [0 .5 0; 0 0 0]; + fail( "dtmcisir(P)" ); ***** test - [Xl Xu Rl Ru] = qncmaba([0 0], [1 2 3; 1 2 3]); - assert( all(Xl(:) == 0) ); - assert( all(Xu(:) == 0) ); - assert( all(Rl(:) == 0) ); - assert( all(Ru(:) == 0) ); + P = [0 1 0; 0 .5 .5; 0 1 0]; + [r s] = dtmcisir(P); + assert( r == 0 ); + assert( max(s), 2 ); + assert( min(s), 1 ); ***** test - S = [10 7 5 4; ... - 5 2 4 6]; - NN=20; - Xl = Xu = Rl = Ru = Xmva = Rmva = zeros(NN,2); - for n=1:NN - N=[n,10]; - [a b c d] = qncmaba(N,S); - Xl(n,:) = a; Xu(n,:) = b; Rl(n,:) = c; Ru(n,:) = d; - [U R Q X] = qncmmva(N,S,ones(size(S))); - Xmva(n,:) = X(:,1)'; Rmva(n,:) = sum(R,2)'; - endfor - assert( all(Xl <= Xmva) ); - assert( all(Xu >= Xmva) ); - assert( all(Rl <= Rmva) ); - assert( all(Xu >= Xmva) ); -***** demo - S = [10 7 5 4; ... - 5 2 4 6]; - NN=20; - Xl = Xu = Rl = Ru = Xmva = Rmva = zeros(NN,2); - for n=1:NN - N=[n,10]; - [a b c d] = qncmaba(N,S); - Xl(n,:) = a; Xu(n,:) = b; Rl(n,:) = c; Ru(n,:) = d; - [U R Q X] = qncmmva(N,S,ones(size(S))); - Xmva(n,:) = X(:,1)'; Rmva(n,:) = sum(R,2)'; - endfor - subplot(2,2,1); - plot(1:NN,Xl(:,1), 1:NN,Xu(:,1), 1:NN,Xmva(:,1), ";MVA;", "linewidth", 2); - ylim([0, 0.2]); - title("Class 1 throughput"); legend("boxoff"); - subplot(2,2,2); - plot(1:NN,Xl(:,2), 1:NN,Xu(:,2), 1:NN,Xmva(:,2), ";MVA;", "linewidth", 2); - ylim([0, 0.2]); - title("Class 2 throughput"); legend("boxoff"); - subplot(2,2,3); - plot(1:NN,Rl(:,1), 1:NN,Ru(:,1), 1:NN,Rmva(:,1), ";MVA;", "linewidth", 2); - ylim([0, 700]); - title("Class 1 response time"); legend("location", "northwest"); legend("boxoff"); - subplot(2,2,4); - plot(1:NN,Rl(:,2), 1:NN,Ru(:,2), 1:NN,Rmva(:,2), ";MVA;", "linewidth", 2); - ylim([0, 700]); - title("Class 2 response time"); legend("location", "northwest"); legend("boxoff"); + P = [.5 .5 0; .2 .3 .5; 0 .2 .8]; + [r s] = dtmcisir(P); + assert( r == 1 ); + assert( max(s), 1 ); + assert( min(s), 1 ); 3 tests, 3 passed, 0 known failure, 0 skipped -[inst/ctmcmtta.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcmtta.m -***** test - Q = [0 1 0; 1 0 1; 0 1 0 ]; Q -= diag( sum(Q,2) ); - fail( "ctmcmtta(Q,[1 0 0])", "no absorbing"); -***** test - Q = [0 1 0; 1 0 1; 0 0 0; 0 0 0 ]; - fail( "ctmcmtta(Q,[1 0 0])", "square matrix"); -***** test - Q = [0 1 0; 1 0 1; 0 0 0 ]; - fail( "ctmcmtta(Q,[1 0 0])", "infinitesimal"); -***** test - Q = [ 0 0.1 0 0; ... - 0.9 0 0.1 0; ... - 0 0.9 0 0.1; ... - 0 0 0 0 ]; - Q -= diag( sum(Q,2) ); - assert( ctmcmtta( Q,[0 0 0 1] ), 0 ); # state 4 is absorbing -***** test - Q = [-1 1; 0 0]; - assert( ctmcmtta( Q, [0 1] ), 0 ); # state 2 is absorbing - assert( ctmcmtta( Q, [1 0] ), 1 ); # the result has been computed by hand -***** demo - mu = 0.01; - death = [ 3 4 5 ] * mu; - birth = 0*death; - Q = ctmcbd(birth,death); - t = ctmcmtta(Q,[0 0 0 1]) -***** demo - N = 100; - birth = death = ones(1,N-1); birth(1) = death(N-1) = 0; - Q = diag(birth,1)+diag(death,-1); - Q -= diag(sum(Q,2)); - t = zeros(1,N/2); - initial_state = 1:(N/2); - for i=initial_state - p = zeros(1,N); p(i) = 1; - t(i) = ctmcmtta(Q,p); - endfor - plot(initial_state,t,"+"); - xlabel("Initial state"); - ylabel("MTTA"); -5 tests, 5 passed, 0 known failure, 0 skipped -[inst/dtmc.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmc.m -***** test - P = [0.75 0.25; 0.5 0.5]; - p = dtmc(P); - assert( p*P, p, 1e-5 ); - assert( p, [0.6666 0.3333], 1e-4 ); -***** test - #Example 2.11 p. 44 Bolch et al. - P = [0.5 0.5; 0.5 0.5]; - p = dtmc(P); - assert( p, [0.5 0.5], 1e-3 ); -***** test - fail("dtmc( [1 1 1; 1 1 1] )", "square"); -***** test - a = 0.2; - b = 0.8; - P = [1-a a; b 1-b]; - plim = dtmc(P); - p = dtmc(P, 100, [1 0]); - assert( plim, p, 1e-5 ); -***** test - P = [0 1 0 0 0; ... - .25 0 .75 0 0; ... - 0 .5 0 .5 0; ... - 0 0 .75 0 .25; ... - 0 0 0 1 0 ]; - p = dtmc(P); - assert( p, [.0625 .25 .375 .25 .0625], 10*eps ); -***** test - P = zeros(9,9); - P(1,[2 4]) = 1/2; - P(2,[1 5 3]) = 1/3; - P(3,[2 6]) = 1/2; - P(4,[1 5 7]) = 1/3; - P(5,[2 4 6 8]) = 1/4; - P(6,[3 5 9]) = 1/3; - P(7,[4 8]) = 1/2; - P(8,[7 5 9]) = 1/3; - P(9,[6 8]) = 1/2; - p = dtmc(P); - assert( p, [1/12 1/8 1/12 1/8 1/6 1/8 1/12 1/8 1/12], 10*eps ); -***** demo - P = zeros(9,9); - P(1,[2 4] ) = 1/2; - P(2,[1 5 3] ) = 1/3; - P(3,[2 6] ) = 1/2; - P(4,[1 5 7] ) = 1/3; - P(5,[2 4 6 8]) = 1/4; - P(6,[3 5 9] ) = 1/3; - P(7,[4 8] ) = 1/2; - P(8,[7 5 9] ) = 1/3; - P(9,[6 8] ) = 1/2; - p = dtmc(P); - disp(p) -***** demo - a = 0.2; - b = 0.15; - P = [ 1-a a; b 1-b]; - T = 0:14; - pp = zeros(2,length(T)); - for i=1:length(T) - pp(:,i) = dtmc(P,T(i),[1 0]); - endfor - ss = dtmc(P); # compute steady state probabilities - plot( T, pp(1,:), "b+;p_0(t);", "linewidth", 2, ... - T, ss(1)*ones(size(T)), "b;Steady State;", ... - T, pp(2,:), "r+;p_1(t);", "linewidth", 2, ... - T, ss(2)*ones(size(T)), "r;Steady State;" ); - xlabel("Time Step"); - legend("boxoff"); -6 tests, 6 passed, 0 known failure, 0 skipped -[inst/ctmcexps.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcexps.m -***** test - Q = [-1 1; 1 -1]; - L = ctmcexps(Q,10,[1 0]); - L = ctmcexps(Q,linspace(0,10,100),[1 0]); -***** test - Q = ctmcbd( [1 2 3], [3 2 1] ); - p0 = [1 0 0 0]; - t = linspace(0,10,10); - L1 = L2 = zeros(length(t),4); - # compute L using the differential equation formulation - ff = @(x,t) (x(:)'*Q+p0); - fj = @(x,t) (Q); - L1 = lsode( {ff, fj}, zeros(size(p0)), t ); - # compute L using ctmcexps (integral formulation) - for i=1:length(t) - L2(i,:) = ctmcexps(Q,t(i),p0); - endfor - assert( L1, L2, 1e-5); -***** demo - lambda = 0.5; - N = 4; - b = lambda*[1:N-1]; - d = zeros(size(b)); - Q = ctmcbd(b,d); - t = linspace(0,10,100); - p0 = zeros(1,N); p0(1)=1; - L = zeros(length(t),N); - for i=1:length(t) - L(i,:) = ctmcexps(Q,t(i),p0); - endfor - plot( t, L(:,1), ";State 1;", "linewidth", 2, ... - t, L(:,2), ";State 2;", "linewidth", 2, ... - t, L(:,3), ";State 3;", "linewidth", 2, ... - t, L(:,4), ";State 4;", "linewidth", 2 ); - legend("location","northwest"); legend("boxoff"); - xlabel("Time"); - ylabel("Expected sojourn time"); -***** demo - lambda = 0.5; - N = 4; - b = lambda*[1:N-1]; - d = zeros(size(b)); - Q = ctmcbd(b,d); - p0 = zeros(1,N); p0(1)=1; - L = ctmcexps(Q,p0); - disp(L); -2 tests, 2 passed, 0 known failure, 0 skipped -[inst/dtmctaexps.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmctaexps.m -***** test - P = dtmcbd([1 1 1 1], [0 0 0 0]); - p0 = [1 0 0 0 0]; - L = dtmctaexps(P,p0); - assert( L, [.25 .25 .25 .25 0], 10*eps ); -1 test, 1 passed, 0 known failure, 0 skipped [inst/ctmc.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmc.m ***** test @@ -5860,281 +5304,106 @@ disp("MTBF (years)"); MTBF = ctmcmtta(Q, p0) / yy # MTBF (years) 9 tests, 9 passed, 0 known failure, 0 skipped -[inst/qncsmvaap.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsmvaap.m -***** test - fail( "qncsmvaap()", "Invalid" ); - fail( "qncsmvaap( 10, [1 2], [1 2 3] )", "S, V and m" ); - fail( "qncsmvaap( 10, [-1 1], [1 1] )", ">= 0" ); - fail( "qncsmvaap( 10, [1 2], [1 2], [1 2] )", "supports"); - fail( "qncsmvaap( 10, [1 2], [1 2], [1 1], 0, -1)", "tol"); +[inst/dtmcmtta.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcmtta.m ***** test - # Example p. 117 Lazowska et al. - S = [0.605 2.1 1.35]; - V = [1 1 1]; - N = 3; - Z = 15; - m = 1; - [U R Q X] = qncsmvaap(N, S, V, m, Z); - Rs = dot(V,R); - Xs = N/(Z+Rs); - assert( Q, [0.0973 0.4021 0.2359], 1e-3 ); - assert( Xs, 0.1510, 1e-3 ); - assert( Rs, 4.87, 1e-3 ); -***** demo - S = [ 0.125 0.3 0.2 ]; - V = [ 16 10 5 ]; - N = 30; - m = ones(1,3); - Z = 4; - Xmva = Xapp = Rmva = Rapp = zeros(1,N); - for n=1:N - [U R Q X] = qncsmva(n,S,V,m,Z); - Xmva(n) = X(1)/V(1); - Rmva(n) = dot(R,V); - [U R Q X] = qncsmvaap(n,S,V,m,Z); - Xapp(n) = X(1)/V(1); - Rapp(n) = dot(R,V); - endfor - subplot(2,1,1); - plot(1:N, Xmva, ";Exact;", "linewidth", 2, 1:N, Xapp, "x;Approximate;", "markersize", 7); - legend("location","southeast"); legend("boxoff"); - ylabel("Throughput X(n)"); - subplot(2,1,2); - plot(1:N, Rmva, ";Exact;", "linewidth", 2, 1:N, Rapp, "x;Approximate;", "markersize", 7); - legend("location","southeast"); legend("boxoff"); - ylabel("Response Time R(n)"); - xlabel("Number of Requests n"); -2 tests, 2 passed, 0 known failure, 0 skipped -[inst/qncmbsb.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmbsb.m + fail( "dtmcmtta(1,2,3)" ); + fail( "dtmcmtta()" ); ***** test - fail("qncmbsb([],[])", "nonempty"); - fail("qncmbsb([1 0], [1 2 3])", "2 rows"); - fail("qncmbsb([1 0], [1 2 3; 4 5 -1])", "nonnegative"); - fail("qncmbsb([1 2], [1 2 3; 4 5 6], [1 2 3])", "2 x 3"); - fail("qncmbsb([1 2], [1 2 3; 4 5 6], [1 2 3; 4 5 -1])", "nonnegative"); - fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1])", "3 elements"); - fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 2])", "not supported"); - fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 2 3])", "2 elements"); - fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 -2])", "nonnegative"); - fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 0])", "only supports"); + P = dtmcbd([0 .5 .5 .5], [.5 .5 .5 0]); + [t N B] = dtmcmtta(P); + assert( t, [0 3 4 3 0], 10*eps ); + assert( B([2 3 4],[1 5]), [3/4 1/4; 1/2 1/2; 1/4 3/4], 10*eps ); + assert( B(1,1), 1 ); + assert( B(5,5), 1 ); ***** test - [Xl Xu Rl Ru] = qncmbsb([0 0], [1 2 3; 1 2 3]); - assert( all(Xl(:) == 0) ); - assert( all(Xu(:) == 0) ); - assert( all(Rl(:) == 0) ); - assert( all(Ru(:) == 0) ); + P = dtmcbd([0 .5 .5 .5], [.5 .5 .5 0]); + [t N B] = dtmcmtta(P); + assert( t(3), 4, 10*eps ); + assert( B(3,1), 0.5, 10*eps ); + assert( B(3,5), 0.5, 10*eps ); ***** test - S = [10 7 5 4; ... - 5 2 4 6]; - NN=20; - Xl = Xu = Rl = Ru = Xmva = Rmva = zeros(NN,2); - for n=1:NN - N=[n,10]; - [a b c d] = qncmbsb(N,S); - Xl(n,:) = a; Xu(n,:) = b; Rl(n,:) = c; Ru(n,:) = d; - [U R Q X] = qncmmva(N,S,ones(size(S))); - Xmva(n,:) = X(:,1)'; Rmva(n,:) = sum(R,2)'; - endfor - assert( all(Xl <= Xmva) ); - assert( all(Xu >= Xmva) ); - assert( all(Rl <= Rmva) ); - assert( all(Xu >= Xmva) ); + P = dtmcbd([0 .5 .5 .5 .5], [.5 .5 .5 .5 0]); + [t N B] = dtmcmtta(P); + assert( t(2:5), [4 6 6 4], 100*eps ); + assert( B(2:5,1), [.8 .6 .4 .2]', 100*eps ); + assert( B(2:5,6), [.2 .4 .6 .8]', 100*eps ); ***** demo - S = [10 7 5 4; ... - 5 2 4 6]; - NN=20; - Xl = Xu = Rl = Ru = Xmva = Rmva = zeros(NN,2); - for n=1:NN - N=[n,10]; - [a b c d] = qncmbsb(N,S); - Xl(n,:) = a; Xu(n,:) = b; Rl(n,:) = c; Ru(n,:) = d; - [U R Q X] = qncmmva(N,S,ones(size(S))); - Xmva(n,:) = X(:,1)'; Rmva(n,:) = sum(R,2)'; + n = 6; + P = zeros(101,101); + for j=0:(100-n) + i=1:n; + P(1+j,1+j+i) = 1/n; endfor - subplot(2,2,1); - plot(1:NN,Xl(:,1), 1:NN,Xu(:,1), 1:NN,Xmva(:,1),";MVA;", "linewidth", 2); - ylim([0, 0.2]); - title("Class 1 throughput"); legend("boxoff"); - subplot(2,2,2); - plot(1:NN,Xl(:,2), 1:NN,Xu(:,2), 1:NN,Xmva(:,2),";MVA;", "linewidth", 2); - ylim([0, 0.2]); - title("Class 2 throughput"); legend("boxoff"); - subplot(2,2,3); - plot(1:NN,Rl(:,1), 1:NN,Ru(:,1), 1:NN,Rmva(:,1),";MVA;", "linewidth", 2); - ylim([0, 700]); - title("Class 1 response time"); legend("location", "northwest"); legend("boxoff"); - subplot(2,2,4); - plot(1:NN,Rl(:,2), 1:NN,Ru(:,2), 1:NN,Rmva(:,2),";MVA;", "linewidth", 2); - ylim([0, 700]); - title("Class 2 response time"); legend("location", "northwest"); legend("boxoff"); -3 tests, 3 passed, 0 known failure, 0 skipped -[inst/qncsbsb.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsbsb.m -***** test - fail("qncsbsb(-1,0)", "N must be"); - fail("qncsbsb(1,[])", "nonempty"); - fail("qncsbsb(1,[-1 2])", "nonnegative"); - fail("qncsbsb(1,[1 2],[1 2 3])", "incompatible size"); - fail("qncsbsb(1,[1 2 3],[1 2 3],[1 2])", "incompatible size"); - fail("qncsbsb(1,[1 2 3],[1 2 3],[1 2 1])", "M/M/1 servers"); - fail("qncsbsb(1,[1 2 3],[1 2 3],[1 1 1],-1)", "nonnegative"); - fail("qncsbsb(1,[1 2 3],[1 2 3],[1 1 1],[0 0])", "scalar"); -***** test - S = [1 0.8 1.2 0.5]; - V = [1 2 2 1]; - D = S .* V; - N = 50; - tol = 1e-7; # compensate for numerical inaccuracies - for n=1:N - [U R Q X] = qncsmva(n, S, V); - Xs = X(1)/V(1); - Rs = dot(R,V); - [Xl Xu Rl Ru] = qncsbsb( n, D ); - assert( Xl <= Xs+tol ); - assert( Xu >= Xs-tol ); - assert( Rl <= Rs+tol ); - assert( Ru >= Rs-tol ); + for j=(101-n):100 + P(1+j,1+j) = (n-100+j)/n; endfor -2 tests, 2 passed, 0 known failure, 0 skipped -[inst/qnomvisits.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnomvisits.m -***** test - fail( "qnomvisits( zeros(3,3,3), [1 1 1] )", "matrix"); -***** test - C = 2; K = 4; - P = zeros(C,K,C,K); - # class 1 routing - P(1,1,1,1) = .05; - P(1,1,1,2) = .45; - P(1,1,1,3) = .5; - P(1,2,1,1) = 0.1; - P(1,3,1,1) = 0.2; - # class 2 routing - P(2,1,2,1) = .01; - P(2,1,2,3) = .5; - P(2,1,2,4) = .49; - P(2,3,2,1) = 0.2; - P(2,4,2,1) = 0.16; - lambda = [0.1 0 0 0.1 ; 0 0 0.2 0.1]; - lambda_sum = sum(lambda(:)); - V = qnomvisits(P, lambda); - assert( all(V(:)>=0) ); - for i=1:K - for c=1:C - assert(V(c,i), lambda(c,i) / lambda_sum + sum(sum(V .* P(:,:,c,i))), 1e-5); - endfor + for j=(101-n):100 + i=1:(100-j); + P(1+j,1+j+i) = 1/n; endfor -***** test - # example 7.7 p. 304 Bolch et al. - # Note that the book uses a slightly different notation than - # what we use here. Specifically, the book defines the routing - # probabilities as P(i,r,j,s) (i,j are service centers, r,s are job - # classes) while the queueing package uses P(r,i,s,j). - # A more serious problem arises in the definition of external arrivals. - # The computation of V(r,i) as given in the book (called e_ir - # in Eq 7.14) is performed in terms of P_{0, js}, defined as - # "the probability in an open network that a job from outside the network - # enters the jth node as a job of the sth class" (p. 267). This is - # compliant with eq. 7.12 where the external class r arrival rate at center - # i is computed as \lambda * P_{0,ir}. However, example 7.7 wrongly - # defines P_{0,11} = P_{0,12} = 1, instead of P_{0,11} = P_{0,12} = 0.5 - # Therefore the resulting visit ratios they obtain must be divided by two. - P = zeros(2,3,2,3); - lambda = S = zeros(2,3); - P(1,1,1,2) = 0.4; - P(1,1,1,3) = 0.3; - P(1,2,1,1) = 0.6; - P(1,2,1,3) = 0.4; - P(1,3,1,1) = 0.5; - P(1,3,1,2) = 0.5; - P(2,1,2,2) = 0.3; - P(2,1,2,3) = 0.6; - P(2,2,2,1) = 0.7; - P(2,2,2,3) = 0.3; - P(2,3,2,1) = 0.4; - P(2,3,2,2) = 0.6; - lambda(1,1) = lambda(2,1) = 1; - V = qnomvisits(P,lambda); - assert( V, [ 3.333 2.292 1.917; 10 8.049 8.415] ./ 2, 1e-3); -3 tests, 3 passed, 0 known failure, 0 skipped -[inst/qsammm.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsammm.m -***** test - [U R Q X] = qsammm( 73,[10,15,20,20,25] ); - assert( U, 0.81, 1e-2 ); - assert( Q, 6.5278, 1e-4 ); -1 test, 1 passed, 0 known failure, 0 skipped -[inst/ctmctaexps.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmctaexps.m -***** test - Q = [ 0 0.1 0 0; ... - 0.9 0 0.1 0; ... - 0 0.9 0 0.1; ... - 0 0 0 0 ]; - Q -= diag( sum(Q,2) ); - M = ctmctaexps(Q, [1 0 0 0]); - assert( sum(M), 1, 10*eps ); -***** demo - lambda = 0.5; - N = 4; - birth = lambda*linspace(1,N-1,N-1); - death = zeros(1,N-1); - Q = diag(birth,1)+diag(death,-1); - Q -= diag(sum(Q,2)); - t = linspace(1e-5,30,100); - p = zeros(1,N); p(1)=1; - M = zeros(length(t),N); - for i=1:length(t) - M(i,:) = ctmctaexps(Q,t(i),p); + Pstar = P; + ## setup snakes and ladders + SL = [1 38; ... + 4 14; ... + 9 31; ... + 16 6; ... + 21 42; ... + 28 84; ... + 36 44; ... + 47 26; ... + 49 11; ... + 51 67; ... + 56 53; ... + 62 19; ... + 64 60; ... + 71 91; ... + 80 100; ... + 87 24; ... + 93 73; ... + 95 75; ... + 98 78 ]; + for ii=1:rows(SL); + i = SL(ii,1); + j = SL(ii,2); + Pstar(1+i,:) = 0; + for k=0:100 + if ( k != i ) + Pstar(1+k,1+j) = P(1+k,1+j) + P(1+k,1+i); + endif + endfor + Pstar(:,1+i) = 0; endfor - clf; - plot(t, M(:,1), ";State 1;", "linewidth", 2, ... - t, M(:,2), ";State 2;", "linewidth", 2, ... - t, M(:,3), ";State 3;", "linewidth", 2, ... - t, M(:,4), ";State 4 (absorbing);", "linewidth", 2 ); - legend("location","east"); legend("boxoff"); - xlabel("Time"); - ylabel("Time-averaged Expected sojourn time"); -***** demo - sec = 1; - min = sec*60; - hour = 60*min; - day = 24*hour; - - # state space enumeration {2, RC, RB, 1, 0} - a = 1/(10*min); # 1/a = duration of reboot (10 min) - b = 1/(30*sec); # 1/b = reconfiguration time (30 sec) - g = 1/(5000*hour); # 1/g = processor MTTF (5000 hours) - d = 1/(4*hour); # 1/d = processor MTTR (4 hours) - c = 0.9; # coverage - Q = [ -2*g 2*c*g 2*(1-c)*g 0 0; ... - 0 -b 0 b 0; ... - 0 0 -a a 0; ... - d 0 0 -(g+d) g; ... - 0 0 0 d -d]; - p = ctmc(Q); - printf("System availability: %f\n",p(1)+p(4)); - TT = linspace(0,1*day,101); - PP = ctmctaexps(Q,TT,[1 0 0 0 0]); - A = At = Abart = zeros(size(TT)); - A(:) = p(1) + p(4); # steady-state availability - for n=1:length(TT) - t = TT(n); - p = ctmc(Q,t,[1 0 0 0 0]); - At(n) = p(1) + p(4); # instantaneous availability - Abart(n) = PP(n,1) + PP(n,4); # interval base availability + Pstar += diag( 1-sum(Pstar,2) ); + # spy(Pstar); pause + nsteps = 250; # number of steps + Pfinish = zeros(1,nsteps); # Pfinish(i) = probability of finishing after step i + pstart = zeros(1,101); pstart(1) = 1; pn = pstart; + for i=1:nsteps + pn = pn*Pstar; + Pfinish(i) = pn(101); # state 101 is the ending (absorbing) state endfor - clf; - semilogy(TT,A,";Steady-state;", ... - TT,At,";Instantaneous;", ... - TT,Abart,";Interval base;"); - ax = axis(); - ax(3) = 1-1e-5; - axis(ax); - legend("boxoff"); -1 test, 1 passed, 0 known failure, 0 skipped + f = dtmcmtta(Pstar,pstart); + printf("Average number of steps to complete 'snakes and ladders': %f\n", f ); + plot(Pfinish,"linewidth",2); + line([f,f],[0,1]); + text(f*1.1,0.2,["Mean Time to Absorption (" num2str(f) ")"]); + xlabel("Step number (n)"); + title("Probability of finishing 'snakes and ladders' before step n"); +***** test + P = zeros(9,9); + P(1,[2 4]) = .5; + P(2,[1 5 3]) = 1/3; + P(3,[2 6]) = .5; + P(4,[1 5 7]) = 1/3; + P(5,:) = 0; P(5,5) = 1; + P(6,[3 5 9]) = 1/3; + P(7,[4 8]) = .5; + P(8,[7 5 9]) = 1/3; + P(9,[6 8]) = .5; + t = dtmcmtta(P); + assert( t, [6 5 6 5 0 5 6 5 6], 10*eps ); +5 tests, 5 passed, 0 known failure, 0 skipped [inst/qncsaba.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsaba.m ***** test @@ -6170,144 +5439,24 @@ assert( Ru >= Rs-tol ); endfor 3 tests, 3 passed, 0 known failure, 0 skipped -[inst/ctmcfpt.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcfpt.m -***** demo - Q = [ -1.0 0.9 0.1; ... - 0.1 -1.0 0.9; ... - 0.9 0.1 -1.0 ]; - M = ctmcfpt(Q) - m = ctmcfpt(Q,1,3) -***** test - N = 10; - Q = reshape(1:N^2,N,N); - Q(1:N+1:end) = 0; - Q -= diag(sum(Q,2)); - M = ctmcfpt(Q); - assert( all(diag(M) < 10*eps) ); -1 test, 1 passed, 0 known failure, 0 skipped -[inst/qncsgb.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsgb.m +[inst/ctmcisir.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcisir.m ***** test - fail( "qncsgb( 1, [] )", "vector" ); - fail( "qncsgb( 1, [0 -1])", "nonnegative" ); - fail( "qncsgb( 0, [1 2] )", "> 0" ); - fail( "qncsgb( -1, [1 2])", "nonnegative" ); - fail( "qncsgb( 1, [1 2],1,[1 -1])", "single server" ); -***** # shared test function -***** function test_gb( D, expected, Z=0 ) - for i=1:rows(expected) - N = expected(i,1); - [X_lower X_upper Q_lower Q_upper] = qncsgb(N,D,1,1,Z); - X_exp_lower = expected(i,2); - X_exp_upper = expected(i,3); - assert( [N X_lower X_upper], [N X_exp_lower X_exp_upper], 1e-4 ) - endfor -***** ## - # table IV - D = [ 0.1 0.1 0.09 0.08 ]; - # N X_lower X_upper - expected = [ 2 4.3040 4.3174; ... - 5 6.6859 6.7524; ... - 10 8.1521 8.2690; ... - 20 9.0947 9.2431; ... - 80 9.8233 9.8765 ]; - test_gb(D, expected); -***** ## - # table V - D = [ 0.1 0.1 0.09 0.08 ]; - Z = 1; - # N X_lower X_upper - expected = [ 2 1.4319 1.5195; ... - 5 3.3432 3.5582; ... - 10 5.7569 6.1410; ... - 20 8.0856 8.6467; ... - 80 9.7147 9.8594]; - test_gb(D, expected, Z); + Q = [-.5 .5 0; 1 0 0]; + fail( "ctmcisir(Q)" ); ***** test - P = [0 0.3 0.7; 1 0 0; 1 0 0]; - S = [1 0.6 0.2]; - m = ones(1,3); - V = qncsvisits(P); - Z = 2; - Nmax = 20; - tol = 1e-5; # compensate for numerical inaccuracies - ## Test case with Z>0 - for n=1:Nmax - [X_gb_lower X_gb_upper NC NC Q_gb_lower Q_gb_upper] = qncsgb(n, S.*V, 1, 1, Z); - [U R Q X] = qnclosed( n, S, V, m, Z ); - X_mva = X(1)/V(1); - assert( X_gb_lower <= X_mva+tol ); - assert( X_gb_upper >= X_mva-tol ); - assert( Q_gb_lower <= Q+tol ); # compensate for numerical errors - assert( Q_gb_upper >= Q-tol ); # compensate for numerical errors - endfor + Q = [-1 1 0; .5 -.5 0; 0 0 0]; + [r s] = ctmcisir(Q); + assert( r == 0 ); + assert( max(s), 2 ); + assert( min(s), 1 ); ***** test - P = [0 0.3 0.7; 1 0 0; 1 0 0]; - S = [1 0.6 0.2]; - V = qncsvisits(P); - Nmax = 20; - tol = 1e-5; # compensate for numerical inaccuracies - ## Test case with Z=0 - for n=1:Nmax - [X_gb_lower X_gb_upper NC NC Q_gb_lower Q_gb_upper] = qncsgb(n, S.*V); - [U R Q X] = qnclosed( n, S, V ); - X_mva = X(1)/V(1); - assert( X_gb_lower <= X_mva+tol ); - assert( X_gb_upper >= X_mva-tol ); - assert( Q_gb_lower <= Q+tol ); - assert( Q_gb_upper >= Q-tol ); - endfor + Q = [-.5 .5 0; .2 -.7 .5; .2 0 -.2]; + [r s] = ctmcisir(Q); + assert( r == 1 ); + assert( max(s), 1 ); + assert( min(s), 1 ); 3 tests, 3 passed, 0 known failure, 0 skipped -[inst/qncsmvablo.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsmvablo.m -***** test - fail( "qncsmvablo( 10, [1 1], [4 5], [0 1; 1 0] )", "capacity"); - fail( "qncsmvablo( 6, [1 1], [4 5], [0 1; 1 1] )", "stochastic"); - fail( "qncsmvablo( 5, [1 1 1], [1 1], [0 1; 1 1] )", "3 elements"); -***** test - # This is the example on section v) p. 422 of the reference paper - M = [12 10 14]; - P = [0 1 0; 0 0 1; 1 0 0]; - S = [1/1 1/2 1/3]; - K = 27; - [U R Q X]=qncsmvablo( K, S, M, P ); - assert( R, [11.80 1.66 14.4], 1e-2 ); -***** test - # This is example 2, i) and ii) p. 424 of the reference paper - M = [4 5 5]; - S = [1.5 2 1]; - P = [0 1 0; 0 0 1; 1 0 0]; - K = 10; - [U R Q X]=qncsmvablo( K, S, M, P ); - assert( R, [6.925 8.061 4.185], 1e-3 ); - K = 12; - [U R Q X]=qncsmvablo( K, S, M, P ); - assert( R, [7.967 9.019 8.011], 1e-3 ); -***** test - # This is example 3, i) and ii) p. 424 of the reference paper - M = [8 7 6]; - S = [0.2 1.2 1.4]; - P = [ 0 0.5 0.5; 1 0 0; 1 0 0 ]; - K = 10; - [U R Q X] = qncsmvablo( K, S, M, P ); - assert( R, [1.674 5.007 7.639], 1e-3 ); - K = 12; - [U R Q X] = qncsmvablo( K, S, M, P ); - assert( R, [2.166 5.372 6.567], 1e-3 ); -***** test - # Network which never blocks, central server model - M = [50 50 50]; - S = [1 1/0.8 1/0.4]; - P = [0 0.7 0.3; 1 0 0; 1 0 0]; - K = 40; - [U1 R1 Q1] = qncsmvablo( K, S, M, P ); - V = qncsvisits(P); - [U2 R2 Q2] = qncsmva( K, S, V ); - assert( U1, U2, 1e-5 ); - assert( R1, R2, 1e-5 ); - assert( Q1, Q2, 1e-5 ); -5 tests, 5 passed, 0 known failure, 0 skipped [inst/qnmarkov.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnmarkov.m ***** test @@ -6376,6 +5525,271 @@ assert( Q1, Q2, 1e-6 ); assert( X1, X2, 1e-6 ); 5 tests, 5 passed, 0 known failure, 0 skipped +[inst/qnom.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnom.m +***** test + fail( "qnom([1 1], [.9; 1.0])", "exceeded at center 1"); + fail( "qnom([1 1], [0.9 .9; 0.9 1.0])", "exceeded at center 2"); + #qnom([1 1], [.9; 1.0],[],2); # should not fail, M/M/2-FCFS + #qnom([1 1], [.9; 1.0],[],-1); # should not fail, -/G/1-PS + fail( "qnom(1./[2 3], [1.9 1.9 0.9; 2.9 3.0 2.9])", "exceeded at center 2"); + #qnom(1./[2 3], [1 1.9 0.9; 0.3 3.0 1.5],[],[1 2 1]); # should not fail +***** test + V = [1 1; 1 1]; + S = [1 3; 2 4]; + lambda = [3/19 2/19]; + [U R Q X] = qnom(lambda, S, diag( lambda / sum(lambda) ) * V ); + assert( U(1,1), 3/19, 1e-6 ); + assert( U(2,1), 4/19, 1e-6 ); + assert( R(1,1), 19/12, 1e-6 ); + assert( R(1,2), 57/2, 1e-6 ); + assert( Q(1,1), .25, 1e-6 ); + assert( Q, R.*X, 1e-5 ); # Little's Law +***** test + # example p. 138 Zahorjan et al. + V = [ 10 9; 5 4]; + S = [ 1/10 1/3; 2/5 1]; + lambda = [3/19 2/19]; + [U R Q X] = qnom(lambda, S, diag( lambda / sum(lambda) ) * V ); + assert( X(1,1), 1.58, 1e-2 ); + assert( U(1,1), .158, 1e-3 ); + assert( R(1,1), .158, 1e-3 ); # modified from the original example, as the reference above considers R as the residence time, not the response time + assert( Q(1,1), .25, 1e-2 ); + assert( Q, R.*X, 1e-5 ); # Little's Law +***** test + # example 7.7 p. 304 Bolch et al. Please note that the book uses the + # notation P(i,r,j,s) (i,j are service centers, r,s are job + # classes) while the queueing package uses P(r,i,s,j) + P = zeros(2,3,2,3); + lambda = S = zeros(2,3); + P(1,1,1,2) = 0.4; + P(1,1,1,3) = 0.3; + P(1,2,1,1) = 0.6; + P(1,2,1,3) = 0.4; + P(1,3,1,1) = 0.5; + P(1,3,1,2) = 0.5; + P(2,1,2,2) = 0.3; + P(2,1,2,3) = 0.6; + P(2,2,2,1) = 0.7; + P(2,2,2,3) = 0.3; + P(2,3,2,1) = 0.4; + P(2,3,2,2) = 0.6; + S(1,1) = 1/8; + S(1,2) = 1/12; + S(1,3) = 1/16; + S(2,1) = 1/24; + S(2,2) = 1/32; + S(2,3) = 1/36; + lambda(1,1) = lambda(2,1) = 1; + V = qnomvisits(P,lambda); + assert( V, [ 3.333 2.292 1.917; 10 8.049 8.415] ./ 2, 1e-3); + [U R Q X] = qnom(sum(lambda,2), S, V); + assert( sum(U,1), [0.833 0.442 0.354], 1e-3 ); + # Note: the value of K_22 (corresponding to Q(2,2)) reported in the book + # is 0.5. However, hand computation using the exact same formulas + # from the book produces a different value, 0.451 + assert( Q, [2.5 0.342 0.186; 2.5 0.451 0.362], 1e-3 ); +***** test + P = zeros(2,2,2,2); + P(1,1,1,2) = 0.8; P(1,2,1,1) = 1; + P(2,1,2,2) = 0.9; P(2,2,2,1) = 1; + S = zeros(2,2); + S(1,1) = 1.5; S(1,2) = 1.2; + S(2,1) = 0.8; S(2,2) = 2.5; + lambda = zeros(2,2); + lambda(1,1) = 1/20; + lambda(2,1) = 1/30; + [U1 R1 Q1 X1] = qnom(lambda, S, P); # qnom_cs + [U2 R2 Q2 X2] = qnom(sum(lambda,2), S, qnomvisits(P,lambda)); # qnom_nocs + assert( U1, U2, 1e-5 ); + assert( R1, R2, 1e-5 ); + assert( Q1, Q2, 1e-5 ); + assert( X1, X2, 1e-5 ); +***** demo + P = zeros(2,2,2,2); + lambda = zeros(2,2); + S = zeros(2,2); + P(1,1,2,1) = P(1,2,2,1) = 0.2; + P(1,1,2,2) = P(2,2,2,2) = 0.8; + S(1,1) = S(1,2) = 0.1; + S(2,1) = S(2,2) = 0.05; + rr = 1:100; + Xk = zeros(2,length(rr)); + for r=rr + lambda(1,1) = lambda(1,2) = 1/r; + [U R Q X] = qnom(lambda,S,P); + Xk(:,r) = sum(X,1)'; + endfor + plot(rr,Xk(1,:),";Server 1;","linewidth",2, ... + rr,Xk(2,:),";Server 2;","linewidth",2); + legend("boxoff"); + xlabel("Class 1 interarrival time"); + ylabel("Throughput"); +5 tests, 5 passed, 0 known failure, 0 skipped +[inst/qncsvisits.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsvisits.m +***** test + P = [-1 0; 0 0]; + fail( "qncsvisits(P)", "invalid" ); + P = [1 0; 0.5 0]; + fail( "qncsvisits(P)", "invalid" ); + P = [1 2 3; 1 2 3]; + fail( "qncsvisits(P)", "square" ); + P = [0 1; 1 0]; + fail( "qncsvisits(P,0)", "range" ); + fail( "qncsvisits(P,3)", "range" ); +***** test + + ## Closed, single class network + + P = [0 0.3 0.7; 1 0 0; 1 0 0]; + V = qncsvisits(P); + assert( V*P,V,1e-5 ); + assert( V, [1 0.3 0.7], 1e-5 ); +***** test + + ## Test tolerance of the qncsvisits() function. + ## This test builds transition probability matrices and tries + ## to compute the visit counts on them. + + for k=[5, 10, 20, 50] + P = reshape(1:k^2, k, k); + P = P ./ repmat(sum(P,2),1,k); + V = qncsvisits(P); + assert( V*P, V, 1e-5 ); + endfor +***** demo + P = [0 0.3 0.7; ... + 1 0 0 ; ... + 1 0 0 ]; + V = qncsvisits(P) +3 tests, 3 passed, 0 known failure, 0 skipped +[inst/qnopen.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnopen.m +***** test + # Example 34.1 p. 572 + lambda = 3; + V = [16 7 8]; + S = [0.01 0.02 0.03]; + [U R Q X] = qnopen( lambda, S, V ); + assert( R, [0.0192 0.0345 0.107], 1e-2 ); + assert( U, [0.48 0.42 0.72], 1e-2 ); +***** test + V = [1 1; 1 1]; + S = [1 3; 2 4]; + lambda = [3/19 2/19]; + [U R Q] = qnopen(lambda, S, diag( lambda / sum(lambda) ) * V); + assert( U(1,1), 3/19, 1e-6 ); + assert( U(2,1), 4/19, 1e-6 ); + assert( R(1,1), 19/12, 1e-6 ); + assert( R(1,2), 57/2, 1e-6 ); + assert( Q(1,1), .25, 1e-6 ); +2 tests, 2 passed, 0 known failure, 0 skipped +[inst/ctmcbd.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcbd.m +***** test + birth = [ 1 1 1 ]; + death = [ 2 2 2 ]; + Q = ctmcbd( birth, death ); + assert( ctmc(Q), [ 8/15 4/15 2/15 1/15 ], 1e-5 ); +1 test, 1 passed, 0 known failure, 0 skipped +[inst/ctmcchkQ.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/ctmcchkQ.m +***** test + Q = [0]; + [result err] = ctmcchkQ(Q); + assert( result, 1 ); + assert( err, "" ); +***** test + N = 10; + Q = ctmcbd(rand(1,N-1),rand(1,N-1)); + [result err] = ctmcchkQ(Q); + assert( result, N ); + assert( err, "" ); +***** test + Q = [1 2 3; 4 5 6]; + [result err] = ctmcchkQ(Q); + assert( result, 0 ); + assert( index(err, "square") > 0 ); +***** test + N = 10; + Q = ctmcbd(rand(1,N-1),rand(1,N-1)); + Q(2,1) = -1; + [result err] = ctmcchkQ(Q); + assert( result, 0 ); + assert( index(err, "infinitesimal") > 0 ); +***** test + N = 10; + Q = ctmcbd(linspace(1,N-1,N-1),linspace(1,N-1,N-1)); + Q(1,1) += 7; + [result err] = ctmcchkQ(Q); + assert( result, 0 ); + assert( index(err, "infinitesimal") > 0 ); +5 tests, 5 passed, 0 known failure, 0 skipped +[inst/qncmbsb.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmbsb.m +***** test + fail("qncmbsb([],[])", "nonempty"); + fail("qncmbsb([1 0], [1 2 3])", "2 rows"); + fail("qncmbsb([1 0], [1 2 3; 4 5 -1])", "nonnegative"); + fail("qncmbsb([1 2], [1 2 3; 4 5 6], [1 2 3])", "2 x 3"); + fail("qncmbsb([1 2], [1 2 3; 4 5 6], [1 2 3; 4 5 -1])", "nonnegative"); + fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1])", "3 elements"); + fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 2])", "not supported"); + fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 2 3])", "2 elements"); + fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 -2])", "nonnegative"); + fail("qncmbsb([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 0])", "only supports"); +***** test + [Xl Xu Rl Ru] = qncmbsb([0 0], [1 2 3; 1 2 3]); + assert( all(Xl(:) == 0) ); + assert( all(Xu(:) == 0) ); + assert( all(Rl(:) == 0) ); + assert( all(Ru(:) == 0) ); +***** test + S = [10 7 5 4; ... + 5 2 4 6]; + NN=20; + Xl = Xu = Rl = Ru = Xmva = Rmva = zeros(NN,2); + for n=1:NN + N=[n,10]; + [a b c d] = qncmbsb(N,S); + Xl(n,:) = a; Xu(n,:) = b; Rl(n,:) = c; Ru(n,:) = d; + [U R Q X] = qncmmva(N,S,ones(size(S))); + Xmva(n,:) = X(:,1)'; Rmva(n,:) = sum(R,2)'; + endfor + assert( all(Xl <= Xmva) ); + assert( all(Xu >= Xmva) ); + assert( all(Rl <= Rmva) ); + assert( all(Xu >= Xmva) ); +***** demo + S = [10 7 5 4; ... + 5 2 4 6]; + NN=20; + Xl = Xu = Rl = Ru = Xmva = Rmva = zeros(NN,2); + for n=1:NN + N=[n,10]; + [a b c d] = qncmbsb(N,S); + Xl(n,:) = a; Xu(n,:) = b; Rl(n,:) = c; Ru(n,:) = d; + [U R Q X] = qncmmva(N,S,ones(size(S))); + Xmva(n,:) = X(:,1)'; Rmva(n,:) = sum(R,2)'; + endfor + subplot(2,2,1); + plot(1:NN,Xl(:,1), 1:NN,Xu(:,1), 1:NN,Xmva(:,1),";MVA;", "linewidth", 2); + ylim([0, 0.2]); + title("Class 1 throughput"); legend("boxoff"); + subplot(2,2,2); + plot(1:NN,Xl(:,2), 1:NN,Xu(:,2), 1:NN,Xmva(:,2),";MVA;", "linewidth", 2); + ylim([0, 0.2]); + title("Class 2 throughput"); legend("boxoff"); + subplot(2,2,3); + plot(1:NN,Rl(:,1), 1:NN,Ru(:,1), 1:NN,Rmva(:,1),";MVA;", "linewidth", 2); + ylim([0, 700]); + title("Class 1 response time"); legend("location", "northwest"); legend("boxoff"); + subplot(2,2,4); + plot(1:NN,Rl(:,2), 1:NN,Ru(:,2), 1:NN,Rmva(:,2),";MVA;", "linewidth", 2); + ylim([0, 700]); + title("Class 2 response time"); legend("location", "northwest"); legend("boxoff"); +3 tests, 3 passed, 0 known failure, 0 skipped [inst/qncsmvald.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsmvald.m ***** test @@ -6434,48 +5848,476 @@ assert( Q1, Q2, 1e-3 ); assert( X1, X2, 1e-3 ); 4 tests, 4 passed, 0 known failure, 0 skipped -[inst/qsmm1k.m] ->>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qsmm1k.m +[inst/qncsmvaap.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsmvaap.m ***** test - lambda = mu = 1; - K = 10; - [U R Q X p0] = qsmm1k(lambda,mu,K); - assert( Q, K/2, 1e-7 ); - assert( U, 1-p0, 1e-7 ); + fail( "qncsmvaap()", "Invalid" ); + fail( "qncsmvaap( 10, [1 2], [1 2 3] )", "S, V and m" ); + fail( "qncsmvaap( 10, [-1 1], [1 1] )", ">= 0" ); + fail( "qncsmvaap( 10, [1 2], [1 2], [1 2] )", "supports"); + fail( "qncsmvaap( 10, [1 2], [1 2], [1 1], 0, -1)", "tol"); ***** test - lambda = 1; - mu = 1.2; - K = 10; - [U R Q X p0 pK] = qsmm1k(lambda, mu, K); - prob = qsmm1k(lambda, mu, K, 0:K); - assert( p0, prob(1), 1e-7 ); - assert( pK, prob(K+1), 1e-7 ); + # Example p. 117 Lazowska et al. + S = [0.605 2.1 1.35]; + V = [1 1 1]; + N = 3; + Z = 15; + m = 1; + [U R Q X] = qncsmvaap(N, S, V, m, Z); + Rs = dot(V,R); + Xs = N/(Z+Rs); + assert( Q, [0.0973 0.4021 0.2359], 1e-3 ); + assert( Xs, 0.1510, 1e-3 ); + assert( Rs, 4.87, 1e-3 ); +***** demo + S = [ 0.125 0.3 0.2 ]; + V = [ 16 10 5 ]; + N = 30; + m = ones(1,3); + Z = 4; + Xmva = Xapp = Rmva = Rapp = zeros(1,N); + for n=1:N + [U R Q X] = qncsmva(n,S,V,m,Z); + Xmva(n) = X(1)/V(1); + Rmva(n) = dot(R,V); + [U R Q X] = qncsmvaap(n,S,V,m,Z); + Xapp(n) = X(1)/V(1); + Rapp(n) = dot(R,V); + endfor + subplot(2,1,1); + plot(1:N, Xmva, ";Exact;", "linewidth", 2, 1:N, Xapp, "x;Approximate;", "markersize", 7); + legend("location","southeast"); legend("boxoff"); + ylabel("Throughput X(n)"); + subplot(2,1,2); + plot(1:N, Rmva, ";Exact;", "linewidth", 2, 1:N, Rapp, "x;Approximate;", "markersize", 7); + legend("location","southeast"); legend("boxoff"); + ylabel("Response Time R(n)"); + xlabel("Number of Requests n"); +2 tests, 2 passed, 0 known failure, 0 skipped +[inst/qncsgb.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsgb.m ***** test - # Compare the result with the equivalent Markov chain - lambda = 0.8; - mu = 0.8; - K = 10; - [U1 R1 Q1 X1] = qsmm1k( lambda, mu, K ); - birth = lambda*ones(1,K); - death = mu*ones(1,K); - q = ctmc(ctmcbd( birth, death )); - U2 = 1-q(1); - Q2 = dot( [0:K], q ); - assert( U1, U2, 1e-4 ); - assert( Q1, Q2, 1e-4 ); + fail( "qncsgb( 1, [] )", "vector" ); + fail( "qncsgb( 1, [0 -1])", "nonnegative" ); + fail( "qncsgb( 0, [1 2] )", "> 0" ); + fail( "qncsgb( -1, [1 2])", "nonnegative" ); + fail( "qncsgb( 1, [1 2],1,[1 -1])", "single server" ); +***** # shared test function +***** function test_gb( D, expected, Z=0 ) + for i=1:rows(expected) + N = expected(i,1); + [X_lower X_upper Q_lower Q_upper] = qncsgb(N,D,1,1,Z); + X_exp_lower = expected(i,2); + X_exp_upper = expected(i,3); + assert( [N X_lower X_upper], [N X_exp_lower X_exp_upper], 1e-4 ) + endfor +***** ## + # table IV + D = [ 0.1 0.1 0.09 0.08 ]; + # N X_lower X_upper + expected = [ 2 4.3040 4.3174; ... + 5 6.6859 6.7524; ... + 10 8.1521 8.2690; ... + 20 9.0947 9.2431; ... + 80 9.8233 9.8765 ]; + test_gb(D, expected); +***** ## + # table V + D = [ 0.1 0.1 0.09 0.08 ]; + Z = 1; + # N X_lower X_upper + expected = [ 2 1.4319 1.5195; ... + 5 3.3432 3.5582; ... + 10 5.7569 6.1410; ... + 20 8.0856 8.6467; ... + 80 9.7147 9.8594]; + test_gb(D, expected, Z); +***** test + P = [0 0.3 0.7; 1 0 0; 1 0 0]; + S = [1 0.6 0.2]; + m = ones(1,3); + V = qncsvisits(P); + Z = 2; + Nmax = 20; + tol = 1e-5; # compensate for numerical inaccuracies + ## Test case with Z>0 + for n=1:Nmax + [X_gb_lower X_gb_upper NC NC Q_gb_lower Q_gb_upper] = qncsgb(n, S.*V, 1, 1, Z); + [U R Q X] = qnclosed( n, S, V, m, Z ); + X_mva = X(1)/V(1); + assert( X_gb_lower <= X_mva+tol ); + assert( X_gb_upper >= X_mva-tol ); + assert( Q_gb_lower <= Q+tol ); # compensate for numerical errors + assert( Q_gb_upper >= Q-tol ); # compensate for numerical errors + endfor +***** test + P = [0 0.3 0.7; 1 0 0; 1 0 0]; + S = [1 0.6 0.2]; + V = qncsvisits(P); + Nmax = 20; + tol = 1e-5; # compensate for numerical inaccuracies + ## Test case with Z=0 + for n=1:Nmax + [X_gb_lower X_gb_upper NC NC Q_gb_lower Q_gb_upper] = qncsgb(n, S.*V); + [U R Q X] = qnclosed( n, S, V ); + X_mva = X(1)/V(1); + assert( X_gb_lower <= X_mva+tol ); + assert( X_gb_upper >= X_mva-tol ); + assert( Q_gb_lower <= Q+tol ); + assert( Q_gb_upper >= Q-tol ); + endfor +3 tests, 3 passed, 0 known failure, 0 skipped +[inst/qncsconv.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncsconv.m +***** test + # Example 8.1 p. 318 Bolch et al. + K=3; + S = [ 1/0.8 1/0.6 1/0.4 ]; + m = [2 3 1]; + V = [ 1 .667 .2 ]; + [U R Q X G] = qncsconv( K, S, V, m ); + assert( G, [1 2.861 4.218 4.465], 5e-3 ); + assert( X, [0.945 0.630 0.189], 1e-3 ); + assert( U, [0.590 0.350 0.473], 1e-3 ); + assert( Q, [1.290 1.050 0.660], 1e-3 ); + assert( R, [1.366 1.667 3.496], 1e-3 ); +***** test + # Example 8.3 p. 331 Bolch et al. + # compare results of convolution to those of mva + S = [ 0.02 0.2 0.4 0.6 ]; + K = 6; + V = [ 1 0.4 0.2 0.1 ]; + [U_mva R_mva Q_mva X_mva G_mva] = qncsmva(K, S, V); + [U_con R_con Q_con X_con G_con] = qncsconv(K, S, V); + assert( U_mva, U_con, 1e-5 ); + assert( R_mva, R_con, 1e-5 ); + assert( Q_mva, Q_con, 1e-5 ); + assert( X_mva, X_con, 1e-5 ); + assert( G_mva, G_con, 1e-5 ); +***** test + # Compare the results of convolution to those of mva + S = [ 0.02 0.2 0.4 0.6 ]; + K = 6; + V = [ 1 0.4 0.2 0.1 ]; + m = [ 1 -1 2 1 ]; # center 2 is IS + [U_mva R_mva Q_mva X_mva] = qncsmva(K, S, V, m); + [U_con R_con Q_con X_con G] = qncsconv(K, S, V, m ); + assert( U_mva, U_con, 1e-5 ); + assert( R_mva, R_con, 1e-5 ); + assert( Q_mva, Q_con, 1e-5 ); + assert( X_mva, X_con, 1e-5 ); ***** demo - ## Given a M/M/1/K queue, compute the steady-state probability pk - ## of having n requests in the systen. - lambda = 0.2; - mu = 0.25; - K = 10; - n = 0:10; - pn = qsmm1k(lambda, mu, K, n); - plot(n, pn, "-o", "linewidth", 2); - xlabel("N. of requests (n)"); - ylabel("p_n"); - title(sprintf("M/M/1/%d system, \\lambda = %g, \\mu = %g", K, lambda, mu)); + n = [1 2 0]; + N = sum(n); # Total population size + S = [ 1/0.8 1/0.6 1/0.4 ]; + m = [ 2 3 1 ]; + V = [ 1 .667 .2 ]; + [U R Q X G] = qncsconv( N, S, V, m ); + p = [0 0 0]; # initialize p + # Compute the probability to have n(k) jobs at service center k + for k=1:3 + p(k) = (V(k)*S(k))^n(k) / G(N+1) * ... + (G(N-n(k)+1) - V(k)*S(k)*G(N-n(k)) ); + printf("Prob( n(%d) = %d )=%f\n", k, n(k), p(k) ); + endfor +3 tests, 3 passed, 0 known failure, 0 skipped +[inst/qncmvisits.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmvisits.m +***** test + + ## Closed, multiclass network + + C = 2; K = 3; + P = zeros(C,K,C,K); + P(1,1,1,2) = 1; + P(1,2,1,1) = 1; + P(2,1,2,3) = 1; + P(2,3,2,1) = 1; + V = qncmvisits(P); + for c=1:C + for k=1:K + assert(V(c,k), sum(sum(V .* P(:,:,c,k))), 1e-5); + endfor + endfor +***** test + + ## Test multiclass network. Example from Schwetman (figure 7, page 9 of + ## http://docs.lib.purdue.edu/cstech/259/ + ## "Testing network-of-queues software, technical report CSD-TR 330, + ## Purdue University). + + C = 2; K = 4; + P = zeros(C,K,C,K); + # class 1 routing + P(1,1,1,1) = .05; + P(1,1,1,2) = .45; + P(1,1,1,3) = .5; + P(1,2,1,1) = 1; + P(1,3,1,1) = 1; + # class 2 routing + P(2,1,2,1) = .01; + P(2,1,2,3) = .5; + P(2,1,2,4) = .49; + P(2,3,2,1) = 1; + P(2,4,2,1) = 1; + V = qncmvisits(P); + for c=1:C + for i=1:K + assert(V(c,i), sum(sum(V .* P(:,:,c,i))), 1e-5); + endfor + endfor +***** test + + ## Network with class switching. + ## This is the example in figure 9 of + ## Schwetman, "Implementing the Mean Value Analysis + ## Algorithm fort the solution of Queueing Network Models", Technical + ## Report CSD-TR-355, Department of Computer Science, Purdue Univrsity, + ## Feb 15, 1982, http://docs.lib.purdue.edu/cstech/286/ + + C = 2; K = 3; + S = [.01 .07 .10; ... + .05 0.7 .10 ]; + P = zeros(C,K,C,K); + P(1,1,1,2) = .7; + P(1,1,1,3) = .2; + P(1,1,2,1) = .1; + P(2,1,2,2) = .3; + P(2,1,2,3) = .5; + P(2,1,1,1) = .2; + P(1,2,1,1) = P(1,3,1,1) = 1; + P(2,2,2,1) = P(2,3,2,1) = 1; + N = [3 0]; + V = qncmvisits(P); + VV = [10 7 2; 5 1.5 2.5]; # result given in Schwetman; our function computes something different, but that's ok since visit counts are actually ratios + assert( V ./ repmat(V(:,1),1,K), VV ./ repmat(VV(:,1),1,K), 1e-5 ); +***** test + + ## two disjoint classes: must produce two disjoing chains + + C = 2; K = 3; + P = zeros(C,K,C,K); + P(1,1,1,2) = 1; + P(1,2,1,1) = 1; + P(2,1,2,3) = 1; + P(2,3,2,1) = 1; + [nc r] = qncmvisits(P); + assert( r(1) != r(2) ); +***** test + + ## two classes, one chain + + C = 2; K = 3; + P = zeros(C,K,C,K); + P(1,1,1,2) = .5; + P(1,2,2,1) = 1; + P(2,1,2,3) = .5; + P(2,3,1,1) = 1; + [nc r] = qncmvisits(P); + assert( r(1) == r(2) ); +***** test + + ## a "Moebius strip". Note that this configuration is invalid, and + ## therefore our algorithm must raise an error. This is because this + ## network has two chains, but both chains contain both classes + + C = 2; K = 2; + P = zeros(C,K,C,K); + P(1,1,2,2) = 1; + P(2,2,1,1) = 1; + P(2,1,1,2) = 1; + P(1,2,2,1) = 1; + fail( "qncmvisits(P)", "different"); +***** test + + ## Network with two classes representing independent chains. + ## This is example in figure 8 of + ## Schwetman, "Implementing the Mean Value Analysis + ## Algorithm fort the solution of Queueing Network Models", Technical + ## Report CSD-TR-355, Department of Computer Science, Purdue Univrsity, + ## Feb 15, 1982, http://docs.lib.purdue.edu/cstech/286/ + + C = 2; K = 2; + P = zeros(C,K,C,K); + P(1,1,1,3) = P(1,3,1,1) = 1; + P(2,2,2,3) = P(2,3,2,2) = 1; + V = qncmvisits(P,[1,2]); + assert( V, [1 0 1; 0 1 1], 1e-5 ); +***** test + C = 2; + K = 3; + P = zeros(C,K,C,K); + P(1,1,1,2) = 1; + P(1,2,1,3) = 1; + P(1,3,2,2) = 1; + P(2,2,1,1) = 1; + [V ch] = qncmvisits(P); + assert( ch, [1 1] ); +***** test + C = 2; + K = 3; + P = zeros(C,K,C,K); + P(1,1,1,2) = 1; + P(1,2,1,3) = 1; + P(1,3,2,2) = 1; + P(2,2,2,1) = 1; + P(2,1,1,2) = 1; + [V ch] = qncmvisits(P); + assert( ch, [1 1] ); +9 tests, 9 passed, 0 known failure, 0 skipped +[inst/qncmaba.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmaba.m +***** test + fail("qncmaba([],[])", "nonempty"); + fail("qncmaba([1 0], [1 2 3])", "2 rows"); + fail("qncmaba([1 0], [1 2 3; 4 5 -1])", "nonnegative"); + fail("qncmaba([1 2], [1 2 3; 4 5 6], [1 2 3])", "2 x 3"); + fail("qncmaba([1 2], [1 2 3; 4 5 6], [1 2 3; 4 5 -1])", "nonnegative"); + fail("qncmaba([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1])", "3 elements"); + fail("qncmaba([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 2])", "not supported"); + fail("qncmaba([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 2 3])", "2 elements"); + fail("qncmaba([1 2], [1 2 3; 1 2 3], [1 2 3; 1 2 3], [1 1 -1],[1 -2])", "nonnegative"); +***** test + [Xl Xu Rl Ru] = qncmaba([0 0], [1 2 3; 1 2 3]); + assert( all(Xl(:) == 0) ); + assert( all(Xu(:) == 0) ); + assert( all(Rl(:) == 0) ); + assert( all(Ru(:) == 0) ); +***** test + S = [10 7 5 4; ... + 5 2 4 6]; + NN=20; + Xl = Xu = Rl = Ru = Xmva = Rmva = zeros(NN,2); + for n=1:NN + N=[n,10]; + [a b c d] = qncmaba(N,S); + Xl(n,:) = a; Xu(n,:) = b; Rl(n,:) = c; Ru(n,:) = d; + [U R Q X] = qncmmva(N,S,ones(size(S))); + Xmva(n,:) = X(:,1)'; Rmva(n,:) = sum(R,2)'; + endfor + assert( all(Xl <= Xmva) ); + assert( all(Xu >= Xmva) ); + assert( all(Rl <= Rmva) ); + assert( all(Xu >= Xmva) ); +***** demo + S = [10 7 5 4; ... + 5 2 4 6]; + NN=20; + Xl = Xu = Rl = Ru = Xmva = Rmva = zeros(NN,2); + for n=1:NN + N=[n,10]; + [a b c d] = qncmaba(N,S); + Xl(n,:) = a; Xu(n,:) = b; Rl(n,:) = c; Ru(n,:) = d; + [U R Q X] = qncmmva(N,S,ones(size(S))); + Xmva(n,:) = X(:,1)'; Rmva(n,:) = sum(R,2)'; + endfor + subplot(2,2,1); + plot(1:NN,Xl(:,1), 1:NN,Xu(:,1), 1:NN,Xmva(:,1), ";MVA;", "linewidth", 2); + ylim([0, 0.2]); + title("Class 1 throughput"); legend("boxoff"); + subplot(2,2,2); + plot(1:NN,Xl(:,2), 1:NN,Xu(:,2), 1:NN,Xmva(:,2), ";MVA;", "linewidth", 2); + ylim([0, 0.2]); + title("Class 2 throughput"); legend("boxoff"); + subplot(2,2,3); + plot(1:NN,Rl(:,1), 1:NN,Ru(:,1), 1:NN,Rmva(:,1), ";MVA;", "linewidth", 2); + ylim([0, 700]); + title("Class 1 response time"); legend("location", "northwest"); legend("boxoff"); + subplot(2,2,4); + plot(1:NN,Rl(:,2), 1:NN,Ru(:,2), 1:NN,Rmva(:,2), ";MVA;", "linewidth", 2); + ylim([0, 700]); + title("Class 2 response time"); legend("location", "northwest"); legend("boxoff"); 3 tests, 3 passed, 0 known failure, 0 skipped +[inst/qnomvisits.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnomvisits.m +***** test + fail( "qnomvisits( zeros(3,3,3), [1 1 1] )", "matrix"); +***** test + C = 2; K = 4; + P = zeros(C,K,C,K); + # class 1 routing + P(1,1,1,1) = .05; + P(1,1,1,2) = .45; + P(1,1,1,3) = .5; + P(1,2,1,1) = 0.1; + P(1,3,1,1) = 0.2; + # class 2 routing + P(2,1,2,1) = .01; + P(2,1,2,3) = .5; + P(2,1,2,4) = .49; + P(2,3,2,1) = 0.2; + P(2,4,2,1) = 0.16; + lambda = [0.1 0 0 0.1 ; 0 0 0.2 0.1]; + lambda_sum = sum(lambda(:)); + V = qnomvisits(P, lambda); + assert( all(V(:)>=0) ); + for i=1:K + for c=1:C + assert(V(c,i), lambda(c,i) / lambda_sum + sum(sum(V .* P(:,:,c,i))), 1e-5); + endfor + endfor +***** test + # example 7.7 p. 304 Bolch et al. + # Note that the book uses a slightly different notation than + # what we use here. Specifically, the book defines the routing + # probabilities as P(i,r,j,s) (i,j are service centers, r,s are job + # classes) while the queueing package uses P(r,i,s,j). + # A more serious problem arises in the definition of external arrivals. + # The computation of V(r,i) as given in the book (called e_ir + # in Eq 7.14) is performed in terms of P_{0, js}, defined as + # "the probability in an open network that a job from outside the network + # enters the jth node as a job of the sth class" (p. 267). This is + # compliant with eq. 7.12 where the external class r arrival rate at center + # i is computed as \lambda * P_{0,ir}. However, example 7.7 wrongly + # defines P_{0,11} = P_{0,12} = 1, instead of P_{0,11} = P_{0,12} = 0.5 + # Therefore the resulting visit ratios they obtain must be divided by two. + P = zeros(2,3,2,3); + lambda = S = zeros(2,3); + P(1,1,1,2) = 0.4; + P(1,1,1,3) = 0.3; + P(1,2,1,1) = 0.6; + P(1,2,1,3) = 0.4; + P(1,3,1,1) = 0.5; + P(1,3,1,2) = 0.5; + P(2,1,2,2) = 0.3; + P(2,1,2,3) = 0.6; + P(2,2,2,1) = 0.7; + P(2,2,2,3) = 0.3; + P(2,3,2,1) = 0.4; + P(2,3,2,2) = 0.6; + lambda(1,1) = lambda(2,1) = 1; + V = qnomvisits(P,lambda); + assert( V, [ 3.333 2.292 1.917; 10 8.049 8.415] ./ 2, 1e-3); +3 tests, 3 passed, 0 known failure, 0 skipped +[inst/qnosvisits.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnosvisits.m +***** test + fail( "qnosvisits([0 .5; .5 0],[0 -1])", "contains negative" ); + fail( "qnosvisits([1 1 1; 1 1 1], [1 1])", "square" ); +***** test + + ## Open, single class network + + P = [0 0.2 0.5; 1 0 0; 1 0 0]; + lambda = [ 0.1 0.3 0.2 ]; + V = qnosvisits(P,lambda); + assert( V*P+lambda/sum(lambda),V,1e-5 ); +***** demo + p = 0.3; + lambda = 1.2 + P = [0 0.3 0.5; 1 0 0; 1 0 0]; + V = qnosvisits(P,[1.2 0 0]) +***** demo + P = [ 0 0.4 0.6 0; ... + 0.2 0 0.2 0.6; ... + 0 0 0 1; ... + 0 0 0 0 ]; + lambda = [0.1 0 0 0.3]; + V = qnosvisits(P,lambda); + S = [2 1 2 1.8]; + m = [3 1 1 2]; + [U R Q X] = qnos( sum(lambda), S, V, m ) +2 tests, 2 passed, 0 known failure, 0 skipped [inst/qncmcb.m] >>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncmcb.m ***** test @@ -6523,6 +6365,200 @@ ylim([0, 700]); title("Class 2 response time"); legend("location", "northwest"); legend("boxoff"); 1 test, 1 passed, 0 known failure, 0 skipped +[inst/qnmknode.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnmknode.m +***** test + fail( "qnmknode( 'pippo', 1 )", "must be one" ); + fail( "qnmknode( '-/g/1-ps', 1, 1, 1)", "Invalid call" ); +1 test, 1 passed, 0 known failure, 0 skipped +[inst/qncscmva.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qncscmva.m +***** test + N=5; + S = [1 0.3 0.8 0.9]; + V = [1 1 1 1]; + [U1 R1 Q1 X1] = qncscmva( N, S(1:3), repmat(S(4),1,N), V ); + [U2 R2 Q2 X2] = qncsmva(N, S, V); + assert( X1, X2, 1e-5 ); + assert( U1, U2, 1e-5 ); + assert( R1, R2, 1e-5 ); + assert( Q1, Q2, 1e-5 ); +***** test + N=5; + S = [1 1 1 1 1; ... + 1 1 1 1 1; ... + 1 1 1 1 1; ... + 1 1/2 1/3 1/4 1/5]; + V = [1 1 1 1]; + [U1 R1 Q1 X1] = qncscmva( N, S(1:3,1), S(4,:), V ); + [U2 R2 Q2 X2] = qncsmvald(N, S, V); + assert( U1, U2, 1e-5 ); + assert( R1, R2, 1e-5 ); + assert( Q1, Q2, 1e-5 ); + assert( X1, X2, 1e-5 ); +***** test + N=5; + S = [1 1 1 1 1; ... + 1 1 1 1 1; ... + 1 1 1 1 1; ... + 1 1/2 1/3 1/4 1/5]; + V = [1 2 1 1]; + Z = 3; + [U1 R1 Q1 X1] = qncscmva( N, S(1:3,1), S(4,:), V, Z ); + [U2 R2 Q2 X2] = qncsmvald(N, S, V, Z); + assert( U1, U2, 1e-5 ); + assert( R1, R2, 1e-5 ); + assert( Q1, Q2, 1e-5 ); + assert( X1, X2, 1e-5 ); +***** demo + maxN = 90; # Max population size + Rmva = Rconv = Rcmva = zeros(1,maxN); # Results + S = 4; Z = 10; m = 8; + old = warning("query","qn:numerical-instability"); + warning("off","qn:numerical-instability"); + for N=1:maxN + [U R] = qncsmva(N,S,1,m,Z); # Use MVA + Rmva(N) = R(1); + [U R] = qncsconv(N,[S Z],[1 1],[m -1]); # Use Convolution + Rconv(N) = R(1); + if ( N > m ) + Scmva = S ./ min(1:N,m); + else + Scmva = S ./ (1:N); + endif + [U R] = qncscmva(N,[],Scmva,1,Z); # Use CMVA + Rcmva(N) = R(1); + endfor + warning(old.state,"qn:numerical-instability"); + plot(1:maxN, Rmva, ";MVA;", ... + 1:maxN, Rconv, ";Convolution;", ... + 1:maxN, Rcmva, ";CNVA;", "linewidth",2); + xlabel("Population size (N)"); + ylabel("Response Time"); + ax=axis(); ax(3) = 0; ax(4) = 40; axis(ax); + legend("location","northwest"); legend("boxoff"); +3 tests, 3 passed, 0 known failure, 0 skipped +[inst/dtmcfpt.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/dtmcfpt.m +***** test + P = [1 1 1; 1 1 1]; + fail( "dtmcfpt(P)" ); +***** test + P = dtmcbd([1 1 1], [0 0 0] ); + fail( "dtmcfpt(P)", "absorbing" ); +***** test + P = [ 0.0 0.9 0.1; ... + 0.1 0.0 0.9; ... + 0.9 0.1 0.0 ]; + p = dtmc(P); + M = dtmcfpt(P); + assert( diag(M)', 1./p, 1e-8 ); +***** test + P = [ 0 1 0 0 0; ... + .25 .0 .75 0 0; ... + 0 .5 0 .5 0; ... + 0 0 .75 0 .25; ... + 0 0 0 1 0 ]; + M = dtmcfpt(P); + assert( M, [16 1 2.6667 6.3333 21.3333; ... + 15 4 1.6667 5.3333 20.3333; ... + 18.6667 3.6667 2.6667 3.6667 18.6667; ... + 20.3333 5.3333 1.6667 4 15; ... + 21.3333 6.3333 2.6667 1 16 ], 1e-4 ); +***** test + sz = 10; + P = reshape( 1:sz^2, sz, sz ); + normP = repmat(sum(P,2),1,columns(P)); + P = P./normP; + M = dtmcfpt(P); + for i=1:rows(P) + for j=1:columns(P) + assert( M(i,j), 1 + dot(P(i,:), M(:,j)) - P(i,j)*M(j,j), 1e-8); + endfor + endfor +***** test + P = zeros(9,9); + P(1,[2 4]) = .5; + P(2,[1 5 3]) = 1/3; + P(3,[2 6]) = .5; + P(4,[1 5 7]) = 1/3; + P(5,[2 4 6 8]) = 1/4; + P(6,[3 5 9]) = 1/3; + P(7,[4 8]) = .5; + P(8,[7 5 9]) = 1/3; + P(9,[6 8]) = .5; + M = dtmcfpt(P); + assert( M(1:9 != 5,5)', [6 5 6 5 5 6 5 6], 100*eps ); +6 tests, 6 passed, 0 known failure, 0 skipped +[inst/qnosaba.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnosaba.m +***** test + fail( "qnosaba( 0.1, [] )", "vector" ); + fail( "qnosaba( 0.1, [0 -1])", "nonnegative" ); + fail( "qnosaba( 0, [1 2] )", "lambda" ); + fail( "qnosaba( -1, [1 2])", "lambda" ); + fail( "qnosaba( 1, [1 2 3], [1 2] )", "incompatible size"); + fail( "qnosaba( 1, [1 2 3], [-1 2 3] )", "nonnegative"); +***** test + [Xl Xu Rl Ru] = qnosaba( 1, [1 1] ); + assert( Xl, 0 ); + assert( Ru, +inf ); +2 tests, 2 passed, 0 known failure, 0 skipped +[inst/qnmix.m] +>>>>> /build/reproducible-path/octave-queueing-1.2.8/inst/qnmix.m +***** test + lambda = [1 0 0]; + N = [1 1 1]; + S = V = [1 1 1; 1 1 1; 1 1 1]; + fail( "qnmix( lambda, N, S, V)", "same time"); + N = [0 0 1]; + fail( "qnmix( lambda, N, S, V)", "open nor closed" ); + N = [0 1 2]; + m = [ 1 1 2 ]; + fail( "qnmix( lambda, N, S, V, m)", "single-server and delay" ); + S = V = [1 1 1; 1 1 1]; + fail( "qnmix( lambda, N, S, V)", "rows" ); +***** test + # Example p. 148 Zahorjan et al. + lambda = [1 1/2 0 0]; + N = [0 0 1 1]; + V = [1 1; 1 1; 1 1; 1 1]; + S = [1/4 1/6; 1/2 1; 1/2 1; 1 4/3]; + [U R Q X] = qnmix(lambda, N, S, V ); + assert( Q(3,1), 4/19, 1e-4 ); + assert( Q(3,2), 15/19, 1e-4 ); + assert( Q(4,1), 5/19, 1e-4 ); + assert( Q(4,2), 14/19, 1e-4 ); + assert( Q, R.*X, 1e-5 ); # Little's Law +***** test + # Example 8.6 p. 345 Bolch et al. + lambda = [0.5 0.25 0 0]; + N = [0 0 1 1]; + V = [2 1; 2.5 1.5; 1 0.5; 1 0.4]; + S = [0.4 0.6; 0.8 1.6; 0.3 0.5; 0.5 0.8]; + [U R Q X] = qnmix( lambda, N, S, V ); + assert( U([1 2],:), [0.4 0.3; 0.5 0.6], 1e-3 ); + assert( R([3 4],:), [4.829 6.951; 7.727 11.636], 1e-3 ); + assert( Q([3 4],:), [0.582 0.418; 0.624 0.376], 1e-3 ); + assert( Q([1 2],:), [8.822 5.383; 11.028 10.766], 1e-3 ); + assert( R([1 2],:), [8.822 10.766; 17.645 28.710], 1e-3 ); + assert( X(3,1)/V(3,1), 0.120, 1e-3 ); + assert( X(4,1)/V(4,1), 0.081, 1e-3 ); + assert( Q, R.*X, 1e-5 ); # Little's Law +***** test + ## example figure 10 p. 26 Schwetman, "Implementing the Mean Value + ## Analysis for the Solution of Queueing Network Models", Technical + ## Report CSD-TR-355, feb 15, 1982, Purdue University. + S = [.25 0; .25 .10]; + V = [1 0; 1 1]; + lambda = [1 0]; + N = [0 3]; + [U R Q X] = qnmix( lambda, N, S, V ); + assert( U(1,1), .25, 1e-3 ); + assert( X(1,1), 1.0, 1e-3 ); + assert( [R(1,1) R(2,1) R(2,2)], [1.201 0.885 0.135], 1e-3 ); + assert( Q, R.*X, 1e-5 ); # Little's Law +4 tests, 4 passed, 0 known failure, 0 skipped Checking C++ files ... Done running the unit tests. Summary: 204 tests, 204 passed, 0 known failures, 0 skipped @@ -6556,12 +6592,14 @@ dpkg-buildpackage: info: binary-only upload (no source included) dpkg-genchanges: info: including full source code in upload I: copying local configuration +I: user script /srv/workspace/pbuilder/3555129/tmp/hooks/B01_cleanup starting +I: user script /srv/workspace/pbuilder/3555129/tmp/hooks/B01_cleanup finished I: unmounting dev/ptmx filesystem I: unmounting dev/pts filesystem I: unmounting dev/shm filesystem I: unmounting proc filesystem I: unmounting sys filesystem I: cleaning the build env -I: removing directory /srv/workspace/pbuilder/3855249 and its subdirectories -I: Current time: Mon Jun 10 22:24:42 -12 2024 -I: pbuilder-time-stamp: 1718101482 +I: removing directory /srv/workspace/pbuilder/3555129 and its subdirectories +I: Current time: Tue Jul 15 06:51:44 +14 2025 +I: pbuilder-time-stamp: 1752511904