<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

學術出版;;Publications

Permanent URI for this communityhdl:11536/1

收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作,涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.

Browse

Search Results

Now showing 1 - 4 of 4
  • Item type:Item,
    Analysis of a general service nonexhaustive polling system using a heuristic combination method and pseudoconservation law
    (1996-05-01)
    Chang, CJ
    ;
    Hwang, LC
    ;
    電信工程研究所
    ;
    電信研究中心
    ;
    Institute of Communications Engineering
    This paper is devoted to the analysis of the mean waiting time for a polling system with general service order sequence and nonexhaustive service discipline. We obtain an expression for the mean waiting time in terms of a so-called residual cycle time and derive a pseudoconservation law (PCL) to help improve the accuracy of estimations of the mean waiting time. By multiplying the estimations of the residual cycle times for all stations by equal and unequal constants, we obtain two separate solutions for the mean waiting time. We furthermore propose a heuristic method that combines these separate mean waiting times into a final solution for the mean waiting time. Numerical examples show that our combination method generates accurate estimations for the mean waiting times in both cyclic and general cases over all traffic loads.
  • Item type:Item,
    An exact analysis of an asymmetric polling system with mixed service discipline and general service order
    (1997-12-01)
    Hwang, LC
    ;
    Chang, CJ
    ;
    電信工程研究所
    ;
    電信研究中心
    ;
    Institute of Communications Engineering
    This paper derives the exact mean waiting time fur an asymmetric polling system with general service order and mixed service discipline. The mixed sen ice discipline means that the service discipline of each stage (a turn in the service order sequence) for the same station can be gated or exhaustive. The general service order denotes that each station can be polled more than once in a polling cycle. We use the mean age and the mean excess of a cumulative time to obtain the mean waiting times fur stages and stations, where the cumulative time for a stage is defined as the total arrival time period of all customers that are served at one visit of the server to the stage. The accuracy of our analysis is verified by comparisons with previously published results and simulation results. We also use a genetic algorithm (GA) to search for an optimal pattern of service order and service discipline For the asymmetrical polling system. The results of the paper can be applied to the design of computer communication networks with polling schemes. (C) 1997 Elsevier Science B.V.
  • Item type:Item,
    Analysis of a general service nonexhaustive polling system using a heuristic combination method and pseudoconservation law
    (1996-05-01)
    Chang, CJ
    ;
    Hwang, LC
    ;
    電信工程研究所
    ;
    電信研究中心
    ;
    Institute of Communications Engineering
    This paper is devoted to the analysis of the mean waiting time for a polling system with general service order sequence and nonexhaustive service discipline. We obtain an expression for the mean waiting time in terms of a so-called residual cycle time and derive a pseudoconservation law (PCL) to help improve the accuracy of estimations of the mean waiting time. By multiplying the estimations of the residual cycle times for all stations by equal and unequal constants, we obtain two separate solutions for the mean waiting time. We furthermore propose a heuristic method that combines these separate mean waiting times into a final solution for the mean waiting time. Numerical examples show that our combination method generates accurate estimations for the mean waiting times in both cyclic and general cases over all traffic loads.
  • Item type:Item,
    An exact analysis of an asymmetric polling system with mixed service discipline and general service order
    (1997-12-01)
    Hwang, LC
    ;
    Chang, CJ
    ;
    電信工程研究所
    ;
    電信研究中心
    ;
    Institute of Communications Engineering
    This paper derives the exact mean waiting time fur an asymmetric polling system with general service order and mixed service discipline. The mixed sen ice discipline means that the service discipline of each stage (a turn in the service order sequence) for the same station can be gated or exhaustive. The general service order denotes that each station can be polled more than once in a polling cycle. We use the mean age and the mean excess of a cumulative time to obtain the mean waiting times fur stages and stations, where the cumulative time for a stage is defined as the total arrival time period of all customers that are served at one visit of the server to the stage. The accuracy of our analysis is verified by comparisons with previously published results and simulation results. We also use a genetic algorithm (GA) to search for an optimal pattern of service order and service discipline For the asymmetrical polling system. The results of the paper can be applied to the design of computer communication networks with polling schemes. (C) 1997 Elsevier Science B.V.