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

Rainer Siebenhaar

dblp:13/1946 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—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
Internet architecture and protocols · 50% Network performance modeling · 25% Routing and switching · 25%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
ATM networks
0.011995
Multiservice Call Blocking Approximations for Virtual Path Based ATM Networks with CBR and VBR Traffic · INFOCOM 1995
Network performance modeling › loss systems
call blocking probability
0.011995
Multiservice Call Blocking Approximations for Virtual Path Based ATM Networks with CBR and VBR Traffic · INFOCOM 1995
Internet architecture and protocols › service integration
multi-service networks
0.011995
Multiservice Call Blocking Approximations for Virtual Path Based ATM Networks with CBR and VBR Traffic · INFOCOM 1995
Routing and switching › routing › virtual circuit routing
virtual path routing
0.011995
Multiservice Call Blocking Approximations for Virtual Path Based ATM Networks with CBR and VBR Traffic · INFOCOM 1995

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

trunk reservation · 0.0equivalent single path model · 0.0
YearPublicationVenuePosition
1995 Multiservice Call Blocking Approximations for Virtual Path Based ATM Networks with CBR and VBR Traffic
abstract
The exact calculation of call blocking probabilities for multiservice ATM networks with alternate or adaptive routing for virtual channels (VC) is hardly possible. Therefore the paper presents and investigates the equivalent single path model as an approximation to omit the VC routing algorithm in the calculation. The model can be applied to ATM networks with several direct virtual path connections between each node pair. Further different methods to calculate the multiservice call blocking probabilities are reviewed and compared. A new approximate method is presented for networks, where the trunk reservation fairness mechanism is applied. This method is accurate, fast and may also be used for noninteger capacities and bandwidth requirements, which is important for statistical multiplexing of variable bitrate traffic.
Rainer Siebenhaar
INFOCOM1