GaAs-based microelectromechanical waveguide switch

Spahn, Olga B.; Sullivan, Charles T.; Burkhart, J.; Tigges, C.P.; Garcia, Ernest J.

doi:10.1109/omems.2000.879617

Cited by 20 publications

(15 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…9 gives an example where four non-overlapping s (i.e., -are used to cover all the entries in zone of an 8 8 matrix. For easy reading, we use an italic number at an 3 For simplicity, we denote an entry by either its location in the matrix (e.g., entry (i; j)), or the matrix element at this location (e.g., entry ! ).…”

Section: B Srf Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics

Yeung

Hamdi

et al. 2009

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-We consider traffic scheduling in an packet switch with an optical switch fabric, where the fabric requires a reconfiguration overhead to change its switch configurations. To provide 100% throughput with bounded packet delay, a speedup in the switch fabric is necessary to compensate for both the reconfiguration overhead and the inefficiency of the scheduling algorithm. In order to reduce the implementation cost of the switch, we aim at minimizing the required speedup for a given packet delay bound. Conventional Birkhoff-von Neumann traffic matrix decomposition requires 2 2 + 2 configurations in the schedule, which lead to a very large packet delay bound. The existing DOUBLE algorithm requires a fixed number of only 2 configurations, but it cannot adjust its schedule according to different switch parameters. In this paper, we first design a generic approach to decompose a traffic matrix into an arbitrary number of ( 2 2 + 2 ) configurations.Then, by taking the reconfiguration overhead into account, we formulate a speedup function. Minimizing the speedup function results in an efficient scheduling algorithm ADAPT. We further observe that the algorithmic efficiency of ADAPT can be improved by better utilizing the switch bandwidth. This leads to a more efficient algorithm SRF (Scheduling Residue First). ADAPT and SRF can automatically adjust the number of configurations in a schedule according to different switch parameters. We show that both algorithms outperform the existing DOUBLE algorithm.

show abstract

Section: B Srf Algorithmmentioning

confidence: 99%

“…In Fig. 13, the two diagonal entries (0, 1) and (3,2) are set to 1 in . After that, the row isomorphic tuple is considered.…”

Section: Casementioning

confidence: 99%

Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics

Yeung

Hamdi

et al. 2009

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…The alternative way is to fabricate optical MEMS from the light source material, such as GaAs semiconductor. A micro-optical encoder [2] and an optical switch [3] were fabricated from GaAs substrate.…”

Section: Introductionmentioning

confidence: 99%

GaN‐Si‐MEMS structure fabricated from nano‐column GaN quantum well crystal grown on Si substrate

Ito

Zhao

et al. 2008

Phys. Status Solidi (c)

View full text Add to dashboard Cite

Nanocolumn‐crystallized InGaN/GaN quantum well crystals were deposited on Si (111) substrate. Photoluminescence measurement demonstrated a wide emission wavelength from about 400 nm to 700 nm. We propose a new light source device combined with Micro‐Electro‐Mechanical Systems (MEMS). The proposed device is monolithically composed of the GaN light source structures and Si MEMS. The direction of the light beam emitted from an array of the light source can be changed by a MEMS beam steering mechanism. A micro‐stage with comb actuators was fabricated from the Si substrate. The InGaN/GaN quantum well film is patterned on the micro‐stage. Basic researches on the growth of GaN crystals on Si substrate were also carried out. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

show abstract

“…The idea of using optical switching technologies (such as MEMS mirror [1], thermal bubble [2] and waveguide [3]) in the design of packet switches/routers is widely accepted since the recent progress of these technologies brings about scalability, high rate, huge capacity and low power consumption features on economical bases. However, reconfiguring these optical packet switches requires relatively large time period (i.e.…”

Section: Introductionmentioning

confidence: 99%

“…Because δN S time slots have to be assigned to reconfigure the switch for N S times and thus only T-δN S time slots left for transmitting C(T) in the third stage, a speedup S exact = T/(T-δN S ) is necessary to compensate for δ. 3 Since the scheduling algorithm usually produces some empty slots (except EXACT algorithm which produces N S =N 2 -2N+2 configurations with S min =1 [4] [6]), a minimum speedup given by S min =T S /T is required to compensate for the inefficient scheduling. The overall internal speedup S is thus given by 2 Let p (n) ij and cij represent the element (i,j) of Pn and C(T) respectively.…”

Section: Introductionmentioning

confidence: 99%

Minimizing internal speedup for performance guaranteed optical packet switches

Yeung²

IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.

View full text Add to dashboard Cite

Providing QoS guarantee 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 S and the reconfiguration overhead δ, or S=f(N S ,δ). 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((λ-1)N 2 logN), is proposed to minimize S.

show abstract

GaAs-based microelectromechanical waveguide switch

Cited by 20 publications

References 2 publications

Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics

Minimizing Internal Speedup for Performance Guaranteed Switches With Optical Fabrics

GaN‐Si‐MEMS structure fabricated from nano‐column GaN quantum well crystal grown on Si substrate

Minimizing internal speedup for performance guaranteed optical packet switches

Contact Info

Product

Resources

About