loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17 th International Conference on Advanced Information Networking and Applications (AINA'03)
A Proposal of a Minimal-State Processing Search Algorithm for Isochronous Channel Reuse Problems in DQDB Networks
Xi?an, China
March 27-March 29
ISBN: 0-7695-1906-7
ASCII Text
x 
 
Nobuo Funabiki, Ayako Sugano, Teruo Higashino, "A Proposal of a Minimal-State Processing Search Algorithm for Isochronous Channel Reuse Problems in DQDB Networks," Advanced Information Networking and Applications, International Conference on, pp. 229, 17 th International Conference on Advanced Information Networking and Applications (AINA'03), 2003.
 
 
BibTex
x
 
@article{ 10.1109/AINA.2003.1192877,
author = {Nobuo Funabiki and Ayako Sugano and Teruo Higashino},
title = {A Proposal of a Minimal-State Processing Search Algorithm for Isochronous Channel Reuse Problems in DQDB Networks},
journal ={Advanced Information Networking and Applications, International Conference on},
volume = {0},
year = {2003},
isbn = {0-7695-1906-7},
pages = {229},
doi = {http://doi.ieeecomputersociety.org/10.1109/AINA.2003.1192877},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Advanced Information Networking and Applications, International Conference on
TI - A Proposal of a Minimal-State Processing Search Algorithm for Isochronous Channel Reuse Problems in DQDB Networks
SN - 0-7695-1906-7
SP
EP
A1 - Nobuo Funabiki,
A1 - Ayako Sugano,
A1 - Teruo Higashino,
PY - 2003
KW - null
VL - 0
JA - Advanced Information Networking and Applications, International Conference on
ER -
 
Nobuo Funabiki, Okayama University
Ayako Sugano, Okayama University
Teruo Higashino, Osaka University
The IEEE 802.6 MA 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. In this paper, we propose a minimal-state processing search algorithm for ICRP (MIPS ICRP). The simulation results show that MIPS ICRP always provides near-optimum solutions.
Citation:
Nobuo Funabiki, Ayako Sugano, Teruo Higashino, "A Proposal of a Minimal-State Processing Search Algorithm for Isochronous Channel Reuse Problems in DQDB Networks," aina, pp.229, 17 th International Conference on Advanced Information Networking and Applications (AINA'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.