DbOBS: dual buffered switch for variable optical bursts in future datacenters
Autor: | Arunendra Singh, Pronaya Bhattacharya, Amod Kumar Tiwari, Rajiv Srivastava, Vinay Kumar Pathak |
---|---|
Rok vydání: | 2021 |
Předmět: |
Network packet
Computer science 02 engineering and technology 021001 nanoscience & nanotechnology Topology 01 natural sciences Optical switch Measure (mathematics) Atomic and Molecular Physics and Optics Electronic Optical and Magnetic Materials Dual (category theory) 010309 optics Core (optical fiber) Variable (computer science) 0103 physical sciences Scalability Bandwidth (computing) Electrical and Electronic Engineering 0210 nano-technology |
Zdroj: | Optical and Quantum Electronics. 53 |
ISSN: | 1572-817X 0306-8919 |
DOI: | 10.1007/s11082-021-02899-8 |
Popis: | Modern data-driven applications pose stringent requirements of high bandwidth, ultra-low-latency, low-powered, and scalable interconnections among switches and routers in data-centers. To address these demands, electronic switching is not a viable choice due to bandwidth and computing bottlenecks. Thus, researchers explored effective optical switch design principles for next-generation data-centers. In optical switches, data aggregates in the form of optical bursts (OB) at ultra-high speeds. In the case of OB contention, solutions are proposed by researchers to store OB as recirculating patterns in fiber delay lines (FDL) with induced optical delay. However, due to variable burst length, it is not possible to measure slot delay length, thus storage of contending bursts is not possible at intermediate core switches. Motivated from the aforementioned discussions, in this paper, we propose a switch design DbOBS, that is capable to store variable OB during contention slots. DbOBS estimates mean burst length, and possible deviation from mean length to minimize burst loss. The considered switch design is validated through parameters like-burst length estimation, over-reservation, and waiting time. For network-layer simulations, poison arrivals of data bursts are considered as packetized units. The packets are sent through Monte-Carlo arrivals and burst loss probability (BLP) is estimated at various input load conditions and buffer sizes. DbOBS achieves a BLP in order of $$10^{-4}$$ at load $$\approx$$ 0.8, and buffer-size of 50, and burst length of $$L=5$$ , that outperforms the traditional switch designs. |
Databáze: | OpenAIRE |
Externí odkaz: |