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

Alfred Lotze

dblp:271/5395 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1981
—ORCID · none

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

Computer networks · 3 · 2 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
3 papers
Network performance modeling · 46% Optical networks · 34% Network optimization and economics · 17%

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

TopicWeightPapersLastEvidence papers
Network performance modeling
teletraffic engineering
0.031981
DDD Network Optimization in Field Engineering-From Theory to Application · IEEE Trans. Commun. 1974
Design Parameters and Loss Calculation of Link Systems · IEEE Trans. Commun. 1974
TDM Versus SDM Switching Arrays-Comparison · IEEE Trans. Commun. 1981
Optical networks
switching network design
0.011981
TDM Versus SDM Switching Arrays-Comparison · IEEE Trans. Commun. 1981
Network optimization and economics › network design
capacity planning
0.011974
DDD Network Optimization in Field Engineering-From Theory to Application · IEEE Trans. Commun. 1974
Network performance modeling › packet loss
loss modeling
0.011981
TDM Versus SDM Switching Arrays-Comparison · IEEE Trans. Commun. 1981
Routing and switching › adaptive routing
alternate routing
0.011974
DDD Network Optimization in Field Engineering-From Theory to Application · IEEE Trans. Commun. 1974

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

link system modeling · 0.0cost analysis · 0.0teletraffic theory · 0.0monte carlo simulation · 0.0loss approximation · 0.0approximate loss calculation · 0.0
YearPublicationVenuePosition
1981 TDM Versus SDM Switching Arrays-Comparison
abstract
In the first paper at the 9th ITC [8], PCM (TDM) switching arrays having up to six stages and up to about 100 000 terminations were investigated with regard to their standardized costs per termination as a function of the cost ratio "gate to memory-bit." In this context, the following were considered: the influence of the number and sequence of stages (T-stages,S-stages), the number of terminations, the degree of multiplexing (30, 120 time slots per multiplex line). Furthermore, new PCM charts for the quick design of economic PCM switching arrays were developed. The second paper completes these studies by comparisons between PCM switching arrays and their equivalent SDM switching arrays. Handy formulas for the best possible economic design of PCM and SDM arrays, respectively, are presented and derived. The loss versus the carried traffic of PCM arrays havingS = 3up to six stages and withM = 30and 120 time slots per highway are compared with each other and with equivalent SDM link systems. Furthermore, the relative costs per termination are calculated for these PCM and SDM array structures and drawn versus the size of these arrays.
Alfred Lotze, Klaus Rothmaier, Reinhard Scheller
IEEE Trans. Commun.1
1974 Design Parameters and Loss Calculation of Link Systems
abstract
The problems of how group-selection link systems should be structured, wired, and hunted to achieve optimal traffic characteristics are studied. Furthermore, a loss-and-load-equivalent mapping of large group-selection link systems to smaller ones is presented. A new approximate loss calculation method is developed. All studies were supported by extensive Monte Carlo simulations.
Dieter Bazlen, Gerald Kampe, Alfred Lotze
IEEE Trans. Commun.3
1974 DDD Network Optimization in Field Engineering-From Theory to Application
abstract
This paper deals with some important practical applications of teletraffic theory to field engineering problems. It is shown that the following tasks concerning line switching telephone networks can be mastered by means of a few handy tables: loss calculation and dimensioning of trunk groups for full or limited access; very accurate loss approximation of link systems with an arbitrary number of stages, operating as group selection or traffic concentrating arrays with point-to-group selection mode (regarding this, and also optimal link structures, wiring, etc., see [7] in this issue); dimensioning groups with limited or full access for offered peaked overflow traffic; cost minimizing partition of the traffic in local or toll networks with alternate routing to the various trunk groups; and computerized dimensioning is of course also possible.
Alfred Lotze
IEEE Trans. Commun.1