A Minimum Dead Space Algorithm for Generalized Isochronous Channel Reuse Problems in DQDB Networks
Summary :
With the explosive growth of the Internet system, demands for broadband communication networks have rapidly increased to provide high quality network services. For this purpose, 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 efficient use of DQDB by finding proper channel assignments to incoming connection requests. In this paper, we first define the generalized isochronous channel reuse problem (GICRP) as a generalization of ICRP, to afford demands of simultaneously satisfying plural connection requests such as for multicast applications, where certain sets of connection requests must be assigned channels simultaneously. We prove the NP-completeness of its decision problem. Then, we propose a minimum dead space (MDS) algorithm as a heuristic approach to GICRP. The extensive simulation results show that with shorter computation time, our MDS algorithm can always find better channel assignments reducing the waiting time for packet transmissions than the best existing algorithm for conventional ICRP.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.9 pp.2692-2698
- Publication Date
- 2004/09/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Network
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Nobuo FUNABIKI, Jun KAWASHIMA, Kiyohiko OKAYAMA, Toru NAKANISHI, Teruo HIGASHINO, "A Minimum Dead Space Algorithm for Generalized Isochronous Channel Reuse Problems in DQDB Networks" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 9, pp. 2692-2698, September 2004, doi: .
Abstract: With the explosive growth of the Internet system, demands for broadband communication networks have rapidly increased to provide high quality network services. For this purpose, 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 efficient use of DQDB by finding proper channel assignments to incoming connection requests. In this paper, we first define the generalized isochronous channel reuse problem (GICRP) as a generalization of ICRP, to afford demands of simultaneously satisfying plural connection requests such as for multicast applications, where certain sets of connection requests must be assigned channels simultaneously. We prove the NP-completeness of its decision problem. Then, we propose a minimum dead space (MDS) algorithm as a heuristic approach to GICRP. The extensive simulation results show that with shorter computation time, our MDS algorithm can always find better channel assignments reducing the waiting time for packet transmissions than the best existing algorithm for conventional ICRP.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_9_2692/_p
Copy
@ARTICLE{e87-b_9_2692,
author={Nobuo FUNABIKI, Jun KAWASHIMA, Kiyohiko OKAYAMA, Toru NAKANISHI, Teruo HIGASHINO, },
journal={IEICE TRANSACTIONS on Communications},
title={A Minimum Dead Space Algorithm for Generalized Isochronous Channel Reuse Problems in DQDB Networks},
year={2004},
volume={E87-B},
number={9},
pages={2692-2698},
abstract={With the explosive growth of the Internet system, demands for broadband communication networks have rapidly increased to provide high quality network services. For this purpose, 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 efficient use of DQDB by finding proper channel assignments to incoming connection requests. In this paper, we first define the generalized isochronous channel reuse problem (GICRP) as a generalization of ICRP, to afford demands of simultaneously satisfying plural connection requests such as for multicast applications, where certain sets of connection requests must be assigned channels simultaneously. We prove the NP-completeness of its decision problem. Then, we propose a minimum dead space (MDS) algorithm as a heuristic approach to GICRP. The extensive simulation results show that with shorter computation time, our MDS algorithm can always find better channel assignments reducing the waiting time for packet transmissions than the best existing algorithm for conventional ICRP.},
keywords={},
doi={},
ISSN={},
month={September},}
Copy
TY - JOUR
TI - A Minimum Dead Space Algorithm for Generalized Isochronous Channel Reuse Problems in DQDB Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 2692
EP - 2698
AU - Nobuo FUNABIKI
AU - Jun KAWASHIMA
AU - Kiyohiko OKAYAMA
AU - Toru NAKANISHI
AU - Teruo HIGASHINO
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2004
AB - With the explosive growth of the Internet system, demands for broadband communication networks have rapidly increased to provide high quality network services. For this purpose, 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 efficient use of DQDB by finding proper channel assignments to incoming connection requests. In this paper, we first define the generalized isochronous channel reuse problem (GICRP) as a generalization of ICRP, to afford demands of simultaneously satisfying plural connection requests such as for multicast applications, where certain sets of connection requests must be assigned channels simultaneously. We prove the NP-completeness of its decision problem. Then, we propose a minimum dead space (MDS) algorithm as a heuristic approach to GICRP. The extensive simulation results show that with shorter computation time, our MDS algorithm can always find better channel assignments reducing the waiting time for packet transmissions than the best existing algorithm for conventional ICRP.
ER -
English
