The accurate estimation of future network traffic is a key enabler for early warning of network degradation and automated orchestration of network resources. The long short-term memory neural network (LSTM) is a popular architecture for network traffic forecasting, and has been successfully used in many applications. However, it has been observed that LSTMs suffer from limited memory capacity problems when the sequence is long. In this paper, we propose a gated dilated causal convolution based encoder-decoder (GDCC-ED) model for network traffic forecasting. The GDCC-ED learns a vector representation in the encoder from historical network traffic series, in which gated dilated causal convolutions are adopted to expand the long-range memory capacity. Moreover, different types of features in various perspectives, including temporal-independent and temporal-related features, are incorporated. In the decoder, the GDCC-ED exploits an RNN with LSTM units to map the vector representation back to a variable-length target sequence. Besides, a sequence data augmentation technique is designed to solve the problem of data scarcity. Experimental results demonstrate that our model achieves superior performance than state-of-the-art algorithms by 11.6%.

The Computing Network is an emerging network paradigm that aims to realize computing resource scheduling through the intrinsic capabilities of the network. However, existing resource scheduling architectures based on conventional TCP/IP networks for the Computing Network suffer from deficiencies in routing flexibility and a lack of user preference awareness, while Information-Centric Networking (ICN) holds the potential to address these issues. ICN inherently supports dynamic routing in scenarios such as multi-homing and mobility due to its routing mechanism that is based on content names rather than host addresses, and it is further enhanced by the integration with Software-Defined Networking (SDN) technologies, which facilitate convenient network-layer route readdressing, thus offering a conducive environment for flexible routing scheduling. Furthermore, ICN introduces novel routing protocols that, compared with the more rigid protocol designs in conventional TCP/IP networks, offer greater flexibility in field usage. This flexibility allows for the incorporation of customized fields, such as “preference”, enabling the perception of user preferences within the network. Therefore, this paper proposes a novel ICN-based on-path computing resource scheduling architecture named IPCRSA. Within this architecture, an original design for computing resource request packet format is developed based on the IPv6 extension header. Additionally, preference-based computing resource scheduling strategies are incorporated, which employ the technique for order preference by similarity to ideal solution (TOPSIS) combined with the entropy weight method, to comprehensively evaluate computing resource nodes and use a roulette-selection algorithm to accomplish the probability selection of destination nodes. Experimental results indicate that, in comparison to alternative scheduling schemes, IPCRSA exhibits significant advantages in enhancing scheduling flexibility, improving scheduling success rates, and catering to diverse user requirements.

The Interplanetary File System (IPFS), a new type of P2P file system, enables people to obtain data from other peer nodes in a distributed system without the need to establish a connection with a distant server. However, IPFS suffers from low resolution efficiency and duplicate data delivery, resulting in poor system availability. The new Information-Centric Networking (ICN), on the other hand, applies the features of name resolution service and caching to achieve fast location and delivery of content. Therefore, there is a potential to optimize the availability of IPFS systems from the network layer. In this paper, we propose an ICN-based IPFS high-availability architecture, called IBIHA, which introduces enhanced nodes and information tables to manage data delivery based on the original IPFS network, and uses the algorithm of selecting high-impact nodes from the entitled network (PwRank) as the basis for deploying enhanced nodes in the network, thus achieving the effect of optimizing IPFS availability. The experimental results show that this architecture outperforms the IPFS network in terms of improving node resolution efficiency, reducing network redundant packets, and improving the rational utilization of network link resources.

The influence of wheel rotation on underbody flow and aerodynamics on high speed train were numerically investigated by using Reynolds averaged Navier-Stokes equations (RANS). Two different conditions including stationary and rotating wheels in CRH3 complex train were calculated, running 380 km/h in the open air. Furthermore, analyses on underbody velocity field, pressure coefficient on bogie sections, wake and leeward vortex structure affected by rotating wheels are performed. The comparison shows that drag coefficient decreases about 1% when wheels rotating. In the rotating condition, the lift forces of train bodies are reduced, especially the bogie sections. The velocity around the tail car's bogies increases 13-20m/s due to the wheel rotation effects, and the vortex cores of wake get closer.