Browsing by Author "Haung, YR"

Now showing 1 - 5 of 5

A high-performance input access scheme for ATM multicast switching
(1996-01-01)
Haung, YR
;
Yuang, MC
;
資訊工程學系
;
Department of Computer Science
In this paper, we propose an input access scheme for input-queued ATM multicast switches, achieving high system throughput, low packet delay and packet loss probability. Multicast and unicast packets of each input port are separately queued. Multicast queues take priority over the unicast queues, and both types of queues are fairly served in a cyclic-priority access discipline. In particular, each unicast queue is handled on a window-service basis, and each multicast packet is switched in a one-shot scheduling manner. To evaluate the performance of the access scheme, we propose an approximate analysis based on a simplified cyclic-priority model for an N x N finite-buffer multicast switch possessing Bernoulli multicast and unicast arrivals, with window-service (for unicasting) and one-shot scheduling (for multicasting) both taken into account. Finally, we show simulation results to demonstrate the accuracy of the approximate analysis and the superiority of the scheme over existing schemes with respect to normalized system throughput, mean packet delay, and packet loss probability.
A high-performance input access scheme for ATM multicast switching
(1996)
Haung, YR
;
Yuang, MC
;
交大名義發表
;
資訊工程學系
;
National Chiao Tung University
In this paper, we propose an input access scheme for input-queued ATM multicast switches, achieving high system throughput, low packet delay and packet loss probability. Multicast and unicast packets of each input port are separately queued. Multicast queues take priority over the unicast queues, and both types of queues are fairly served in a cyclic-priority access discipline. In particular, each unicast queue is handled on a window-service basis, and each multicast packet is switched in a one-shot scheduling manner. To evaluate the performance of the access scheme, we propose an approximate analysis based on a simplified cyclic-priority model for an N x N finite-buffer multicast switch possessing Bernoulli multicast and unicast arrivals, with window-service (for unicasting) and one-shot scheduling (for multicasting) both taken into account. Finally, we show simulation results to demonstrate the accuracy of the approximate analysis and the superiority of the scheme over existing schemes with respect to normalized system throughput, mean packet delay, and packet loss probability.
A software architecture for GPRS session management
(2002-03-01)
Haung, YR
;
Lin, YB
;
資訊工程學系
;
Department of Computer Science
General packet radio service (GPRS) provides efficient access to the integrated services Internet from wireless networks. When the GPRS-attached mobile station attempts to send or receive data, a packet data protocol (PDP) context shall be established. The GPRS session management (SM) supports the PDP context handling, which consists of PDP context activation, deactivation, and modification procedures. In this paper, we propose an SM software architecture for the serving GPRS support node. Our design goals are to achieve compatibility. modularity, and flexibility. More importantly, our approach can accommodate the design of the SM software architecture for third-generation wireless networks. Copyright (C) 2001 John Wiley Sons, Ltd.
An all-IP approach for UMTS third-generation mobile networks
(2002-09-01)
Lin, YB
;
Pang, AC
;
Haung, YR
;
Chlamtac, I
;
交大名義發表
This article describes the UMTS all-IP approach for third-generation mobile systems, with emphasis on the core network architecture. Followng the introduction of the core network nodes, we elaborate on application-level registration, circuit-switched call origination, packet-switched call origination, and packet-switched call termination.
Performance analysis for voice/data integration on a finite-buffer mobile system
(2000-03-01)
Haung, YR
;
Lin, YB
;
Ho, JM
;
資訊工程學系
;
Department of Computer Science
Personal communication service (PCS) networks offer mobile users diverse telecommunication applications, such as voice, data, and image, with different bandwidth and quality-of-service (QoS) requirements. This paper proposes an analytical model to investigate the performance of an integrated voice/data mobile network with finite data buffer in terms of voice-call blocking probability, data loss probability, and mean data delay. The model is based on the movable-boundary scheme that dynamically adjusts the number of channels for voice and data traffic. With the movable-boundary scheme, the bandwidth can be utilized efficiently while satisfying the QoS requirements for voice and data traffic. Using our model, the impact of hot-spot traffic in the heterogeneous PCS networks, in which the parameters (e.g., number of channels, voice, and data arrival rates) of cells can be varied, can be effectively analyzed. In addition, an iterative algorithm based on our model is proposed to determine the handoff traffic, which computes the system performance in polynomial-bounded time. The analytical model is validated by simulation.