Satellite Packet Switching with Global Assignments and Batch Poisson Arrivals

A satellite packet switching multiaccess model which employs a global scheduling assignment scheme is described and analyzed for batch Poisson arrivals. System performance in terms of buffer overflow probability and system delay is analyzed and simulated. The numerical results, presented in graphical form, indicate that the performance improves as the population size M increases. For large value of M the queueing delay decays approximately exponentially as the buffer length increases. Our results indicate that the system delay performance of our dynamic assignment (DA) algorithm is significantly better than that of a synchronous time-division multiplexing scheme.