Static assignment of IP addresses or identifiers can be exploited by an adversary to attack a network. However, existing dynamic IP address assignment approaches suffer from two limitations, namely: participation of t...Static assignment of IP addresses or identifiers can be exploited by an adversary to attack a network. However, existing dynamic IP address assignment approaches suffer from two limitations, namely: participation of terminals in the assignment and inadequate network server management. Thus, in this paper, we propose an Overall-transparent Dynamic Identifier-mapping Mechanism(ODIM) to manage the identifier of network nodes to defend against scanning and worm propagation in the Smart Identifier NETwork(SINET). We establish the selection and allocation constraints, and present selection and allocation algorithms to determine the constraints. The non-repetition probability and cover cycle allow us to evaluate the defense efficiency against scanning. We propose the probability for routing identifiers and derive the defense efficiency of ODIM against worm propagation. Simulation results and theoretical analysis show that the proposed method effectively reduces the detection probability of Routing IDentifiers(RIDs) and thus improves defense capabilities against worm propagation.展开更多
提出了一种基于 CAN(controller area network)总线的网络控制系统的分布式消息调度策略。该策略改变传统 CAN 节点消息的标识符固定分配的方法,它根据节点发送消息的时间紧急程度动态地给消息分配标识符,即与前一条消息的最大允许时间...提出了一种基于 CAN(controller area network)总线的网络控制系统的分布式消息调度策略。该策略改变传统 CAN 节点消息的标识符固定分配的方法,它根据节点发送消息的时间紧急程度动态地给消息分配标识符,即与前一条消息的最大允许时间间隔较短且间隔中逝去时间较多的消息有较高的优先级。该文也对提出的调度策略进行了仿真分析。展开更多
文摘Static assignment of IP addresses or identifiers can be exploited by an adversary to attack a network. However, existing dynamic IP address assignment approaches suffer from two limitations, namely: participation of terminals in the assignment and inadequate network server management. Thus, in this paper, we propose an Overall-transparent Dynamic Identifier-mapping Mechanism(ODIM) to manage the identifier of network nodes to defend against scanning and worm propagation in the Smart Identifier NETwork(SINET). We establish the selection and allocation constraints, and present selection and allocation algorithms to determine the constraints. The non-repetition probability and cover cycle allow us to evaluate the defense efficiency against scanning. We propose the probability for routing identifiers and derive the defense efficiency of ODIM against worm propagation. Simulation results and theoretical analysis show that the proposed method effectively reduces the detection probability of Routing IDentifiers(RIDs) and thus improves defense capabilities against worm propagation.
文摘提出了一种基于 CAN(controller area network)总线的网络控制系统的分布式消息调度策略。该策略改变传统 CAN 节点消息的标识符固定分配的方法,它根据节点发送消息的时间紧急程度动态地给消息分配标识符,即与前一条消息的最大允许时间间隔较短且间隔中逝去时间较多的消息有较高的优先级。该文也对提出的调度策略进行了仿真分析。
