Filterless and High-Speed InP Near-Infrared Photodetector With an Ultra-Small Full-Width at Half Maximum

Authors：Wang, Li^*; He, Xiu-Dong; Wang, Quan-You; Qi, Ning; Tian, Song-Yun; Wang, Mo-Lin; Wu, Chun-Yan; Hu, Ji-Gang; Luo, Lin-Bao^*

Source：IEEE Transactions on Electron Devices, 2023.

DOI：10.1109/TED.2023.3267754

• Indium phosphide
• III-V semiconductor materials
• Electrodes
• Photodetectors
• Substrates
• Narrowband
• Gold
• InP photodetector
• narrowband
• near-infrared
• passivation
• Schottky junction

the state of each flow is a fundamental task underlying many network functions, such as load balancing and network anomaly detection. There are two important kinds of per-flow states: per flow size (e.g., the number of packets received by an arbitrary destination IP) and per-flow cardinality (e.g., the number of distinct source IP addresses that contacted each destination IP). In this paper, we focus on the latter kind of states, and define a new problem: online query of per-flow cardinality , in which we query any given flow's cardinality entirely on the data plane with low time complexity. For this problem, we propose three solutions named On-vHLL, Ton-vHLL and Aton-vHLL, whose time cost are O (1) even for the query operation. Our proposed techniques are three folds. First, we redesign the traditional vHLL with new supplementary data structures called incremental update units (IUUs). When a certain flow's cardinality is queried, these IUUs can avoid scanning the whole data structure and reduce the time complexity to O(1). Second, we apply a HLL register compression technique called TailCut to the On-vHLL sketch, which can save memory cost by 50%. Third, we add a prefilter based on min-heap, alongside the Ton-vHLL sketch. The prefilter is to give each currently sampled top -k superspreader a dedicated HyperLogLog estimator for better accuracy. It can also absorb