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

Tadanobu Okada

dblp:38/1671 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1988
—ORCID · none

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

Computer networks · 2 · 1 first-author

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 · 61% Transport protocols and congestion control · 30% Network optimization and economics · 9%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
ATM networks
0.011988
Flow control schemes and delay/loss tradeoff in ATM networks · IEEE J. Sel. Areas Commun. 1988
Transport protocols and congestion control
flow control
0.011988
Flow control schemes and delay/loss tradeoff in ATM networks · IEEE J. Sel. Areas Commun. 1988
Internet architecture and protocols › quality of service
service classes
0.011988
Flow control schemes and delay/loss tradeoff in ATM networks · IEEE J. Sel. Areas Commun. 1988
Network optimization and economics
resource allocation
0.011988
Flow control schemes and delay/loss tradeoff in ATM networks · IEEE J. Sel. Areas Commun. 1988

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

queueing analysis · 0.0
YearPublicationVenuePosition
1988 Flow control schemes and delay/loss tradeoff in ATM networks
abstract
Performance and flow control mechanisms, which represent ATM (asynchronous transfer mode) flexibility, are discussed. To control performance, delay- and/or loss-sensitive service classes, and two mechanisms to realize these classes, are proposed. It is shown that it is possible to have better performance than with other mechanisms, such as no-class distinction or simple priority methods. It is further suggested that this performance controllability results in the provision of multiple logical services, including quasi-STM (synchronous transfer mode; compatible with circuit switching), by an ATM network. ATM flow control is based on a call-oriented resource allocation mechanism similar to circuit switching. The concepts of call/line bit rate ratio and multiplexing degree are seen to be significant for efficient use of resources. When the network handles calls with large call/line bit rate ratios, user-specified flow control parameters at the call setup phase are important for resource assignment. The definition of two types of maximum throughput of each call and its usage for resource management are proposed.>
Hirokazu Ohnishi, Tadanobu Okada, Kiyohiro Noguchi
IEEE J. Sel. Areas Commun.2
1984 Network Facilities For Communications Processing
Tadanobu Okada, Masahiko Itoh, Toshio Sakaguchi, Yoshinori Sakai
ICC (3)1