The Experts below are selected from a list of 132 Experts worldwide ranked by ideXlab platform
Bert Zwart - One of the best experts on this subject based on the ideXlab platform.
-
Approximating the performance of a batch service queue using the M/M k /1 model
IEEE Transactions on Automation Science and Engineering, 2011Co-Authors: Kan Wu, Leon F. Mcginnis, Bert ZwartAbstract:Batching plays an important role in semiconductor fabs, and it can lead to inefficiency if not treated with care. The performance of parallel batch processes is often approximated by the G/G/1based approximate models. By carefully examining the existing models, the dependence between Queueing Time and wait-to-batch Time has been identified. A new improved model for parallel batch systems is proposed to exploit this dependence. The computation of the new model is still simple and fast, but it gives better approximation by reducing the systematic error in earlier models which ignored the dependence between Queueing Time and wait-to-batch Time. © 2010 IEEE.
-
Approximating the Performance of a Batch Service Queue Using the ${\rm M/M}^{\rm k}/1$ Model
IEEE Transactions on Automation Science and Engineering, 2011Co-Authors: Kan Wu, Leon F. Mcginnis, Bert ZwartAbstract:Batching plays an important role in semiconductor fabs, and it can lead to inefficiency if not treated with care. The performance of parallel batch processes is often approximated by the G/G/1-based approximate models. By carefully examining the existing models, the dependence between Queueing Time and wait-to-batch Time has been identified. A new improved model for parallel batch systems is proposed to exploit this dependence. The computation of the new model is still simple and fast, but it gives better approximation by reducing the systematic error in earlier models which ignored the dependence between Queueing Time and wait-to-batch Time.
Kan Wu - One of the best experts on this subject based on the ideXlab platform.
-
Approximating the performance of a batch service queue using the M/M k /1 model
IEEE Transactions on Automation Science and Engineering, 2011Co-Authors: Kan Wu, Leon F. Mcginnis, Bert ZwartAbstract:Batching plays an important role in semiconductor fabs, and it can lead to inefficiency if not treated with care. The performance of parallel batch processes is often approximated by the G/G/1based approximate models. By carefully examining the existing models, the dependence between Queueing Time and wait-to-batch Time has been identified. A new improved model for parallel batch systems is proposed to exploit this dependence. The computation of the new model is still simple and fast, but it gives better approximation by reducing the systematic error in earlier models which ignored the dependence between Queueing Time and wait-to-batch Time. © 2010 IEEE.
-
Approximating the Performance of a Batch Service Queue Using the ${\rm M/M}^{\rm k}/1$ Model
IEEE Transactions on Automation Science and Engineering, 2011Co-Authors: Kan Wu, Leon F. Mcginnis, Bert ZwartAbstract:Batching plays an important role in semiconductor fabs, and it can lead to inefficiency if not treated with care. The performance of parallel batch processes is often approximated by the G/G/1-based approximate models. By carefully examining the existing models, the dependence between Queueing Time and wait-to-batch Time has been identified. A new improved model for parallel batch systems is proposed to exploit this dependence. The computation of the new model is still simple and fast, but it gives better approximation by reducing the systematic error in earlier models which ignored the dependence between Queueing Time and wait-to-batch Time.
Leon F. Mcginnis - One of the best experts on this subject based on the ideXlab platform.
-
Approximating the performance of a batch service queue using the M/M k /1 model
IEEE Transactions on Automation Science and Engineering, 2011Co-Authors: Kan Wu, Leon F. Mcginnis, Bert ZwartAbstract:Batching plays an important role in semiconductor fabs, and it can lead to inefficiency if not treated with care. The performance of parallel batch processes is often approximated by the G/G/1based approximate models. By carefully examining the existing models, the dependence between Queueing Time and wait-to-batch Time has been identified. A new improved model for parallel batch systems is proposed to exploit this dependence. The computation of the new model is still simple and fast, but it gives better approximation by reducing the systematic error in earlier models which ignored the dependence between Queueing Time and wait-to-batch Time. © 2010 IEEE.
-
Approximating the Performance of a Batch Service Queue Using the ${\rm M/M}^{\rm k}/1$ Model
IEEE Transactions on Automation Science and Engineering, 2011Co-Authors: Kan Wu, Leon F. Mcginnis, Bert ZwartAbstract:Batching plays an important role in semiconductor fabs, and it can lead to inefficiency if not treated with care. The performance of parallel batch processes is often approximated by the G/G/1-based approximate models. By carefully examining the existing models, the dependence between Queueing Time and wait-to-batch Time has been identified. A new improved model for parallel batch systems is proposed to exploit this dependence. The computation of the new model is still simple and fast, but it gives better approximation by reducing the systematic error in earlier models which ignored the dependence between Queueing Time and wait-to-batch Time.
Yieh-ran Haung - One of the best experts on this subject based on the ideXlab platform.
-
Performance analysis for UMTS networks with queued radio access bearers
IEEE Transactions on Vehicular Technology, 2002Co-Authors: Yieh-ran HaungAbstract:The Universal Mobile Telecommunications System (UMTS) network consists of a core network (CN) and a UMTS terrestrial radio access network (UTRAN). The UTRAN offers radio access bearer (RAB) services between the user equipment (UE) and the CN to support mobile mulTimedia applications with different quality of service (QoS) requirements. Depending on the requested QoS, different types of RABs can be established at the request of the CN. The UTRAN then has to establish and maintain the RAB with the requested QoS. We study the Queueing of RABs as a means for improving the bandwidth utilization while minimizing the RAB blocking probability. We develop an analytical model to study the performance for UTRAN with queued RABs in terms of RAB blocking probability and average Queueing Time of queued RABs. From an analytic point of view, the main contribution of this paper is the introduction of a novel recursion for the computation of the performance measures.
Shuo-yen Robert Li - One of the best experts on this subject based on the ideXlab platform.
-
Analog memory by recursive 2-stage switching
2006 IEEE International Symposium on Information Theory, 2006Co-Authors: Shuo-yen Robert LiAbstract:This paper deals with flexibility, rather than efficiency, in information propagation. When optical, electrical, or acoustical signals are guided through their transmission medium, it is possible to store and retrieve their analog form for the purposes of Queueing, Time slot interchanging, multiplexing, demultiplexing, flexible delay, etc. To harness the constantly progressing signals, the analog memory need be equipped with switches for access flexibility and logical elasticity. This paper proposes systematic algorithms for recursive construction of analog memory via most basic interconnection patterns. The mathematical underpinning is mainly the algebraic theory on 2-stage interconnection networks, over which the switching control is self-routing and fast
