The pi-persistent protocol has received a lot of attention from the research community and is considered to be a very suitable candidate for multiple-access communication over high-speed metropolitan area networks (MANS). The pi-persistent is a unit-capacity and distance-insensitive protocol. Further, it is a very fair protocol. In order to make the p,-persistent protocol adaptive to changing load conditions, the inventors of the protocol proposed a novel dynamic algorithm that continuously adjusts the stations' probabilities pi's at their proper levels as governed by the offered traffic. While this dynamic algorithm achieves extremely good results, it requires N i-1 counters at the interface of each station to the network for an N-station network. Moreover, it requires a large processing time for updating the pi's of all stations which can have a big effect on the behavior of the protocol. In this paper, we propose a variant of this dynamic algorithm that solves these two problems while yielding exuctZy the same results as the original algorithm. Our new algorithm requires only a constant of 4 counters per station no matter how many stations are attached to the network. Further, the processing time for updating the pi's is a lot less than that of the original dynamic algorithm. Thus, with our new algorithm, the p,-persistent protocol seems to be the ideal candidate for future generation MANS. 0 1997 Elsevier Science B.V.