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.

Jint Waramahaputi

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

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

Computer networks · 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
1 paper
Internet architecture and protocols · 50% Wireless networking · 50%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols › local area network
bus network
0.011988
The linear conflict resolution algorithm for unidirectional broadcast bus networks · INFOCOM 1988
Wireless networking › multiple access protocols
conflict resolution
0.011988
The linear conflict resolution algorithm for unidirectional broadcast bus networks · INFOCOM 1988
Internet architecture and protocols › link-layer protocols
local area network protocol
0.011988
The linear conflict resolution algorithm for unidirectional broadcast bus networks · INFOCOM 1988
Wireless networking
medium access control
0.011988
The linear conflict resolution algorithm for unidirectional broadcast bus networks · INFOCOM 1988

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

queueing analysis · 0.0
YearPublicationVenuePosition
1988 The linear conflict resolution algorithm for unidirectional broadcast bus networks
abstract
A protocol called linear conflict resolution (LCR) for unidirectional broadcast bus networks is introduced. This protocol is shown to be suitable for both LAN (local area network) and MAN (metropolitan area network) environments. LCR combines the benefits of the quick access of the Aloha protocol and the deterministic access of TDMA (time-division multiple access). Not only could the maximum throughput of LCR be increased to near 100% but also the network is stable in that the delay is finite for all the operating conditions. The channel capacity of the LCR protocol is less sensitive to the bus characteristics than most of the existing protocols. Numerical results indicate that LCR exhibits good performance over a wide range of network sizes.>
Jint Waramahaputi, Suchai Thanawastien
INFOCOM1