Browsing by Author "HWANG, LC"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item type:Item, A NEW RECURSIVE METHOD FOR THE MEAN WAITING TIME IN A POLLING NETWORK WITH GATED GENERAL ORDER SERVICE(1994-08-01) ;CHANG, CJ ;HWANG, LC ;電信工程研究所 ;電信研究中心Institute of Communications EngineeringA new recursive method for obtaining the mean waiting time in a polling system with general service order and gated service discipline is proposed. The analytical approach used to obtain the mean waiting time is via an imbedded Markov chain and a new recursive method is used to obtain the moments of pseudocycle time which are parameters in the formula for the mean waiting time. This method is computationally tractable, so the analytical results can cover a wide range of applications. Simulations are also conducted to verify the validity of the analysis.Item type:Item, A SCHEDULING MECHANISM OF GENERAL SERVICE ORDER SEQUENCE AND LIMITED SERVICE DISCIPLINE FOR A DISTRIBUTED SWITCHING SOFTWARE(1994) ;CHANG, CJ ;HWANG, LC ;電信工程研究所Institute of Communications EngineeringItem type:Item, OPTIMAL-DESIGN OF A FINITE-BUFFER POLLING NETWORK WITH MIXED SERVICE DISCIPLINE AND GENERAL SERVICE ORDER SEQUENCE(1995-02-01) ;HWANG, LC ;CHANG, CJ ;電信工程研究所 ;電信研究中心Institute of Communications EngineeringPolling schemes have been widely used in LANs, MANs, and distributed systems. The authors design a polling network (system) in which each station is finite-buffered and is served according to a mixed service discipline and a general service order sequence. They first analyse the network by means of an imbedded Markov chain approach to obtain probability generating functions (PGFs) for the number of customers in stations at four observation points: customer-service beginning, customer-service ending, server's arrival, and server's departure. Two performance measures of mean waiting time and blocking probability are then derived. Finally, the authors search for an optimal pattern of the mixed service discipline and service order sequence for a polling network via a genetic algorithm. The results show that a polling network with an optimal pattern of mixed service discipline and service order sequence offers a great improvement in performance over a polling network with a unique service discipline and cyclic service order sequence; a polling network has different optimal patterns for different traffic intensities; and a near-optimal pattern could exist for all traffic loads.