Grid networks provide users with a transparent way to access computational and storage resources. The introduction of (dense) wavelength division multiplexing techniques have made optical networks the technology of ch...
详细信息
Grid networks provide users with a transparent way to access computational and storage resources. The introduction of (dense) wavelength division multiplexing techniques have made optical networks the technology of choice for data-intensive grid traffic. In a grid network scenario, users are generally more interested in the successful completion of their jobs than in the location where the actual processing occurs. Job routing and scheduling in current generation grid networks are managed by resource brokers, which assign each job to a resource and route the job in a unicast way. An anycast approach using grid-aware network algorithms would bypass the need for a resource broker and increase scalability. We propose several anycast algorithms for job routing in optical grid networks, based on the concept of ant colony optimization, which draws parallels between the behavior of ants gathering food and the routing of packets inside a network. Simulation results show an increased performance of our algorithms over more classical unicast-based protocols, even though this is accompanied by a slight increase in complexity. (c) 2008 Optical Society of America.
The exact contribution of this paper is a review of existing state-of-the-art routing strategies for optical burst switched networks developed by researchers to deal with burst contention before it happens. routing sc...
详细信息
The exact contribution of this paper is a review of existing state-of-the-art routing strategies for optical burst switched networks developed by researchers to deal with burst contention before it happens. routing schemes are implemented in space domain, which make them simple and cost effective. Additionally, the paper points out the importance of routing as an effective way to deal with burst contention compared to other solutions. It also underlines the main differences between contention avoidance schemes and contention resolution techniques for optical burst switched networks. We believe that this review will help different optical burst switched researchers involved in the development of route optimization algorithms to control burst contention. Copyright (c) 2011 John Wiley & Sons, Ltd.
In wireless multi-hop networks, especially large scale wireless multi-hop networks, the feasibility of routing strategies is of vital significance. However, the basic function of routing strategies, the ability of fin...
详细信息
In wireless multi-hop networks, especially large scale wireless multi-hop networks, the feasibility of routing strategies is of vital significance. However, the basic function of routing strategies, the ability of finding a path from source to destination, is seldom researched. In this paper, we apply a Markov chain to model the routing discovery process of wireless multi-hop networks with arbitrary routing strategies. Taking the fading characteristics of wireless channel into consideration, we analyze the impacts of weak links on routing algorithms in wireless multi-hop networks. The probability of routing success and the distribution of hop count are discussed in detail and their close-form solutions are given. Simulation and theoretical results show that, with the increase of the network scale, the impact of weak links gets stronger and even makes the routing strategies unusable. Our research has pointed out the relations between the performance of routing strategies and the network scale under the impact of weak links. The results have important significance for routing strategy designing and network planning.
routing is a key design parameter in the interconnection network of large parallel computers. routing algorithms are classified into two different categories depending on the number of routing options available for ea...
详细信息
routing is a key design parameter in the interconnection network of large parallel computers. routing algorithms are classified into two different categories depending on the number of routing options available for each source-destination pair: deterministic (there is one path available) and adaptive (there'are several ones). Adaptive routing has two opposed effects on network performance. On one hand, it provides routing flexibility that may help on avoiding a congested network area, thus improving network performance. On the other hand, it also may increase the Head-of-Line blocking effect due to more destination nodes sharing the port queues. Usually, adaptive routing uses virtual channels to provide routing flexibility and to guarantee deadlock freedom. Deterministic routing is simpler, which implies lower routing delay and it introduces less Head-of-Line blocking effect. In this paper, we propose an adaptive and HoL-blocking reduction routing algorithm for direct topologies that tries to combine the good properties of both worlds: It provides routing flexibility but also reduces the Head-of-Line blocking effect. To do that, this paper proposes several functions which use the XOR operation to efficiently distribute the packets among virtual channels based on their destination node. The resulting routing mechanisms have different properties depending on whether they enforce routing flexibility or Head-of-Line blocking reduction. (C) 2017 Elsevier B.V. All rights reserved.
This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW). Small and large vehicles deliver services to customers within time constraints;small vehicles en route m...
详细信息
This paper addresses the linehaul-feeder vehicle routing problem with virtual depots and time windows (LFVRPTW). Small and large vehicles deliver services to customers within time constraints;small vehicles en route may reload commodities from either the physical depot or from the larger vehicle at a virtual depot before continuing onward. A two-stage solution heuristic involving Tabu search is proposed to solve this problem. The test results show that the LFVRPTW performs better than the vehicle routing problem with time windows in terms of both objective value and the number of small vehicles dispatched.
Wireless Sensor Networks (WSNs) are often used to monitor the physical world. By using sensor nodes, various types of environmental conditions can be sensed and also it can communicate with the sensed data via wireles...
详细信息
Wireless Sensor Networks (WSNs) are often used to monitor the physical world. By using sensor nodes, various types of environmental conditions can be sensed and also it can communicate with the sensed data via wireless communication. The sensor nodes are provided with a battery, and the reduction of the power consumption may lead to the prolonged anticipation of a lifetime of sensor nodes. Researchers worked on sensor nodes to gain energy efficiency and increase its lifetime. Reliable and effective communication among nodes routing algorithms is often used for WSNs. The important objective of routing algorithms is energy saving. Clustering algorithm improves energy efficiency in Homogeneous WSNs. The clustering technique identifies the shortest path, and it is used for cluster head selection. To dissipate energy efficiently, Optimized Radio Energy Algorithm (OREA) is used. Power-Aware Distance Source routing (PADSR) clustering algorithm has been proposed for increasing Network lifetime of WSNs. Energy consumption and data quality are balanced by Quality of Service based routing protocols. Power Aware Distance Source routing (PADSR) decides performance evaluation of Quality of Service. (C) 2017 Elsevier B.V. All rights reserved.
Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony opt...
详细信息
Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.
Analytical models of fully adaptive routing for common wormhole-routed networks (e.g., hypercubes) under the uniform traffic pattern have recently been reported in the literature. However, many studies have revealed t...
详细信息
Analytical models of fully adaptive routing for common wormhole-routed networks (e.g., hypercubes) under the uniform traffic pattern have recently been reported in the literature. However, many studies have revealed that the performance advantages of adaptive routing over deterministic routing is more noticeable when the traffic is nonuniform due to, for example, the existence of hot spots in the network. This paper proposes a new queueing model of fully adaptive routing in the hypercube in the presence of hot spot traffic. The analysis focuses on Duato's algorithm [11], but can easily be applied to other fully adaptive routing algorithms. Results from simulation experiments are presented to validate the model.
Star graphs possess many desirable properties such as scalable node degrees and diameters, which are essential to facilitate reduced routing table sizes and low maximum path length for routing in large P2P networks. I...
详细信息
Star graphs possess many desirable properties such as scalable node degrees and diameters, which are essential to facilitate reduced routing table sizes and low maximum path length for routing in large P2P networks. In addition, because a large number of disjoint paths are available and each data/replica in an n-star can be placed in an (n - 1)-star, load balancing and alleviation of network bottlenecks can be implemented in star P2P overlay networks. Therefore, star networks have been proposed as viable alternatives to existing overlay topologies for large P2P networks. In this paper, we propose an optimal stabilizing and inherently stabilizing algorithm for routing messages over all disjoint paths between two peers in a star P2P overlay network. The algorithm is optimal in terms of its time complexity in rounds and the length of the longest path traversed by the messages, and fault tolerant due to being stabilizing and inherently stabilizing, allowing the system to withstand transient faults. The algorithm can be used to increase network reliability and survivability in P2P networks. In addition, the usage of all disjoint paths to route messages between two peers leads to increased network bandwidth while distributing the communication overhead across the network and eliminating network bottlenecks in P2P networks. Copyright (c) 2016 John Wiley & Sons, Ltd.
Context information can be used to streamline routing decisions in opportunistic networks. We propose a novel social context-based routing scheme that considers both the spatial and the temporal dimensions of the acti...
详细信息
Context information can be used to streamline routing decisions in opportunistic networks. We propose a novel social context-based routing scheme that considers both the spatial and the temporal dimensions of the activity of mobile nodes to predict the mobility patterns of nodes based on the BackPropagation Neural Networks model. (C) 2011 Elsevier B.V. All rights reserved.
暂无评论