This paper proposes a robust optimization model for probabilistic protection under uncertain capacity demands to minimize the total required capacity against multiple simultaneous failures of physical machines. The proposed model determines both primary and backup virtual machine allocations simultaneously under the probabilistic protection guarantee. To express the uncertainty of capacity demands, we introduce an uncertainty set that considers the upper bound of the total demand and the upper and lower bounds of each demand. The robust optimization technique is applied to the optimization model to deal with two uncertainties: failure event and capacity demand. With this technique, the model is formulated as a mixed integer linear programming (MILP) problem. To solve larger sized problems, a simulated annealing (SA) heuristic is introduced. In SA, we obtain the capacity demands by solving maximum flow problems. Numerical results show that our proposed model reduces the total required capacity compared with the conventional model by determining both primary and backup virtual machine allocations simultaneously. We also compare the results of MILP, SA, and a baseline greedy algorithm. For a larger sized problem, we obtain approximate solutions in a practical time by using SA and the greedy algorithm.

This paper proposes a design of high-speed interconnection between optical modules and electrical modules via bonding-wires and coplanar waveguide transmission lines on printed circuit boards for 400 Gbps 4-channel optical communication systems. In order to broaden the interconnection bandwidth, interdigitated capacitors were integrated with GSG pads on chip for the first time. Simulation results indicate the reflection coefficient is below -10 dB from DC to 53 GHz and the insertion loss is below 1 dB from DC to 45 GHz. Both indicators show that the proposed interconnection structure can effectively satisfy the communication bandwidth requirements of 100-Gbps or even higher data-rate PAM4 signals.

The prosperous Internet communication technologies have led to e-commerce in mobile computing and made Web of Things become popular. Electronic payment is the most important part of e-commerce, so many electronic payment schemes have been proposed. However, most of proposed schemes cannot give change. Based on proxy blind signatures, an e-cash payment system is proposed in this paper to solve this problem. This system can not only provide change divisibility through Web of Things, but also provide anonymity, verifiability, unforgeability and double-spending owner track.

The issue of copying values or references has historically been studied for managing memory objects, especially in distributed systems. In this paper, we explore a new topic on copying values v.s. references, for memory page compaction on virtualized systems. Memory page compaction moves target physical pages to a contiguous memory region at the operating system kernel level to create huge pages. Memory virtualization provides an opportunity to perform memory page compaction by copying the references of the physical pages. That is, instead of copying pages' values, we can move guest physical pages by changing the mappings of guest-physical to machine-physical pages. The goal of this paper is a quantitative comparison between value- and reference-based memory page compaction. To do so, we developed a software mechanism that achieves memory page compaction by appropriately updating the references of guest-physical pages. We prototyped the mechanism on Linux 4.19.29 and the experimental results show that the prototype's page compaction is up to 78% faster and achieves up to 17% higher performance on the memory-intensive real-world applications as compared to the default value-copy compaction scheme.

This letter provides a direct construction of binary even-length Z-complementary pairs. To date, the maximum zero correlation zone ratio of Type-I Z-complementary pairs has reached 6/7, but no direct construction of Z-complementary pairs can achieve the zero correlation zone ratio of 6/7. In this letter, based on Boolean function, we give a direct construction of binary even-length Z-complementary pairs with zero correlation zone ratio 6/7. The length of constructed Z-complementary pairs is 2m+3 + 2m + 2+2m+1 and the width of zero correlation zone is 2m+3 + 2m+2.

Testing the radio frequency compatibility between Cn-band Satellite Navigation and Microwave Landing System (MLS) has included establishing a specific interference model and reporting the effect of such interference. This paper considers two interference scenarios according to the interfered system. By calculating the Power Flux Density (PFD) values, the interference for Cn-band satellite navigation downlink signal from several visible space stations on MLS service is evaluated. Simulation analysis of the interference for MLS DPSK-data word signal and scanning signal on Cn-band satellite navigation signal is based on the Spectral Separation Coefficient (SSC) and equivalent Carrier-to-Noise Ratio methodologies. Ground tests at a particular military airfield equipped with MLS ground stations were successfully carried out, and some measured data verified the theoretical and numerical results. This study will certainly benefit the design of Cn-band satellite navigation signals and guide the interoperability and compatibility research of Cn-band satellite navigation and MLS.

End-to-end loss and delay are both fundamental metrics in network performance evaluation, and accurate measurements for these end-to-end metrics are one of the keys to keeping delay/loss-sensitive applications (e.g., audio/video conferencing, IP telephony, or telesurgery) comfortable on networks. In our previous work [1], we proposed a parallel flow monitoring method that can provide accurate active measurements of end-to-end delay. In this method, delay samples of a target flow increase by utilizing the observation results of other flows sharing the source/destination with the target flow. In this paper, to improve accuracy of loss measurements, we propose a loss measurement method by extending our delay measurement method. Additionally, we improve the loss measurement method so that it enables to fully utilize information of all flows including flows with different source and destination. We evaluate the proposed method through theoretical and simulation analyses. The evaluations show that the accuracy of the proposed method is bounded by theoretical upper/lower bounds, and it is confirmed that it reduces the error of loss rate estimations by 57.5% on average.

The multi-FPGA system known as, the Flow-in-Cloud (FiC) system, is composed of mid-range FPGAs that are directly interconnected by high-speed serial links. FiC is currently being developed as a server for multi-access edge computing (MEC), which is one of the core technologies of 5G. Because the applications of MEC are sometimes timing-critical, a static time division multiplexing (STDM) network has been used on FiC. However, the STDM network exhibits the disadvantage of decreasing link utilization, especially under light traffic. To solve this problem, we propose a hybrid router that combines packet switching for low-priority communication and STDM for high-priority communication. In our hybrid network, the packet switching uses slots that are unused by the STDM; therefore, best-effort communication by packet switching and QoS guarantee communication by the STDM can be used simultaneously. Furthermore, to improve each link utilization under a low network traffic load, we propose a dynamic communication switching algorithm. In our algorithm, each router monitors the network load metrics, and according to the metrics, timing-critical tasks select the STDM according to the metrics only when congestion occurs. This can achieve both QoS guarantee and efficient utilization of each link with a small resource overhead. In our evaluation, the dynamic algorithm was up to 24.6% faster on the execution time with a high network load compared to the packet switching on a real multi-FPGA system with 24 boards.

It has been widely recognized that in compressed sensing, many restricted isometry property (RIP) conditions can be easily obtained by using the null space property (NSP) with its null space constant (NSC) 0<θ≤1 to construct a contradicted method for sparse signal recovery. However, the traditional NSP with θ=1 will lead to conservative RIP conditions. In this paper, we extend the NSP with 0<θ<1 to a scale NSP, which uses a factor τ to scale down all vectors belonged to the Null space of a sensing matrix. Following the popular proof procedure and using the scale NSP, we establish more relaxed RIP conditions with the scale factor τ, which guarantee the bounded approximation recovery of all sparse signals in the bounded noisy through the constrained l1 minimization. An application verifies the advantages of the scale factor in the number of measurements.

This paper proposes a novel random access identifier (RAID)-linked receiver beamforming method for time division duplex (TDD)-based random access. When the number of receiver antennas at the base station is large in a massive multiple-input multiple-output (MIMO) scenario, the channel estimation accuracy per receiver antenna at the base station receiver is degraded due to the limited received signal power per antenna from the user terminal. This results in degradation in the receiver beamforming (BF) or antenna diversity combining and active RAID detection. The purpose of the proposed method is to achieve accurate active RAID detection and channel estimation with a reasonable level of computational complexity at the base station receiver. In the proposed method, a unique receiver BF vector applied at the base station is linked to each of the M RAIDs prepared by the system. The user terminal selects an appropriate pair comprising a receiver BF vector and a RAID in advance based on the channel estimation results in the downlink assuming channel reciprocity in a TDD system. Therefore, per-receiver antenna channel estimation for receiver BF is not necessary in the proposed method. Furthermore, in order to utilize fully the knowledge of the channel at the user transmitter, we propose applying transmitter filtering (TF) to the proposed method for effective channel shortening in order to increase the orthogonal preambles for active RAID detection and channel estimation prepared for each RAID. Computer simulation results show that the proposed method greatly improves the accuracy of active RAID detection and channel estimation. This results in lower error rates than that for the conventional method performing channel estimation at each antenna in a massive MIMO environment.

A path loss prediction formula for IoT (Internet of Things) wireless communication close to ceiling beams in the 920MHz band is presented. In first step of our investigation, we conduct simulations using the FDTD (Finite Difference Time Domain) method and propagation tests close to a beam on the ceiling of a concrete building. In the second step, we derive a path loss prediction formula from the simulation results by using the FDTD method, by dividing into three regions of LoS (line-of-sight) situation, situation in the vicinity of the beam, and NLoS (non-line-of-sight) situation, depending on the positional relationship between the beam and transmitter (Tx) and receiver (Rx) antennas. For each condition, the prediction formula is expressed by a relatively simple form as a function of height of the antennas with respect to the beam bottom. Thus, the prediction formula is very useful for the wireless site planning for the IoT wireless devices set close to concrete beam ceiling.

This study presents a selective data-compression interconnection network to boost its performance. Data compression virtually increases the effective network bandwidth. One drawback of data compression is a long latency to perform (de-)compression operation at a compute node. In terms of the communication latency, we explore the trade-off between the compression latency overhead and the reduced injection latency by shortening the packet length by compression algorithms. As a result, we present to selectively apply a compression technique to a packet. We perform a compression operation to long packets and it is also taken when network congestion is detected at a source compute node. Through a cycle-accurate network simulation, the selective compression method using the above compression algorithms improves by up to 39% the network throughput with a moderate increase in the communication latency of short packets.

Wireless sensor networks provide long-term monitoring of the environment, but sensors are powered by small batteries. Using a mobile charger (MC) to replenish energy of sensors is one promising solution to prolong their usage time. Many approaches have been developed to find the MC's moving path, and they assume that sensors have a fixed sensing rate (SR) and prefer to fully charge sensors. In practice, sensors can adaptively adjust their SRs to meet application demands or save energy. Besides, due to the fully charging policy, some sensors with low energy may take long to wait for the MC's service. Thus, the paper formulates a path and charge (P&C) problem, which asks how to dispatch the MC to visit sensors with adaptive SRs and decide their charging time, such that both survivability and throughput of sensors can be maximized. Then, we propose an efficient P&C scheduling (EPCS) algorithm, which builds the shortest path to visit each sensor. To make the MC fast move to charge the sensors near death, some sensors with enough energy are excluded from the path. Moreover, EPCS adopts a floating charging mechanism based on the ratio of workable sensors and their energy depletion. Simulation results verify that EPCS can significantly improve the survivability and throughput of sensors.

This brief presents A 16/32Gb/s dual-mode transmitter including a linearity calibration loop to maintain amplitude linearity of the SST driver. Linearity detection and corresponding master-slave power supply circuits are designed to implement the proposed architecture. The proposed transmitter is manufactured in a 22nm FD-SOI process. The linearity calibration loop reduces the peak INL errors of the transmitter by 50%, and the RLM rises from 92.4% to 98.5% when the transmitter is in PAM4 mode. The chip area of the transmitter is 0.067mm2, while the proposed linearity enhanced part is 0.05×0.02mm2 and the total power consumption is 64.6mW with a 1.1V power supply. The linearity calibration loop can be detached from the circuit without consuming extra power.

This paper shows structural optimal design of optical waveguide components utilizing an efficient 3D frequency-domain and 2D time-domain beam propagation method (BPM) with an alternating direction implicit (ADI) scheme. Usual optimal design procedure is based on iteration of numerical simulation, and total computational cost of the optimal design mainly depends on the efficiency of numerical analysis method. Since the system matrices are tridiagonal in the ADI-based BPM, efficient analysis and optimal design are available. Shape and topology optimal design shown in this paper is based on optimization of density distribution and sensitivity analysis to the density parameters. Computational methods of the sensitivity are shown in the case of using the 3D semi-vectorial and 2D time-domain BPM based on ADI scheme. The validity of this design approach is shown by design of optical waveguide components: mode converters, and a polarization beam splitter.

In order to increase communication capacity, the use of millimeter-wave and terahertz-wave bands are being actively explored. Non-radiative dielectric waveguide known as NRD guide is one of promising platform of millimeter-wave integrated circuits thanks to its non-radiative and low loss nature. In order to develop millimeter wave circuits with various functions, various circuit components have to be efficiently designed to meet requirements from application side. In this paper, for efficient design of NRD guide devices, we develop a topology optimal design technique based on function-expansion-method which can express arbitrary structure with arbitrary geometric topology. In the present approach, recently developed two-dimensional full-vectorial finite element method (2D-FVFEM) for NRD guide devices is employed to improve computational efficiency and several evolutionary approaches, which do not require appropriate initial structure depending on a given design problem, are used to optimize design variables, thus, NRD guide devices having desired functions are efficiently obtained without requiring designer's special knowledge.

A novel compact 5-pole bandpass filter (BPF) using two different types of resonators, one is coaxial TEM-mode resonator and the other dielectric triple-mode resonator, is proposed in this paper. The coaxial resonator is a simple single-mode resonator, while the triple-mode dielectric resonator (DR) includes one TM01δ mode and two degenerate HE11 modes. An excellent spurious performance of the BPF is obtained due to the different resonant behaviors of these two types of resonators used in the BPF. The coupling scheme of the 5-pole BPF includes two cascade triplets (CTs) which produce two transmission zeros (TZs) and a sharp skirt of the passband. Behaviors of the resonances, the inter-resonance couplings, as well as their tuning methods are investigated in detail. A procedure of mapping the coupling matrix of the BPF to its physical dimensions is developed, and an optimization of these physical dimensions is implemented to achieve best performance of the filter. The designed BPF is operated at 1.84GHz with a bandwidth of 51MHz. The stopband rejection is better than 20dB up to 9.7GHz (about 5.39×f0) except 7.85GHz. Good agreement between the designed and theoretically synthesized responses of the BPF is reached, verifying well the proposed configuration of the BPF and its design method.

This paper introduces the working principle of continuous wave (CW) illuminator and selects the test space by developing the wave impedance selection algorithm for the CW illuminator. For the vertical polarization and the horizontal polarization of CW illuminator, the law of wave impedance distribution after loading is analyzed and the influence of loading distribution on test space selection is studied. The selection principle of wave impedance based on incident field or total field at the monitoring point is analyzed.

In [2], Choi et al. proposed an identity-based password-authenticated key exchange (iPAKE) protocol using the Boneh-Franklin IBE scheme, and its generic construction (UKAM-PiE) that was standardized in ISO/IEC 11770-4/AMD 1. In this paper, we show that the iPAKE and UKAM-PiE protocols are insecure against passive/active attacks by a malicious PKG (Private Key Generator) where the malicious PKG can find out all clients' passwords by just eavesdropping on the communications, and the PKG can share a session key with any client by impersonating the server. Then, we propose a strengthened PAKE (for short, SPAIBE) protocol with IBE, which prevents such a malicious PKG's passive/active attacks. Also, we formally prove the security of the SPAIBE protocol in the random oracle model and compare relevant PAKE protocols in terms of efficiency, number of passes, and security against a malicious PKG.

The Euclidean projection operation is the most complex and time-consuming of the alternating direction method of multipliers (ADMM) decoding algorithms, resulting in a large number of resources when deployed on hardware platforms. We propose a simplified line segment projection algorithm (SLSA) and present the hardware design and the quantization scheme of the SLSA. In simulation results, the proposed SLSA module has a better performance than the original algorithm with the same fixed bitwidths due to the centrosymmetric structure of SLSA. Furthermore, the proposed SLSA module with a simpler structure without hypercube projection can reduce time consuming by up to 72.2% and reduce hardware resource usage by more than 87% compared to other Euclidean projection modules in the experiments.