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

Luis E. Flamm

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

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

Computer networks · 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
1 paper
Internet architecture and protocols · 70% Network performance modeling · 30%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › voice/data integration
integrated voice/data transmission
0.011983
A Distributed Local Area Network Packet Protocol for Combined Voice and Data Transmission · IEEE J. Sel. Areas Commun. 1983
Internet architecture and protocols › link-layer protocols
local area network protocol
0.011983
A Distributed Local Area Network Packet Protocol for Combined Voice and Data Transmission · IEEE J. Sel. Areas Commun. 1983
Internet architecture and protocols › local area network
unidirectional bus network
0.011983
A Distributed Local Area Network Packet Protocol for Combined Voice and Data Transmission · IEEE J. Sel. Areas Commun. 1983

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

simulation · 0.0distributed scheduling algorithm · 0.0
YearPublicationVenuePosition
1983 A Distributed Local Area Network Packet Protocol for Combined Voice and Data Transmission
abstract
Local area networks designed to carry a variety of traffic such as data, voice, facsimile, and video should be able to implement low latency virtual circuits to meet the demands of periodic traffic. We have designed a partially distributed algorithm to efficiently schedule voice traffic on a unidirectional bus system called Fasnet. Virtual channels are allocated for the duration of a talk spurt and relinquished during the intervening silent intervals. Conversations already in progress, but without an assigned circuit, take precedence over newly arriving calls. Unused voice capacity may be utilized by data stations when required. Simulations of the system indicate that performance is close to that obtained by an ideal TASI multiplexer. While the algorithm is unfair, this is not a significant factor unless the network is loaded very heavily. Further, except for a "sojourn" time unused voice capacity is utilized by the data stations.
John O. Limb, Luis E. Flamm
IEEE J. Sel. Areas Commun.2