A minimum dead space algorithm for generalized isochronous channel reuse problems m DQDB networks

Nobuo Funabiki, Jun Kawashima, Kiyohiko Okayama, Toru Nakanishi, Teruo Higashino

Research output: Contribution to journalArticle

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.

Original languageEnglish
Pages (from-to)2692-2698
Number of pages7
JournalIEICE Transactions on Communications
VolumeE87-B
Issue number9
Publication statusPublished - Sep 2004

Fingerprint

Metropolitan area networks
Broadband networks
Telecommunication networks
Internet
Network protocols

Keywords

  • DQDB
  • Heuristic algorithm
  • ICRP
  • IEEE 802.6
  • Minimum dead space
  • NP-complete

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

A minimum dead space algorithm for generalized isochronous channel reuse problems m DQDB networks. / Funabiki, Nobuo; Kawashima, Jun; Okayama, Kiyohiko; Nakanishi, Toru; Higashino, Teruo.

In: IEICE Transactions on Communications, Vol. E87-B, No. 9, 09.2004, p. 2692-2698.

Research output: Contribution to journalArticle

@article{29b9c8ce4ad64b0ab566ee949f780f6a,
title = "A minimum dead space algorithm for generalized isochronous channel reuse problems m DQDB networks",
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 = "DQDB, Heuristic algorithm, ICRP, IEEE 802.6, Minimum dead space, NP-complete",
author = "Nobuo Funabiki and Jun Kawashima and Kiyohiko Okayama and Toru Nakanishi and Teruo Higashino",
year = "2004",
month = "9",
language = "English",
volume = "E87-B",
pages = "2692--2698",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

TY - JOUR

T1 - A minimum dead space algorithm for generalized isochronous channel reuse problems m DQDB networks

AU - Funabiki, Nobuo

AU - Kawashima, Jun

AU - Okayama, Kiyohiko

AU - Nakanishi, Toru

AU - Higashino, Teruo

PY - 2004/9

Y1 - 2004/9

N2 - 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.

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.

KW - DQDB

KW - Heuristic algorithm

KW - ICRP

KW - IEEE 802.6

KW - Minimum dead space

KW - NP-complete

UR - http://www.scopus.com/inward/record.url?scp=5444260642&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=5444260642&partnerID=8YFLogxK

M3 - Article

VL - E87-B

SP - 2692

EP - 2698

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 9

ER -