GCRA generic cell rate algorithm in Python

from collections import deque
import time

class GCRA:
    def __init__(self, rate, burst):
        self.tau = burst
        self.T = rate
        self.t = 0
        self.LCT = 0

    def add_cell(self, arrival_time):
        if arrival_time <= self.t:
            return False
        arrived_early = (arrival_time - self.LCT) < 0
        if arrived_early:
            return False
        if (arrival_time - self.LCT) >= self.tau:
            self.t = self.LCT = arrival_time
            return True
        if self.t <= (arrival_time - self.LCT) < self.tau:
            self.t += self.T
            if self.t > arrival_time:
                return False
            self.t = max(self.t, arrival_time)
            return True
        return False

def mock_gcra(cells, rate=1.0, burst=4.0):
    scheduler = GCRA(rate, burst)
    accepted = []
    rejected = []
    for i, arrival in enumerate(cells):
        if scheduler.add_cell(arrival):
            accepted.append(arrival)
        else:
            rejected.append(arrival)
    return accepted, rejected

if __name__ == "__main__":
    cells = [0.0, 0.5, 1.0, 1.5, 2.0, 2.5, 3.0, 3.5, 4.0, 4.5]
    accepted, rejected = mock_gcra(cells, rate=1.0, burst=2.0)
    print(f"Accepted: {accepted}")
    print(f"Rejected: {rejected}")