你好,模拟M / M / 1的队列阻塞时间我想出了这个解决方案,但不幸的是它不是面向对象的,问题是我想用M / M / 2来模拟它系统,例如我初始化lambda 19和mu和20只是为了便于计算任何解决方案,提示,代码示例将不胜感激。
public class Main {
public static void main(String[] args) {
final int MAX_ENTITY = 100000;
final int SYSTEM_CAPACITY = 5;
final int BUSY = 1;
final int IDLE = 0;
double lambda = 19, mu = 20;
int blocked = 0;
int queue_length = 0;
int server_state = IDLE;
int entity = 0;
double next_av = getArivalRand(lambda);
double next_dp = next_av + getDeparturedRand(lambda);
while (entity <= MAX_ENTITY) {
//Arrival
if (next_av <= next_dp) {
entity++;
if (server_state == IDLE) {
server_state = BUSY;
} else if (queue_length < SYSTEM_CAPACITY - 1) {
queue_length++;
} else {
blocked++;
}
next_av += getArivalRand(lambda);
} // Departure
else if (queue_length > 0) {
queue_length--;
next_dp = next_dp + getDeparturedRand(mu);
} else {
server_state = IDLE;
next_dp = next_av + getDeparturedRand(mu);
}
}
System.out.println("Blocked Etity:" + blocked + "\n");
}
public static double getArivalRand(double lambda) {
return -1 / lambda * Math.log(1 - Math.random());
}
public static double getDeparturedRand(double mu) {
return -1 / mu * Math.log(1 - Math.random());
}
}
修改
如果您不了解队列理论,请检查here
答案 0 :(得分:0)
哦,你知道你的代码需要严格的重构才能实现M/M/2
。
我创建了一个gist文件here,我认为它实现了你想要的,
在gist文件中,我创建了一个Dispatcher
类来平衡两个服务器中的两个队列,并且我用两个种子模拟它,它更像是面向对象的方法,
这是一个来自gist文件的示例代码,用于平衡负载 任务
if (server1.getQueueLength() < server2.getQueueLength())
currentServer = server1;
else if (server1.getQueueLength() > server2.getQueueLength())
currentServer = server2;
else if (currentServer == server1)
currentServer = server2;
else
currentServer = server1;