-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
238 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,238 @@ | ||
import scala.math.log | ||
import scala.util.Random | ||
|
||
class QueueingNetwork(tMax: Int, L: Int, lambda0: Float, theta: Array[Array[Double]], mu: Array[Double], gamma: Array[Double], tauThreshold: Float) { | ||
var tMax: Int = tMax | ||
var L: Int = L | ||
var lambda0: Float = lambda0 | ||
var theta: Array[Array[Double]] = theta | ||
var initialTheta: Array[Array[Double]] = theta | ||
var mu: Array[Double] = mu | ||
var gamma: Array[Double] = gamma | ||
|
||
var tNow: Int = 0 | ||
var tOld: Int = 0 | ||
var indicator: Boolean = false | ||
|
||
// моменты активации процессов | ||
// обслуживания (_ = 1, L + 1) | ||
// генерации (_ = 0) | ||
var tProcesses: Array[Int] = Array.fill(L + 1)(tMax + 1) | ||
tProcesses(0) = 0 | ||
initSystems() | ||
|
||
var servicedDemands: Int = 0 | ||
var lostDemands: Int = 0 | ||
var totalDemands: Int = 0 | ||
var sumLifeTime: Int = 0 | ||
var b: Array[Int] = Array.fill(L)(1) | ||
var countStates: Int = 1 | ||
var tauSummarized: Int = 0 | ||
|
||
var tau: Int = 0 | ||
var tauThreshold: Float = tauThreshold | ||
|
||
def initSystems(): Unit = { | ||
var systems: List[QueueingSystem] = List(QueueingSystem(0, 0, 0, 0)) // источник | ||
systems.head.serializationTimeStates(List(0)) | ||
for (system <- 1 to L) { | ||
systems :+= QueueingSystem(system, 1, mu(system - 1), gamma(system - 1)) | ||
systems.last.serializationTimeStates(List(0)) | ||
systems.last.beDestroyedAt = tNow + systems.last.destroyTime() | ||
// print(systems[-1].beDestroyedAt) | ||
} | ||
this.systems = systems | ||
} | ||
|
||
def arrivalTime(): Double = { | ||
-log(Random.nextDouble()) / lambda0 | ||
} | ||
|
||
def changeTheta(): Array[Array[Double]] = { | ||
var oldTheta: Array[Array[Double]] = theta.map(_.clone) | ||
var newTheta: Array[Array[Double]] = oldTheta.map(_.clone) | ||
for (m <- b.indices) { | ||
if (b(m) == 0) { | ||
for { | ||
i <- 0 to L | ||
k <- 0 to L | ||
} { | ||
if (i != m + 1 && k != m + 1) { | ||
if (oldTheta(i)(m + 1) != 1) { | ||
newTheta(i)(k) = oldTheta(i)(k) / (1 - oldTheta(i)(m + 1)) | ||
} | ||
} else if (k != m + 1) { | ||
newTheta(m + 1)(k) = 0 | ||
} else if (i != m + 1) { | ||
newTheta(i)(m + 1) = 0 | ||
} | ||
} | ||
newTheta(m + 1)(m + 1) = 1 | ||
} | ||
oldTheta = newTheta.map(_.clone) | ||
} | ||
newTheta | ||
} | ||
|
||
def checkMatrix(): Boolean = { | ||
var excepted: List[Int] = List() | ||
for (i <- theta.indices) { | ||
if (theta(i)(i) == 1) excepted :+= i | ||
} | ||
|
||
def dfs(start: Int, visited: Array[Boolean]): Unit = { | ||
for ((v, ind) <- theta(start).zipWithIndex) { | ||
if (v > 0) { | ||
visited(start) = true | ||
if (!visited(ind)) { | ||
dfs(ind, visited) | ||
} | ||
} | ||
} | ||
} | ||
|
||
for (i <- 0 to L) { | ||
if (!excepted.contains(i)) { | ||
var visited: Array[Boolean] = Array.fill(L + 1)(false) | ||
excepted.foreach(m => visited(m) = true) | ||
if (!visited(i)) { | ||
dfs(i, visited) | ||
if (!visited.forall(identity)) return false | ||
} | ||
} | ||
} | ||
visited.forall(identity) | ||
} | ||
|
||
def routing(i: Int, demand: Demand): Unit = { | ||
var r = scala.util.Random.nextDouble() | ||
var tmpSum = 0 | ||
var j = 0 | ||
while (j < L) { | ||
if (theta(i)(j) > 0) { | ||
tmpSum += theta(i)(j) | ||
} | ||
if (tmpSum >= r) { | ||
break | ||
} | ||
j += 1 | ||
} | ||
// println(s'\tтребование ${demand.id} переходит из $i в $j') | ||
|
||
if (i != 0) { | ||
systems(i).updateTimeStates(tNow) | ||
systems(i).demands.remove(demand) | ||
// println(s'\tтребования в $i: ${systems(i).currentDemands()}') | ||
} | ||
if (j != 0) { | ||
systems(j).updateTimeStates(tNow) | ||
systems(j).demands.append(demand) | ||
// println(s'\tтребования в $j: ${systems(j).currentDemands()}') | ||
} else { | ||
servicedDemands += 1 | ||
sumLifeTime += tNow - demand.arrival | ||
} | ||
} | ||
|
||
def restore(): Unit = { | ||
println(s"Сеть восстанавливается при \nb: $b") | ||
b = List.fill(L)(1) | ||
theta = initialTheta.clone() | ||
for (system <- systems.drop(1)) { | ||
// println(system.gamma) | ||
system.beDestroyedAt = tNow + system.destroyTime() | ||
} | ||
} | ||
|
||
def simulation(): Unit = { | ||
var demandId = 0 | ||
while tNow < tMax { | ||
println(s"$tNow") | ||
// [println(s"${system.id}\n\t${system.deserializationTimeStates()}\n\t${system.demands.length}") for system <- systems] | ||
indicator = false | ||
|
||
// генерация требования | ||
if (tProcesses(0) == tNow) { | ||
indicator = true | ||
tProcesses(0) = tNow + arrivalTime() | ||
demandId += 1 | ||
val demand = Demand(demandId, tNow) | ||
totalDemands += 1 | ||
println(s"\tтребование $demandId поступило в сеть") | ||
routing(0, demand) | ||
} | ||
|
||
for (i <- 1 to L) { | ||
// начало обслуживания | ||
if (!systems(i).serviceFlag && systems(i).demands.length > 0) { | ||
indicator = true | ||
systems(i).serviceFlag = true | ||
tProcesses(i) = tNow + systems(i).serviceTime() | ||
println(s"\tтребование ${systems(i).demands(0).id} начало обслуживаться в системе ${systems(i).id}") | ||
} | ||
|
||
// завершение обслуживания | ||
if (tProcesses(i) == tNow) { | ||
indicator = true | ||
systems(i).serviceFlag = false | ||
println(s"\tтребование ${systems(i).demands(0).id} закончило обслуживаться в системе ${systems(i).id}") | ||
routing(i, systems(i).demands(0)) | ||
tau = sumLifeTime / servicedDemands | ||
if (servicedDemands != 0) 0 | ||
tProcesses(i) = tMax + 1 | ||
} | ||
|
||
// выход из строя | ||
if (systems(i).beDestroyedAt == tNow) { | ||
println(s"Система $i выходит из строя") | ||
systems(i).state = false | ||
lostDemands += systems(i).demands.length | ||
// println(systems(i).currentDemands()) | ||
systems(i).demands.clear() | ||
b(i - 1) = 0 | ||
systems(i).beDestroyedAt = tMax + 1 | ||
tProcesses(i) = tMax + 1 | ||
theta = changeTheta() | ||
if (!checkMatrix()) { | ||
restore() | ||
} | ||
tauSummarized += sumLifeTime / servicedDemands | ||
if (servicedDemands != 0) 0 | ||
countStates += 1 | ||
servicedDemands = 0 | ||
sumLifeTime = 0 | ||
} | ||
} | ||
|
||
if (tau > tauThreshold) { | ||
restore() | ||
tauSummarized += sumLifeTime / servicedDemands | ||
if (servicedDemands != 0) 0 | ||
countStates += 1 | ||
servicedDemands = 0 | ||
sumLifeTime = 0 | ||
} | ||
|
||
if (!indicator) { | ||
// статистика | ||
for (system <- systems) { | ||
system.updateTimeStates(tNow) | ||
} | ||
|
||
// println('------') | ||
// println(s'tau for $b = $tau') | ||
// for (i <- 0 to L) { | ||
// println(s'Система $i:\n${for (state <- systems(i).deserializationTimeStates()) yield state / tMax}') | ||
// } | ||
// println('------\n') | ||
|
||
tOld = tNow | ||
tNow = (tProcesses :+ systems.tail.map(_.beDestroyedAt)).min | ||
} | ||
} | ||
|
||
println(s"\nВсего требований: $totalDemands\nОбслужено ${totalDemands - lostDemands}, потеряно $lostDemands") | ||
println(s"tau = ${tauSummarized / countStates if tauSummarized != 0 else tau}") | ||
println(s"pLost = ${lostDemands / totalDemands}") | ||
} | ||
} |