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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Inge Svinnset

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

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

Computer networks · 1 · 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
Routing and switching · 61% Internet architecture and protocols · 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.011994
Nonblocking ATM switching networks · IEEE Trans. Commun. 1994
Routing and switching › switching networks
multistage interconnection network		 0.011994
Nonblocking ATM switching networks · IEEE Trans. Commun. 1994
Routing and switching › switching networks
nonblocking networks		 0.011994
Nonblocking ATM switching networks · IEEE Trans. Commun. 1994
Network optimization and economics › admission control
connection admission control		 0.011994
Nonblocking ATM switching networks · IEEE Trans. Commun. 1994

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

combinatorial analysis · 0.0
YearPublicationVenuePosition
1994 Nonblocking ATM switching networks
abstract
General formulas have been derived for ATM multistage switching networks which are nonblocking on the connection level for certain types of connections. These formulas show that the size of such a network (i.e. the number of middle stage blocks) depends on the connection admission control (CAC) function. Exact formulas have been derived for networks with only point to point connections and networks with point to multipoint connections when the CAC function is a linear function of connection parameters. When CAC is a two moment allocation, upper and lower limit for the number of middle stage blocks have been given and exact formulas only for certain types of connections.>
Inge Svinnset
 IEEE Trans. Commun.1