Functional strong law of large numbers for loads in a planar network model

In this note we consider a planar network with three bins located at the vertices of an equilateral triangle and customers which are uniformly distributed on the triangle and have Poisson arrival times and general sojourn times. We show that the allocation which minimizes the bin loads and that one which affiliates each customer to its less costly bin satisfy the same functional strong law of large numbers.