ADAPTIVE ROUTING FOR HYPERCUBE MULTIPROCESSORS: A PERFORMANCE STUDY
5
Citation
0
Reference
10
Related Paper
Abstract:
Through simulation, we studied the performance of three adaptive “wormhole” routing strategies, and compared them with static routing. Since adaptive routing is susceptible to deadlock, an abort-and-retry strategy was used to prevent it from arising. The impact of packetization of long messages and buffering at message destinations were also studied. Results are presented and analyzed for a variety of hardware configurations and traffic conditions. The combination of adaptive routing, abort-and-retry, and buffering at the destination is shown to achieve excellent performance for modest cost.Keywords:
Abort
Adaptive routing
Policy-based routing
Multipath routing
Geographic routing
Equal-cost multi-path routing
Bitmap
Cite
Citations (0)
In providing new telecommunication services, the requisition for quality of network is more and more popular and sophisticated with high bandwidth, small value of delay time or packet loss etc. To assure the quality of network, the localized routing schemes have recently been researched as a promising alternative to the currently deployed global QoS routing schemes. Different from the traditional QoS routing algorithms which use global state information, the localized routing algorithms use local information collected from source node to make routing decisions. These localized routing algorithms can be solutions to meet the demand of telecom market in the near future. In this paper, we study and propose one model of localized QoS routing algorithm, which uses distributed routing type to route flows. We perform it with experiments, compare and realize the more considerable performance of this algorithm than other algorithms, which use the same conditions of simulation. From that, we imply that localized QoS routing algorithm using distributed routing works more effectively than other types of routing algorithm.
Policy-based routing
Multipath routing
Equal-cost multi-path routing
Cite
Citations (0)
Routing protocols in wireless sensor networks tend to be designed for a particular task type and network status. The dynamic routing system can adaptively choose the optimal performance of routing protocols at run time. Based on policy engine, a dynamic routing system is designed for wireless sensor networks. This work uses a modular design approach which makes each sensor node to carry multiple routing protocols. Resources, such as neighbor table and output buffer, are shared between routing protocols. A routing protocol switching mechanism is implemented based on the policy engine. Experimental results show that, in multitasking network environments, dynamic routing can meet the quality of service while effectively reducing energy consumption.
Zone Routing Protocol
Policy-based routing
Multipath routing
Geographic routing
Cite
Citations (0)
Policy-based routing
Equal-cost multi-path routing
Multipath routing
Zone Routing Protocol
Cite
Citations (12)
Policy-based routing
Multipath routing
Geographic routing
Zone Routing Protocol
Cite
Citations (94)
Within multimedia environment,there are two problems on Quality-of-Service(QoS) of routing in mobile ad hoc networks.One is routing maintaining issue,and the other is that congestion will take place in QoS routing as traffic changing with applications arising.This paper proposes a multi-path adaptive dynamic resource reservation routing protocol(MDRSVP) for the two problems.It employs a multi-path routing topology with serial and parallel routing structure to solve failure routing and dynamic traffic.Firstly,MDRSVP can start a new serial routing to continue transmitting data as original primary routing fails.This approach does not interrupt a routing from source node to destination node during transmission.Secondly,MDRSVP reduces QoS bandwidth for each parallel routing,but the total of bandwidth in all parallel routings is QoS bandwidth required by application,so as to decrease the congestion in a single QoS routing and increase probability of other paths utilized.In addition,MDRSVP allocates flow to a few applications through calculating the bottle-neck bandwidth of upstream and downstream which adapts dynamic traffic in QoS routing as the bandwidth of MDRSVP routing.Simulation shows that MDRSVP can increase tolerance of QoS routing,decrease congestion of routing,and increase scalability of QoS network.
Equal-cost multi-path routing
Policy-based routing
Zone Routing Protocol
Multipath routing
Cite
Citations (0)
To effectively support communication in such a dynamic networking environment as the ad hoc networks, the routing framework has to be adaptable to the spatial and temporal changes in the characteristics of the network, such as traffic and mobility patterns. Multiscoping, as is provided through the concept of the Zone Routing Protocol (ZRP) for example, can serve as a basis for such an adaptive behavior. The Zone Routing framework implements hybrid routing by every network node proactively maintaining routing information about its local neighborhood called the routing zone, while reactively acquiring routes to destinations beyond the routing zone. In this paper, we propose the Independent Zone Routing (IZR) framework, an enhancement of the Zone Routing framework, which allows adaptive and distributed configuration for the optimal size of each node's routing zone, on the per-node basis. We demonstrate that the performance of IZR is significantly improved by its ability to automatically and dynamically tune the network routing operation, so as to flexibly and robustly support changes in the network characteristics and operational conditions. As a point of reference, through this form of adaptation, we show that the volume of routing control traffic overhead in the network can be reduced by an order of magnitude, under some set of parameter values. Furthermore, the adaptive nature of IZR enhances the scalability of these networks as well.
Policy-based routing
Multipath routing
Geographic routing
Hybrid routing
Zone Routing Protocol
Cite
Citations (217)
Hole problem is a hot issue of Geographic Routing in Wireless Sensor Networks, which is caused by an area without active sensors that blocks the greedy forwarding process, thus long detour path is produced. One of the common solutions is to find a landmark and generate a routing path from the source sensor to the landmark node first, then the landmark resumes routing until to the destination to avoid long detour path. However, this approach results in a constant path prior to routing process, then the forwarding nodes in the path afford routing while other nodes are idle even if they are very close to the pre-setup routing path, thus the busy nodes run out of their energy soon and the hole is larger. In this paper, we present a novel approach, in which circles are created to guide routing thus the idle nodes near the routing path participate in the forwarding. As such, our new mechanism benefits both geographic routing and energy efficiency routing. Simulation results demonstrate that our approach significantly prolongs the lifetime of sensors over peer approaches while almost keeps the same short path as landmark based routing algorithms.
Equal-cost multi-path routing
Multipath routing
Policy-based routing
Geographic routing
Cite
Citations (3)
In wireless sensor networks, multi-path routing is proposed for energy balancing which prolongs the network lifetime as compared to single-path routing where utilization of a single route between a source node and the base station results in imbalanced energy dissipation. While it is evident that increasing the number of routing paths mitigates the problem of energy over-utilization in a subset of nodes acting as relays, the net effect of the proliferation of multiple routing paths on energy balancing remains unclear. It is imperative to keep the number of routing paths as low as possible without significantly deteriorating the network lifetime; therefore, determination of the optimal number of routing paths in multi-path routing by considering the tradeoff in routing complexity and network lifetime extension is an interesting research problem. In this study, to investigate the impact of the number of routing paths in multi-path routing on network-wide energy balancing under optimal operating conditions, we build a novel mixed integer programming framework. We explore the parameter space consisting of a number of paths, number of nodes, maximum transmission range, network area, and network topology. The results of the analysis show that by utilizing the optimization scheme proposed, it is possible to achieve near-optimal energy consumption (within 1.0% neighborhood of the case where no restrictions are imposed on the number of routing paths in multi-path routing) using at most two paths for each node.
Equal-cost multi-path routing
Multipath routing
Policy-based routing
Hierarchical routing
Path vector protocol
Geographic routing
Cite
Citations (9)