Access scheduling schemes using global information on local area networks

Random access scheduling schemes for broadcast-bus-type local area networks are considered. It is found that a good access scheduling scheme not only has information about the number of packets to be scheduled, but which, more importantly controls the average of this number, which can be achieved by properly choosing the scheduling interval. Furthermore, this scheduling interval is updated in such a way that adjacent intervals overlap, which by correlation gives a better estimate for the number of packets to be scheduled. The scheduling schemes developed using such concepts provide significant performance improvement over schemes using other scheduling approaches previously reported in the literature.<>