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

Steven S. Katz

dblp:93/4377 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none

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

Computer networks · 2

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
Network optimization and economics · 60% Routing and switching · 40%

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

TopicWeightPapersLastEvidence papers
Routing and switching
adaptive routing
0.011989
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
Network optimization and economics › resource allocation
bandwidth allocation
0.011989
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
Routing and switching › routing
distributed routing
0.011989
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
Network optimization and economics › network design
network planning
0.011989
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
Network optimization and economics › network design
robust network design
0.011989
Robust design and planning of a worldwide intelligent network · IEEE J. Sel. Areas Commun. 1989
YearPublicationVenuePosition
1990 Robust Design for Switched Digital Services in a Worldwide Intelligent Network
Arik N. Kashper, Steven S. Katz, Gerald R. Ash
Comput. Networks ISDN Syst.2
1989 Robust design and planning of a worldwide intelligent network
abstract
The authors describe the structure of the worldwide intelligent network (WIN), describe methods for its design and planning, investigate the adequacy of decentralized control for problem-free worldwide call completion, explore the feasibility of adaptive routing and control concepts, discuss network robustness/reliability objectives, and describe a strategy for achieving these objectives for all cooperating international carriers. Several decentralized adaptive routing policies that are particularly attractive in the WIN environment and network performance improvements that can be achieved with the introduction of flexible routing capabilities are characterized. It is shown by example that network integration coupled with flexible routing and bandwidth allocation for preferential treatment of new services provides an effective approach for robust and economical new service provisioning.>
Gerald R. Ash, Prosper Chemouil, Arik N. Kashper, Steven S. Katz, Katsuyuki Yamazaki, Yu Watanabe
IEEE J. Sel. Areas Commun.4