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

Marcel Schlatter

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

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

Computer networks · 1Theory of computation · 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
2 papers
Routing and switching · 36% Internet architecture and protocols · 32% Network performance modeling · 16%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › local area network
buffer insertion ring
0.011983
An Approximate Method for the Performance Analysis of Buffer Insertion Rings · IEEE Trans. Commun. 1983
Internet architecture and protocols › network topology
interconnected ring networks
0.011983
Capacity of interconnected ring communication systems with unique loop-free routing · IEEE Trans. Inf. Theory 1983
Routing and switching › routing algorithms
loop-free routing
0.011983
Capacity of interconnected ring communication systems with unique loop-free routing · IEEE Trans. Inf. Theory 1983
Wireless networking
network capacity
0.011983
Capacity of interconnected ring communication systems with unique loop-free routing · IEEE Trans. Inf. Theory 1983
Network performance modeling › local area network performance
ring network performance
0.011983
An Approximate Method for the Performance Analysis of Buffer Insertion Rings · IEEE Trans. Commun. 1983
Routing and switching
routing
0.011983
Capacity of interconnected ring communication systems with unique loop-free routing · IEEE Trans. Inf. Theory 1983

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

traffic modeling · 0.0queueing analysis · 0.0decomposition · 0.0analytic modeling · 0.0
YearPublicationVenuePosition
1983 An Approximate Method for the Performance Analysis of Buffer Insertion Rings
abstract
A new analytic approach for the performance evaluation of buffer insertion rings is proposed which overcomes the basic limitations of former analyses. Key to our analysis is that the global performance model of a buffer insertion ring is decomposed into submodels in such a way that the basic interdependence of interarrival and transmission times of the frames transmitted is taken into account. The analysis itself is relatively straightforward and yields simple and explicit results for the mean delays of the frames. For special traffic patterns, the analysis is exact, for the general case, it is approximate but its accuracy turns out to be high, as comparison with simulation results shows.
Werner Bux, Marcel Schlatter
IEEE Trans. Commun.2
1983 Capacity of interconnected ring communication systems with unique loop-free routing
abstract
{\em Capacity} is defined for a given distribution of offered traffic as the maximum rate with which packets can be sent with finite delay through the network by appropriate routing. It is shown how capacity depends on the traffic characteristics and on the topology of ring communication systems interconnected so as to provide unique loop-free routing. First, the traffic conditions are given under which the capacity of a {\em single ring} attains its maximum and its minimum. For the case of {\em uniform traffic} it is shown that the capacity is equal to twice the minimum capacity. Then it is shown that, for uniform traffic, the capacity relative to a single ring communication system can be increased by as much as33.3or80percent when the stations are split up into two or three separate rings, respectively, interconnected to give unique loop-free routing. Exact formulas are given for the capacity of systems with an arbitrary number of stations split up into an arbitrary number of separate rings interconnected to give unique loop-free routing. Finally, it is shown that connecting {\em local rings} through a star network with a central switching node is particularly useful when stations can be segregated into local groups of stations which often communicate with stations from the same local group but only rarely with stations from the other groups. Exact formulas are given to calculate the capacity of such interconnected ring communication systems.
Marcel Schlatter, James L. Massey
IEEE Trans. Inf. Theory1