Abstract
The IEEE 802.6 MA standard protocol defines the distributed-queue dual bus (DQDB) for metropolitan area networks (MANs). The isochronous channel reuse problem (ICRP) has been studied for the efficient use of DQDB. Given a set of established connections and a set of connection requests, the goal of ICRP is to maximize the number of satisfied requests by finding a proper channel assignment, such that no established connection is not only reassigned a channel, but also any pair of active connections does not interfere each other. In this paper, we propose a minimal-state processing search algorithm for ICRP (MIPS ICRP). The simulation results show that MIPS ICRP always provides near-optimum solutions.