Minimizing internal speedup for performance guaranteed optical packet switches
Bin Wu, Kwan Lawrence Yeung · 2005
Providing QoS guarantees for Internet services is very important. It evokes the issue that packet switches should provide guaranteed performance (i.e. 100% throughput with bounded worst-case delay). Optical switching technology is widely considered as an excellent solution for packet switches in future networks. However, to achieve guaranteed performance in optical packet switches, an internal speedup is required due to the existence of reconfiguration overhead. How to reduce the internal speedup is the main concern for making these switches practical. In this paper, we first derive the internal speedup S as a function of the number of switch configurations N/sub S/ and the reconfiguration overhead /spl delta/, or S=f(N/sub S/,/spl delta/). We show that the recently proposed ADJUST algorithm is flawed. Based on the internal speedup function we derived, a new algorithm (ADAPTIVE), with time complexity of O((/spl lambda/-1)N/sup 2/logN), is proposed to minimize S.