IEICE TRANSACTIONS on transactions
A Switch-Box Router 
BOX-PEELER" and Its Tractable Problems
Summary :
Given a switch-box, let C be a connection requirement. If there is a polynomial time algorithm (router) to complete C, C is said to be tractable by the algorithm. There have been proposed a number of switch-box routers but none that makes clear its tractable problems. We propose a switch-box router, or rather a principle, BOX-PEELER with a simple characterization of a class of tractable problems. BOX-PEELER is developed to be an underlying concept in switch-box routing as LEFT-EDGE method has been in 2-side channel routing.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E72-E No.12 pp.1367-1373
- Publication Date
- 1989/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on the 2nd Karuizawa Workshop on Circuits and Systems)
- Category
- VLSI Design Technology
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
Atsushi TAKAHASHI, Yoji KAJITANI, "A Switch-Box Router BOX-PEELER" and Its Tractable Problems" in IEICE TRANSACTIONS on transactions,
vol. E72-E, no. 12, pp. 1367-1373, December 1989, doi: .
Abstract: Given a switch-box, let C be a connection requirement. If there is a polynomial time algorithm (router) to complete C, C is said to be tractable by the algorithm. There have been proposed a number of switch-box routers but none that makes clear its tractable problems. We propose a switch-box router, or rather a principle, BOX-PEELER with a simple characterization of a class of tractable problems. BOX-PEELER is developed to be an underlying concept in switch-box routing as LEFT-EDGE method has been in 2-side channel routing.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e72-e_12_1367/_p
Copy
@ARTICLE{e72-e_12_1367,
author={Atsushi TAKAHASHI, Yoji KAJITANI, },
journal={IEICE TRANSACTIONS on transactions},
title={A Switch-Box Router BOX-PEELER" and Its Tractable Problems},
year={1989},
volume={E72-E},
number={12},
pages={1367-1373},
abstract={Given a switch-box, let C be a connection requirement. If there is a polynomial time algorithm (router) to complete C, C is said to be tractable by the algorithm. There have been proposed a number of switch-box routers but none that makes clear its tractable problems. We propose a switch-box router, or rather a principle, BOX-PEELER with a simple characterization of a class of tractable problems. BOX-PEELER is developed to be an underlying concept in switch-box routing as LEFT-EDGE method has been in 2-side channel routing.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A Switch-Box Router BOX-PEELER" and Its Tractable Problems
T2 - IEICE TRANSACTIONS on transactions
SP - 1367
EP - 1373
AU - Atsushi TAKAHASHI
AU - Yoji KAJITANI
PY - 1989
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E72-E
IS - 12
JA - IEICE TRANSACTIONS on transactions
Y1 - December 1989
AB - Given a switch-box, let C be a connection requirement. If there is a polynomial time algorithm (router) to complete C, C is said to be tractable by the algorithm. There have been proposed a number of switch-box routers but none that makes clear its tractable problems. We propose a switch-box router, or rather a principle, BOX-PEELER with a simple characterization of a class of tractable problems. BOX-PEELER is developed to be an underlying concept in switch-box routing as LEFT-EDGE method has been in 2-side channel routing.
ER -
English
