Browsing by Author "Yang, JS"

Now showing 1 - 4 of 4

A prioritized Petri Net model and its application in distributed multimedia systems
(1998-04-01)
Guan, SU
;
Yu, HY
;
Yang, JS
;
資訊工程學系
;
Department of Computer Science
The achievement of media synchronization has been dealt with in the Object Composition Petri Net (OCPN) model and the extended OCPN (XOCPN) model. Yet these two models are not enough for synchronization of computers in a distributed environment. This paper proposes a new Petri Net model-Prioritized Petri Net (P-net). The modeling power and properties of P-nets are analyzed. We apply the P-net model to distributed multimedia synchronization, using our version of Distributed Object Composition Petri Net (DOCPN) model. Using the DOCPN model, we can coordinate operations among distributed computer sites. The scenario is like a conductor conducting an orchestra to perform a symphony.
An intelligent agent-based mobile resource reservation scheme
(2005)
Wang, JT
;
Yang, JS
;
Tseng, CC
;
資訊工程學系
;
Department of Computer Science
This paper presents an Intelligent Agent-based Resource reservation aPproach (IARSVP) to support Quality of Service (QoS) aware packet transmissions for mobile networks. Mobile Intelligent Agents (MIAs) are characterized by their ability to move across wide-area networks, operate autonomously on foreign hosts, and perform tasks on behalf of the originating hosts. With MIAs, IARSVP can pre-allocate resources in advance for anticipated location an MN may visit next. Because MIAs carries the MN's W requirement and administration specification, and mobility association together with the necessary executable codes, they can adjust themselves in accordance with the network topology and current resource usage in locating forwarding points for the anticipated locations the MNs may visit next. Therefore, IARSVP can support route optimization and regional registration naturally, avoid redundant resource reservations made in common routes, and discover alternative route dynamically. Furthermore, MIAs can also perform location updates on behalf of MNs. Simulation results show that IARSVP outperforms Mobile RSVP and Hierarchical Mobile RSVP in terms of forced termination, reservation blocking, and session completion probabilirties.
Dynamic scheduling framework on an RLC/MAC layer for, general packet radio service
(2003-09-01)
Yang, JS
;
Tseng, CC
;
Cheng, RG
;
資訊工程學系
;
Department of Computer Science
In this paper, we present a traffic-scheduling framework that can dynamically allocate radio resources to a general packet radio service (GPRS) mobile station (MS) based on the interference levels of the radio links and the quality of service (QoS) specification of the MS. The underlying,idea of this scheduling scheme is to preserve more bandwidth for use by those MSs that are within a low interference region so that the limited radio resources can be used more effectively. In this scheme, an MS uses a low transmission rate for data transfer when the MS is within a high interference region to avoid wasting bandwidth by transmitting data in a condition with high interference. In order to compensate for the service loss of the MS, we will allocate more bandwidth to the MS when it is within a low interference region. In addition, we also propose an analytical model that can be used to derive the transmission rate for an MS in a low interference region based on the delay-bound requirement of the MS. The performance results show that our dynamic scheme can utilize the bandwidth more effectively to satisfy various QoS requirements of the MSs in the GPRS system without changing the convolution-coding rate.
Dynamic scheduling framework on RLC/MAC layer for general packet radio service
(2001)
Yang, JS
;
Tseng, CC
;
Cheng, RG
;
資訊工程學系
;
Department of Computer Science
In this paper, we present a traffic-scheduling framework which can dynamically allocate radio resource to GPRS handsets based on the interference levels of the radio links. Essentially, when a mobile station (MS) is within a high interference region, the proposed scheme uses a low transmission rate to reduce bandwidth wastage due to re-transmissions. On the other hand, when the MS is within a low interference region, a high transmission rare is used, in order to fulfill its quality of service (QoS) requirements. One of our contributions is to derive a rate decision analytical model to determine the high and low transmission rates based on the interference conditions and the delay-bound requirement. The performance results show that our dynamic scheme can effectively utilize the bandwidth to satisfy various QoS requirements in the GPRS system without changing the convolution-coding rate.