共查询到20条相似文献,搜索用时 31 毫秒
1.
Ying‐Dar Lin Te‐Lung Liu Shun‐Hsien Wang Yuan‐Cheng Lai 《International Journal of Communication Systems》2019,32(14)
With the growth of network traffic volume, link congestion cannot be avoided efficiently with conventional routing protocols. By utilizing the single shortest‐path routing algorithm from link state advertisement information, standard routing protocols lack of global awareness and are difficult to be modified in a traditional network environment. Recently, software‐defined network (SDN) provided innovative architecture for researchers to program their own network protocols. With SDN, we can divert heavy traffic to multiple paths in order to resolve link congestion. Furthermore, certain network traffics come in periodic fashion such as peak hours at working days so that we can leverage forecasting for resource management to improve its performance. In this paper, we propose a proactive multipath routing with a predictive mechanism (PMRP) to achieve high‐performance congestion resolution. PMRP has two main concepts: (a) a proactive mechanism where PMRP deploys M/M/1 queue and traffic statistics to simulate weighted delay for possible combinations of multipaths placement of all subnet pairs, and leverage genetic algorithm for accelerating selection of optimized solution, and (b) a predictive mechanism whereby PMRP uses exponential smoothing for demand traffic volumes and variance predictions. Experimental results show a 49% reduction in average delay as compared with single shortest routing, and a 16% reduction in average delay compared with utilization & topology‐aware multipath routing (UTAMP). With the predictive mechanism, PMRP can decrease an additional 20% average delay. Furthermore, PMRP reduces 93% of flow table usage on average as compared with UTAMP. 相似文献
2.
The energy consumption is a key design criterion for the routing protocols in wireless sensor networks (WSN). Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. Thus, multipath routing schemes is an optimal alternative to extend the lifetime of WSN. Multipath routing schemes distribute the traffic across multiple paths instead of routing all the traffic along a single path. In this paper, we propose a multipath Energy-Efficient data Routing Protocol for wireless sensor networks (EERP). The latter keeps a set of good paths and chooses one based on the node state and the cost function of this path. In EERP, each node has a number of neighbours through which it can route packets to the base station. A node bases its routing decision on two metrics: state and cost function. It searches its Neighbours Information Table for all its neighbours concerned with minimum cost function. Simulation results show that our EERP protocol minimizes and balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime. 相似文献
3.
Recently, multipath routing in wireless sensor networks (WSN) has got immense research interest due to its capability of providing increased robustness, reliability, throughput, and security. However, a theoretical analysis on the energy consumption behavior of multipath routing has not yet been studied. In this paper, we present a general framework for analyzing the energy consumption overhead (i.e., energy tax) resulting from multipath routing protocol in WSN. The framework includes a baseline routing model, a network model, and two energy consumption schemes for sensor nodes, namely, periodic listening and selective wake-up schemes. It exploits the influence of node density, link failure rates, number of multiple paths, and transmission environment on the energy consumption. Scaling laws of energy-tax due to routing and data traffic are derived through analysis, which provide energy profiles of single-path and multipath routing and serve as a guideline for designing energy-efficient protocols for WSN. The crossover points of relative energy taxes, paid by single-path and multipath routing, reception, and transmission, are obtained. Finally, the scaling laws are validated and performance comparisons are depicted for a reference network via numerical results. 相似文献
4.
互联网对时延敏感的业务数据流,要求具有较低的端到端时延,但是网络拥塞的发生,将会使服务质量无法保证。基于链路关键度提出了一种新的自适应负载均衡路由算法(LARA,load adaptive routing algorithm),能最大限度地避开拥塞链路从而减少端到端延迟。该算法通过得到一个优化目标函数,并利用凸优化理论将优化目标函数分解为若干个子函数,最终得到一个简单的分布式协议。利用NS2仿真器在基于CERNET2真实的拓扑结构上进行仿真实验,同时与网络中能普遍部署的等开销多路径(ECMP,equal-costmulti-path)算法相比较,通过测试反馈时延、分组丢失率、流量负载,结果表明LARA具有更好的自适应性和健壮性,性能相比更优。 相似文献
5.
Among the many multipath routing protocols, the AOMDV is widely used in highly dynamic ad hoc networks because of its generic feature. Since the communicating nodes in AOMDV are prone to link failures and route breaks due to the selection of multiple routes between any source and destination pair based on minimal hop count which does not ensure end-to-end reliable data transmission. To overcome such problems, we propose a novel node disjoint multipath routing protocol called End-to-End Link Reliable Energy Efficient Multipath Routing (E2E-LREEMR) protocol by extending AOMDV. The E2E-LREEMR finds multiple link reliable energy efficient paths between any source and destination pair for data transmission using two metrics such as Path-Link Quality Estimator and Path-Node Energy Estimator. We evaluate the performance of E2E-LREEMR protocol using NS 2.34 with varying network flows under random way-point mobility model and compare it with AOMDV routing protocol in terms of Quality of Service metrics. When there is a hike in network flows, the E2E-LREEMR reduces 30.43 % of average end-to-end delay, 29.44 % of routing overhead, 32.65 % of packet loss ratio, 18.79 % of normalized routing overhead and 12.87 % of energy consumption. It also increases rather 10.26 % of packet delivery ratio and 6.96 % of throughput than AOMDV routing protocol. 相似文献
6.
José Craveirinha João Clímaco Lúcia Martins Carlos G. da Silva Nuno Ferreira 《Telecommunication Systems》2013,52(1):203-215
The MPLS platform enables the implementation of advanced multipath and multicast routing schemes. This work develops and analyses the performance of a new bi-criteria minimum spanning tree model intended for routing broadcast messages in MPLS networks or constructing tree-based overlay networks. The aim of the model is to obtain spanning trees which are compromise solutions with respect to two important traffic engineering metrics: load balancing cost and average delay bound. An exact solution to the formulated bi-criteria optimization problem is presented, which is based on an algorithm that enables the computation of the set of supported non-dominated spanning trees. An application model and a set of experiments on randomly generated Internet type topologies will also be presented. Finally a network performance analysis of the model considering three network performance metrics will be shown. 相似文献
7.
In the context of IEEE 802.11b network testbeds, we examine the differences between unicast and broadcast link properties, and we show the inherent difficulties in precisely estimating unicast link properties via those of broadcast beacons even if we make the length and transmission rate of beacons be the same as those of data packets. To circumvent the difficulties in link estimation, we propose to estimate unicast link properties directly via data traffic itself without using periodic beacons. To this end, we design a data-driven routing protocol Learn-on-the-Fly (LOF). LOF chooses routes based on ETX/ETT-type metrics, but the metrics are estimated via MAC feedback for unicast data transmission instead of broadcast beacons. Using a realistic sensor network traffic trace and an 802.11b testbed of ~195 Stargates, we experimentally compare the performance of LOF with that of beacon-based protocols, represented by the geography-unaware ETX and the geography-based PRD. We find that LOF reduces end-to-end MAC latency by a factor of 3, enhances energy efficiency by a factor up to 2.37, and improves network throughput by a factor up to 7.78, which demonstrate the feasibility and the potential benefits of data-driven link estimation and routing. 相似文献
8.
9.
Routing Metrics and Protocols for Wireless Mesh Networks 总被引:4,自引:0,他引:4
Campista M.E.M. Esposito P.M. Moraes I.M. Costa L.H.M. Duarte O.C.M. Passos D.G. de Albuquerque C.V.N. Saade D.C.M. Rubinstein M.G. 《IEEE network》2008,22(1):6-12
WMNs are low-cost access networks built on cooperative routing over a backbone composed of stationary wireless routers. WMNs must deal with the highly unstable wireless medium. Therefore, the design of algorithms that consider link quality to choose the best routes are enabling routing metrics and protocols to evolve. In this work, we analyze the state of the art in WMN metrics and propose a taxonomy for WMN routing protocols. Performance measurements for a WMN, deployed using various routing metrics, are presented and corroborate our analysis. 相似文献
10.
A new multilayered inter satellite-high altitude platform(HAP)system routing algorithm is proposed,which is mainly based on multipath routing to ensure the network reliability.The proposed multipath routing scheme principally relies on splitting the traffic between different paths to make the best utilization of multiple routes.Linear programming is the main method used for multipath selection.The major constraints to the quality of service(QoS)(delay and link utilization)have been taken into account to meet the criteria of the advanced multimedia applications.Due to the effect of link utilization,the system encounters traffic flow oscillation between paths over time,which affects the system performance.Hence,to fix this issue,we propose a cognitive routing algorithm which reacts to the long-term changes of the traffic loads rather than short-term ones.The performance of the proposed routing techniques has been evaluated using appropriate simulation models and implemented by Matlab. 相似文献
11.
For effective routing in wireless mesh networks, we proposed a routing metric, expected path throughput (EPT), and a routing protocol, expected path throughput routing protocol (EPTR), to maximize the network throughput. The routing metric EPT is based on the estimated available bandwidth of the routing path, considering the link quality, the inter- and intra-flow interference and the path length. To calculate the EPT of a routing path, we first calculate the expected bandwidth of the link and the clique, and then consider the decay caused by the path length. Based on EPT, a distributed routing protocol EPTR is proposed, aiming to balance the network load and maximize the network throughput. Extensive simulations are conducted to evaluate the performance of the proposed solution. The results show that the proposed EPTR can effectively balance the network load, achieve high network throughput, and out-perform the existing routing protocols with the routing metrics previously proposed for wireless mesh networks. 相似文献
12.
The ever‐increasing transmission requirements of quality of service (QoS)‐sensitive applications, especially real‐time multimedia applications, can hardly be met by the single path routing protocols. Multipath transmission mechanism is a feasible approach to provide QoS for various applications. On the basis of the general framework of multipath transport system based on application‐level relay, we present a relay path allocation scheme, whose goal is to select suitable relay paths, while balancing the overlay traffic among the different domains and relayers. With the application‐layer traffic optimization service under the standardization within the Internet Engineering Task Force (IETF), the controller has the topology‐aware ability to allocate relay paths with excellent routing performance. To further develop the universality of our method, the controller perceives transmission performance of relay overlay network through relayers' performance detection processes and, thus, has the application‐aware ability to allocate relay paths with excellent transmission performance for different applications by consulting application‐specific transmission metrics. Simulation results demonstrate that the proposed relay path allocation algorithm performs well in allocating superior relay paths and can balance the distribution of overlay traffic across domains in different network situations. 相似文献
13.
Mobile ad hoc networks (MANETs) will play a vital role in civilian and military applications where users move around and share
information with each other. The movement of users varies depending on the environment, e.g. people may move randomly in different
directions (Random Waypoint and Gauss Markov mobility models); or walk, run and drive in two directions in the street (Manhattan
Mobility Model); or move as a group (Reference Point Group Mobility model). The interaction between mobility patterns and
routing protocols contributes significantly to vary the overall network performance. We build an analytical framework that
shows an analysis structure for the overall network performance test. In this framework, we first compare the properties of
the mobility models that are designated for MANETs. Second, we measure single path (proactive and reactive) and multipath
(proactive and reactive) routing protocols across the mobility models by tuning into TCP and CBR traffic individually. Finally,
we examine the performance of each routing protocol across mobility models and discuss the possibility of interaction between
them. Most of the previous findings only evaluate the impact of mobility models and single path routing protocols with CBR
traffic, whereas a significant finding of this study is that how the interaction between mobility models and single path and
multipath routing protocols varies depending on the usage of traffic (TCP and CBR). 相似文献
14.
Mirjana D. Vladanka S. 《AEUE-International Journal of Electronics and Communications》2006,60(5):387-398
In this paper, an approach to efficient traffic engineering in the DiffServ-aware network environment is proposed. We focus to distance vector-based routing protocols, considering both modifications of routing protocols needed to support path differentiation and traffic engineering methods relied on adjusting multiple per-link costs to particular network conditions. Further, a method for determining link cost of particular traffic class, as a unique generic function of the single generalized performance metric has been proposed. In order to achieve efficient traffic engineering, possible approximations of generic cost function and mappings of generalized to particular metrics have been proposed. Finally, prerequisites for implementing proposed approach have been discussed in the context of different administrative policies and time scales of their application. 相似文献
15.
In wireless sensor network (MSN), reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault. 相似文献
16.
This paper shows how to optimize the routing decisions in a nondeterministic routing algorithm called convergence routing in which routes may change depending on the traffic conditions. The routing algorithm guarantees a loss-free delivery of data packets from bursty sources, and a deterministic bound on the route length in arbitrary topology networks. The routing decisions are based on assigning routing priorities to the links such that a packet is forwarded to the highest priority link which is not blocked. Routing priorities are assigned using a local-greedy metric which minimizes the distance (number of hops) to the destination. This work shows that routing decisions using a local-greedy metric are not optimal, and the performance of the algorithm can be improved substantially by using new measures. Thus, various look-ahead metrics which take into account the potential gain on the other switching nodes toward the destination of a packet are suggested. The contributions of this work are: (1) a new analytical model to capture the behavior of a switching node; (2) an iterative optimization technique to set routing priorities according to various look-ahead measures; and (3) heuristics to ensure the stability of the routing priorities. The optimization objective is to maximize the throughput by minimizing the maximum total flow carried on a link in the network under static traffic model. The performance is studied computationally on various networks and traffic matrices. It is shown that up to a 50% performance increase can be obtained by optimizing the routing priorities 相似文献
17.
Toward internet-wide multipath routing 总被引:1,自引:0,他引:1
The Internet would be more efficient and robust if routers could flexibly divide traffic over multiple paths. Often, having one or two extra paths is sufficient for customizing paths for different applications, improving security, reacting to failures, and balancing load. However, support for Internet-wide multipath routing faces two significant barriers. First, multipath routing could impose significant computational and storage overhead in a network the size of the Internet. Second, the independent networks that comprise the Internet will not relinquish control over the flow of traffic without appropriate incentives. In this article, we survey flexible multipath routing techniques that are both scalable and incentive compatible. Techniques covered include: multihoming, tagging, tunneling, and extensions to existing Internet routing protocols. 相似文献
18.
Multipath routing is an efficient technique to route data in wireless sensor networks (WSNs) because it can provide reliability, security and load balance, which are especially critical in the resource constrained system such as WSNs. In this paper we provide a survey of the state-of-the-art of proposed multipath routing protocols for WSNs, which are classified into three categories, infrastructure based, non-infrastructure based and coding based, based on the special techniques used in building multiple paths and delivering sensing data. For each category, we study the design of protocols, analyze the tradeoff of each design, and overview several representing protocols. In addition, we give a summery of design goals, challenges, and evaluation metrics for multipath routing protocols in resource constrained systems in general. 相似文献
19.
Quality-of-service (QoS) routing satisfies application performance requirements and optimizes network resource usage by selecting paths based on connection traffic parameters and link load information. However, distributing link state imposes significant bandwidth and processing overhead on the network. This paper investigates the performance tradeoff between protocol overhead and the quality of the routing decisions in the context of the source-directed link state routing protocols proposed for IP and ATM networks. We construct a detailed model of QoS routing that parameterizes the path-selection algorithm, link-cost function, and link state update policy. Through extensive simulation experiments with several network topologies and traffic patterns, we uncover the effects of stale link state information and random fluctuations in traffic load on the routing and setup overheads. We then investigate how inaccuracy of link state information interacts with the size and connectivity of the underlying topology. Finally, we show that tuning the coarseness of the link-cost metric to the inaccuracy of underlying link state information reduces the computational complexity of the path-selection algorithm without significantly degrading performance. This work confirms and extends earlier studies, and offers new insights for designing efficient quality-of-service routing policies in large networks 相似文献
20.
This paper addresses the problem of route selection in IEEE 802.11 based Wireless Mesh Networks (WMNs). Traditional routing protocols choose the shortest path between two routers. However, recent research reveals that there can be enormous differences between links in terms of quality (link loss ratio, interference, noise etc) and therefore selecting the shortest path (hop count metric) is a poor choice. We propose a novel routing metric—Expected Link Performance (ELP) metric for wireless mesh networks which takes into consideration multiple factors pertaining to quality (link loss ratio, link capacity and link interference) to select the best end-to-end route. Simulation based performance evaluation of ELP against contemporary routing metrics shows an improvement in terms of throughput and delay. Moreover, we propose an extension of the metric called ELP-Gateway Selection (ELP-GS) which is an extension meant for traffic specifically oriented towards the gateway nodes in the mesh network. We also propose a gateway discovery protocol which facilitates the dissemination of ELP-GS in the network. Simulation results for ELP-GS show substantial improvement in performance. 相似文献