queue_markov_chain.py

class QueueChain():
    def __init__(self, arrival, service):
        self.arrival = arrival
        self.service = service
    
    def sample_path(self, n):
        
        path = [0]
        for i in range(1, n):
            path.append(path[i - 1])
            if np.random.random() < self.arrival:
                path[i] += 1
            if path[i] > 0 and np.random.random() < self.service:
                path[i] -= 1
        
        return path