Search

Aiming at the missile Defense system of systems process, based on complex network, firstly, the Application of missile Defense system-of-systems is abstracted for Topologically, and the supernetwork Modeling of the application of missile Defense system-of-systems is built, which is composed of shard subnet, information subnet, Engagement subnet configures and sensor subnet configures. Secondly, the static interaction mechanism of models is analyzed deeply, and which nodes interaction is described mathematically. Thirdly, The dynamic interaction mechanism of models is analyzed based on the timing sequence of operation, Extracted and the characteristic parameters which reflect the network evolution characteristics between subnet and internal subnet are extracted. An example is illustrated at last. The simulation results show The overall characteristic value of the network changes in phases, such as network Density, while, the information flow changes regularly with phases, As well as the role and status of each node, which is a helpful exploration for the following optimization problems.

Metro plays an important role in an urban public transport system. With the use of metro lines, the increasing flow of people has brought tremendous pressure to the operation of metro lines, resulting in different faults, thus affecting the travel of residents. How to qualitatively evaluate the robustness of the metro network after encountering faults is a problem worthy of attention. By 2018, ten metro lines have been opened in Nanjing, forming a radiation structure from the urban center to the surrounding suburbs. In this study, the metro faults in Nanjing in the past three years are counted and classified. The space L and space P models for the metro network are constructed. The robustness of a Nanjing metro network is measured by the three indicators: network connectivity efficiency, largest connected subgraph size, and average subgraph size. The concept of supernetwork is proposed, and the metro line is considered as a whole. The robustness changes of the Nanjing metro network caused by the attacks on the nodes and hyperedges of the metro network are analyzed. The results show that deliberate attack causes more damage than a random attack. When traffic hub stations and trunk lines are attacked, the performance of the metro network will decline sharply. The research conclusion has certain practical value to enhance the anti-fault ability of the metro network.

Currently, studies on the system-of-systems (SoS) capability evaluation index system generation mechanism are scant, and the indicators are mostly determined by merely qualitative expert experience. This paper tries to explore a quantitative method for constructing the search and rescue system-of-systems (SARSoS) capability evaluation index system based on the SoS network architecture analysis, considering the impact from the SoS activity, organization, equipment, project, technology, and their relationships constraint on the capability generation. The four-layers weighted supernetwork model of the SARSoS is first established to describe the influence of SoS network architecture to the capability. Then, the index system construction method is proposed through the indicator importance sort algorithm (IISA). Finally, a specific case study of the SARSoS capability evaluation index system construction is demonstrated based on the proposed method. This paper provides a viable way to construct the index system based on the SoS architecture, which can select and integrate the indicators from multiple perspectives, and help to discover the SoS weak points and relationships in the future capability evaluation work.

Current command and control (C2) network models typically do not account for differences in attributes of nodes that belong to the same class; in addition, there is no provision in these models for the adequate description of operational relationships that exist between multiple combat entities with different attributes in real-world scenarios. To address these issues, we propose a method to model multilevel command and control supernetworks (MC2S) based on the attribute synergy prioritization and hypergraph theory. First, the characteristics of C2 supernetworks are analyzed to abstract their nodes and hyperedges, based on which, we propose the MC2S model, which consists of three layers and five networks. Second, the Term Frequency-Inverse Document Frequency and spatial distance algorithms are used to construct an attribute synergy prioritization-based strategy for the generation of intra-layer MC2S hyperedges, while the local-world (LW) selection is used to create an LW model-based method for the generation of inter-layer MC2S hyperedges. Through simulation experiments, we show that our model exhibits (approximately) scale-free properties as well as small-world properties, excellent cooperative engagement capabilities, and has a high level of network invulnerability. These findings will serve as a useful reference for the description of complex nodal (edge) relationships in C2 networks, network performance analyses, and deployment of complex combat mission networks.

In recent years, many researchers have applied complex network theory to urban public transport network to construct complex network and analyze its network performance. The original analysis method generally uses the Space L and Space R model to establish a simple link between public sites but ignores the organic link between the overall network system and the line subsystem. As an important part of urban public transport system, subway plays an important role in alleviating traffic pressure. In this paper, a supernetwork model of Nanjing metro network is established by using the supernetwork method. Three parameters, node-hyperedge degree, hyperedge-node degree, and hyperedge degree, are proposed to describe the model. The model is compared with the traditional Space L and Space P models. The study on the supernetwork model of Nanjing metro complex network shows that the network density, network centrality, and network clustering coefficient are large, and the average network distance is small, which meets the requirements of traffic planning and design. In this study, the subway line is considered as a subsystem and further simplified as a node, so that the complex network analysis method can be applied to the new supernetwork model, expanding the thinking of complex network research.

Prior solutions for routing to multi-instantiated destinations simply adapt existing routing algorithms designed for single-instance destinations, or rely on flooding techniques. In this paper, a new approach for routing to multi-instantiated destinations is introduced, and the Multiple Instance Destination Routing (MIDR) framework is presented as an example of the approach. MIDR uses only distance information to multi-instantiated destinations, without routers having to establish overlays, know the network topology, use complete paths to destination instances, or know about all the instances of destinations. MIDR can be used in name-based content routing, IP unicast routing, multicasting, and anycasting; even in scenarios where the network topology is highly dynamic such as in the case of MANETs. It is shown that MIDR provides multiple loop-free paths to destination instances. Extensive simulation-based experiments performed in the context of MANETs show that MIDR outperforms traditional approaches based on unicast protocols and that it scales to large networks.

Geographic routing has been considered as an attractive approach for resource-constrained wireless sensor networks (WSNs) since it exploits local location information instead of global topology information to route data. However, this routing approach often suffers from the routing hole (i.e., an area free of nodes in the direction closer to destination) in various environments such as buildings and obstacles during data delivery, resulting in route failure. Currently, existing geographic routing protocols tend to walk along only one side of the routing holes to recover the route, thus achieving suboptimal network performance such as longer delivery delay and lower delivery ratio. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient manner once encountering routing holes. In this paper, we focus on addressing these issues and propose an energy-aware dual-path geographic routing (EDGR) protocol for better route recovery from routing holes. EDGR adaptively utilizes the location information, residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint anchor lists, passing through two sides of the routing holes, to shift routing path for load balance. Moreover, we extend EDGR into three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour. Simulation results demonstrate that EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through routing holes. The proposed EDGR is much applicable to resource-constrained WSNs with routing holes.

Free-floating car-sharing (FFC) has recently received increasing attention due to the flexibility in mobility services. Existing studies related to FFC mainly focus on the analysis of operational management and user preferences. Efforts to model the dynamic choices of free-floating shared cars (SCs) in individuals’ daily multi-modal multi-activity trip chains have still been rare. This study proposes a tolerance-based dynamic user equilibrium model of activity-travel scheduling that formulates free-floating SC as an alternative transport mode for conducting daily activities. The model embeds the choice of SC into daily trip chains by extending the state-of-the-art multi-state supernetwork representation. The dynamic traffic flows and supply-demand interactions of SCs are captured endogenously. Moreover, traveler heterogeneity and different pricing schemes are taken into account. A path-flow swapping method is suggested to solve the tolerance-based dynamic user equilibrium model. Numerical examples of various scenarios demonstrate that fleet size, distribution, and rental-parking price of FFC significantly influence the choice of SC and activity-travel pattern.

This paper develops a novel household-oriented activity-based mixed-equilibrium model for estimating individual and household activity–travel choices in multimodal transportation networks with interactions between private car and public transit modes. In the novel model, household members with heterogeneous errors of perception on the time-dependent utility of different activity types make daily joint/solo activity–travel choices in a mixed-equilibrium manner, which maximizes either perceived household utility or perceived individual utility. A logit-based stochastic choice model is developed to capture the mixed equilibrium with heterogeneous errors of perception and used to predict the choices of alternative joint activity–travel paths (JATPs) on a supernetwork platform. Based on this stochastic JATP choice model, the mixed-equilibrium model is formulated as an equivalent variational inequality (VI) problem and solved using a modified diagonalization method. This converts the time-dependent activity–travel scheduling problem into an equivalent static traffic assignment problem on JATPs. The conditions required for the existence and uniqueness of a solution to the equivalent VI problem in terms of a JATP flow pattern are also identified. Numerical examples are provided to illustrate the model’s merits and its applications for examining the effect of the coronavirus disease 2019 (COVID-19) pandemic.

A weapon system of systems (WSoS) is a collection of interdependent systems providing multiple interdependent capabilities to support multiple tasks. In this paper, we propose a WSoS scheme generation method based on a granular analysis of a WSoS supernetwork. More precisely, we establish a WSoS supernetwork model based on a “network-centered” combat mode. Next, based on the theory of quotient space, a granular analysis is presented to reduce the complexity of the WSoS scheme generation. Then, the WSoS supernetwork is converted into a directed weighted network with multiple granularities, and an algorithm for the WSoS scheme generation based on the directed weighted network is presented. Consequently, each WSoS scheme corresponds to a path in the directed weighted network, and the capability of supporting the realization of a task by a WSoS can be analyzed based on the schemes. Finally, the feasibility of the proposed approach is demonstrated using an illustrative example.

This work describes a clean-slate inter-domain routing protocol designed to meet the needs of the future mobile Internet. In particular, we describe the edge-aware inter-domain routing (EIR) protocol which provides new abstractions, such as aggregated-nodes (aNodes) and virtual-links (vLinks) for expressing network topologies and edge network properties necessary to address mobility related routing scenarios which are inadequately supported by the border gateway protocol (BGP) in use today. Specific use-cases addressed by EIR include emerging mobility service scenarios such as multi-homing across WiFi and cellular, multipath routing over several access networks, and anycast access from mobile devices to replicated cloud services. It is shown that EIR can be used to realize efficient routing strategies for the mobility use-cases under consideration, while also providing support for a range of inter-domain routing policies currently associated with BGP. Simulation results for protocol overhead are presented for a global-scale CAIDA topology, leading to an identification of parameters necessary to obtain a good balance between overhead and routing table convergence time. A Click-based proof-of-concept implementation of EIR on the ORBIT testbed is described and used to validate performance and functionality for selected mobility use-cases, including mobile data services with open WiFi access points and mobile platforms such as buses operating in an urban area.

International audience; This paper studies the routing protocol "Lightweight On-demand Ad hoc Distance-vector Routing Protocol Next Generation (LOADng)", designed to enable efficient, scalable and secure routing in low power and lossy networks. As a reactive protocol, it does not maintain a routing table for all destinations in the network, but initiates a route discovery to a destination only when there is data to be sent to that destination to reduce routing overhead and memory consumption. Designed with a modular approach, LOADng can be extended with additional components for adapting the protocol to different topologies, traffic, and data-link layer characteristics. This paper studies several such additional components for extending LOADng: support for smart route requests and expanding ring search, an extension permitting maintaining collection trees, a fast rerouting extension. All those extensions are examined from the aspects of specification, interoperability with other mechanisms, security vulnerabilities, performance and applicability. A general framework is also proposed to secure the routing protocol.

Accessibility is a key concept in transport and land use policies, and infrastructure-based measures are one important category of accessibility measures. Recently, there has been a significant increase in the attention paid in both academic literature and policy documents to the robustness of the transport system. However, there is not a mature body of literature on the infrastructure-based accessibility measures expressing this concept. This paper proposes a family of accessibility measures to express the robustness of the transport system. These have in common that they express the number of travel options between a given origin and destination, or to conduct activities. The family of measures is conceptualized by using the multi-state supernetwork approach. With respect to the travel options, we discuss (1) the overlap of travel routes, and (2) the choices of travel modes (e.g. car versus train; multimodal). With respect to the activities, we discuss (1) the choice of OD pairs as opposed to activity-travel patterns, and (2) fixed versus flexible activity locations and fixed versus flexible order of activities. We illustrate the travel options and robustness in a multi-modal transport system between the city centers of the Hague-Rotterdam-Dordrecht corridor (The Netherlands).

Network stability is a key performance metric in supporting real time communication over wireless networks. Because of high bandwidth demand and dynamic traffic variation, several paths in Wireless Mesh Networks (WMNs) are expected to be unstable. High levels of network instability can lead to interferences, packet losses and high delays. In this paper, we address the stability problem of WMNs. Instability in these networks is caused mainly by link quality fluctuations and frequent route flapping. First, we present the key factors that may cause network instability. Then, we propose a new technique, called Node Stability-based Routing (NSR), using the entropy function to define a node stability and a probability function to select an appropriate gateway. Simulation results show that NSR can significantly improve the overall network performance compared to techniques using interference and channel switching (MIC), Expected Transmission count (ETX) or load at gateways as a routing metric, Reinforcement learning-based best path to best gateway (RLBDR), and nearest gateway (i.e., shortest path to gateway).

While the throughput demand for a backbone router keeps increasing constantly, both routing and switching of packets are facing tough challenges for running faster. Currently, the prefix trie-based routing algorithms for IP lookup are playing a key role in building high performance routing systems. We propose in this article a scalable routing architecture for pipelining any prefix trie-based routing algorithm that links nodes by pointers. All the prefixes in a routing table are classified into the short and the long categories to organize as a quick table and a set of prefix tries, respectively, where the tries’ nodes are evenly distributed into multiple memory blocks using a randomization technique. Each arriving packet finds its route information by looking up the quick table at first and then traverses a corresponding prefix trie if necessary. A routing buffer is employed to cache packet arrivals that suffer memory access contentions when visiting nodes of the prefix tries. The scheduling of queuing packets to access the memory blocks is modeled as a bipartite matching problem. The performance of the proposed architecture is evaluated by investigating the memory requirements and the maximum throughput with comparison to the linear and the circular pipelines. The results for both the analytical queuing model and the simulation experiments indicate that this architecture can be a potential candidate for building high bandwidth routing engines of backbone routers.

Objectives: To establish a trust based secured routing protocol to accurately distinguish malicious nodes that are dropping the important information and modifying the routes. Efforts are made to identify malicious nodes such as route modifiers and packet droppers. Methods/Statistical Analysis: Vehicular Ad-hoc NETworks (VANETs) is a modern technology which help a vehicle and a driver in several ways. The main characteristics of VANETs are nodes i.e. vehicles with relatively high mobility and constantly changing topology. In case of data communication in VANETs, a source node must depend on the intermediate nodes to send its data packets to the destination node on multi-hop routes. VANETs can give better performance if all its nodes work properly with full cooperation during the communication. In VANETs, a node can generate and broadcast important and essential messages to other nodes in the network for safety reason. However, the generated message by a vehicle may not be reliable every time. In this paper we have proposed a trusted and secured routing protocol that evaluates the trust of a vehicle and also checks the message reliability. The proposed protocol is named as Trusted Vehicular Ad-hoc On-demand Distance Vector (TVAODV) routing protocol which is the modification of Ad-hoc On-demand Distance Vector routing protocol. Since VANETs are mostly attacked by the malicious nodes; therefore better security solution is needed to stop such attacks. The proposed protocol introduces a trust model to establish a malicious node free route for source node to send its data packets to the destination node on multi-hop routes. Findings: The TVAODV protocol is simulated in Network Simulator (NS2) to check the performance and accuracy and also compared to AODV routing protocol. It is found that TVAODV is comparatively better in performance when VANET is in high mobility and versatile topology. The performance of the proposed protocol is evaluated using performance measurement metrics: average end-to-end delay, throughput, routing load and packet delivery ratio. The proposed protocol performance is evaluated in the presence of malicious (route modifiers and packet droppers) vehicles and the results shows that the proposed protocol is achieved better accuracy and it shows better performance compared to AODV routing protocol. Application/Improvements: The proposed protocol may be useful in the process of developing a better traffic management and transportation system. In this paper we have proposed a TVAODV routing protocol which includes trust model to evaluate the trust of vehicles as well as to establish a malicious free route.

The hierarchy and the correct nature of the Internet has been strongly contaminated by the advent of the Internet water armies in recent years. The minute and intense identification and detection of such Internet water armies is an important task. On the basis of the Supernetwork theory, a new model is proposed in this paper that will be employed in the detection of water armies. In this model, a Supernetwork consisting of five layers including User subnetwork, Content subnetwork, Psychological subnetwork, Negative keyword subnetwork and Repeated keywords subnetwork. Literature survey is carried out on the evolution of such spammers over years. The performance of the model is tested with the dataset obtained from the online communication platform, Reddit. A comparative analysis is presented from five existing models of Internet water army detection that were introduced in previous studies.

It is of great significance to comprehensively and reasonably identify the key nodes in the WeChat epidemic information dissemination system. First, the recognition results can be used to guide the spread of epidemic-related information in WeChat, such as accelerating the spread of valuable information or monitoring the spread of rumors. Secondly, the analysis of key nodes helps us understand the evolution of the epidemic information dissemination network in WeChat, and the analysis of key nodes also helps us understand the modes and methods of epidemic-related information dissemination in WeChat. Finally, the results of these studies may be generalized to other fields of social life. This paper analyzes the composition of and relationship between epidemic-related information dissemination systems in WeChat and proposes a Supernetwork model for WeChat epidemic information dissemination on this basis. In this study, a comprehensive identification method of key nodes of the WeChat epidemic information dissemination system under the Supernetwork vision was constructed, and the method is analyzed and verified through examples in this paper.

In this paper, we take up the timely topic of the modeling, analysis, and solution of refugee migration networks. We construct a general, multiclass, multipath model, determine the governing equilibrium conditions, and provide alternative variational inequality formulations in path flows and in link flows. We also demonstrate how governmental imposed regulations associated with refugees can be captured via constraints. We provide qualitative properties and then establish, via a supernetwork transformation, that the model(s) are isomorphic to traffic network equilibrium models with fixed demands. Illustrative examples are given, along with numerical examples, inspired by a refugee crisis from Mexico to the United States, which are solved using the Euler method embedded with exact equilibration. The work sets the foundation for the development of additional models and algorithms and also provides insights as to who wins and who loses under certain refugee regulations.

As the transport volume of civil aviation increases rapidly, more attention than before has been paid to the stable and reliable operation of the Air Traffic Management (ATM) system. Then, the reliability analysis of the system is in urgent need. Meantime, due to the complexity of this “system of systems” which contains a diversity of individual systems, the construction of the model which can efficiently and accurately reflect the characteristics of ATM system is crucial. After the characteristic analysis of the system, a modeling method based on the supernetwork theory is introduced in this paper. The theory specializes in characterizing the complicated structural attribute of the complex system and the interaction relationship between the system components. Furthermore, the method is applied to the modeling of the System Wide Information Management (SWIM)-based ATM system which facilitates the information access and interchange of distributed heterogeneous systems. Specifically, the supernetwork model can be divided into three subnetworks according to the user based information domains of SWIM. Considered that there remains a certain number of invalid paths between nodes within the supernetwork, five types of supply-demand flows are proposed, and based on which improvements in traditional reliability index, typically the efficiency parameters are achieved. In order to simulate the performance of the SWIM-based ATM system in the case of system failure, the reliability index of the supernetwork model is calculated under the node removal strategy. Analysis results indicate the reasonability and applicability of the reliability analysis scheme for ATM system.

The National Science Foundation, the Office of Education, the Council on Library Resources, and a number of foundations provided millions of dollars for development of library automation activities. Once plans for library automation are firm and the institution is ready to begin implementation, the major problem is apt to be funding. Traditionally there have been three primary sources for such funds: grants from the federal government or private foundations; reallocation of existing funds; and additional appropriations from the library's normal source of funds, whether that be institutional, state appropriations, bond issues, or city and county budgets. The council has developed what it calls the Bibliographic Services Development Program, which has as its principal goal the linking of the several networks that grew up during the 1970s. As far as granting agencies are concerned, then, the trend is clear: from individual library projects to networks and from networks to a supernetwork.

Adequate and accurate models describing quantitatively the syntheses of fine and pharmaceutical chemicals are essential to optimize the performances of chemical processes. However, it is difficult, time consuming and experimentally expensive to develop such models. Appropriate, efficient and systematic strategies for model development are therefore required. In this context, the aims of this work consist in methodological development, numerical implementation and experimental validation of a systematic model-development strategy. In the first stage of this work, a methodologically systematic model-development strategy, consisting of initial data acquisition, model development, model identification, model validation and model refining modules, is developed. In the initial data acquisition module, preliminary experiments are designed and performed to provide the basic information for the initial model development. Module development module is composed of three steps: model structure development, model structure analysis and model parameter development. Model structure development is based on the reaction network proposed within the reaction supernetwork containing all feasible chemical reactions and mass transfers. For model identification, validation and refining, the model-based experimental design is performed by taking into consideration several reactors, which enlarges the explored experimental windows. In the second stage of this work, in order to facilitate the application of the strategy, a software, integrating model parameter estimation, model evaluation, model-based experimental design for model refining and performance optimization, is developed using MATLAB R2014a. The initial version of the software is suitable for the liquid-phase reaction systems, 4 ideal reactors are taken into consideration: batch stirred-tank reactor, semi-batch stirred-tank reactor, continuous stirred-tank reactor and continuous tubular reactor. In the third stage of this work, the feasibilities and generalities of the developed strategy and strategy-based software are demonstrated with two experimental case studies, relating to the valorization of sunflower oil, namely, NaOH-catalyzed ethanolysis of sunflower oil and epoxidation of sunflower oil by performic acid generated in situ.

IP lookup and routing table update affect the speed at which a router forwards packets. This study proposes a new data structure for dynamic router tables used in IP lookup and update, called the Multi-inherited Search Tree (MIST). Partitioning each prefix according to an index value and removing the relationships among prefixes enables performing IP lookup operations efficiently. Because a prefix trie is used as a substructure, memory can be consumed and dynamic router-table operations can be performed efficiently. Experiments using real IPv4 routing databases indicated that the MIST uses memory efficiently and performs lookup, insert, and delete operations effectively.

The Internet interdomain routing protocol (border gateway protocol) exhibits slow convergence. Many Internet applications suffer from the effects of its high convergence delay. In this paper, we provide an overview of the state-of-the-art methods on efforts to improve interdomain routing performance. We classified these efforts into five kinds of approaches: 1) speeding up updates; 2) limiting path exploration; 3) efficient policy configuration; 4) multipath; and 5) centralized control of the network. We detailed how each approach addresses the slow convergence problem. The goal of this paper is to provide the researchers a deep understanding on what has been done to improve Internet convergence time. We also discuss why, despite the existence of these efforts, the issue remains open.

The Internet routing system faces serious scalability challenges due to the growing number of IP prefixes that needs to be propagated throughout the network. Although IP prefixes are assigned hierarchically and roughly align with geographic regions, today’s Border Gateway Protocol (BGP) and operational practices do not exploit opportunities to aggregate routing information. We present DRAGON, a distributed route-aggregation technique whereby nodes analyze BGP routes across different prefixes to determine which of them can be filtered while respecting the routing policies for forwarding data-packets. DRAGON works with BGP, can be deployed incrementally, and offers incentives for Autonomous Systems (ASs) to upgrade their router software. We illustrate the design of DRAGON through a number of examples, prove its properties while developing a theoretical model of route aggregation, and evaluate its performance. Our experiments with realistic AS-level topologies, assignments of IP prefixes, and routing policies show that DRAGON reduces the number of prefixes in each AS by at least 70% with minimal stretch in the lengths of AS-paths traversed by data packets.

Due to the ever-increasing physical link speed, routing table size and internet traffic, modern routers have been the major bottleneck to process packages with a high throughout. As the most time-consumption task of routers, designing efficient IP lookup schemes for IPv6 face new challenges. In this paper, we design parallel bloom filter for IPv6, and implement it on Graphics Processing Unit to develop a novel GPU-accelerated software router, GRv6. Moreover, we design two schemes to support dynamic prefix update, i.e., dynamic prefix insert scheme and dynamic prefix delete scheme. To evaluate the performance of GRv6, we implement it with NVIDIA GeForce GTX 580 and utilize 5 real-life IPv6 routing tables to demonstrate that the IP lookup engine could achieve 60 Gbps for static routing tables, and 40 Gbps for dynamic routing tables with 3000 updates per second.

One of the crucial building blocks for Information Centric Networking (ICN) is a name based routing scheme that can route directly on content names instead of IP addresses. However, moving the address space from IP addresses to content names brings the scalability issues to a whole new level, due to two reasons. First, name aggregation is not as trivial a task as the IP address aggregation in BGP routing. Second, the number of addressable contents in the Internet is several orders of magnitude higher than the number of IP addresses. With the current size of the Internet, name based, anycast routing is very challenging specially when routing efficiency is of prime importance. We propose a name-based routing scheme $\alpha$ Route for ICN that offers efficient bandwidth usage, guaranteed content lookup and scalable routing table size. $\alpha$ Route consists of two components: an alphanumeric Distributed Hash Table (DHT) and an overlay to underlay (Internet topology) mapping algorithm. Simulation results show that $\alpha$ Route performs significantly better than Content Centric Network (CCN) in terms of network bandwidth usage, lookup latency and load balancing.

International audience; When a spanning tree is built on top of a wireless network and an appropriate labelling scheme is applied, the complexity of the routing mechanism in terms of memory usage and control messages can be drastically reduced using compact routing. In this paper, we propose multipath prefix routing (MPR), a multipath routing protocol for wireless sensor networks. MPR is a hybrid (both reactive and proactive) protocol that operates on an already built spanning tree rooted at the sink (the collect station). Besides the tree path, additional paths are built based on an appropriate labelling scheme and neighbourhood relationships. For practical implementation, we propose and evaluate two different labelling schemes. We mainly show that in a perfect W-ary tree, the additional number of bits required to encode labels is at most (H−1)(H−1) where H is the height of the tree. Finally, we apply MPR to the ZigBee standard and evaluate its performance using simulations. MPR has a small state routing while control messages overhead is maintained low compared to traditional multipath routing protocols.

Our group has proposed the unified hybrid network theory framework (UHNTF), which has revealed complicated transition relationship of topological property. In this paper, we constructed three types of multilayer supernetwork models based on UHNTF. We have numerically studied new topological features of these supernetwork models, and revealed some interesting phenomena. This lays the foundation for further practical application of UHNTF.

In this paper, we introduce mathematical models for studying a supernetwork that is comprised of closely connected groups of subnetworks. For several related classes of such supernetworks, we explicitly derive an analytical representation of their Laplacian spectra. This work is motivated by an application of spectral graph theory in cooperative control of multi-agent networked systems. Specifically, we apply our graph-theoretic results to establish bounds on the speed of convergence and the communication time-delay for solving the average-consensus problem by a supernetwork of clusters of integrator agents.

Border gateway protocol (BGP) is the main protocol used on the Internet today, for the exchange of routing information between different networks. The lack of authentication mechanisms in BGP, render it vulnerable to prefix hijacking attacks, which raise serious security concerns regarding both service availability and data privacy. To address these issues, this study presents BGPGraph, a scheme for detecting and visualising Internet routing anomalies. In particular, BGPGraph introduces a novel BGP anomaly metric that quantifies the degree of anomaly on the BGP activity, and enables the analyst to obtain an overview of the BGP status. The analyst, is afterwards able to focus on significant time windows for further analysis, by using a hierarchical graph visualisation scheme. Furthermore, BGPGraph uses a novel method for the quantification of information visualisation that allows for the evaluation, and optimal selection of parameters, in case of the corresponding visual analytics algorithms. As a result, by utilising the proposed approach, four new BGP anomalies were able to be identified. Experimental demonstration in known BGP events, illustrates the significant analytics potential of the proposed approach in terms of identifying prefix hijacks and performing root cause analysis.