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

Michael Fine

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

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

Computer networks · 2 · 1 first-authorSystems, architecture and hardware · 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
3 papers
Internet architecture and protocols · 51% Wireless networking · 30% Physical-layer communications · 9%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
local area network
0.031986
Packet Voice on a Local Area Network with Round Robin Service · IEEE Trans. Commun. 1986
Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks · IEEE Trans. Computers 1984
Performance of Unidirectional Broadcast Local Area Networks: Expressnet and Fasnet · IEEE J. Sel. Areas Commun. 1983
Wireless networking › multiple access protocols
round robin access protocol
0.011986
Packet Voice on a Local Area Network with Round Robin Service · IEEE Trans. Commun. 1986
Internet architecture and protocols
voice/data integration
0.011986
Packet Voice on a Local Area Network with Round Robin Service · IEEE Trans. Commun. 1986
Internet architecture and protocols › local area network
bus network
0.011984
Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks · IEEE Trans. Computers 1984
Physical-layer communications › multiple access
demand assignment multiple access
0.011984
Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks · IEEE Trans. Computers 1984
Wireless networking
medium access control
0.011984
Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks · IEEE Trans. Computers 1984
Wireless networking › medium access control
access protocol
0.011983
Performance of Unidirectional Broadcast Local Area Networks: Expressnet and Fasnet · IEEE J. Sel. Areas Commun. 1983
Network performance modeling › delay analysis
packet delay analysis
0.011986
Packet Voice on a Local Area Network with Round Robin Service · IEEE Trans. Commun. 1986
Routing and switching
service disciplines
0.011983
Performance of Unidirectional Broadcast Local Area Networks: Expressnet and Fasnet · IEEE J. Sel. Areas Commun. 1983

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

simulation · 0.0queueing analysis · 0.0performance comparison · 0.0
YearPublicationVenuePosition
1986 Packet Voice on a Local Area Network with Round Robin Service
abstract
In this paper, we propose a combined voice/data protocol suitable for multiple access broadcast networks that provide round robin service to the stations. Such networks are well suited to the integration of voice and data since they guarantee bounded delay and provide high utilization even for high bandwidth channels. Using one such network proposal-namely Expressnet-as a representative scheme, we examine the characteristics of the service that voice traffic experiences under the voice/data protocol. We show that the access protocol is able to utilize the channel efficiently to support a large population of voice sources while maintaining low packet delay and guaranteeing some prespecified minimum bandwidth for data traffic. In addition, we show the advantages of silence suppression, i.e., discarding speech that constitutes silent periods, and we examine the cost of overloading the network in terms of the amount of speech discarded.
Michael Fine, Fouad A. Tobagi
IEEE Trans. Commun.1
1984 Demand Assignment Multiple Access Schemes in Broadcast Bus Local Area Networks
abstract
Local area communications networks based on packet broadcasting techniques provide simple architectures and efficient and flexible operation. Various ring systems and CSMA contention bus systems have been in operation for several years. More recently, a number of distributed demand assignment multiple access (DAMA) schemes suitable for broadcast bus networks have emerged which provide conflict-free broadcast communications by means of various scheduling techniques. Among these schemes, the Token-Passing Bus Access method uses explicit tokens, i.e., control messages, to provide the required scheduling. Others use implicit tokens, whereby stations in the network rely on information deduced from the activity on the bus to schedule their transmissions. In this paper we present many implicit-token DAMA schemes in a unified manner grouped according to their basic access mechanisms, and compare them in terms of performance and other important attributes.
Michael Fine, Fouad A. Tobagi
IEEE Trans. Computers1
1983 Performance of Unidirectional Broadcast Local Area Networks: Expressnet and Fasnet
abstract
Local area communication networks based on packet broadcasting techniques provide simple architectures and flexible and efficient operation. Unidirectional broadcast systems use a unidirectional transmission medium which, due to their physical ordering on the medium, users can access according to some efficient distributed conflict-free round-robin algorithm. Two systems of this type have been presented in the literature: Expressnet and Fasnet. In this paper we briefly describe these two. We identify three different service disciplines achievable by these systems and discuss and compare the performance of each. These systems overcome some of the performance limitations of existing random-access schemes, making them particularly well suited to the high bandwidth requirements Of an integrated services digital local network.
Fouad A. Tobagi, Michael Fine
IEEE J. Sel. Areas Commun.2