Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Toshiya Ohuchi

dblp:122/1371 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Internet architecture and protocols · 50% Routing and switching · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 50% Electronic design automation · 50%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › ATM networks
ATM switching
0.011993
Shared buffer memory switch for an ATM exchange · IEEE Trans. Commun. 1993
Routing and switching › switching
shared memory switch
0.011993
Shared buffer memory switch for an ATM exchange · IEEE Trans. Commun. 1993
Electronic design automation › physical design › buffer optimization
buffer sizing
0.011993
Shared buffer memory switch for an ATM exchange · IEEE Trans. Commun. 1993
Performance modeling and evaluation
queueing models
0.011993
Shared buffer memory switch for an ATM exchange · IEEE Trans. Commun. 1993

Methods — techniques the papers use, named apart from their topics

traffic measurement · 0.0queueing analysis · 0.0
YearPublicationVenuePosition
1993 Shared buffer memory switch for an ATM exchange
abstract
An asynchronous transfer mode (ATM) switch architecture called a shared buffer memory switch whose output cell buffers are shared among all the output ports of the switch is proposed. Experimental measurements and a discussion about the traffic characteristics of the switch architecture are carried out to determine how much buffer memory will be reduced through buffer sharing under various traffic conditions and to roughly estimate how many buffers are needed for the switch to meet certain requirements. The resultant estimate shows that buffer sharing reduces the necessary buffer memory to less than 1/5 of what would otherwise be required, and the required buffer size is about 128 cells/output for a 32*32 switch when considering bursty traffic conditions. LSI implementation is also discussed to show that a 32*32 switch can be composed of about 12 chips mounted on one printed board.>
Noboru Endo, Takahiko Kozaki, Toshiya Ohuchi, Hiroshi Kuwahara, Shinobu Gohara
IEEE Trans. Commun.3