Search

Dynamic multipath routing gives users flexibility over the transmitting path to deliver messages for security. Several protocols have already presented, such as multipath TCP, random routing mutation. However, they often limited to scalability, which mainly reflects on two aspects of network resource consumption and compossibility with other main transfer protocols. In this paper, to enhance the security of data delivery in wide area networks, a novel multipath routing scheme for end‐to‐end communication is proposed. The basic idea is concurrently using two paths (a fixed path and a changing path) to deliver the data of a pair, the fixed routing path undertakes the main delivery tasks, and the continually changing routing path only transfers a little data of the flow during the whole communication period. For systematically achieving security, Information Dispersal Algorithm disperses the flow data over the two paths for resisting anyone routing path compromised. Further, the method can maintain more routing path change since the burst network resource requirement decreases significantly at the routing mutation moment. Meanwhile, it brings a small amount of bandwidth disturbance over the traffic statuses of the network, thus alleviating instead of worsening the compossibility with other protocols. [ABSTRACT FROM AUTHOR]

Automatic Dependent Surveillance‐Broadcast (ADS‐B) system provides significant improvements in air traffic control system such as optimal routing in non‐radar environments with a new level of safety and efficiency. The ADS‐B system is being installed in many aircrafts in recent year. The ADS‐B equipped aircraft broadcasts the air traffic information to nearby aircraft and ground stations either once or twice per second. Because of the open channel communication atmosphere, the ADS‐B system is affected by many security attacks. Many authentication and batch verification schemes are available to provide data integrity and source authentication for the ADS‐B system. But they are suffering from computational overhead and communication overhead. Hence, an efficient anonymous authentication scheme is proposed for the ADS‐B system with batch verification based on Message Recovery Signature (MRS). The security and performance analysis section ensure that the proposed scheme provides essential security features with less computational and communication overhead comparison with the other existing schemes. [ABSTRACT FROM AUTHOR]

As very large scale integration technology scales to deep submicron, design for interconnections becomes increasingly challenging. The traditional bus routing follows a sequential bit-by-bit order, and few works explicitly target interbit regularity for signal groups via multilayer topology selection. To overcome these limitations, we present $\mathsf {Streak}$ , an efficient framework that combines topology generation and wire synthesis with a global view of optimization and constrained metal layer track resource allocation. In the framework, an identification stage decomposes binding groups into a set of representative objects; with the generated backbones, equivalent topologies are accompanied by the bits in every object; then a formulation guides the routing considering wire congestion and design regularity. Furthermore, a bottom-up clustering methodology based on layer prediction targets to enhance the routability; a post-refinement stage is developed to match the source-to-sink distance deviation among bits in one group. Experimental results using industrial benchmarks demonstrate the effectiveness of the proposed technique. [ABSTRACT FROM AUTHOR]

Scholars have recently suggested the reorganization of general hospitals into organizationally separate divisions for routine and non-routine services to overcome operational misalignments between the two types of services. We provide empirical evidence for this proposal from a quality perspective, using over 250,000 patient discharge records from 60 German hospitals across 39 high-mortality disease segments, and focusing on in-hospital mortality as outcome. Disentangling the effects of high, absolute, and relative hospital volumes in a disease group, our analysis suggests that routine and complex patients would benefit from a hospital organization with a multi-specialty hub for emergency and non-routine elective services at its core, complemented by organizationally separate disease-focused hospitals-within-hospitals for routine services. We also provide evidence that the hub hospital can further improve service quality for complex patients by adopting a disease-based rather than medical specialty-based departmental routing strategy for newly arriving patients. A counterfactual analysis, based on a simultaneous equations probit model that simultaneously controls for endogeneity of volume, focus, and routing strategy, suggests that the proposed reorganization could have reduced mortality in the sample by 13.43% (95% CI [6.87%; 18.95%]) for routine patients and by 11.67% (95% CI [6.13%; 16.86%]) for the most complex patients. The supplementary material is available at https://doi.org/10.1287/mnsc.2018.3064. This paper was accepted by Serguei Netessine, operations management. [ABSTRACT FROM AUTHOR]

On the one hand, the correctness of routing protocols in networks is an issue of utmost importance for guaranteeing the delivery of messages from any source to any target. On the other hand, a large collection of routing schemes have been proposed during the last two decades, with the objective of transmitting messages along short routes, while keeping the routing tables small. Regrettably, all these schemes share the property that an adversary may modify the content of the routing tables with the objective of, e.g. blocking the delivery of messages between some pairs of nodes, without being detected by any node. In this paper, we present a simple certification mechanism which enables the nodes to locally detect any alteration of their routing tables.In particular, we show how to locally verify the stretch-3 routing scheme by Thorup and Zwick, presented in SPAA in 2001, by adding certificates of the same order of magnitude as the original routing tables. We also propose a new name-independent routing scheme using routing tables of size O ˜ (n) bits at each node in n -node networks. This new routing scheme can be locally verified using certificates of O ˜ (n) bits. Its stretch is 3 if using handshaking, and 5 otherwise. [ABSTRACT FROM AUTHOR]

Identifying congested links accurately to ensure the Service Level Agreements is an important but challenging task, since it is costly or even practically unfeasible to monitor massive interior links directly for large networks. Network tomography has been proposed to overcome this problem by using end-to-end (path) measurements. However, most of existing tomographic methods only focus on the loss performance degradation, while paying much less attention the fact that network congestion will also greatly worsen the delay performance. Nevertheless, most of them normally work under single-path routing, which may also get violated in today's Internet as multipath routing is increasingly common. In this paper, we consider the problem of using end-to-end measurements to identify congested links when multipath routing is employed in a non-tree network. Firstly, we use both link delay variances and link loss rates to model the system constraints between end- to-end paths and the interior links, and transfer the issue of congested link identification as an optimization problem. By theoretically demonstrating that the link delay variances are identifiable from the end-to-end delay measurements with certain topology conditions, we further prove that the above optimization problem is a Non-deterministic Polynomial-time hard (NP-hard) problem. Then in order to solve such an NP-hard problem, two greedy algorithms based on bool and additive congestion statuses are proposed. Lastly, simulation studies show that with extra delay constraints, our proposed algorithms are able to achieve better identification performances than existing methods under multipath routing. [ABSTRACT FROM AUTHOR]

ARPANET demonstrated that packet switching was an effective routing principle for computer networks, accelerating the evolution towards the current network paradigm, in which packetization is found in almost all forms of digital communication. The decision to use the packet switching principle was crucial to the development of the Internet and computer networking broadly, and in popular literature, packet switching is often attributed to three originators: Paul Baran, Donald Davies and Leonard Kleinrock. This paper does not concern itself with who invented packet switching, but rather, who had the greatest influence on the risky and highly consequential decision to base the ARPANET design on this previously untested technology. A close examination of the available documentation, including two newly re-emerged documents, indicate that Paul Baran had a much more substantial influence on the decision to use packet switching for ARPANET than most retellings of Internet history portray. The findings also show that Donald Davies' role in the adoption of packet switching as a dominant principle for digital communication may have been less impactful than depicted in current literature and that Kleinrock may have played a significant role in bringing packet switching to the ARPANET, influenced by interactions with Baran. [ABSTRACT FROM AUTHOR]

We study problems that integrate buy-at-bulk network design into the classical (connected) facility location problem. In such problems, we need to open facilities, build a routing network, and route every client demand to an open facility. Furthermore, capacities of the edges can be purchased in discrete units from K different cable types with costs that satisfy economies of scale. We extend the linear programming framework of Talwar (IPCO 2002) for the single-source buy-at-bulk problem to these variants and prove integrality gap upper bounds for both facility location and connected facility location buy-at-bulk problems. For the unconnected variant we prove an integrality gap bound of O(K), and for the connected version, we get the first LP-based bound of O(1). [ABSTRACT FROM AUTHOR]

Mobile social networks are networks with mobile nodes which have social properties. Various methods for routing have been introduced in these networks. Some of these methods take advantage of single-copy message forwarding and some take advantage of multi-copy message forwarding. In single-copy forwarding, due to fragility of the route, the probability of the message delivery decreases. For example, there is possibility that the node receiving the packet becomes damaged. In the multi-copy methods, in which there is no control over the number of the message replications, the network overhead increases. In the methods recently presented a balanced state between two mentioned methods has been created which applies quota allocation in controlling the replications number of message copies in the network. It seems that employing social features in determining the number of replication licenses has an impact in the efficiency of routing methods. In this article a multi-copy routing method, named SFQ, has been introduced which controls the number of copy replications by the adjustment of the quota. The SFQ method uses social property of nodes in determining the quota of each node. In this method those nodes which have more common properties with the destination receive more quotas of replication permissions. The results of simulation by the software of ONE display that in average the ratio of message delivery in this method is more than the two other methods. [ABSTRACT FROM AUTHOR]

Research on wireless sensor network (WSN) has mainly involved the use of a portable and limited power source, namely batteries, to power the sensors. Without energy, a sensor is essentially useless and can not contribute to the utility of the network as a whole. As a result, considerable research effort has been devoted to designing energy efficient networking protocols to maximize network life. For this reason, a new routing concept called opportunistic routing has emerged whose objective is to address the resource management problem in order to maximize the lifetime of the network. In other words, opportunistic routing is a new theme in the WSNs, as it is an approach to take into account the environment of a node as it is and not as perceived by the network. Our main objective in this work will be to present a new idea to calculate the list of candidates to minimize energy consumption and increased the life time of network. And we proposed a new opportunistic routing protocols called energy-efficient opportunistic routing using a new forward list (EEOR-FL) aiming to balance energy consumption and maximize the network lifetime. EEOR-FL uses a new method in order to to calculate the list of candidates. The obtained results indicate that EEOR-FL can effectively balance the energy consumption and therefore can lengthen the network lifetime. [ABSTRACT FROM AUTHOR]

Abstract Telecommunication networks are a critical infrastructure of our society. Wide area backbone communication networks are based on optical networks, where each fiber has a very large capacity. These networks must offer high end-to-end availability and a high resilience to large-scale disasters. Routing with geodiversity can mitigate the impact of disasters but will result in longer paths, making it difficult to achieve the availability levels required by critical services. In this paper, we consider a given core optical network such that the current availability and the cost of upgrading it to a higher value are known for each network link (or edge). Then, the problem of selecting a set of edges to be upgraded at a minimum cost, while guaranteeing desired values of end-to-end availability and geodiversity, is considered and formulated as an arc based integer non-linear programming model. The non-linear constraints of the model are approximated and linearized, resulting in a new ILP based heuristic. A filtering procedure is proposed for decreasing (if possible) the cost and the number of upgraded edges of the solutions obtained by previously proposed greedy heuristics and also by the ILP based heuristic. The relative performance of the heuristics is evaluated using different geodiverse distances and end-to-end availability values in two reference core optical networks. [ABSTRACT FROM AUTHOR]

Abstract Elastic optical networks with optical-orthogonal frequency division multiplexing have been addressed enthusiastically for communication networks in the last decade because they result in high bandwidth efficiency. Routing and spectrum allocation (RSA) problems need to be solved when we transmit demands in an elastic optical network. This research deals with static RSA models for anycast transmission, which is one-to-one-of-many transmission in inter-datacenter networks. Two static RSA optimization models are considered. One minimizes the maximum number of spectrum slots needed to allocate given demands. The other maximizes the traffic volume of demands served under a given spectrum slot number. For both models, lower and upper bounds are developed in order to obtain exact optimal solutions. One-side bounds of the problems are evaluated by relaxing spectrum continuity constraints. For the other side bounds, several greedy algorithms are investigated. We conducted computational experiments to confirm whether relaxation problems can give tight bounds and to determine greedy algorithmic behaviors by using each of route selection criterion and each of demand ordering policies. The results show that the solutions obtained by relaxing spectrum continuity constraints are almost optimal. They also indicate that exact optimal solutions are obtained efficiently by using these bounds. [ABSTRACT FROM AUTHOR]

Opportunistic routing is a promising technique that has been proposed for wireless mesh networks. It achieves significant performance gains under unstable wireless links since it can take advantage of the broadcast nature of the wireless medium. Many protocols of opportunistic routing have been proposed to increase transmission reliability and network throughput. Instead of using a dedicated next hop, opportunistic routing can consider multiple downstream nodes as potential forwarders. The decision of which nodes being chosen to forward packets is made by the coordination schema. Although the coordination helps opportunistic routing to deliver opportunistic gains, it requires a batch-based schedule to minimize the cost, which may prevent spatial channel reuse and thus under utilize wireless media. In this paper, we explain the fundamental idea of opportunistic routing and propose a discrete-time Markov chain as a general model to map the transmission process. It demonstrates how to map batch-based packet transmissions in the network with state transitions in a Markov chain. Our model considers the pipelined data transfer and evaluates opportunistic routing under different wireless networks in terms of the expected number of transmissions and time slots. It shows both the pros and cons of opportunistic routing and thus helps in the design of future protocols of opportunistic routing. [ABSTRACT FROM AUTHOR]

Software-defined networking (SDN) is a representative next generation network architecture, which allows network administrators to programmatically initialize, control, change, and manage network behavior dynamically via open interfaces. SDN is widely adopted in systems like 5G mobile networks and cyber-physical systems (CPS). However, SDN brings new security problems, e.g., controller hijacking, black-hole, and unauthorized data modification. Traditional firewall or IDS based solutions cannot fix these challenges. It is also undesirable to develop security mechanisms in such an ad hoc manner, which may cause security conflict during the deployment procedure. In this paper, we propose OSCO (Open Security-enhanced Compatible OpenFlow) platform, a unified, lightweight platform to enhance the security property and facilitate the security configuration and evaluation. The proposed platform supports highly configurable cryptographic algorithm modules, security protocols, flexible hardware extensions, and virtualized SDN networks. We prototyped our platform based on the Raspberry Pi Single Board Computer (SBC) hardware and presented a case study for switch port security enhancement. We systematically evaluated critical security modules, which include 4 hash functions, 8 stream/block ciphers, 4 public-key cryptosystems, and key exchange protocols. The experiment results show that our platform performs those security modules and SDN network functions with relatively low computational (extra 2.5% system overhead when performing AES-256 and SHA-256 functions) and networking performance overheads (73.7 Mb/s TCP and 81.2Mb/s UDP transmission speeds in 100Mb/s network settings). [ABSTRACT FROM AUTHOR]

The characteristics of MANET such as decentralized architecture, dynamic topologies make MANETs susceptible to various security attacks. Sequence number attacks are such type of security threats which tend to degrade the network functioning and performance by sending fabricated route reply packets (RREP) with the objective of getting involved in the route and drop some or all of the data packets during the data transmission phase. The sequence number adversary attempts to send a fabricated high destination number in the RREP packet which attracts the sender to establish a path through the adversary node. This paper proposes a proactive secure routing mechanism which is an improvement over the authors previously proposed scheme. It makes use of linear regression mechanism to predict the maximum destination sequence number that the neighboring node can insert in the RREP packet. As an additional security checkpoint, it uses a bait detection mechanism to establish confidence in marking a suspicious node as a malicious node. The proposed approach works in collaboration with the ad hoc on-demand distance vector routing (AODV) protocol. The simulation results depict that the approach improves the network performance in the presence of adversaries as compared to previously proposed scheme. [ABSTRACT FROM AUTHOR]

The end-to-end throughput of multi-hop communication in wireless ad hoc networks is affected by the conflict between forwarding nodes. It has been shown that sending more packets than maximum achievable end-to-end throughput not only fails to increase throughput but also decreases throughput owing to high contention and collision. Accordingly, it is of crucial importance for a source node to know the maximum end-to-end throughput. The end-to-end throughput depends on multiple factors, such as physical layer limitations, medium access control (MAC) protocol properties, routing policy, and nodes’ distribution. There have been many studies on analytical modeling of end-to-end throughput but none of them has taken routing policy and nodes’ distribution as well as MAC layer altogether into account. In this paper, the end-to-end throughput with perfect MAC layer is obtained based on routing policy and nodes’ distribution in 1-D and 2-D networks. Then, imperfections of IEEE 802.11 protocol are added to the model to obtain precise value. An exhaustive simulation is also made to validate the proposed models using ns-2 simulator. Results show that if the distribution to the next hop for a particular routing policy is known, our methodology can obtain the maximum end-to-end throughput precisely. [ABSTRACT FROM AUTHOR]

Routing is one of the most important technologies in wireless sensor networks. The energy efficiency of the sensor network is realized by combining other technologies with routing protocols in this paper. First, through the analysis of the energy model of the clustering routing algorithm, the local signal to noise ratio (SNR) is used to purposefully select the nodes in the cluster to transmit data. In order to avoid the energy consumption of a large number of nodes to transmit data, a simple architecture is proposed to combine the distributed source code with the cluster routing protocol. The method uses the data on the cluster head as the edge information to decode the compressed information transmitted from the cluster nodes. The simulation result shows that the energy efficiency of the network can be achieved through this combination. [ABSTRACT FROM AUTHOR]

Summary: A smart opportunistic environment is a physical space, which allows the smart physical objects to communicate in the presence of disruption in connectivity. Because, the objects in such an environment are buffer constrained, some of the objects will not participate in data forwarding, when there is scarcity of storage (buffer) space. In this paper, we focus on such selfish behavior of objects triggered by space constraints in a smart opportunistic environment. We propose a novel data forwarding algorithm, selfishness and buffer‐aware routing (SBR), in which a node is chosen as a relay, based on its capability, which is a function of its available buffer space and past encounter history (delivery predictability) with the destination. SBR can efficiently utilize the limited buffer space in a node with a buffer management scheme, WSD. It can also detect space constraint driven selfish behavior of nodes and resolve it using a reputation‐based technique, MSD. We have conducted simulation using both synthetic and real‐world traces for evaluating our proposed SBR algorithm. For analyzing the performance of the algorithm in real‐time, a smart vehicular test‐bed is developed. Simulation results and test‐bed implementation show that our algorithm performs better in terms of higher delivery ratio, lower overhead ratio, and lower delivery delay, compared with existing opportunistic data forwarding algorithms. [ABSTRACT FROM AUTHOR]

Pareto optimality is capable of striking the optimal tradeoff amongst the diverse conflicting quality-of-service requirements of routing in wireless multihop networks. However, this comes at the cost of increased complexity owing to searching through the extended multiobjective search-space. We will demonstrate that the powerful quantum-assisted dynamic programming optimization framework is capable of circumventing this problem. In this context, the so-called evolutionary quantum Pareto optimization (EQPO) algorithm has been proposed, which is capable of identifying most of the optimal routes at a near-polynomial complexity versus the number of nodes. As a benefit, we improve both the EQPO algorithms by introducing a back-tracing process. We also demonstrate that the improved algorithm, namely the back-tracing-aided EQPO algorithm, imposes a negligible complexity overhead, while substantially improving our performance metrics, namely the relative frequency of finding all Pareto-optimal solutions and the probability that the Pareto-optimal solutions are, indeed, a part of the optimal Pareto front. [ABSTRACT FROM AUTHOR]

In recent years, the idea of wireless three-dimensional network-on-chips (3D NoCs) was promoted in order to design many-core chips with greater performance and lower energy consumption. This technology is the combination of different dies that are stacked on each other. Therefore, it is necessary to propose a suitable routing mechanism for irregular wireless 3D NoCs that can support the agnostic topologies. In this paper, we propose a deadlock-free routing algorithm for wireless 3D NoCs, called Floyd-base Inter-chip Traffic distribution (FIT), which is based on Floyd routing algorithm. In FIT algorithm, the number of hops is reduced compared to the already established deterministic algorithms; moreover, the traffic distribution is improved. Evaluation results show that our proposed routing algorithm significantly improves the performance and throughput by reducing the energy consumption, the average hop count and the communication latency. [ABSTRACT FROM AUTHOR]

Three major problems of wireless sensor networks can be summarized into communication traffic, energy consumption and routing security. In this paper, we analyze performance of an underwater sensor network in dense mode under creation of spherical division-based forbidden regions. Obviously, unnecessary smart node removal from the packet forwarding process of a flooding-based routing policy is theoretically an idea for enhancing the known network parameters. In this research, our purposed approach is to improve energy consumption by using a removal process over physical routing space toward more network reliability and better network lifetime. Clearly, our aim is performance improvement in terms of a network protocol in an underwater wireless sensor networks with a huge number of high-speed mobile nodes. The nodes generally consist of different underwater instruments such as sensors, robots, modems and batteries and are categorized into two groups of autonomous unmanned underwater vehicles and remotely operated vehicles. The proposed approach is a hybrid solution based on vector-based forwarding routing protocol and spherical divisions which is named spherical division-based vector-based forwarding. The proposed protocol can successfully reduce energy consumption and equivalently increase the network lifetime while packet delivery ratio is in a saturation level. In details, our proposed method works on preservation of sensors’ energy in which we physically remove some additional paths of routing process (based on a multipath forwarding using a basic routing algorithm). In this regard, we apply a spherical division-based physical restriction on the routing space. However, removing these additional sensor nodes/routers is conditionally done under keeping the suitable traffic performance in terms of PDR because it is essential to say that a new scheme is effective. [ABSTRACT FROM AUTHOR]

Due to the dynamism of topology, sharing of bandwidth and constraint of resources in wireless nodes, the provision of quality of service (QoS) for routing in mobile ad hoc networks (MANETs) presents a great challenge. Security is another crucial aspect of providing QoS since the existence of malicious nodes present all kinds of threats to MANETs. Although a number of mechanisms have been proposed for protecting MANETs, most of the solutions are only effective for a particular kind of attacks or provide security at the cost of sacrificing QoS. In this paper, we propose a trust-based secure QoS routing scheme by combining social and QoS trust. The primary approach of the proposed scheme relies on mitigating nodes that exhibit various packet forwarding misbehavior and on discovering the path that ensures reliable communication through the trust mechanism. The scheme would select the best forwarding node based on packet forwarding behavior as well as capability in terms of QoS parameters, such as residual energy, channel quality, link quality, etc. We will present an adversary model for packet dropping attack against which we evaluate the proposed scheme. Simulation experiment using Network Simulator-2 (NS2) and under various network conditions show that mixing social and QoS trust parameters can greatly improve security and quality of service routing in terms of overhead, packet delivery ratio and energy consumption. [ABSTRACT FROM AUTHOR]

Efficient utilization of spectrum is a key concern in the soon to be deployed elastic optical networks (EONs). To perform routing in EONs, various fixed routing (FR), and fixed-alternate routing (FAR) schemes are ubiquitously used. FR, and FAR schemes calculate a fixed route, and a prioritized list of a number of alternate routes, respectively, between different pairs of origin o and target t nodes in the network. The route calculation performed using FR and FAR schemes is predominantly based on either the physical distance, known as k -shortest paths (KSP), or on the hop count (HC). For survivable optical networks, FAR usually calculates link-disjoint (LD) paths. These conventional routing schemes have been efficiently used for decades in communication networks. However, in this paper, it has been demonstrated that these commonly used routing schemes cannot utilize the network spectral resources optimally in the newly introduced EONs. Thus, we propose a new routing scheme for EON, namely, k -distance adaptive paths (KDAP) that efficiently utilizes the benefit of distance-adaptive modulation, and bit rate-adaptive superchannel capability inherited by EON to improve spectrum utilization. In the proposed KDAP, routes are found and prioritized on the basis of bit rate, distance, spectrum granularity, and the number of links used for a particular route. To evaluate the performance of KSP, HC, LD, and the proposed KDAP, simulations have been performed for three different sized networks, namely, 7-node test network (TEST7), NSFNET, and 24-node US backbone network (UBN24). We comprehensively assess the performance of various conventional, and the proposed routing schemes by solving both the RSA and the dual RSA problems under homogeneous and heterogeneous traffic requirements. Simulation results demonstrate that there is a variation amongst the performance of KSP, HC, and LD, depending on the o - t pair, and the network topology and its connectivity. However, the proposed KDAP always performs better for all the considered networks and traffic scenarios, as compared to the conventional routing schemes, namely, KSP, HC, and LD. The proposed KDAP achieves up to 60 % , and 10.46 % improvement in terms of spectrum utilization, and resource utilization ratio, respectively, over the conventional routing schemes. [ABSTRACT FROM AUTHOR]

Motivated by routing in telecommunication network using Software Defined Network (SDN) technologies, we consider the following problem of finding short routing lists using aggregation rules. We are given a set of communications $$\mathcal {X}$$ , which are distinct pairs $$(s,t)\subseteq S\times T$$ , (typically S is the set of sources and T the set of destinations), and a port function $$\pi :\mathcal {X} \rightarrow P$$ where P is the set of ports. A routing list $$\mathcal {R}$$ is an ordered list of triples which are of the form ( s, t, p), $$(*,t,p)$$ , $$(s,*,p)$$ or $$(*,*,p)$$ with $$s\in S$$ , $$t\in T$$ and $$p\in P$$ . It routes the communication ( s, t) to the port $$r(s,t) =p$$ which appears on the first triple in the list $$\mathcal {R}$$ that is of the form ( s, t, p), $$(*,t,p)$$ , $$(s,*,p)$$ or $$(*,*,p)$$ . If $$r(s,t)=\pi (s,t)$$ , then we say that ( s, t) is properly routed by $$\mathcal {R}$$ and if all communications of $$\mathcal {X}$$ are properly routed, we say that $$\mathcal {R}$$ emulates $$(\mathcal {X}, \pi )$$ . The aim is to find a shortest routing list emulating $$(\mathcal {X}, \pi )$$ . In this paper, we carry out a study of the complexity of the two dual decision problems associated to it. Given a set of communication $$\mathcal {X}$$ , a port function $$\pi $$ and an integer k, the first one called Routing List (resp. the second one, called List Reduction) consists in deciding whether there is a routing list emulating $$(\mathcal {X}, \pi )$$ of size at most k (resp. $$|\mathcal {X}| -k$$ ). We prove that both problems are NP-complete. We then give a 3-approximation for List Reduction, which can be generalized to higher dimensions. We also give a 4-approximation for Routing List in the fundamental case when there are only two ports (i.e. $$|P|=2$$ ), $$\mathcal {X}=S\times T$$ and $$|S|=|T|$$ . [ABSTRACT FROM AUTHOR]

Greedy Forward is a well-known technique used by most of the geographic routing algorithms to forward packets to the node that is geographically closer to the destination node. It is the simplest form of the proposed geographic routing algorithms and it is particularly attractive in sensor networks by bringing additional advantages such scalability, dynamism, and high delivery rates. However, in the presence of a hole (or voids), greedy forward techniques tend to fail. Thus, a hole bypass solution needs to be used in order to route packets to a node where greedy forwarding process can be resumed. In this work, we propose a new geographic routing algorithm called REACT that can bypass routing holes and create routing paths toward the sink node. Our solution takes advantage of the higher communication range of the sink node and the Received Signal Strength Indicator (RSSI) to enable the construction of routing paths by self-electing the next hop at each step while also performing data aggregation. No extra packets are required to configure the routing task. Our results clearly show an efficient data delivery achieved by the proposed algorithm in scenarios with routing holes with all the benefits of a greedy forwarding technique. [ABSTRACT FROM AUTHOR]

In this paper, we proposed and developed Function-Oriented Networking (FON), a platform for network users. It has a different philosophy as opposed to technologies for network managers of Software-Defined Networking technology, OpenFlow. It is a technology that can immediately reflect the demands of the network users in the network, unlike the existing OpenFlow and Network Functions Virtualization (NFV), which do not reflect directly the needs of the network users. It allows the network user to determine the policy of the direct network, so it can be applied more precisely than the policy applied by the network manager. This is expected to increase the satisfaction of the service users when the network users try to provide new services. We developed FON function that performs on-demand routing for Low-Delay Required service. We analyzed the characteristics of the Ant Colony Optimization (ACO) algorithm and found that the algorithm is suitable for low-delay required services. It was also the first in the world to implement the routing software using ACO Algorithm in the real Ethernet network. In order to improve the routing performance, several algorithms of the ACO Algorithm have been developed to enable faster path search-routing and path recovery. The relationship between the network performance index and the ACO routing parameters is derived, and the results are compared and analyzed. Through this, it was possible to develop the ACO algorithm. [ABSTRACT FROM AUTHOR]

We design throughput-optimal dynamic broadcast algorithms for multi-hop networks with arbitrary topologies. Most of the previous broadcast algorithms route packets along spanning trees. For large time-varying networks, computing and maintaining a set of spanning trees is not efficient, as the network-topology may change frequently. In this paper, we design a class of dynamic algorithms, which make simple packet-by-packet scheduling and routing decisions, and hence obviate the need for maintaining any global topological structures, such as spanning trees. Our algorithms may be conveniently understood as a non-trivial generalization of the familiar back-pressure algorithm for unicast traffic, which performs packet routing and scheduling based on queue lengths. However, in the broadcast setting, due to packet duplications, it is difficult to define appropriate queuing structures. We design and prove the optimality of a virtual queue-based algorithm, where virtual queues are defined for subsets of nodes. We then propose a multi-class broadcast policy, which combines the above scheduling algorithm with in-class-in-order packet forwarding, resulting in significant reduction in complexity. Finally, we evaluate the performance of the proposed algorithms via extensive numerical simulations. [ABSTRACT FROM PUBLISHER]

Legacy networks are often designed to operate with simple single-path routing, like the shortest path, which is known to be throughput suboptimal. On the other hand, previously proposed throughput optimal policies (i.e., backpressure) require every device in the network to make dynamic routing decisions. In this paper, we study an overlay architecture for dynamic routing, such that only a subset of devices (overlay nodes) need to make the dynamic routing decisions. We determine the essential collection of nodes that must bifurcate traffic for achieving the maximum multi-commodity network throughput. We apply our optimal node placement algorithm to several graphs and the results show that a small fraction of overlay nodes is sufficient for achieving maximum throughput. Finally, we propose a threshold-based policy (BP-T) and a heuristic policy (OBP), which dynamically control traffic bifurcations at overlay nodes. Policy BP-T is proved to maximize throughput for the case when underlay paths do no overlap. In all studied simulation scenarios, OBP not only achieves full throughput but also reduces delay in comparison to the throughput optimal backpressure routing. [ABSTRACT FROM PUBLISHER]

Network switches and routers need to serve packet writes and reads at rates that challenge the most advanced memory technologies. As a result, scaling the switching rates is commonly done by parallelizing the packet I/Os using multiple memory units. For improved read rates, packets can be coded upon write, thus giving more flexibility at read time to achieve higher utilization of the memory units. This paper presents a detailed study of coded network switches, and in particular, how to design them to maximize the throughput advantages over standard uncoded switches. Toward that objective, the paper contributes a variety of algorithmic and analytical tools to improve and evaluate the throughput performance. The most interesting finding of this paper is that the placement of packets in the switch memory is the key to both high performance and algorithmic efficiency. One particular placement policy we call “design placement” is shown to enjoy the best combination of throughput performance and implementation feasibility. [ABSTRACT FROM PUBLISHER]

This paper investigates the problem of finding optimal paths in single-source single-destination accumulative multi-hop networks. We consider a single source that communicates to a single destination assisted by several relays through multiple hops. At each hop, only one node transmits, while all the other nodes receive the transmitted signal, and store it after processing/decoding and mixing it with the signals received in previous hops. That is, we consider that terminals make use of advanced energy accumulation transmission/reception techniques, such as maximal ratio combining reception of repetition codes, or information accumulation with rateless codes. Accumulative techniques increase communication reliability, reduce energy consumption, and decrease latency. We investigate the properties that a routing metric must satisfy in these accumulative networks to guarantee that optimal paths can be computed with Dijkstra’s algorithm. We model the problem of routing in accumulative multi-hop networks, as the problem of routing in a hypergraph. We show that optimality properties in a traditional multi-hop network (monotonicity and isotonicity) are no longer useful and derive a new set of sufficient conditions for optimality. We illustrate these results by studying the minimum energy routing problem in static accumulative multi-hop networks for different forwarding strategies at relays. [ABSTRACT FROM PUBLISHER]

Delay-tolerant networks (DTNs) are intermittently connected networks, such as mobile social networks formed by human-carried mobile devices. Routing in such mobile social DTNs is very challenging, as it must handle network partitioning, long delays, and dynamic topology. Recently, social-based approaches, which attempt to exploit social behaviors of DTN nodes to make better routing decision, have drawn tremendous interest in the DTN routing design. In this paper, we propose a novel social-based routing approach for mobile social DTNs, where a new metric, i.e., social energy, is introduced to quantify the ability of a node to forward packets to others, inspired by general laws in particle physics. Social energy is generated via node encounters and shared by the communities of encountering nodes. Similar to the radiation of energy in physics, the social energy of any node decays over time. Our proposed social-energy-based routing (SEBAR) protocol considers social energy of encountering nodes and is in favor of the node with a higher social energy in its or the destination's social community. Our simulations with real-life wireless traces demonstrate the efficiency and the effectiveness of the SEBAR method by comparing it with several existing DTN routing schemes. In addition, two variations of SEBAR with the aim of overhead reduction are also presented and evaluated. [ABSTRACT FROM AUTHOR]

Modern technologies provide wide and thick metal layers that must be wisely used to reduce the delay of critical interconnections. After global routing, incremental layer assignment can improve the circuit timing by properly selecting critical interconnect segments to be routed in the faster (but very limited) wires on upper layers. Existing techniques based on net-by-net iterative improvement may get stuck at locally-optimal solutions depending on net ordering. Recent techniques rule out such drawback through the simultaneous iterative improvement of all nets, but they unfortunately rely on objective functions that may guide the optimization off critical paths. As opposed to all reported techniques, which rely on simplified, overly pessimistic timing models, this paper proposes the decoupling of incremental layer assignment from the timing analysis and the exploitation of flow conservation conditions so as to enable the use of an external signoff timing engine. The novel technique was experimentally compared with two state-of-the art works, leading to 50% less timing violations under total negative slack metric and 35% less timing violations under worst negative slack metric with similar overhead in number of vias. [ABSTRACT FROM AUTHOR]

Triple patterning lithography (TPL) is one of the most promising lithography technology in sub-14-nm technology nodes, especially for complicated low metal layer manufacturing. To overcome the intracell routability problem and improve the cell regularity, recently middle-of-line (MOL) layers are employed in standard cell design. However, MOL layers may introduce a large amount of cross-row TPL conflicts for row-based design. Motivated by this challenge, in this paper we propose the first TPL aware detailed placement toward zero cross-row MOL conflict. In standard cell precoloring, Boolean-based look-up table is proposed to reduce solution space. In detailed placement stage, three powerful techniques, i.e., local reordered single row refinement, min-cost flow-based conflict removal, and local cell interleaving, are proposed to provide zero TPL conflict solution. The experimental results demonstrate the effectiveness of our proposed methodologies. [ABSTRACT FROM AUTHOR]

Due to the absence of infrastructure support, secure data dissemination is a challenging task in scalable mobile ad hoc networks (MANETs) environment. In most of the traditional routing techniques for MANETs, either security has not been taken into account or only one aspect of security concern has been addressed without optimizing the routing performance. This paper proposes Flooding Factor based Framework for Trust Management (F3TM) in MANETs. True flooding approach is utilized to identify attacker nodes based on the calculation of trust value. Route Discovery Algorithm is developed to discover an efficient and secure path for data forwarding using Experimental Grey Wolf algorithm for validating network nodes. Enhanced Multi-Swarm Optimization is used to optimize the identified delivery path. Simulations are carried out in ns2 to assess and compare the performance of F3TM with the state-of-the-art frameworks: CORMAN and PRIME considering the metrics including delay, packet delivery ration, overhead and throughput. The performance assessment attests the reliable security of F3TM compared to the state-of-the-art frameworks. [ABSTRACT FROM AUTHOR]

Internet of Things (IoT) enables the interaction of objects or things with each other or with the surrounding environment. "Smart" objects, embedded with RFID are the key element for IoT. These objects are provided with the unique identities which addresses each device uniquely in the network. Routing plays a major role in adapting the IoT vision as nodes must communicate and exchange information efficiently with each other. A major challenge for IoT is the design and implementation of routing algorithms that adapt to the frequent and randomly changing network topology. In this paper a multipath routing protocol for IoT that is MRPIoT has been proposed which adapts to the basic requirements of IoT network. In the proposed work an Internet Connecting Routing Table (ICRT) is used which consists of routing information as well as internet connecting nodes information thereby eliminating need to maintain separate table for internet connecting nodes information. We have analyzed and evaluated the performance of proposed protocol on the basis of parameters such as packet delivery ratio, energy consumption and throughput. [ABSTRACT FROM AUTHOR]

In this work, an ACO routing protocol for mobile ad hoc networks based on AntHocNet is specified. As its predecessor, this new protocol, called AntOR, is hybrid in the sense that it contains elements from both reactive and proactive routing. Specifically, it combines a reactive route setup process with a proactive route maintenance and improvement process. Key aspects of the AntOR protocol are the disjoint-link and disjoint-node routes, separation between the regular pheromone and the virtual pheromone in the diffusion process and the exploration of routes, taking into consideration the number of hops in the best routes. In this work, a family of ACO routing protocols based on AntOR is also specified. These protocols are based on protocol successive refinements. In this work, we also present a parallelized version of AntOR that we call PAntOR. Using programming multiprocessor architectures based on the shared memory protocol, PAntOR allows running tasks in parallel using threads. This parallelization is applicable in the route setup phase, route local repair process and link failure notification. In addition, a variant of PAntOR that consists of having more than one interface, which we call PAntOR-MI (PAntOR-Multiple Interface), is specified. This approach parallelizes the sending of broadcast messages by interface through threads. [ABSTRACT FROM AUTHOR]

In this paper, we formulate an integer linear programming (ILP) to perform multicast routing and spectrum assignment (MRSA) in elastic optical networks, which serves jointly a set of multicast requests. In this formulation, all physical layer restrictions including modulation level assignment, maximum number of multicast capable nodes (MCNs), and maximum splitting degree (MSD) of MCNs, are considered. In addition, we modify the proposed joint ILP to serve multicast requests one-by-one, which is referred to as a separate ILP. Furthermore, we present three heuristic algorithms for MRSA, namely distance-based MRSA (DMRSA), congestion-based MRSA (CMRSA), and mixed CMRSA/DMRSA, which are applicable in both static and dynamic operation scenarios. In CMRSA and DMRSA, the link length and the amount of occupied spectrum are considered as the cost function of multicast routing, respectively; and in mixed CMRSA/DMRSA, a combination of normalized link length and normalized occupied spectrum is considered as the cost function. The comparison of ILPs and heuristic algorithms in static operation reveals that the joint ILP, as the benchmark, gives the optimum solution while has the most computational complexity. Furthermore, the separate ILP has lower complexity at the cost of consuming slightly more spectrum. Unless the DMRSA method, which has the worst performance, the gap between the other two heuristic algorithms and the ILPs is negligible. Furthermore, simulation results of dynamic operation scenarios reveal that mixed CMRSA/DMRSA outperforms other two heuristics algorithms in terms of blocking probability. [ABSTRACT FROM PUBLISHER]

Forwarding decisions in classical IP-based networks are predetermined by routing. This is necessary to avoid loops, inhibiting opportunities to implement an adaptive and intelligent forwarding plane. Consequently, content distribution efficiency is reduced due to a lack of inherent multi-path transmission. In Named Data Networking (NDN) instead, routing shall hold a supporting role to forwarding, providing sufficient potential to enhance content dissemination at the forwarding plane. In this paper, we design, implement, and evaluate a novel probability-based forwarding strategy, called Stochastic Adaptive Forwarding (SAF) for NDN. SAF imitates a self-adjusting water pipe system, intelligently guiding and distributing interests through network crossings circumventing link failures and bottlenecks. Just as real pipe systems, SAF employs overpressure valves enabling congested nodes to lower pressure autonomously. Through an implicit feedback mechanism, it is ensured that the fraction of the traffic forwarded via congested nodes decreases. By conducting simulations, we show that our approach outperforms existing forwarding strategies in terms of the interest satisfaction ratio in the majority of the evaluated scenarios. This is achieved by extensive utilization of NDN’s multipath and content-lookup capabilities without relying on the routing plane. SAF explores the local environment by redirecting requests that are likely to be dropped anyway. This enables SAF to identify new paths to the content origin or to cached replicas, circumventing link failures, and resource shortages without relying on routing updates. [ABSTRACT FROM AUTHOR]

The shortest path problem is one of the fundamental network flow problems. A large number of problems from diverse areas such as routing in telecommunication networks are an intrinsic part of this problem. The report examines different algorithms to solve this major problem for logistics. [ABSTRACT FROM AUTHOR]

In dynamic flex-grid optical transport networks, Lightpath Admission Control (LAC) is the task of finding a Routing and Spectrum Assignment (RSA) solution for a current lightpath request; otherwise, the request is blocked if there are not enough free available resources. When rerouting is supported, one or more currently established lightpaths can be rerouted and/or assigned with a different spectrum in order to accommodate the current lightpath request. We propose LAC methods based on mixed integer linear programming that provide a RSA solution for the current request aiming to maximize the acceptance probability of future lightpath requests. When rerouting is supported, we consider that only one currently established lightpath can be rerouted. We compare the proposed methods with the traditional shortest path-based approach through simulation. Without lightpath rerouting, the blocking probability is significantly improved. With lightpath rerouting, the number of rerouting operations is significantly decreased while the blocking probability is marginally improved. Moreover, the blocking fairness between lightpaths with different spectrum widths is improved both with and without lightpath rerouting. In all cases, the CPU times of the mixed integer linear programming approaches are a few seconds, on average. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(1), 151-163 2017 [ABSTRACT FROM AUTHOR]

This article is devoted to nonlinear single-path routing problems, which are known to be NP-hard even in the simplest cases. For solving these problems, we propose an algorithm inspired from Game Theory in which individual flows are allowed to independently select their path to minimize their own cost function. We design the cost function of the flows so that the resulting Nash equilibrium of the game provides an efficient approximation of the optimal solution. We establish the convergence of the algorithm and show that every optimal solution is a Nash equilibrium of the game. We also prove that if the objective function is a polynomial of degree [ABSTRACT FROM AUTHOR]

During the planning of communication networks, the routing decision process (distributed and online) often remains decoupled from the network design process, that is, resource installation and allocation-planning process (centralized and offline). To reconcile both processes and take into account demand variability, we generalize the capacitated multicommodity fixed charge network design class of problems by including different types of fixed costs (installation and maintenance costs) and variable costs (routing costs) but also variable traffic demands over multiple periods. However, conventional integer programming methods can typically solve only small to medium size instances of this problem. Two major difficulties are encountered when using commercial solvers to solve the associated mixed integer programs: (i) problems are large scale and even solving the linear relaxation of the problem can be challenging; and (ii) the solver hardly find good feasible solutions for medium to large scale instances. As an alternative, we propose a Lagrangian approach for computing a lower bound by relaxing the flow conservation constraints such that the Lagrangian subproblem itself decomposes by node. Though this approach yields one subproblem per network node, solving the Lagrangian dual by means of the bundle method remains a complex computational tasks. However, it always provides a lower bound on the optimal solution. Moreover, based on this relaxation, we propose a Lagrangian heuristic that makes the approach more robust than a black-box usage of a Mixed Integer Programming (MIP) solver. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 69(1), 110-123 2017 [ABSTRACT FROM AUTHOR]

Wireless sensor networks consist of hundreds and thousands of nodes which are deployed to sense parameters related to the surroundings such as temperature, moisture level, pressure etc. Network topology and energy consumption are important issue in WSN for improving network performance in critical applications. The cluster-based routing is the best way to decrease energy consumption by reducing the number of hops to transmit messages to the sink node. The cluster heads are responsible for gathering data from cluster members and forwarding them to the base station. Hence the cluster heads are expected to be more energy efficient compared to other sensor nodes. LEACH is the popular cluster-based routing protocol in which cluster heads are selected on a rotation basis. It is based on the assumption that sensor nodes can directly communicate with the sink node. We propose a CCE Virtual Backbone cluster-based routing protocol to overcome this assumption by selecting cluster heads using generated Virtual back bone path with multi-hop routing protocol. Virtual back bone path calculation is based on the parameters like message success rate, communication cost, and maximum connectivity. It is proved that our protocol highly reliable energy efficient and increase the life time of the network. [ABSTRACT FROM AUTHOR]

A data-centric routing protocol considering a data aggregation technique at relay nodes is required to increase the lifetime of wireless sensor networks. An energy-efficient data-centric routing algorithm is proposed by considering a tradeoff between acquisition time and energy consumption in the wireless sensor network. First, the proposed routing scheme decides the sink node among all sensor nodes in order to minimize the maximum distance between them. Then, the proposed routing extends its tree structure in a way to minimize the link cost between the connected nodes for reducing energy consumption while minimizing the maximum distance between sensor nodes and a sink node for rapid information gathering. Simulation results show that the proposed data-centric routing algorithm has short information acquisition time and low energy consumption; thus, it achieves high energy efficiency in the wireless sensor network compared to conventional routing algorithms. [ABSTRACT FROM AUTHOR]

Network-on-Chip (NoC) research and development have increased noticeably over the past few years. As the NoC size increases, it was an urge to group processing elements (PEs) into clusters, based on common characteristics between these elements or the spatial locality in the floorplan. NoC clustering achieved better performance, scalability, and load balancing. On another hand, many NoC simulators, like NoCTweak, were developed to provide quick and easy tool for early evaluation of NoC-based designs. In this paper, we extend NoCTweak in order to allow it to simulate NoC clustering. The presented NoC clustering simulator supports the modular design technique, which in turn offers the flexibility in configuring cluster parameters. Examples of configurable parameters that are supported by our simulator are adding a cluster manager, adding latency factors of cluster links, and adapting the routing algorithm for both inter-cluster and intra-cluster traffic. [ABSTRACT FROM AUTHOR]

In this paper, we analyze the performance of two contact graph routing (CGR) enhancements, namely, CGR with earliest transmission opportunity (CGR-ETO) and overbooking management. CGR-ETO aims to improve the accuracy of predicted bundle delivery time by exploiting existing information on queueing delay, in routing decisions. Overbooking management aims to proactively handle contact oversubscription, which occurs when high-priority bundles are forwarded to a contact that is already fully subscribed by lower-priority bundles. These two enhancements have been recently included in the official CGR version as part of the Interplanetary Overlay Network delay-tolerant/disruption-tolerant networking implementation maintained by the National Aeronautics and Space Administration. In parallel to the comparative evaluation of the enhancements against the original CGR, we introduce an experimental version of CGR-ETO that exploits information on locally routed data to calculate queueing delays in all hops through the path to destination, rather than in the first hop only. We evaluate the aforementioned enhancements in a set of emulation experiments conducted on a GNU/Linux testbed and compare official and experimental versions of CGR. Results show that the two enhancements are complementary and can significantly improve routing decisions compared with older versions of CGR, particularly in the presence of parallel routes and traffic of different priorities. These advantages are further extended when the experimental version of ETO is considered. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Geographic routing protocol (GRP) allows sensor node to select path solely depending on the position information of its neighbor nodes. However, the irregular distribution of sensor node in wireless sensor networks (WSN) gives rise to the problem that GRP using the greedy algorithm may suffer the problem of local extrema. Due to the routing voids, it tends to result in the failure of data transmission. To overcome this drawback and improve the control packet overhead and transmission delay of routing void, based on virtual coordinate mapping, this paper proposes an efficient void-bypassing routing protocol (EVRP). Through mapping the coordinates on a virtual circle for edge nodes, EVRP transforms the void edge's random structure into a regular one. After clustering and redundant scheduling, each node has an energy threshold. If a node's energy is lower than its threshold, it sends a failure message to its cluster head which then uses the intersection angle with the failure node and considers all its neighbors as preparatory boundary nodes. Each preparatory boundary node is also judged. Thus a virtual rectangle is constructed. Its ability of covering the void which engenders dynamic intermediate destination nodes can enhance the efficiency and success of bypassing routing void. Compared with RGP and GPSR, simulation and analysis results demonstrate that EVRP is superior in finding the shortest routing path with higher delivery ratio, less control packet overhead and energy consumption. [ABSTRACT FROM AUTHOR]

In order to guarantee the QoS of multimedia applications in a mobile ad hoc network (MANET), a reliable packet transmitting mechanism used in MANETs is developed. In this paper, we synthesize the geographical information, bit error rates of the links and 2-hop routing information to elaborate a most durable routing path between the source node and the destination node. In route discovery phase, all the possible paths from the source node to the destination node are checked on the basis of path reliability and number of hops. Meanwhile, 2-hop routing tables are created. Aided by the geographical information, our mechanism can reduce broadcast packets significantly in RREQ phase compared with other flooding-based protocols. The 2-hop routing information is employed just like backup node information used in other stable routing protocols. Once the path breaks, it can be repaired locally and rapidly by setting up a short path to a 2-hop neighboring node. Compared with other four stable mechanisms with excellent performance, our mechanism (B2RP) exhibits a slightly better in terms of packet delivery ratio, average route lifetime and end-to-end delay. [ABSTRACT FROM AUTHOR]

Delay-tolerant networks (DTNs) are an emergent communication paradigm characterized by intermittent connectivity. The nodes in DTNs can take advantage of their contact opportunities to forward messages. However, in noncooperative DTNs, the nodes may be selfish and reluctant to cooperate with each other in message forwarding. In such DTNs, stimulating cooperation among the nodes will be indispensable. Recently, many incentive mechanisms have been proposed to motivate nodes to cooperate in message forwarding. However, most of them cannot guarantee systematic security. To resolve the drawback of the previous incentive mechanisms, we first propose a credit-based rewarding scheme called the earliest path singular rewarding (EPSR) scheme to motivate the nodes to truthfully forward the messages during every contact opportunity. Then, we propose another credit-based rewarding scheme called the earliest path cumulative rewarding (EPCR) scheme by further considering that a node may get more contact information on others. We prove that both the EPSR and EPCR schemes are incentive compatible, and the payment for each delivered message is upper bounded. Furthermore, the proposed schemes can prevent selfish nodes having malicious behaviors. We have conducted real-trace-based simulations to illustrate the effectiveness of the proposed EPSR and EPCR schemes. [ABSTRACT FROM AUTHOR]

IPv6 protocol, which should replace the actual IPv4 protocol, brings many new possibilities and improvements considering simplicity, routing speed, quality of service, and security. In comparison to IPv4, IPv6 improves mechanisms for assuring a secure and confidential transfer of information. DNS has been extended to provide security services (Domain Name System Security Extensions (DNSSEC)) mainly through public key cryptography. We propose a new approach to DNSSEC that may result in a significantly more efficient protocol. We introduce a new strategy to build chains of trust from root servers to authoritative servers. The techniques we employ are based on symmetric-key cryptography. With the depletion of IPv4 address and rampant information security threat, IPv6 and DNSSEC are widely deployed in recent years, but there is no platform that can integrate all relevant detection information and technical information and provide advice for officers concerned in Taiwan. This paper implements an Auxiliary Deployment System for IPv6 and DNSSEC and presents the results of preliminary testing and statistics which can help technology and promoting staff to do evaluation, promotion, and debugging on IPv6 and DNSSEC deployment easily. [ABSTRACT FROM AUTHOR]