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.

title: Efficient scheduling of transmissions in optical broadcast networks
abstract: 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.

title: Efficient route establishment and maintenance in wireless sensor networks with mobile base stations
abstract: The integration of ground wireless adhoc networks and airborne UAVs is a promising solution for realtime data collection in wireless sensor networks. Such networks play a vital role in many mission critical tasks such as forest fire-fighting and battlefield support. An important problem is to establish/maintain efficient routing structures in the ground sensor network for packet relaying. Our problem is unique in that the base stations are non-static, which necessitates frequent update of the routing structure. The performance of flooding based methods are evaluated. Particularly, in order to deal with non-uniform node density, we propose to introduce an artificial delay factor to control the flooding pattern. We mathematically prove that the delay should be proportional to local node density. Our simulation results show that the proposed method achieves good load balance among multiple base stations.

title: Packet filtering for congestion control under DoS attacks
abstract: 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.

title: Preserving survivability during logical topology reconfiguration in WDM ring networks
abstract: We consider the design of reconfiguring logical topologies over physical WDM ring networks. The logical topology consists of the same set of nodes as the physical topology, and the links of the logical topology are lightpaths established (or embedded) over the physical topology. The logical topology is said survivable if the failure of any single physical link does not disconnect the logical topology. In this paper, we consider the following problem: Given a logical topology with its survivable embedding over a physical ring network and a new logical topology to be reconfigured, find a sequence of lightpaths additions and deletions satisfying the given wavelengths and ports constraints such that the logical topology remains survivable throughout the reconfiguration.

title: Efficient alarm management in optical networks
abstract: As the capacity of optical transport networks increases, rapid fault identification and localization become increasingly important. These problems are more challenging than in traditional electronic networks because of optical transparency. In a transparent optical network which does not regenerate optical signals, a fault may propagate to various parts of the network from the origin, and multiple alarms can be generated for a single failure. Efficient alarm management and filtering requires a careful selection and placement of network monitoring equipment. In this paper we survey the capabilities of current optical monitoring equipment and formulate a problem of selecting monitors to be placed throughout the network. Simulation results suggest that the number of monitors and generated alarms can be significantly reduced if monitor locations are selected judiciously.

title: Link-disjoint embedding of complete binary trees in meshes

title: Construction and shape analysis of PH quintic Hermite interpolants
abstract: In general, the problem of interpolating given first-order Hermite data (end points and derivatives) by quintic Pythagorean-hodograph (PH) curves has four distinct formal solutions. Ordinarily, only one of these interpolants is of acceptable shape. Previous interpolation algorithms have relied on explicitly constructing all four solutions, and invoking a suitable measure of shape—e.g., the absolute rotation index or elastic bending energy—to select the “good” interpolant. We introduce here a new means to differentiate among the solutions, namely, the winding number of the closed loop formed by a union of the hodographs of the PH quintic and of the unique “ordinary” cubic interpolant. We also show that, for “reasonable” Hermite data, the good PH quintic can be directly constructed with certainty, obviating the need to compute and compare all four solutions. Finally, we present an algorithm based on the subdivision, degree elevation, and convex hull properties of the Bernstein form, that gives rapidly convergent curvature bounds for PH curves, using only rational arithmetic operations on their coefficients.

title: Designing On-Chip Network Based on Optimal Latency Criteria
abstract: 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.

title: Analyzing the Performance of Mesh and Fat-Tree Topologies for Network on Chip Design
abstract: The demand of integration of many heterogeneous semiconductor intellectual property (IP) blocks has been introducing a new chip design paradigm so called on chip network. This paradigm promisingly offers a packet switched network among IPs to reduce the main problems in the very deep sub micron technologies that arise from non-scalable global wire delay, failure to achieve global synchronization, errors due to the signal integrity, non-scalable bus based functional interconnection, etc. This paper introduces interconnected or switched network topologies and also analyze their performances in terms of communication protocol related to the issues such as routing strategy, buffer size, routing algorithm , etc. The above mentioned evaluations are done by utilizing the tool that has been widely used in the research domain of computer network design, so called NS-2.

title: Secure reporting of traffic forwarding activity in mobile ad hoc networks
abstract: 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.