近年來網路交換處理系統(Switched Processing Systems)已受到許多關注及討論。這領域的研究發展，主要在於如何建構優良的控制策略，使得系統能夠達到最大的吞吐量表現。而這些策略通常必須透過交換服務模組來執行(如MaxProduct等)。但是，當伺服器交換所需時間必須被考量時，這類控制策略會損失不少的吞吐量。在2003年Armony & Bambos提出了一個吞吐量不受轉換時間影響的控制策略－BatchAdapt，但是此策略在工作平均等待時間(average delay)的表現極差，所以本文將提出一控制策略－角錐延展(Expanded Cone)策略，利用MaxProduct 策略來架構擁有的動態決策區域(decision cones)的角錐策略(Cone policy)。最後，透過電腦模擬的方式我們將展示當伺服器交換所需的時間被考慮時，此策略幾乎可達最大吞吐量，以及在平均等待時間上的表現會比BatchAdapt策略更好。 Switched Processing Systems (SPS) have received a lot of attentions in the past years. Over the last decade, research has been focused on how to obtain the maximal throughput of the system by constructing optimal scheduling policies which are executed throughout switching service modes (for example, MaxProduct). But, if the switch time of severs exchanging is non-negligible (theoretically, zero), this kind of policies will lose a lot of throughput. In 2003, Armony & Bambos brought up Adaptive Batching (BatchAdapt) policies. No matter how long the switch time is, it can possess maximal throughput property. But the delay performance of BatchAdapt policies is very worse. So we utilize the MaxProduct policies to construct new cone policies with dynamical decision cones, called Expanded Cone policies. Finally, we also perform the simulation study to show that policies that we propose can almost achieve maximal throughput when the switch time is considered, and perform better than BatchAdapt policies in average delay.
