The isochronous channel reuse problem (ICRP) on DQDB metropolitanarea networks is investigated. Given a set of established isochronousconnections and a set of isochronous requests, the goal is to use aminimal number of isochronous channels to service these requests. On theother hand, given a limited isochronous bandwidth, the goal is toestablish a maximal number of isochronous connections. In the paper, theauthors show that the ICRP is NP-complete. For the simplified ICRP(SICRP), in which all the established isochronous connections as well asthe isochronous requests are of the same bandwidth, the authors suggesta tight lower bound and propose an efficient isochronous channel reusealgorithm (ICRA). Simulation results show that for the SICRP, thesolutions obtained by the ICRA are very close to the lower bound whichimplies the proposed ICRA is very attractive. For a limited isochronousbandwidth, the number of successful established isochronous connectionsobtained by the ICRA is much more than that of the original DQDBisochronous channels allocation scheme
展开▼
