A New Polling Architecture for Network with Non-exhaustive Multiple Token Mechanism

Abstract

The multichannel network is one of the solution to provide a huge network bandwidth, and the token passing is the scheme to guarantee the response in determinate interval and to provide the property of traffic collision-free. In this paper we study a multiple token system considered as a symmetric multiqueue, these queues are served in cyclic order by a number of identical tokens (servers). The discipline of service in this system is the non-exhaustive (Limited-1 service) type in which a token is permitted to serve at most one packet at a node (queue) per one token cycle. A node can simultaneously use more than one token at the same time; the study is concerned with the general case in which the walking time between nodes is not zero. By the renewal theory, we derive an approximate expression of the mean intervisit time in this system.