A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks

Author

Funabiki, Nobuo ; Sugano, Ayako ; Higashino, Teruo

Author_Institution

Dept. of Commun. Network Eng., Okayama Univ., Japan

fYear

2003

fDate

27-29 March 2003

Firstpage

229

Lastpage

232

Abstract

The IEEE 802.6 MAC 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. We propose a minimal-state processing search algorithm for ICRP (MIPS_-ICRP). The simulation results show that MIPS_-ICRP always provides near-optimum solutions.

Keywords

IEEE standards; access protocols; channel allocation; metropolitan area networks; performance evaluation; telecommunication standards; DQDB networks; IEEE 802.6 MAC standard protocol; channel assignment; distributed-queue dual bus; isochronous channel reuse problems; metropolitan area networks; minimal-state processing search algorithm; Communication networks; Communication standards; Information science; Intelligent networks; Media Access Protocol; Metropolitan area networks; Payloads; Proposals; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Advanced Information Networking and Applications, 2003. AINA 2003. 17th International Conference on

Print_ISBN

0-7695-1906-7

Type

conf

DOI

10.1109/AINA.2003.1192877

Filename

1192877