This paper proposes a method to solve the joint optimization of test node selection and fiber thread connection. The problem is modeled as an integer linear programming problem with two classes of decision variables. The first class of decision variables are composed of the number of parallel fiber threads throughout each potential testing route, the other class of decision variables are imposed just to denote whether a node is decided as a location to place testing equipment. The objective of the joint optimization is to minimize the number of nodes where fiber test equipment based on the optical time domain reflectometer are planned to locate. The objective function is just the sum of the second class of decision variables. Two types of linear constraints are needed. The first type of constraints describes the mutual relation between the two classes of variables, and the other type of constraints are formed to depict the impact of the number of fiber threads mounted within each fiber link on the first class of decision variables. Multiple examples are given to exhibit the advantage of joint optimization over heuristic method.
Experimental courses for fundamental hardware are compulsory for electronics or information specialized subject. Owing to impacts of novel coronavirus in recent years, the hardware experimental courses witnessed harsh strikes. After full opening of national prevention measures for anti-novel coronavirus, it is necessary to provide remote hardware experiments for students who are temporarily wounded or infected by novel coronavirus. Remote hardware experiment helps protecting the health of both teachers and students. In this paper, the problem of planning and constructing a laboratory with virtual integrated real equipment is studied, and feasibilities of such experimental platforms have been verified.
The problem of seeking for monitor-nodes to measure the network traffic is abstractly regarded as the problem of finding out the minimum weak vertex cover of a graph which is NP-hard. First, an approximation algorithm based on the concept of incidence matrix is proposed in this paper. Also, we analyze the complexity of the algorithm. Furthermore, the algorithm is expanded to seek for the minimum weak vertex cover of a graph that has weights on its nodes. According to the theoretical analysis and the simulation results, our novel algorithm is comparatively more patulous than the traditional algorithms, and more effective in searching for smaller weak vertex cover as well. Keywords: Weak vertex cover, nodes with weights, flow conservation, NP-hard, incidence matrix <!----> <!----> <!----> <!---->