35661638
Double-Link Failure Recovery in WDM Optical Torus Networks
Most existing link protection methods have been focused on single-link failures. Recently, the double-link failure model has also been considered. In this model, any two links may fail in an arbitrary order. However, an existing model for protecting the entire network against double-link failures does not always provide a 100% recovery when the link identification is not required for pre-computing backup paths. In this paper, we consider double-link failure models that provide 100% recovery in WDM torus optical networks. Three link protection methods are presented. The first method requires failed link identification, whereas the last two methods do not. Other performance measures such as hop-length and backup capacity are also discussed. Finally, we briefly address how our method is possibly extended to mesh optical networks.
40767747
Hardness on IP-subnet Aware Routing in WDM Network
In this paper, we study the hardness of the IP-subnet aware routing problem in WDM network. IP-subnet aware routing attempts to reduce routing overhead by grouping a set of addresses under a single subnet. However, routing in WDM network with subnets imposes neighboring IP interfaces along the path to be on the same subnet. This subnet constraint forces the routing path to be longer unless routing permits reconfiguration of subnets. The hardness of this routing problem is first studied in [1]. We investigate further the problem of finding paths accounting for subnets and its hardness. Regardless of subnets, we argue that a shortest IP hop path can be constructed in a polynomial time. We provide efficient routing algorithms to justify our argument.
24043784
Efficient scheduling of transmissions in optical broadcast networks
All-optical networks (AONs) with a broadcast-star based physical topology offer the possibility of transmission scheduling to resolve channel and receiver conflicts. This paper considers the problem of scheduling packet transmissions in a wavelength-division multiplexed (WDM) optical network with tunable transmitters and fixed-tuned receivers. The scheduling problem is complicated by tuning latency, a limited number of channels, and arbitrary traffic demands. We first analyze scheduling all-to-all packet transmissions and obtain a new lower bound for the schedule length. The lower bound is achieved by an algorithm proposed by Pieris and Sasaki (1994). We then extend the analysis to the case of arbitrary traffic demands and obtain lower bounds for the schedule length. Two constructions for scheduling algorithms are provided through list scheduling and multigraphs. The upper bounds so obtained not only provide performance guarantees with arbitrary demands, but also nearly meet the lower bound in simulations.
800618
Packet filtering for congestion control under DoS attacks
Congestion control in IP networks is typically done at each router through queue management, and the network is entirely dependent on the end hosts to react congestion. However, when misbehaving flows exist and continue to send their packets in very high rates, the queue management schemes implemented in current IP routers reveal a significant shortcoming in protecting legitimate flows. Here, we propose a novel scheme for congestion control in IP networks. Our approach is a time-window based filtering mechanism implemented in a router and processed before a queue management policy is applied. Setting the window size properly and dropping packets reaching in the next window can catch the nonresponsive nature of misbehaving flows. The performance of our proposed scheme is demonstrated through extensive simulations using the NS2, simulator using a set of simulated traffic generated based on IP traces reported in http://www.nlnar.org.
7484493
Dual power management for network connectivity in wireless sensor networks
Summary form only given. As the energy consumption in wireless sensor nodes is dominated by the radio transmission circuitry, the network configuration must be designed to minimize the power consumption by transmission radios. Sensor nodes are generally equipped with short-range radios that require low power consumption. But the current technology allows each node to adjust its transmission power. We consider the dual power radios in which the radio of each node can be assigned high-or low-power during the network initializing stage. Our primary goal in such an assignment is to minimize the overall power consumption by radios to maximize the network lifetime while maintaining the full network connectivity, the most fundamental network functionality. Using a graph-theoretic approach, we formulate the problem as a "minimum subgraph" problem, show its NP-completeness, establish upper and lower bounds on the optimum solution, and present a near-optimal heuristic algorithm and simulation results.
9824119
Loopback recovery from neighboring double-link failures in WDM mesh networks
Traditional survivable network design assumes that at any time at most a single link or node fails. In optical networks, a single point of failure may lead to the failure of multiple links. In this paper, we consider the design of an optical network that can survive the failures of any two neighboring links. We present a loopback recovery method that requires the computation of backup paths for each link. An optimal algorithm for computing the backup paths is presented. Numerical results comparing the performance of our algorithm with other loopback approaches indicate that a slight increase in capacity can achieve 100% protection under this failure model.
195605809
Designing On-Chip Network Based on Optimal Latency Criteria
A new chip design paradigm, so called Network on Chip, has been introduced based on the demand of integration of many heterogeneous semiconductor intellectual property (IP) blocks. The Network on Chip design not only requires the good performance but also the minimization of several physical constraints such as the network latency, the used area as well as the power consumption of design. This paper analyzes the average latency of heterogeneous Network on Chip architectures in which the shortest path routing algorithm is applied. This average latency includes the queuing latency and the wire latency, and is calculated for general cases of allocating IPs onto the fixed generic switching architectures such as 2-D Mesh and Fat-Tree. With different allocation schemes of IPs, the network has different average latencies. Hence, this article presents an optimal search that adopts the Branch and Bound algorithm to find out the optimal mapping scheme to achieve the minimal network latency. This algorithm automatically map the desired IPs onto the target Network on Chip architecture with the criteria of lowest network latency. Some experiments of On Chip Multiprocessor Network application are simulated. The results show that the network latency is significantly saved with the optimized allocation scheme for the several cases of generic architectures of On Chip Multiprocessor Network application.
30297846
Throughput Aware Mapping for Network on Chip Design of H.264 Decoder
Network-on-Chip (NoC) has been proposed as a new methodology for addressing the design challenges of future massly integrated system in nanoscale. In this paper, we present the queuing theory based model for router to evaluate the performance of NoC in terms of drop probability, throughput and energy consumption. Then we apply the linear programming to optimize the allocation of the heterogeneously functional blocks (IPs) onto the given heterogeneous NoC architecture so as to obtain the maximum throughput as well as to optimize the energy dissipation of whole system. Finally, the three differently heterogenous Tree-based network topologies are proposed as the NoC architectures for the study case of H.264 Decoder. This paper also evaluates the proposed topologies by comparing them to other conventional topologies such as 2-D Mesh and Fat-Tree with respects to throughput, power consumption and size. We use the power modelling tool, known as Orion model to calculate the static powers, areas, and dynamic powers of three topologies. The experiment results show that our Tree-based topologies offer similar throughputs as Fat-Tree does and much higher throughputs compared to 2-D Mesh while use less chip areas and energy consumptions.
386520
Establishing Pair-Wise Keys in Heterogeneous Sensor Networks
Many applications that make use of sensor networks require secure communication. Because asymmetric-key solutions are difficult to implement in such a resource-constrained environment, symmetric-key methods coupled with a priori key distribution schemes have been proposed to achieve the goals of data secrecy and integrity. These approaches typically assume that all sensors are similar in terms of capabilities, and hence deploy the same number of keys in all sensors in a network to provide the aforementioned protections. In this paper we demonstrate that a probabilistic unbalanced distribution of keys throughout the network that leverages the existence of a small percentage of more capable sensor nodes can not only provide an equal level of security but also reduce the consequences of node compromise. We demonstrate the effectiveness of this approach on small networks using a variety of trust models and then demonstrate the application of this method to very large systems. The approach and analysis presented in this paper can be applied to all protocols that use probabilistic keys including those that employ broadcast mechanisms, hash functions or polynomials for the generation of keys.
1950897
Secure reporting of traffic forwarding activity in mobile ad hoc networks
Nodes forward data on behalf of each other in mobile ad hoc networks. In a civilian application, nodes are assumed to be selfish and rational, i.e., they pursue their own self-interest. Hence, the ability to accurately measure traffic forwarding is critical to ensure proper network operation. These measurements are often used to credit nodes based on their level of participation, or to detect loss. Past solutions employ neighbor monitoring and reporting on node forwarding traffic. These methods are not applicable in civilian networks where neighbor nodes lack the desire or ability to perform the monitoring function. Such environments occur frequently in which neighbor hosts are resource constrained, or in networks where directional antennas are used and reliable monitoring is difficult or impossible. In this paper, we propose a protocol that uses nodes on the data path to securely produce packet forwarding reports. Reporting nodes are chosen randomly and secretly so that malicious nodes cannot modify their behavior based upon the monitoring point. The integrity and authenticity of reports are preserved through the use of secure link layer acknowledgments and monitoring reports. The robustness of the reporting mechanism is strengthened by forwarding the report to multiple destinations (source and destination). We explore the security, cost, and accuracy of our protocol.
12191931
Clifford algebra, Lorentzian geometry, and rational parametrization of canal surfaces
We present a new approach toward the rational parametrization of canal surfaces. According to our previous work, every canal surface with rational (respectively polynomial) spine curve and rational (respectively polynomial) radius function is a rational (respectively polynomial) Pythagorean hodograph curve in R3,1. Drawing upon this formalism and utilizing the underlying Lorentzian geometry, the problem is reduced to simple algebraic manipulations.We also illustrate how our work related to the previous work of pottmann and Peternell. Finally, we give an outline of an approach toward the rotation minimizing parametrization of canal surfaces.