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

Nobuo Funabiki, A. Sugano, T. Higashino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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/sub -/ICRP). The simulation results show that MIPS/sub -/ICRP always provides near-optimum solutions.

Original languageEnglish
Title of host publicationProceedings - International Conference on Advanced Information Networking and Applications, AINA
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages229-232
Number of pages4
Volume2003-January
ISBN (Print)0769519067
DOIs
Publication statusPublished - 2003
Event17th International Conference on Advanced Information Networking and Applications, AINA 2003 - Xi'an, China
Duration: Mar 27 2003Mar 29 2003

Other

Other17th International Conference on Advanced Information Networking and Applications, AINA 2003
CountryChina
CityXi'an
Period3/27/033/29/03

Fingerprint

Metropolitan area networks
Processing
Network protocols

Keywords

  • Communication networks
  • Communication standards
  • Information science
  • Intelligent networks
  • Media Access Protocol
  • Metropolitan area networks
  • Payloads
  • Proposals
  • Telecommunication traffic
  • Traffic control

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Funabiki, N., Sugano, A., & Higashino, T. (2003). A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks. In Proceedings - International Conference on Advanced Information Networking and Applications, AINA (Vol. 2003-January, pp. 229-232). [1192877] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/AINA.2003.1192877

A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks. / Funabiki, Nobuo; Sugano, A.; Higashino, T.

Proceedings - International Conference on Advanced Information Networking and Applications, AINA. Vol. 2003-January Institute of Electrical and Electronics Engineers Inc., 2003. p. 229-232 1192877.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Funabiki, N, Sugano, A & Higashino, T 2003, A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks. in Proceedings - International Conference on Advanced Information Networking and Applications, AINA. vol. 2003-January, 1192877, Institute of Electrical and Electronics Engineers Inc., pp. 229-232, 17th International Conference on Advanced Information Networking and Applications, AINA 2003, Xi'an, China, 3/27/03. https://doi.org/10.1109/AINA.2003.1192877
Funabiki N, Sugano A, Higashino T. A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks. In Proceedings - International Conference on Advanced Information Networking and Applications, AINA. Vol. 2003-January. Institute of Electrical and Electronics Engineers Inc. 2003. p. 229-232. 1192877 https://doi.org/10.1109/AINA.2003.1192877
Funabiki, Nobuo ; Sugano, A. ; Higashino, T. / A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks. Proceedings - International Conference on Advanced Information Networking and Applications, AINA. Vol. 2003-January Institute of Electrical and Electronics Engineers Inc., 2003. pp. 229-232
@inproceedings{7b550d4ee80242a482db60efb873f6a5,
title = "A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks",
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/sub -/ICRP). The simulation results show that MIPS/sub -/ICRP always provides near-optimum solutions.",
keywords = "Communication networks, Communication standards, Information science, Intelligent networks, Media Access Protocol, Metropolitan area networks, Payloads, Proposals, Telecommunication traffic, Traffic control",
author = "Nobuo Funabiki and A. Sugano and T. Higashino",
year = "2003",
doi = "10.1109/AINA.2003.1192877",
language = "English",
isbn = "0769519067",
volume = "2003-January",
pages = "229--232",
booktitle = "Proceedings - International Conference on Advanced Information Networking and Applications, AINA",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

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

AU - Funabiki, Nobuo

AU - Sugano, A.

AU - Higashino, T.

PY - 2003

Y1 - 2003

N2 - 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/sub -/ICRP). The simulation results show that MIPS/sub -/ICRP always provides near-optimum solutions.

AB - 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/sub -/ICRP). The simulation results show that MIPS/sub -/ICRP always provides near-optimum solutions.

KW - Communication networks

KW - Communication standards

KW - Information science

KW - Intelligent networks

KW - Media Access Protocol

KW - Metropolitan area networks

KW - Payloads

KW - Proposals

KW - Telecommunication traffic

KW - Traffic control

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

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

U2 - 10.1109/AINA.2003.1192877

DO - 10.1109/AINA.2003.1192877

M3 - Conference contribution

SN - 0769519067

VL - 2003-January

SP - 229

EP - 232

BT - Proceedings - International Conference on Advanced Information Networking and Applications, AINA

PB - Institute of Electrical and Electronics Engineers Inc.

ER -