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

N. Funabiki; A. Sugano; T. Higashino

doi:10.1109/AINA.2003.1192877

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

N. Funabiki, A. Sugano, T. Higashino

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings - 17th International Conference on Advanced Information Networking and Applications, AINA 2003
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	229-232
Number of pages	4
ISBN (Electronic)	0769519067
DOIs	https://doi.org/10.1109/AINA.2003.1192877
Publication status	Published - 2003
Event	17th International Conference on Advanced Information Networking and Applications, AINA 2003 - Xi'an, China Duration: Mar 27 2003 → Mar 29 2003

Publication series

Name	Proceedings - International Conference on Advanced Information Networking and Applications, AINA
Volume	2003-January
ISSN (Print)	1550-445X

Other

Other	17th International Conference on Advanced Information Networking and Applications, AINA 2003
Country	China
City	Xi'an
Period	3/27/03 → 3/29/03

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)

Access to Document

10.1109/AINA.2003.1192877

Fingerprint Dive into the research topics of 'A proposal of a minimal-state processing search algorithm for isochronous channel reuse problems in DQDB networks'. Together they form a unique fingerprint.

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 - 17th International Conference on Advanced Information Networking and Applications, AINA 2003 (pp. 229-232). [1192877] (Proceedings - International Conference on Advanced Information Networking and Applications, AINA; Vol. 2003-January). 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, N.; Sugano, A.; Higashino, T.

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

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 - 17th International Conference on Advanced Information Networking and Applications, AINA 2003., 1192877, Proceedings - International Conference on Advanced Information Networking and Applications, AINA, vol. 2003-January, 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 - 17th International Conference on Advanced Information Networking and Applications, AINA 2003. Institute of Electrical and Electronics Engineers Inc. 2003. p. 229-232. 1192877. (Proceedings - International Conference on Advanced Information Networking and Applications, AINA). 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. Proceedings - 17th International Conference on Advanced Information Networking and Applications, AINA 2003. Institute of Electrical and Electronics Engineers Inc., 2003. pp. 229-232 (Proceedings - International Conference on Advanced Information Networking and Applications, AINA).

@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 = "N. Funabiki and A. Sugano and T. Higashino",

note = "Publisher Copyright: {\textcopyright} 2003 IEEE. Copyright: Copyright 2015 Elsevier B.V., All rights reserved.; 17th International Conference on Advanced Information Networking and Applications, AINA 2003 ; Conference date: 27-03-2003 Through 29-03-2003",

year = "2003",

doi = "10.1109/AINA.2003.1192877",

language = "English",

series = "Proceedings - International Conference on Advanced Information Networking and Applications, AINA",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "229--232",

booktitle = "Proceedings - 17th International Conference on Advanced Information Networking and Applications, AINA 2003",

}

TY - GEN

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

AU - Funabiki, N.

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

AN - SCOPUS:84941340855

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

SP - 229

EP - 232

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

PB - Institute of Electrical and Electronics Engineers Inc.

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

Y2 - 27 March 2003 through 29 March 2003

ER -