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

Luke Wong

dblp:43/1665 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none

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

Systems, architecture and hardware · 1Computer networks · 1Databases, data management, data science and information retrieval · 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
2 papers
Internet architecture and protocols · 66% Network performance modeling · 16% Wireless networking · 14%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
local area network
0.021985
Short-Packet Transfer Performance in Local Area Ring Networks · IEEE Trans. Computers 1985
Short-Packet Transfer Performance in Local Area Rings · INFOCOM 1984
Internet architecture and protocols › local area network
ring network
0.021985
Short-Packet Transfer Performance in Local Area Ring Networks · IEEE Trans. Computers 1985
Short-Packet Transfer Performance in Local Area Rings · INFOCOM 1984
Internet architecture and protocols › network security
access control protocol
0.011985
Short-Packet Transfer Performance in Local Area Ring Networks · IEEE Trans. Computers 1985
Wireless networking
medium access control
0.011985
Short-Packet Transfer Performance in Local Area Ring Networks · IEEE Trans. Computers 1985
Cellular and mobile networks
short packet transmission
0.011984
Short-Packet Transfer Performance in Local Area Rings · INFOCOM 1984

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

simulation · 0.0measurement · 0.0analytical modeling · 0.0
YearPublicationVenuePosition
2002 iQueue: A Pervasive Data Composition Framework
abstract
There will soon be a huge number of data sources accessible to applications across the Internet. These include Web services, personal devices such as cellular phones and cars, and sensors measuring physical phenomena. New classes of data-composition applications can exploit this data. However, the data is diverse, voluminous, and often rapidly changing. The sources of data can be mobile, distributed, and failure-prone. Without system support, applications that use this kind of data are difficult to write. The iQueue data composition framework provides system support for data composition, thereby making the task of writing applications easier.
Norman H. Cohen, Apratim Purakayastha, Luke Wong, Danny L. Yeh
Mobile Data Management3
1985 Short-Packet Transfer Performance in Local Area Ring Networks
abstract
The performance of various access control protocols for bit-serial local area computer network (LACN) rings is studied. Applications in which mnessage packets are of fixed length and shorter than the total inherent propagation delay around the ring are the focus of attention. Token, slotted, and static and dynamic insertion rings are included in the study. In all cases, the transmitting station is responsible for removing its transmitted packet from the ring. Under this type of removal rule, it is possible for the stations of all types of ring structures to execute their access control algorithms with only a short fixed in-line delay in each station. The insertion rings dynamically switch longer delays (insertion registers) into the ring when they are transmitting a packet. The transmitter-remove rule operates in such a way that hogging of the ring transmission facility by a subset of stations cannot occur. Expressions that approximate average transfer time as a function of utilization are derived for all ring types and are checked by simulation. The expressions are found to be quite accurate at low ring utilization levels, which is the case of most importance for LACN's; but some of them exhibit significant errors at high utilization levels. For the assumed, short-packet environment, it is found that token rings exhibit the slowest transfer times, while dynamic insertion rings are fastest.
Wayne M. Loucks, V. Carl Hamacher, Bruno R. Preiss, Luke Wong
IEEE Trans. Computers4
1984 Short-Packet Transfer Performance in Local Area Rings
Wayne M. Loucks, V. Carl Hamacher, Bruno R. Preiss, Luke Wong
INFOCOM4