Routing in times square mode

This paper presents a new algorithm for channel routing of multiterminal nets. We first transform any multiterminal problem of density d to a socalled extended simple channel routing problem (ESCRP ) of density 3d/2+O(√dlog d), which will then be solved with channel width w ≤3d/2+O(√dlog d) in the knock-knee model. The same strategy can be used for routing in the other two models: The channel width is w ≤ 3d/2+O(√dlog d)+O(f) in the Manhattan model, where f is the flux of the problem, and w ≤ 3d/2+O(√dlogd) in the unit-vertical-overlap model. In all three cases we improve the best known upper bounds.

We propose a simple multicast traffic split routing for packet switched networks (Internet). We propose a mathematical model that maximizes the reward generated by successfully forwarding packets from source to destinations. Using this model, we show that in order to reduce packet loss, while keeping the delay bounded: 1) trees should be as small as possible (typically spanning trees) and 2) trees should be as disjoint as possible. We also show that these two routing rules are independent of the traffic forecast which makes them of practical interest. We then propose a simple traffic split routing algorithm based on these two rules. Numerical results show that traffic split routing outperforms shortest path routing in terms of packet loss while being comparable in terms of queuing delay.

The worldwide expansion of the network devices led to difficulties with network management and routing mechanisms related to dynamic adapting to the network needs. SDN provides a centralized global network view, maintenance, and management of network devices with vendor-specific configurations. Its main focus is routing the network traffic, load balancing the network, and improving the QoS. This paper proposes a Simple Routing algorithm with Link Discovery between source and destination hosts in SDN networks.

In this paper we consider the routing and wavelength assignment problem in a wavelength routed all optical network. Inspired by techniques from artificial intelligence, in particular the Blocking Island (BI) abstraction, we propose a simple and intelligent routing and wavelength assignment (RWA) algorithm: BI_RWA. This algorithm can be used in arbitrarily connected optical networks. In addition, it is general enough such that with some simple modifications, it can be applied to different optical networking scenarios: static or dynamic traffic, single or multiple fiber links between node pairs, with or without wavelength converters. We have conducted simulation experiments to evaluate the performance of our algorithm. The simulation is carried out in two parts: static traffic and dynamic traffic. The results will demonstrate that our RWA algorithm outperforms state-of-the-art related algorithms.

An effective focusing approach for azimuth invariant bistatic SAR processing

A dynamic logistics coordination model for evacuation and support in disaster response activities

Routing plays a critical role in determining the performance of a multi-hop wireless mesh network. When there are a large number of nodes available the task of communication becomes quite challenging. Our main concern is energy-efficient routing. Energy conservation is a critical issue in wireless networks for node and network lifetime, as the nodes are powered by batteries only. One major approach for energy conservation is to establish a communication session which consumes the lowest total transmission energy. This optimization problem is referred as minimum-energy routing. Our work, we have considered a simple routing algorithm which can be implemented in both centralized and distributed manner. Energy consumed in each of the route is calculated. The route in which energy consumption is the less is chosen for the communication.

Highly parallel systems are receiving significant attention to solve the large and complex problems. This has resulted in the emergence of many attractive interconnection network topologies. This paper introduces a new processor interconnection topology called STH (Scalable Twisted Hypercube) to counter the poor scalability of twisted hypercube. Its suitability for use as multiprocessor interconnection networks has also been explored. The various properties of the proposed topology have been analyzed and it has been compared with some other highly scalable topologies of interest on a number of interconnection networks evaluation parameters. With reduced diameter, better average distance, low traffic density, low cost, maximum number of links, high bisection width and tremendous scalability, STH is more suitable for Massively Parallel Systems. Procedures for routing and broadcasting on the proposed topology have also been discussed and a simple routing algorithm has been presented. The proposed interconnection network provides a great architectural support for parallel computing due to the concurrent existence of multiple LST(m) and TQn.

On a class of recursive network topologies

An effective approach to the enhancement of incomplete hypercube computers

With the current technology, all-optical networks require nonblocking switch architectures for building optical cross-connects. The crossbar switch has been widely used for building an optical cross-connect due to its simple routing algorithm and short path setup time. It is known that the crossbar suffers from huge signal loss and crosstalk. The Clos network uses a crossbar as building block and reduces switch complexity, but it does not significantly reduce signal loss and crosstalk. Although the Spanke's network eliminates the crosstalk problem, it increases the number of switching elements required considerably (to 2N2 - 2N). In this paper, we propose a new architecture for building nonblocking optical switching networks that has much lower signal loss and crosstalk than the crossbar without increasing switch complexity. Using this architecture we can build non-squared nonblocking networks that can be used as building block for the Clos network. The resulting Clos network will then have not only lower signal loss and crosstalk but also a lower switch complexity.

Sorting networks are an important application for parallel processing and also can be used as interconnection networks with fast and simple self routing algorithm. The odd-even transposition sorting networks are an important class of sorting networks because of the ease of hardware implementation. The paper investigates testing and fault tolerant properties of such networks for single stuck at crossing (stuck at X) and stuck at straight (stuck at T) faults in the comparators. We have proved that a single test vector is sufficient to detect all single and multiple stuck at T faults. For stuck at X faults, we have shown that the networks are 1-fault tolerant for large number of comparators. Analysis of several examples support the conjecture that these networks are 1-fault tolerant for all internal comparators.

This paper proposes a set of techniques to restore the regularity of a Boolean n-cube network in the presence of node failures, and algorithms to effectively route messages among the surviving nodes. An analytical model to evaluate the degradation of a damaged network is also presented. One way to restore the regularity of a damaged Boolean n-cube network is by simply disabling the nodes with more than one bad neighbor. The remaining network is called a '1-degraded subnet'. A very simple optimal-path routing algorithm, which requires each node to know only its neighbor's status, is developed for such a subnet. Since many nonfaulty nodes may have to be disabled in constructing a 1-degraded subnet, the authors further develop a heuristic algorithm to restore the network's regularity by constructing a 'subnet connected with optimal paths (SCOP)', where only a few nodes must be disabled. The routing algorithm used in 1-degraded subnets also works for SCOPs. To preserve the processing power of the network, they also propose a two-level hierarchical fault-tolerant routing scheme without disabling any nodes.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Popularity of Mobile Wireless Sensor Network (MWSN) has increased tremendously due to the ability to connect the physical world with the virtual world. In MWSN, Sensor nodes move freely in a target area without the need of any special infrastructure. MWSN has attracted many researchers as it has introduced unique challenges in aspects like resource management, coverage, routing protocols, security in many applications such as target tracking in military applications, detection of catastrophic events, environment monitoring, health applications etc. Due to mobility, routing process in MWSN has become more complicated as connections in the network can change dynamically. This paper proposes a Mobility-Aware Multi-Objective Hybrid Routing Algorithm (MMOHRA) for Wireless Sensor Network (WSN). MMOHRA selects the best route and forwards the data packets from source to sink using multiple metrics such as Average Energy consumption, Control Overhead, Reaction Time, LQI, and HOP Count. Performance of MMOHRA is compared with Simple Hybrid Routing Protocol (SHRP) and Dynamic Multi-objective Routing Algorithm (DyMORA) using metrics such as Average Energy Consumption, Packet Delivery Ratio, and Jitter. MMOHRA improves the Average Energy Consumption (AEC) by a factor of 14.1% as compared with SHRP and 8.13 % as compared to DyMORA. MMOHRA outperformed SHRP and DyMORA in terms of packet Delivery Ratio (PDR) by 10.17 % and 9.83 % respectively.

We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the nodes are embedded in the Euclidean plane. In our algorithm, a packet path is constructed by first choosing a random intermediate node in the space between the source and destination, and then the packet is sent to its destination through the intermediate node. We analyze the performance of the algorithm in terms of the stretch and congestion of the resulting paths. We show that the stretch is constant, and the congestion is near optimal when the network paths can be chosen to be close to the geodesic lines that connect the end points of the paths. We give applications of our general result to the mesh topology and uniformly distributed disc graphs. Previous oblivious routing algorithms with near optimal congestion use many intermediate nodes and do not control the stretch.