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

K. Dan Levin

dblp:53/1348 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 1982
—ORCID · none

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

Computer networks · 2 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1

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
Wireless networking · 22% Routing and switching · 21% Internet of things and sensor networks · 21%

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

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks
data compression
0.011982
The Determination of Upper Bounds for Economically Effective Compression in Packet Switching Networks · SIGMETRICS 1982
Routing and switching
packet switching
0.011982
The Determination of Upper Bounds for Economically Effective Compression in Packet Switching Networks · SIGMETRICS 1982
Wireless networking
multiple access protocols
0.011979
BRAM: The Broadcast Recognizing Access Method · IEEE Trans. Commun. 1979
Transport protocols and congestion control › error control
automatic repeat request
0.011975
The Overlapping Problem and Performance Degradation of Mobile Digital Communication Systems · IEEE Trans. Commun. 1975
Cellular and mobile networks › mobile networks
land mobile radio
0.011975
The Overlapping Problem and Performance Degradation of Mobile Digital Communication Systems · IEEE Trans. Commun. 1975
Transport protocols and congestion control
retransmission schemes
0.011975
The Overlapping Problem and Performance Degradation of Mobile Digital Communication Systems · IEEE Trans. Commun. 1975
Wireless networking › cognitive radio › spectrum management
spectrum utilization
0.011975
The Overlapping Problem and Performance Degradation of Mobile Digital Communication Systems · IEEE Trans. Commun. 1975
Network performance modeling
queueing analysis
0.011975
The Overlapping Problem and Performance Degradation of Mobile Digital Communication Systems · IEEE Trans. Commun. 1975
Network performance modeling › queueing analysis › queueing performance
waiting time distribution
0.011975
The Overlapping Problem and Performance Degradation of Mobile Digital Communication Systems · IEEE Trans. Commun. 1975

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

simulation · 0.0queueing analysis · 0.0performance modeling · 0.0
YearPublicationVenuePosition
1982 The Determination of Upper Bounds for Economically Effective Compression in Packet Switching Networks
abstract
This paper deals with the economic tradeoffs associated with data compression in a packet switching environment.
Avner Aleh, K. Dan Levin
SIGMETRICS2
1979 BRAM: The Broadcast Recognizing Access Method
abstract
In this paper, we first present the broadcast recognizing access method (BRAM), an access protocol suitable for regulating internode communication in either a radio or (coaxial or fiber) cable based communication system. The method avoids collisions, imposes negligible computational requirements on the nodes attempting to transmit, and is fair in the sense that no node will be indefinitely prevented from transmitting. Next we introduce parametric BRAM which attempts to balance the length of inserted channel idle periods, resulting from scheduling effects, against the probability of allowed message collisions. We show that parametric BRAM can be used to realize a method which balances inserted channel idle time against the probability of message collision to yield enhanced performance. For high message loads, parametric BRAM converges to BRAM, while for low and medium loadings it yields throughputs in excess of BRAM, and other methods. Both BRAM and parametric BRAM are discussed under the assumption of homogeneous message arrival rates at the nodes. We conclude by showing how the parametric BRAM can be applied when the nodes operate with heterogeneous or mixed message arrival rates.
Imrich Chlamtac, William R. Franta, K. Dan Levin
IEEE Trans. Commun.3
1975 The Overlapping Problem and Performance Degradation of Mobile Digital Communication Systems
abstract
The expansion in the use of land mobile communications have led to a state of congestion in that portion of the radio spectrum allocated to the land mobile service. Digital communication is one of the methods that can be applied to improve spectrum utilization. In a typical digital communication system, messages are not queued and all overlapped messages have to be retransmitted. That overlapping phenomenon has a negative impact on the performance of the system. The behavior of various determinants of system performance (like probability distribution of waiting time and the load that saturates the channel capacity) are studied in detail. A simulation model was developed to simulate four basic design approaches. It was found that a combination of randomizer (for automatic retransmission) and an inhibit signal has no significant payoff and that each one of these features is superior to a commonly used method of automatic retransmission with constant delay. The relative merits of each design is studied as a function of the load on the channel.
K. Dan Levin
IEEE Trans. Commun.1