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.

Jon Chiung-Shien Wu

dblp:43/780 · also Chiung-Shien Wu · DBLP profile ↗
← Back
12ranked-venue papers
9as first author
0since 2021 · last 2001
—ORCID · none

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

Computer networks · 9 · 7 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 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
Wireless networking · 43% Transport protocols and congestion control · 22% Optical networks · 20%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 85% Embedded and real-time systems · 15%

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

TopicWeightPapersLastEvidence papers
Transport protocols and congestion control › transport protocols
reliable data transfer
0.011998
Data Transfer Scheme for Wireless Real-Time Communications · INFOCOM 1998
Wireless networking › wireless network protocols
wireless link protocol
0.011998
Data Transfer Scheme for Wireless Real-Time Communications · INFOCOM 1998
Wireless networking
medium access control
0.011997
Architecture for Two-Way Data Services over Residential Area CATV Networks · INFOCOM 1997
Internet architecture and protocols › broadband access
residential broadband access
0.011997
Architecture for Two-Way Data Services over Residential Area CATV Networks · INFOCOM 1997
Storage systems
data placement
0.011997
Efficient Real-Time Data Retrieval Through Scalable Multimedia Storage · ACM Multimedia 1997
Storage systems
multimedia storage
0.011997
Efficient Real-Time Data Retrieval Through Scalable Multimedia Storage · ACM Multimedia 1997
Optical networks › WDM networks
time-wavelength scheduling
0.011994
A Time-Wavelength Scheduling Algorithm for Interconnected WDM Star Networks · INFOCOM 1994
Wireless networking › scheduling
transmission scheduling
0.011994
A Time-Wavelength Scheduling Algorithm for Interconnected WDM Star Networks · INFOCOM 1994
Optical networks › WDM networks
WDM star networks
0.011994
A Time-Wavelength Scheduling Algorithm for Interconnected WDM Star Networks · INFOCOM 1994
Embedded and real-time systems
real-time communication
0.011998
Data Transfer Scheme for Wireless Real-Time Communications · INFOCOM 1998
Transport protocols and congestion control
flow control
0.011997
Architecture for Two-Way Data Services over Residential Area CATV Networks · INFOCOM 1997
Approximation and online algorithms
approximation algorithms
0.011994
A Time-Wavelength Scheduling Algorithm for Interconnected WDM Star Networks · INFOCOM 1994

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

analytical modeling · 0.0simulation · 0.0scheduling algorithm design · 0.0seek-time reduction · 0.0retrieval scheduling · 0.0queueing analysis · 0.0data placement · 0.0
YearPublicationVenuePosition
2001 A Real Time Transport Scheme for Wireless Multimedia Communications
Jon Chiung-Shien Wu
Mob. Networks Appl.1
2001 Intelligent Handoff for Mobile Wireless Internet
Jon Chiung-Shien Wu, Chieh-Wen Cheng, Nen-Fu Huang, Gin-Kou Ma
Mob. Networks Appl.1
1999 An efficient MAC protocol with interference reduction for wideband DS-CDMA systems
abstract
Wideband DS-CDMA is one of the RTT (radio transmission technology) proposals considered by ITU International Mobile Telecommunications commission: IMT-2000. For packet transmission over uplink common channels, multi-code spread slotted Aloha was the most popular MAC protocol. However, CDMA systems require more attention in code allocation and interference prevention, which is different for TDMA systems. This paper proposed an improved uplink MAC protocol for efficient common channel access. The new scheme can efficiently prevent unnecessary interference by stopping a transmission if it is bound to collide with others. Furthermore, the proposed protocol is very flexible in code allocation. The simulation result shows that less number of codes is required to achieve the same throughput/delay performance as the original spread slotted Aloha.
Jon Chiung-Shien Wu
ICC1
1999 A Scalable Storage Supporting Multistream Real-Time Data Retrieval
Jon Chiung-Shien Wu, Gin-Kou Ma, Mei-Chian Liu
Multim. Syst.1
1998 Performance consideration for packet reservation multiple access protocols over wireless networks
abstract
This paper presents a performance analysis of wireless MAC protocols in which the transmission of wireless packets is reserved through contention-based access. Compared with other pure random access protocols, this type of protocol is suitable for wireless networks with bursty packet arrivals, e.g., wireless ATM, or wireless LAN, for the reason that the carrier-sensing function cannot be efficiently implemented, thereby resulting in a very poor performance on the pure random access mechanism. The proposed analysis is based on simulation and the result shows that the efficiency of the protocol varies with different network parameters. The result also gives guidelines for optimizing the network performance, e.g., the control of the number of packets reserved in each request, the adjustment of signaling time-slots to the data time-slots ratio, and the adjustment of the threshold for rejecting a packet reservation request.
Jon Chiung-Shien Wu, Gin-Kou Ma
ICC1
1998 Data Transfer Scheme for Wireless Real-Time Communications
abstract
We proposed a link protocol called burst-oriented transfer with time-bounded retransmission (BTTR) for wireless real-time communications. This scheme uses a large transmission window for sending/receiving a burst of time-sensitive data, and within this window, another smaller observation window is repeatedly used for dynamic error retransmission(s). There is time limitation on each retransmission such that the burst of data can be received in a timely manner however by trading the packet loss performance for delay and throughput performance. An analysis is given in terms of the expectations of delay, throughput, and packet drop rate. The result shows that the proposed scheme can meet the delay and throughput requirement at reasonable packet loss performance.
Jon Chiung-Shien Wu, Gin-Kou Ma
INFOCOM1
1998 Link-sharing method for ABR/UBR services in ATM networks
Jon Chiung-Shien Wu
Comput. Commun.1
1997 Architecture for Two-Way Data Services over Residential Area CATV Networks
abstract
An architectural design for high speed residential data access using the traditional IEEE 802.3 medium access protocol over the existing CATV network is proposed. The described architecture is attractive in using the existing infrastructure combined with the existing access scheme in the residential area and thus it is cost effective and well suited for home Internet access. However, the traditional CSMA/CD protocol is not suitable for the cable TV network due to its long propagation delay. Thus, we propose to combine the existing IEEE 802.3 CSMA/CD MAC with the segmented cable subnetworks so that a home user can get access to the Internet as if he is using the Ethernet at 10 Mbps, or Fast-Ethernet at 100 Mbps. Only three subcarriers in the passband cable is used and therefore it will not interfere with the traditional broadcasting channels and the future digital video channels. The segmented cable are interconnected by the defined cable bridge (CB) and a simple flow control mechanism is proposed among the CBs. The functional components and operations of each CB are also described. For a fair performance among the subnetworks, a prioritized queueing scheme is also proposed on each CB.
Jon Chiung-Shien Wu, Gin-Kou Ma, Po-Ning Chen
INFOCOM1
1997 Efficient Real-Time Data Retrieval Through Scalable Multimedia Storage
abstract
This paper presents a novel data placement and retrieving scheme or real-time multimedia stream playback via a scalable storage system.The multimedia streams are contiguous data packets which may be representing video, audio, or other media be retrieved simultaneously from a storage system on a real-time and on-demand basis, The major challenge in implementing the system is the support of simultaneously retrieving a big number of streams from a large-capacity storage system.This bottleneck comes from the seeking delay caused by the random movement of disk head in the storage under multiple stream requests.The proposed scheme efftciently reduces the seeking time by a very simple placement method and a retrieval scheduler and, in the mean time, continuous playback of multiple real-time streams and a scalable storage capacity are both achieved.Performance valuation of the proposed scheme is provided through theoretical analysis and experimental measure.
Gin-Kou Ma, Jon Chiung-Shien Wu, Mei-Chian Liu, Bao-Shuh Paul Lin
ACM Multimedia2
1997 Personal mobile multimedia communications in a wireless WAN environment
abstract
Personal mobile equipments are often required to be simple, inexpensive, as well as powerful in the same time, for instance, a lightweight mobile terminal with multimedia on Internet. We refer to this equipment as Mobile Multimedia Terminal (MMT). This paper presents a protocol architecture supporting the multimedia access for MMT in a wireless WAN environment. To save the processing power, each MMT has a service agent located in a server connected to the mobile switching center. Based upon this model, a transport protocol and architecture for mobile multimedia communications is proposed. The proposed protocol is intended for the handover and real-time data transportation between MMT and the MMT agent. Architectural design of the MMT and its agent will also be described.
Jon Chiung-Shien Wu, Gin-Kou Ma, Bao-Shuh Paul Lin
MMSP1
1994 A Time-Wavelength Scheduling Algorithm for Interconnected WDM Star Networks
abstract
Although WDM-based single-hop star networks are attractive owing to their all-optical communication features, the throughput of such lightwave networks is limited due to the small number of available wavelengths. In this paper, a wavelength-reusable local lightwave network which consists of interconnected WDM star networks is proposed. Based on this architecture, the lower bound for the problems of minimizing the switching duration is derived. A transmission scheduling algorithm for this architecture to efficiently reuse the wavelengths is also proposed. The analytical result shows that the proposed scheduling algorithm always produces solutions no greater than twice of the lower bounds. Simulation results show that given the same number of users and available wavelengths, the solutions (in terms of the average switching duration and the average number of switching matrices) obtained by the proposed scheduling algorithm on the interconnected WDM networks are better than the optimal solution on a single-star WDM network. In most cases, the performance improvement achieves 20% to 45%.>
Nen-Fu Huang, Jon Chiung-Shien Wu, Gin-Kou Ma
INFOCOM2
1994 Some Routing Problems on Broadband ISDN
Nen-Fu Huang, Jon Chiung-Shien Wu, Yi-Jang Wu
Comput. Networks ISDN Syst.2