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

Kin Mun Lye

dblp:27/3858 · DBLP profile ↗
← Back
21ranked-venue papers
7as first author
0since 2021 · last 2010
—ORCID · none

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

Computer networks · 19 · 7 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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
4 papers
Cellular and mobile networks · 40% Physical-layer communications · 19% Network optimization and economics · 16%

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

TopicWeightPapersLastEvidence papers
Cellular and mobile networks › mobile networks › mobile network architecture › mobile core network › location register
home location register
0.011995
Two-Way Calling Public CT2 Telepoint System · IEEE J. Sel. Areas Commun. 1995
Cellular and mobile networks › mobile networks › mobile network architecture › mobile core network
location register
0.011995
Two-Way Calling Public CT2 Telepoint System · IEEE J. Sel. Areas Commun. 1995
Cellular and mobile networks
mobility management
0.011995
Two-Way Calling Public CT2 Telepoint System · IEEE J. Sel. Areas Commun. 1995
Cellular and mobile networks › mobility management
visitor location register
0.011995
Two-Way Calling Public CT2 Telepoint System · IEEE J. Sel. Areas Commun. 1995
Network optimization and economics › resource allocation
bandwidth allocation
0.011994
Rate-Based Headend Request Control Protocol for MAN · INFOCOM 1994
Network optimization and economics › resource allocation › bandwidth allocation
fair bandwidth allocation
0.011994
Rate-Based Headend Request Control Protocol for MAN · INFOCOM 1994
Wireless networking
medium access control
0.011994
Rate-Based Headend Request Control Protocol for MAN · INFOCOM 1994
Network performance modeling
queueing analysis
0.011992
Performance Analysis of an Adaptive Token Bus Protocol · INFOCOM 1992
Internet architecture and protocols › local area network
token bus
0.011992
Performance Analysis of an Adaptive Token Bus Protocol · INFOCOM 1992
Physical-layer communications › modulation › frequency modulation
digital FM
0.011990
Error rates for narrow-band digital FM with discriminator detection in mobile radio systems · IEEE Trans. Commun. 1990
Physical-layer communications
fading channels
0.011990
Error rates for narrow-band digital FM with discriminator detection in mobile radio systems · IEEE Trans. Commun. 1990
Physical-layer communications
modulation
0.011990
Error rates for narrow-band digital FM with discriminator detection in mobile radio systems · IEEE Trans. Commun. 1990
Physical-layer communications
radio propagation
0.011990
Error rates for narrow-band digital FM with discriminator detection in mobile radio systems · IEEE Trans. Commun. 1990
Internet architecture and protocols › link-layer protocols
local area network protocol
0.011992
Performance Analysis of an Adaptive Token Bus Protocol · INFOCOM 1992

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

simulation · 0.0analytical modeling · 0.0rayleigh fading simulation · 0.0quasistatic analysis · 0.0discriminator detection · 0.0
YearPublicationVenuePosition
2010 Complexity Scalable H.264/AVC Encoding
abstract
The H.264/AVC video coding standard encapsulates the most advanced video coding tools. Since the various techniques that lead to better coding efficiency of the coding standard also inevitably increase the complexity of the video encoder, real-time H.264 encoding of video streams is a challenging task. If available computational resource does not allow the entire encoding process to be carried out in time, a complexity scalable technique that ensures a graceful degradation of coding performance will be a valuable tool. We designed a video encoding scheme that allows the rate distortion (R-D) process to be carried out in a complexity scalable fashion. Our proposed singularly parameterized complexity scalable scheme allows the control of complexity-coding performance tradeoff when available resources are limited and the optimal R-D performance is unattainable.
Yih Han Tan, Wei Siong Lee, Jo Yew Tham, Susanto Rahardja, Kin Mun Lye
IEEE Trans. Circuits Syst. Video Technol.5
2008 On the Delivery of Scalable Video over Heterogenous P2P Networks
abstract
We consider the on-demand delivery of layered video over peer-to-peer (P2P) networks. A parallel server architecture enables the service of requests by more than one server, thus reducing load at individual servers and dispersing network load. In a P2P network, peer upload bandwidth is limited and heterogenous, so a P2P streaming session may involve multiple supplying peers of different uplink. Partitioning the video data is a crucial first step in the collaborative delivery of data by multiple servers. If done right, the client's viewing experience can be significantly improved. In this paper, we describe a retrieval strategy that significantly reduces access delay necessary for continous playback when retrieving layers of heterogenous bitrate over multiple connections of heterogenous bandwidth.
Yih Han Tan, Jo Yew Tham, Kin Mun Lye
ICCCN3
2008 An energy efficient cooperative optimal harvesting algorithm for Mobile Sensor Networks
abstract
We research into using Mobile Sensor Networks to harvest physical quantities that emanate from sources and are distributed in space in hazardous environments. Examples are temperature, toxic emissions and pollutions. Mobile sensors are more advantageous than static sensors in many ways such as easy re-deployment and environmental friendliness. However, they are usually deployed at low node densities with equally spaced nodes. As a result, the reconstructed distribution maps are highly distorted. Our approach attacks the problem from the source, by mobilizing the sensors to harvest data with high information content cooperatively and intelligently. As a result, we achieve 3.6 times in error reduction relative to an equally distributed grid. Moreover, in comparison with the Random Waypoint and Broyden-Fletcher-Goldfarb-Shanno methods, we achieve at least 60% more reduction in energy usage by consuming 70% lesser energy. Finally, our approach has a resource utilization efficiency of 50 times that of static sensors.
Choong Hock Mar, Winston Khoon Guan Seah, Kin Mun Lye, Marcelo H. Ang
PIMRC3
1997 Performance of a Delta ATM switch
Kin Mun Lye, Winston Khoon Guan Seah
Comput. Commun.1
1995 Performance of PRMA in a mobile radio channel
Kee Chaing Chua, W. M. Tan, Kin Mun Lye
Comput. Commun.3
1995 Two-Way Calling Public CT2 Telepoint System
abstract
In most current implementations of CT2 telepoint systems, only handset initiated calls are allowed. This paper describes a design to allow two-way calling for the CT2 public telepoint system with minimal modifications to the current CT2 infrastructure and the public switched telephone network (PSTN). The design makes use of centralized databases in the home location register (HLR) and visitor location registers (VLR) to track the location of handsets. This location information is stored in the VLR and HLR, and is used by the PSTN to route incoming calls destined for CT2 handsets to the appropriate CT2 telepoint base station (TBS). The TBS connect to the PSTN local exchanges (LE) through the integrated services digital network (ISDN) basic rate interfaces (BRI) for fast out-of-band signaling. We present simulation results of the system with the objective of determining where congestion might occur within the system and to understand the impact of the new implementation on the PSTN. The results indicate that the performance of the system will be limited by the VLR processing speed and the number of ISDN BRI's connecting the ISDN front end (IFE) to the PSTN.>
C. J. H. Foo, R. Sharp, Kin Mun Lye, B. T. Tan, Kee Chaing Chua
IEEE J. Sel. Areas Commun.4
1994 Rate-Based Headend Request Control Protocol for MAN
abstract
The paper presents a new MAC protocol, rate-based headend request control (RHRC), for dual unidirectional bus networks, which overcomes the unfairness of DQDB by allowing each station to generate multiple requests while retaining most of the positive features of DQDB, including 100% bandwidth utilization and low access delay at very low load. In addition, the protocol has two attractive features. Firstly, the transmission mechanism controlling station access to the data channel is able to provide approximately equal opportunity to messages so that they experience almost the same average delay independent of their physical locations and the traffic distribution. Secondly, the bandwidth allocation mechanism can achieve fair bandwidth sharing among stations when the network is overloaded, while maintaining fairness in terms of message delay amongst the underloaded stations. This mechanism also results in a shorter transient period than the bandwidth balancing mechanism of DQDB. Simulation results are included and comparisons are made with DQDB.>
Shanzeng Guo, Kee Chaing Chua, Kin Mun Lye
INFOCOM3
1994 Performance of a network protocol processor
Kin Mun Lye, Kee Chaing Chua
Comput. Commun.1
1994 Adaptive self-stabilizing connection control scheme for server-based networks
Kin Mun Lye, G. Y. Loo, Kee Chaing Chua, Winston Khoon Guan Seah
Comput. Commun.1
1994 Synchronization protocol for high quality and single-point playout multimedia applications
G. F. Zhao, Kin Mun Lye
Comput. Commun.2
1993 Performance analysis of two bridged CSMA/CD networks
Chi Chung Ko, J. L. Du, Robert H. Deng, Kin Mun Lye
Comput. Commun.5
1992 Performance Analysis of an Adaptive Token Bus Protocol
abstract
The authors study the performance of an adaptive token-passing bus protocol where only active stations participate in the token passing, and therefore make up the logical ring. A station is active over an interval of time if during that interval data are generated at the station to be sent over the network. The size of the logical ring thus varies randomly according to the traffic intensity of the system. Existing analytical results for token-passing systems assume a fixed number of stations, which will take part in the token passing regardless of whether a station is active or not. An approximate analytical model is provided for a token-passing system where the effective size of the ring changes dynamically according to the network traffic.>
Kin Mun Lye, Winston Khoon Guan Seah, Kee Chaing Chua
INFOCOM1
1990 Simple performance analysis of a token ring metropolitan area network
Chi Chung Ko, Tjeng Thiang Tjhung, Winston Khoon Guan Seah, Kin Mun Lye
Comput. Commun.4
1990 Implementation of Segnet and its experimental performance
Kin Mun Lye, Fa Toh Yap
Comput. Commun.1
1990 Performance of a dynamically segmentable ring network
Kin Mun Lye, Chi Chung Ko
Comput. Commun.2
1990 Error rates for narrow-band digital FM with discriminator detection in mobile radio systems
abstract
Error rates for a narrowband digital FM system with discriminator detection in a land mobile radio channel characterized by fading and Doppler frequency shift are obtained using a new analytical method. The fading rate is assumed to be much slower than the bit rate so that signal distortion through a narrow bandpass filter can be analyzed via a quasistatic approach. An experiment was conducted using a Rayleigh fading simulator, and the error rate measurements are shown to agree well with the calculated results, except at high SNR (signal-to-noise ratio) where an irreducible error rate was observed.>
Tjeng Thiang Tjhung, Kin Mun Lye, K. A. Koh, K. B. Chang
IEEE Trans. Commun.2
1989 Analysis of a CSMA/CD-Based Protocol with Dynamic Segmentation
Chi Chung Ko, Kin Mun Lye, Kee Chaing Chua, Fa Toh Yap
Comput. Networks2
1987 Performance of Segnet - a simulation study
Kin Mun Lye, Kee Chaing Chua, Chi Chung Ko
Comput. Commun.1
1986 A New Priority Multi-Channel CSMA/CD Protocol
Kin Mun Lye, Chi Chung Ko
ICC1
1986 On Quaternary DPSK Error Rates Due to Noise and Interferences
Tjeng Thiang Tjhung, Kin Mun Lye
ICC2
1986 CSMA/CD-based protocol with dynamic segmentation
Kee Chaing Chua, Kin Mun Lye, Chi Chung Ko
Comput. Commun.2