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

Ling-Yang Kung

dblp:28/471 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1998
—ORCID · none

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

Computer networks · 3Systems, architecture and hardware · 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 · 42% Wireless networking · 30% Routing and switching · 23%

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

TopicWeightPapersLastEvidence papers
Wireless networking › medium access control
carrier sense multiple access
0.011997
Multiple Priority CSMA-type Mulitchannel Local Area Network · INFOCOM 1997
Wireless networking
medium access control
0.011997
Multiple Priority CSMA-type Mulitchannel Local Area Network · INFOCOM 1997
Internet architecture and protocols › local area network
multichannel LAN
0.011997
Multiple Priority CSMA-type Mulitchannel Local Area Network · INFOCOM 1997
Routing and switching › routing
distributed routing
0.011995
Binary addressing and routing schemes in the Manhattan street network · IEEE/ACM Trans. Netw. 1995
Internet architecture and protocols › network topology
manhattan street network
0.011995
Binary addressing and routing schemes in the Manhattan street network · IEEE/ACM Trans. Netw. 1995
Internet architecture and protocols › naming and addressing
network addressing
0.011995
Binary addressing and routing schemes in the Manhattan street network · IEEE/ACM Trans. Netw. 1995
Routing and switching › routing
routing schemes
0.011995
Binary addressing and routing schemes in the Manhattan street network · IEEE/ACM Trans. Netw. 1995
Internet architecture and protocols › packet scheduling
priority scheduling
0.011997
Multiple Priority CSMA-type Mulitchannel Local Area Network · INFOCOM 1997
Network performance modeling
throughput analysis
0.011997
Multiple Priority CSMA-type Mulitchannel Local Area Network · INFOCOM 1997

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

simulation · 0.0queueing analysis · 0.0binary addressing · 0.0
YearPublicationVenuePosition
1998 Design of Reservation Mechanism Based on the Slotted Ring Network
abstract
The traditional slotted ring network is one of the high speed networks, however its transmission delay in heavy network load is too long. We propose a reservation mechanism to improve this drawback. The mechanism is particularly useful in the heavy network load to get a lower delay for high priority packet transmission. We compare it with a traditional slotted ring network by using simulations, and the results show that this mechanism provides the lower delay when the network traffic load is heavy.
Yung-Jin Wu, Jun-Yao Wang, Ling-Yang Kung, Wen-Shyang Hwang
ICPADS3
1997 Multiple Priority CSMA-type Mulitchannel Local Area Network
abstract
We introduce a new network access protocol for a CSMA-type multichannel local area network (MLAN). This new protocol has the capability of providing different network access priority among the various applications. From the earlier research, it has been shown that the CSMA-type MLAN is superior to a single channel of equal network bandwidth. On the basis of the developed MLAN architecture, we construct a new network access protocol to provide multiple transmission priorities for various applications e.g., text, voice, video, image, etc. This protocol is called multiple-priority multichannel local area network (MP-MLAN). The data transmission of MP-MLAN is collision-free, and we can find the throughput characteristics of MP-MLAN are higher and more stable than the conventional CSMA/CD or multichannel CSMA/CD network from the analysis results. A queueing analysis model for representing the MP-MLAN protocol is established and simulation results are also provided to evaluate the performance of this network.
Jia-Wei Liao, Jun-Yao Wang, Wei-Tsong Lee, Ling-Yang Kung
INFOCOM4
1995 Binary addressing and routing schemes in the Manhattan street network
abstract
In this paper, a simple addressing methodology called binary address scheme (BAS) is presented for the Manhattan Street Networks. It overcomes some of the deficiencies of other previously proposed schemes. It allows new nodes to be inserted into the network without changing the addresses of any existing nodes. In addition, it also reduces the computational complexity of routing. BAS provides a simple distributed routing rule that can be easily implemented by hardware in each node to achieve better performance. BAS can also be used in other networks which have strong dependence on the sequential order of node addressing.>
Wei-Tsong Lee, Ling-Yang Kung
IEEE/ACM Trans. Netw.2
1989 A new buffer insertion ring with time variant priority scheme to facilitate real-time image transmission on a high speed integrated local area network
abstract
A high speed integrated local area network and its protocols are described. The protocols combine blocking, queueing, and connection management disciplines to maximize the use of network bandwidth. This ensures that many stations can transmit real-time packets simultaneously, even real-time video data. Performance results including transmission delay and discarding ratio are presented and discussed.>
J. Y. Chao, Wei-Tsong Lee, Ling-Yang Kung
LCN3