Hybrid buffer‐based optical packet switch with negative acknowledgment for multilevel data centers

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Sumit Chandra ◽  
Shahnaz Fatima ◽  
Raghuraj Singh Suryavanshi

AbstractIn the present scenario, data centers serve many functionalities like storage, transfer of data, supporting web applications, etc. In data centers, various levels of hierarchy different types of switches are required; therefore, multifunctional data centers are desired. This paper discusses a novel design for optical switch which can be placed at various levels of hierarchy. In the proposed design, multifunctionality contention resolution schemes which consider electronic and optical buffering and all-optical negative acknowledgment (AO-NACK) are considered. In buffering technologies, contending packets are stored in either in electronic RAM or in fiber delay lines. In case of the AO-NACK scheme, contending packets are blocked, and a negative acknowledgment is sent back to the transmitting node and blocked packets are retransmitted. For various considered schemes, Monte Carlo simulation have been performed, results in terms of packet loss probability are presented, and it has been found that the performance of optical buffering is much superior to electronic buffering and AO-NACK schemes. It is found that, in the AO-NACK scheme, the numbers of retransmitted packets due to contention blocking are 33,304 which can be reduced to 7, by using a small amount of buffer at each node.

2019 ◽  
Author(s):  
Corey Pollock ◽  
Matthias Imboden ◽  
Flavio Pardo ◽  
David J. Bishop

There is a world-wide push to create the next generation all-optical transmission and switching technologies for exascale data centers. In this paper we focus on the switching fabrics. Many different types of 2D architectures are being explored including MEMS/waveguides and semiconductor optical amplifiers. However, these tend to suffer from high, path dependent losses and crosstalk issues. The technologies with the best optical properties demonstrated to date in large fabrics (>100 ports) are 3D MEMS beam steering approaches. These have low average insertion losses, and equally important, a narrow loss distribution. However, 3D MEMS fabrics are generally dismissed from serious consideration for this application because of their slow switching speeds (~few milliseconds) and costs ($100/port). In this paper we show how novel feedforward open loop controls can solve both problems by improving switching speeds by two orders of magnitude and costs by one order of magnitude. With these improvements in hand, we believe 3D MEMS fabrics can become the technology of choice for data centers.


1988 ◽  
Vol 24 (6) ◽  
pp. 303 ◽  
Author(s):  
P.D. Colbourne ◽  
P.E. Jessop

2021 ◽  
Vol 1 ◽  
pp. 3041-3050
Author(s):  
Georgios Koronis ◽  
Hernan Casakin ◽  
Arlindo Silva ◽  
Jacob Kai Siang Kang

AbstractThis study centers on using different types of brief information to support creative outcomes in architectural and engineering design and its relation to design expertise. We explore the influence of design briefs characterized by abstract representations and/or instructions to frame design problems on the creativity of concept sketches produced by novice and advanced students. Abstract representations of problem requirements served as stimuli to encourage associative thinking and knowledge transfer. The Ishikawa/Fishbone Diagram was used to foster design restructuring and to modify viewpoints about the main design drives and goals. The design outcomes generated by novice and advanced engineering/architecture students were assessed for their creativity using a pairwise experimental design. Results indicated that advanced students generated more novel design solutions while also contributing the most useful solutions overall. Implications for creativity in design education and professional practice are presented. Educational programs aimed at promoting creativity in the design studio may find it helpful to consider that the way design briefs are constructed can either promote or inhibit different aspects of design creativity.


Author(s):  
Dan Alistarh ◽  
Hitesh Ballani ◽  
Paolo Costa ◽  
Adam Funnell ◽  
Joshua Benjamin ◽  
...  

2021 ◽  
Vol 397 (1) ◽  
pp. 2000341
Author(s):  
Anil Kumar Shukla ◽  
Girijesh Narayan Pandey

2021 ◽  
Vol 48 (3) ◽  
pp. 39-44 ◽  
Author(s):  
Wenkai Dai ◽  
Klaus-Tycho Foerster ◽  
David Fuchssteiner ◽  
Stefan Schmid

Emerging reconfigurable data centers introduce the unprecedented flexibility in how the physical layer can be programmed to adapt to current traffic demands. These reconfigurable topologies are commonly hybrid, consisting of static and reconfigurable links, enabled by e.g. an Optical Circuit Switch (OCS) connected to top-of-rack switches in Clos networks. Even though prior work has showcased the practical benefits of hybrid networks, several crucial performance aspects are not well understood. In this paper, we study the algorithmic problem of how to jointly optimize topology and routing in reconfigurable data centers with a known traffic matrix, in order to optimize a most fundamental metric, maximum link load. We chart the corresponding algorithmic landscape by investigating both un-/splittable flows and (non-)segregated routing policies. We moreover prove that the problem is not submodular for all these routing policies, even in multi-layer trees, where a topological complexity classification of the problem reveals that already trees of depth two are intractable. However, networks that can be abstracted by a single packet switch (e.g., nonblocking Fat-Tree topologies) can be optimized efficiently, and we present optimal polynomialtime algorithms accordingly. We complement our theoretical results with trace-driven simulation studies, where our algorithms can significantly improve the network load in comparison to the state of the art.


2021 ◽  
Vol 119 ◽  
pp. 111306
Author(s):  
Hossein mehrzad ◽  
Ezeddin Mohajerani ◽  
Mohammad Mohammadimasoudi ◽  
Kristiaan Neyts

2000 ◽  
Vol 12 (4) ◽  
pp. 425-427 ◽  
Author(s):  
S. Nakamura ◽  
Y. Ueno ◽  
K. Tajima ◽  
J. Sasaki ◽  
T. Sugimoto ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document