No abstract available

[en] The design of routing strategies for traffic-driven epidemic spreading has received increasing attention in recent years. In this paper, we propose an adaptive routing strategy that incorporates topological distance with local epidemic information through a tunable parameter h. In the case where the traffic is free of congestion, there exists an optimal value of routing parameter h, leading to the maximal epidemic threshold. This means that epidemic spreading can be more effectively controlled by adaptive routing, compared to that of the static shortest path routing scheme. Besides, we find that the optimal value of h can greatly relieve the traffic congestion in the case of finite node-delivering capacity. We expect our work to provide new insights into the effects of dynamic routings on traffic-driven epidemic spreading.

[en] This paper presents and evaluates a cross-layered communication architecture which allows for robust, reliable and efficient data collection in an embedded wireless multi-hop network. The proposed solution, based on a novel embodiment of gradient routing, proposes to piggyback control data along with data packets. We show how this simple scheme is robust against topological changes which are quickly absorbed by the network, and that it is largely unaffected by the density or size of the network. Experimental results confirm these observations and show how the nodes and sinks can be added/removed without disturbing network operation while staying energy efficient. The simple solution proposed in this paper offers a true deploy-and-forget user experience

[en] There is plenty of oil in Central Asia, and plenty of companies have signed agreements to extract that oil. Now the focus is on finding secure and financially viable export routes. And it looks increasingly as if a route through the Caucasus to a Turkish terminal on the Mediterranean will be favoured for Azerbaijani crude, and perhaps also for exports from Chevron's giant venture at Tengiz in Kazakhstan. (author)

[en] In complex networks characterized by broad degree distribution, node significance is often associated with its degree or with centrality metrics which relate to its reachability and shortest paths passing through it. Such measures do not consider availability of efficient backup of the node and thus often fail to capture its contribution to the functionality and resilience of the network operation. In this paper, we suggest the quality of backup (QoB) and alternative path centrality (APC) measures as complementary methods which enable analysis of node significance in a manner which considers backup. We examine the theoretical significance of these measures and use them to classify nodes in social interaction networks and in the Internet AS (autonomous system) graph while applying the valley-free routing restrictions which reflect the economic relationships between the AS nodes in the Internet. We show that both node degree and node centrality are not necessarily evidence of its significance. In particular, we show that social structures do not necessarily depend on highly central nodes and that medium degree nodes with medium centrality measure prove to be crucial for efficient routing in the Internet AS graph

[en] We present a family of networks, expanded deterministic Apollonian networks, which are a generalization of the Apollonian networks and are simultaneously scale free, small world and highly clustered. We introduce a labeling of their nodes that allows one to determine the shortest path routing between any two nodes of the network based only on the labels

[en] The specifics and challenges of securing Industrial Control Systems (ICS) in the age of Digital Transformation are proposed in the paper. Providing sustainability is considered as the main safety challenge while securing ICS systems. Secure information sharing between participants of Digital Manufacturing process and their segments is considered as the main information security challenge of a new production paradigm. Available technics and the drawbacks thereof to provide ICS security in the context of sustainability are mentioned. To meet the challenges an approach based on garlic routing principals is proposed to secure communications and provide stable manufacturing process due to providing information flaws availability and integrity in between different segments. (paper)

[en] Highlights: ► An idea of a high-performance computer using RSFQ circuits is shown. ► An outline of processor with reconfigurable data-paths (RDPs) is shown. ► Architectural details of an SFQ-RDP are described. -- Abstract: We show recent progress in our research on an energy-efficient high-performance processor with reconfigurable data-paths (RDPs) using rapid single-flux-quantum (RSFQ) circuits. We mainly describe the architectural details of an RDP implemented using RSFQ circuits. An RDP consists of a lot of floating-point units (FPUs) and operand routing networks (ORNs) which connect the FPUs. We reconfigure the RDP to fit a computation, i.e., a group of floating-point operations, appearing in a ‘for’ loop of programs for numerical computations by setting the route in ORNs before the execution of the loop. In the RDP, a lot of FPUs work in parallel with pipelined fashion, and hence, very high-performance computation is achieved

[en] In this paper, a high speed reconfigurable control bits generation algorithm for cyclic shift operations is proposed. The algorithm utilizes the characteristics of routing information when Inverse Butterfly multi level network supports cyclic shift. Moreover, it also integrates a kind of cyclic shift operations together, including cyclic shift and sub-word cyclic shift based on a bit width of 2ⁱ(i = 1, 2, …). Based on this, the shifter is implemented, and the logic synthesis is realized in the SMIC 65nm process. The results show that when the proposed unit only supports cyclic shift operations, enhances the frequency by 3.6% ∼ 8.6% and reduces the area by1.4% ∼ 32%, compared with previously proposed solutions. When achieving a variety of cyclic shift operations, the frequency of our unit enhances the frequency by 5% and reduces the area by 6%. (paper)

[en] This paper presents a dynamic grouping and routing approach for the maintenance optimization of a geographically dispersed production system (GDPS) consisting of several production sites located far apart from each other. Only one maintenance center is in charge of the preventive maintenance of the system. Maintenance grouping and routing are two interrelated processes but often investigated separately in literature. In this paper, these two processes are jointly studied and integrated in a global model considering economic and geographical dependencies at both component and site levels. The optimal maintenance grouped plan and routes are then determined by a combination of the Local Search Genetic Algorithm (LSGA) and Branch and Bound method (BAB). Moreover, several dynamic contexts impacting the current optimal maintenance grouped planning and routing, which may occur with time, are also studied and integrated in the joint optimization process. Thanks to this consideration, the proposed approach allows updating the grouped maintenance planning and routing to take into account the impacts of dynamic contexts when they occur. The uses and advantages of the proposed approach are illustrated through a numerical example of a GDPS consisting of 15 components located in five different sites.