No abstract

No abstract

We propose a scheme to implement the Deutsch's algorithm through non-degenerate four-wave mixing process. By employing photon topological charges of optical vortices, we demonstrate the ability to realize the necessary four logic gates for all balanced and constant functions. We also analyze the feasibility of the proposed scheme on the single photon level.

The important issues of network TCP congestion control are how to compute the link price according to the link status and regulate the data sending rate based on link congestion pricing feedback information. However, it is difficult to predict the congestion state of the link-end accurately at the source. In this paper, we presented an improved NUMFabric algorithm for calculating the overall congestion price. In the proposed scheme, the whole network structure had been obtained by the central control server in the Software Defined Network, and a kind of dual-hierarchy algorithm for calculating overall network congestion price had been demonstrated. In this scheme, the first hierarchy algorithm was set up in a central control server like Opendaylight and the guiding parameter B is obtained based on the intelligent data of global link state information. Based on the historical data, the congestion state of the network and the guiding parameter B is accurately predicted by the machine learning algorithm. The second hierarchy algorithm was installed in the Openflow link and the link price was calculated based on guiding parameter B given by the first algorithm. We evaluate this evolved NUMFabric algorithm in NS3, which demonstrated that the proposed NUMFabric algorithm could efficiently increase the link bandwidth utilization of cloud computing IoT datacenters.

Abstract. In order to explore changes in accessibility and connectivity of urban traffic network before and after the construction of subway, traffic networks within the Second Ring road, Hohhot, was analyzed based on complex network theory. Firstly, the urban road traffic network and the urban compound traffic network with the adjunction of the subway to former were mapped. Secondly, the node degree, clustering coefficient, average path length and node strength of the two networks were calculated based on SuperMap. Finally, the eigenvalues obtained above were compared and analyzed. Results show that both of the two traffic networks have some characteristics of small clustering coefficient reflected in random network and scale-free network. The latter, compared to the former, network diameter and average shortest path reduce, the average node degree and average node intensity increase. That is to say, with the adjunction of the subway, the connectivity and the accessibility of the entire network are significantly improved, and its carrying capacity increases remarkably.