QoS routing based on mobile agent for LEO satellite IP networks

Current quality of service (QoS) routing schemes for low earth orbit (LEO) satellites IP networks either neglect the varying population density or fail to guarantee end-to-end delay. As a remedy, QoS routing protocol based on mobile agent (QoSRP-MA) is proposed. QoSRP-MA is a source-based routing protocol. Once connection requests arrive, QoS mobile agents are dispatched from ingress satellite to explore routes, which migrate using satellite routing tables. Upon arriving in egress satellite, QoS mobile agents migrate back towards ingress satellite to reserve bandwidth. To construct satellite routing tables, load balancing routing algorithm based on mobile agent (LBRA-MA) is presented. In LBRP-MA, at regular intervals mobile agents launched on all satellites migrate autonomously to evaluate path cost and update routing tables. Moreover, path cost between source and destination is evaluated considering satellite geographical position as well as inter-satellite link (ISL) cost. Furthermore, ISL congestion index is considered to update routing table. Through simulations on a Courier-like constellation, it shows that QoSRP-MA can achieve guaranteed end-to-end delay bound with higher throughput, lower connection failing ratio and signaling overhead compared to high performance satellite routing (HPSR) scheme.     

Capacity analysis of the MEO satellite constellation

Aiming to calculate the system capacity of a given satellite constellation,a time-varying traffic model based on varying traffic with varying time zone was proposed.Focusing on a MEO satellite constellation with global coverage,using a load balanced routing algorithm,the system capacity in different time slices was analyzed and the effect of inter-satellite link (ISL) capacity on the system capacity was investigated.The time-varying traffic model makes analysis more reliable and effective via comparison with equal traffic model.Application of time slices reduces complexity of calculation.     

Load Balanced Congestion Adaptive Routing for Randomly Distributed Mobile Adhoc Networks

In mobile ad hoc networks, congestion occurs due to limited sources of the network, which leads to packet losses, bandwidth degradation and wastes time and energy on congestion recovery. Various techniques have been developed in attempt to minimize congestion in uniformly distributed networks. In this paper, a load balanced congestion adaptive routing algorithm has been proposed for randomly distributed networks. In the proposed algorithm two metrics: traffic load density and life time associated with a routing path, have been used to determine the congestion status and weakest node of the route. The route with low traffic load density and maximum life time is selected for packet transmission.     

Performance evaluation of adaptive routing algorithms in packet‐switched intersatellite link networks

This paper addresses the performance evaluation of adaptive routing algorithms in non‐geostationary packet‐switched satellite communication systems. The dynamic topology of satellite networks and variable traffic load in satellite coverage areas, due to the motion of satellites in their orbit planes, pose stringent requirements to routing algorithms. We have limited the scope of our interest to routing in the intersatellite link (ISL) segment. In order to analyse the applicability of different routing algorithms used in terrestrial networks, and to evaluate the performance of new algorithms designed for satellite networks, we have built a simulation model of a satellite communication system with intersatellite links. In the paper, we present simulation results considering a network‐uniform source/destination distribution model and a uniform source–destination traffic flow, thus showing the inherent routing characteristics of a selected Celestri‐like LEO satellite constellation. The updates of the routing tables are centrally calculated according to the Dijkstra shortest path algorithm. Copyright © 2002 John Wiley & Sons, Ltd.     

Load Balancing Technique for Congestion Control Multipath Routing Protocol in MANETs

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes that can communicate without a central controller or fixed infrastructure. Due to node mobility, designing a routing protocol to provide an efficient and suitable method to route the data with less energy consumption, packet drop and to prolong the network lifetime has become a challenging issue in MANETs. In MANETs, reducing energy consumption and packet loss involves congestion control and load balancing techniques. Thus, this paper introduces an efficient routing technique called the multipath load balancing technique for congestion control (MLBCC) in MANETs to efficiently balance the load among multiple paths by reducing the congestion. MLBCC introduces a congestion control mechanism and a load balancing mechanism during the data transmission process. The congestion control mechanism detects the congestion by using an arrival rate and an outgoing rate at a particular time interval T. The load balancing mechanism selects a gateway node by using the link cost and the path cost to efficiently distribute the load by selecting the most desirable paths. For an efficient flow of distribution, a node availability degree standard deviation parameter is introduced. Simulation results of MLBCC show the performance improvements in terms of the control overhead, packet delivery ratio, average delay and packet drop ratio in comparison with Fibonacci sequence multipath load balancing, stable backbone-based multipath routing protocol and ad hoc on demand multipath distance vector routing. In addition, the results show that MLBCC efficiently balances the load of the nodes in the network.

     

最小化路径代价和流量均衡模型及算法

流量均衡是流量工程中为避免网络拥塞经常采用的路由优化目标,如何选择路径以使流量达到均衡分布是流量路由的研究热点和难点.为了最小化网络拥塞,该文在指出网络拥塞决定于流量路由时所选路径的拥塞特征后,建立了流量分布的最小化路径代价和模型.在流量路由选择路径时,提出基于瓶颈链路的最小代价路径路由算法.在实际的网络拓扑和流量矩阵数据基础上对所提模型及算法进行了实验验证,结果显示:在网络负载较大时最大链路利用率相对于已有模型可降低近20%.     

多层卫星通信网络自适应路由策略

单层卫星网络由于轨道高度和覆盖能力的不同,以至构成通信的单层系统往往不能满足不同业务服务质量的需求。分析了Walkerdelta型星座构建多层卫星通信网络的拓扑结构和ISL性能,提出了在统计分布模型下的多层卫星自适应路由策略,综合考虑了路径时延和ISL链路负载。仿真结果表明了多层网络自适应路由策略能够更加有效地分配网络通信量,网络具有较小的丢包率、网络平均归一化链路负载和特定路径综合路径权重,有利于降低网络平均阻塞概率和特定路径阻塞概率,获得更高的可靠性,较传统的单层非自适应路由更加有效、可靠。     

Adaptive load distribution approach based on congestion control scheme in ad-hoc networks

The ‘load distribution’ proposition in mobile ad-hoc networks (MANETs) is accomplishing great stimulation. This is because of the phenomenal facets it possesses including advanced network resilience, reliability and performance. Though there are other leading network layer routing protocols, but they radically utilise single-path communication paradigm, which is why they fail in achieving efficient load distribution in a network. Via this paper, we propose an efficient cross-layer adaptive load distribution approach to capitalise network’s channel utilisation and to rapidly adapt to dynamic wireless channel characteristic changes. The proposed method modifies the load balanced congestion adaptive routing (LBCAR) protocol and is developed using dynamic load distribution technique, by pioneering (i) novel parameters, which report for the availability of route pertaining to minimum traffic load and better link lifetime and also adapt according to varying available network resources; (ii) an absolute dynamic method to lessen the redundant route oscillations which further reduces the routing instabilities. The simulation results demonstrate the usefulness of the proposed method and yields better results in comparison to LBCAR and standard instead of dynamic ource outing, it is dynamic source routing (DSR) protocol.     

Load-balancing in MANET shortest-path routing protocols

Mobile ad hoc networks (MANET) are infrastructure-less networks, dynamically formed by an independent system of mobile nodes that are connected via wireless links. Because routing is performed by nodes with limited resources, load should be efficiently distributed through the network. Otherwise, heavily-loaded nodes may make up a bottleneck that lowers the network performances by congestion and larger delays. Regrettably, load-balancing is a critical deficiency in MANET shortest-path routing protocols, as nodes at the center of the network are much heavily-loaded than the others. Thus, we propose, in this paper, load-balancing mechanisms that push the traffic further from the center of the network. Basically, we provide novel routing metrics that take into account nodes degree of centrality, for both proactive and reactive routing protocols. Simulations show that the proposed mechanisms improve the load distribution and significantly enhance the network performances in terms of average delay and reliability.     

Resource optimization algorithm of combination of NFV and SDN for application of multiple services

Various services of internet of things (IoT) require flexible network deployment to guarantee different quality of service (QoS).Aiming at the problem of IoT service function chain deployment,network function virtualization (NFV) and software defined networking (SDN) were combined to optimize resources.Considering forwarding cost and traffic load balance,a joint optimization model of virtual network function placement and service function chain routing was given and was proved to be NP-Hard.In order to solve this model,two heuristic algorithms were proposed.One was the service chain deployment algorithm of first routing then placing (FRTP) and the other was the placing followed by routing (PFBR) based on node priority.Simulation results demonstrate that FRTP and PFBR algorithm can significantly balance network traffic load while alleviating congestion and improving the acceptance ratio of the chain requests compared with other algorithms.     

基于流量预测的物联网卫星节点动态缓存分配路由策略

针对低轨物联网卫星系统的路由问题,提出了基于流量预测的物联网卫星节点动态缓存分配路由策略。首先,分析低轨卫星覆盖区域内业务分布的时空特性,提出了端到端流量预测方法。然后,根据流量预测结果,提出了动态缓存分配路由策略。卫星节点通过对星间链路的流量负载进行周期性监测,动态分配与邻居节点间各条星间链路的缓存资源,分为初始化和系统运行2个阶段。同时,提出了节点拥塞时的业务分流及数据分组转发策略,通过比较排队时延和转发时延的大小,决定数据分组是否需要进行重路由。仿真结果表明,所提路由策略有效地降低了分组丢失率及平均端到端时延,改善了业务在全网的分布情况。     

Dynamic traffic-aware routing algorithm for multi-sink wireless sensor networks

In this paper, a distributed traffic-balancing routing algorithm is proposed for multi-sink wireless sensor networks that effectively distributes traffic from sources to sinks. Each node has a gradient field that is used to decide on a neighbor node to reach a sink. The node’s gradient index contains (1) the distance cost from a source to a respective sink, and (2) traffic information from neighboring nodes. The proposed algorithm considers the traffic being faced by surrounding neighbors before forwarding packets to any sink using gradient search for routing and providing a balance between optimal paths and possible congestion on routes toward those sinks. The key objective of this work is to achieve traffic-balancing by detecting congested areas along the route and distributing packets along paths that have idle and underloaded nodes. Extensive simulations conducted to evaluate the performance of the proposed scheme indicate that it effectively reduces the overall packet delay, energy consumption and improves the packet delivery ratio under heavy traffic.     

ATM-based routing in LEO/MEO satellite networks with intersatellitelinks

An asynchronous transfer mode (ATM)-based concept for the routing of information in a low Earth orbit/medium Earth orbit (LEO/MEO) satellite system including intersatellite links (ISLs) is proposed. Specific emphasis is laid on the design of an ATM-based routing scheme for the ISL part of the system. The approach is to prepare a virtual topology by means of virtual path connections (VPCs) connecting all pairs of end nodes in the ISL subnetwork for a complete period in advance, similar to implementing a set of (time dependent) routing tables. The search for available end-to-end routes within the ISL network is based on a modified Dijkstra (1959) shortest path algorithm (M-DSPA) capable of coping with the time-variant topology. With respect to the deterministic time variance of the considered ISL topologies, an analysis of optimization aspects for the selection of a path at call setup time is presented. The performance of the path search in combination with a specific optimization procedure is-by means of extensive simulations-evaluated for example LEO and MEO ISL topologies, respectively     

Design and Performance Analysis of a Proxy-Based Indirect Routing Scheme in Ad Hoc Wireless Networks

The majority of existing ad hoc network routing protocols has a tendency to use the shortest single path from a source to a destination. However, in constantly changing topologies such as those in mobile ad hoc wireless networks, the shortest single path is not only unreliable for reachability but also unsuitable for traffic load equilibrium. In order to improve routing performance and make optimum use of the limited resources, the congestion must first be relieved as much as possible and the routing path be made available at all times. In this paper, we propose a novel scheme, called the Applicative Indirect Routing (AIR), to control network traffic congestion and refine route availability by coping with unreliable links quickly. The proposed scheme, acting as a proactive routing protocol, utilizes additional information about the neighbors shared by the sender and the receiver to find an alternative for the original path with unreliable links. The additional bandwidth usage in AIR to obtain the information about shared neighbors (defined as proxy candidates) is so minimal that the bandwidth availability for user data traffic is not significantly affected. Extensive simulation experiments show that compared with a conventional proactive protocol, namely Destination-Sequenced Distance Vector (DSDV), the AIR scheme leads to a much improved system performance in terms of packet delivery ratio, average end-to-end packet delay, and network reliability. We further show that, in terms of packet delivery ratio, AIR is also a competitive protocol compared with such reactive protocols as Ad hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR).     

智慧协同网络中基于流量矩阵的负载均衡路由机制

智慧协同网络具有能够实时准确测算流量矩阵的特点。将流量矩阵作为约束,对负载均衡路由优化问题进行建模,利用拉格朗日对偶方法,将原问题转化为优化目标易实现的对偶问题。为实现对偶问题优化目标,提出一种基于流量矩阵的负载均衡路由 (TM-LB,traffic matrix based load balancing) 算法,供控制层根据实时网络情况为后续流规划传输路径。利用OMNET++仿真器在NFSnet拓扑结构上进行仿真实验,结果表明TM-LB相比传统路径规划机制能有效避免拥塞,实现负载均衡。最后,搭建原型系统对TM-LB算法的开销进行测试。     

Minimum cost load balanced multipath routing protocol for low power and lossy networks

Conventional shortest path routing mechanisms in low power and lossy networks (LLNs) impose excessive traffic load on some nodes and cause their early battery depletion. Load balancing via multipath routing is a promising solution to increase lifetime. This idea is practised by some algorithms, mostly through limited number of disjoint paths, to reduce inter-path interference. In this paper a proactive multipath routing algorithm called MRPL is proposed, based on the recent standard routing protocol for LLNs. The algorithm tries to distribute the traffic load through a set of braided paths, with the objective of maximizing the network lifetime and minimizing total transmission cost. The traffic distribution mechanism is formulated by a linear program and a heuristic method is proposed to implement it in a distributed manner. Simulation results provide enough evidence for energy and cost efficiency of the proposed routing mechanism.     

Performance of delay‐sensitive traffic in multi‐layered satellite IP networks with on‐board processing capability

In this article, performance of delay‐sensitive traffic in multi‐layered satellite Internet Protocol (IP) networks with on‐board processing (OBP) capability is investigated. With OBP, a satellite can process the received data, and according to the nature of application, it can decide on the transmission properties. First, we present a concise overview of relevant aspects of satellite networks to delay‐sensitive traffic and routing. Then, in order to improve the system performance for delay‐sensitive traffic, specifically Voice over Internet Protocol (VoIP), a novel adaptive routing mechanism in two‐layered satellite network considering the network's real‐time information is introduced and evaluated. Adaptive Routing Protocol for Quality of Service (ARPQ) utilizes OBP and avoids congestion by distributing traffic load between medium‐Earth orbit and low‐Earth orbit layers. We utilize a prioritized queueing policy to satisfy quality‐of‐service (QoS) requirements of delay‐sensitive applications while evading non‐real‐time traffic suffer low performance level. The simulation results verify that multi‐layered satellite networks with OBP capabilities and QoS mechanisms are essential for feasibility of packet‐based high‐quality delay‐sensitive services which are expected to be the vital components of next‐generation communications networks. Copyright © 2007 John Wiley & Sons, Ltd.     

Congestion management techniques for disruption‐tolerant satellite networks

Delay and disruption‐tolerant networks are becoming an appealing solution for extending Internet boundaries toward challenged environments where end‐to‐end connectivity cannot be guaranteed. In particular, satellite networks can take advantage of a priori trajectory estimations of nodes to make efficient routing decisions. Despite this knowledge is already used in routing schemes such as contact graph routing, it might derive in congestion problems because of capacity overbooking of forthcoming connections (contacts). In this work, we initially extend contact graph routing to provide enhanced congestion mitigation capabilities by taking advantage of the local traffic information available at each node. However, since satellite networks data generation is generally managed by a mission operation center, a global view of the traffic can also be exploited to further improve the latter scheme. As a result, we present a novel strategy to avoid congestion in predictable delay‐ and disruption‐tolerant network systems by means of individual contact plans. Finally, we evaluate and compare the performance improvement of these mechanisms in a typical low Earth orbit satellite constellation.     

Topological design,routing and capacity dimensioning for ISL networks in broadband LEO satellite systems

This paper considers the network design of intersatellite link (ISL) networks in broadband LEO satellite systems, where the major challenge is the topology dynamics. First, a general method to design convenient ISL topologies for connection‐oriented operation is presented, and a reference topology for numerical studies is derived. A permanent virtual topology is then defined on top of the orbiting physical one, thus forming a framework for discrete‐time dynamic traffic routing. On this basis, heuristic and optimization approaches for the combined routing and dimensioning task, operating on discrete time steps, are presented and their performance is numerically compared. It is shown that minimizing the worst‐case link capacity is an appropriate target function, which can be formulated as linear optimization problem with linear constraints. Using linear programming (LP) techniques, the dimensioning results are clearly better than with simple heuristic approaches. Copyright © 2001 John Wiley & Sons, Ltd.