Reinforcement Learning for Call Admission Control and Routing under Quality of Service Constraints in Multimedia Networks

In this paper, we solve the call admission control and routing problem in multimedia networks via reinforcement learning (RL). The problem requires that network revenue be maximized while simultaneously meeting quality of service constraints that forbid entry into certain states and use of certain actions. The problem can be formulated as a constrained semi-Markov decision process. We show that RL provides a solution to this problem and is able to earn significantly higher revenues than alternative heuristics.     

LEO卫星网络中一种简洁的星上分布式路由协议

在具有星际链路的低地球轨道(LEO)卫星网络中,高度动态的网络拓扑和受限的星上资源为其路由协议设计带来很大的挑战.提出了一种简洁的星上分布式路由协议ODRP来应对这种挑战.在ODRP协议中,单层LEO星座被作为双层星座处理.根据星际链路动态特性和流量分布情况,各轨道面内位于一定位置的卫星节点被选作为轨道面发言人,从而实现简洁的分布式分层路由.实验结果表明,ODRP能够适应网络拓扑的动态变化,保证路由最优.尤其是在高负载情况下,能够有效降低分组丢失率.通过复杂性分析得知,与其他星上路由机制相比,ODRP具有较低的通信开销、计算开销和存储开销.     

基于OPNET的低轨卫星网络仿真平台

为研究适用于低轨卫星网络的协议与算法,在OPNET中搭建仿真平台,包括卫星网络拓扑的设计、节点模型、进程模型以及链路模型的建立。该平台能模拟低轨卫星网络路由表的建立和数据包选路等过程。依据卫星网络运动的规律性,采用拓扑快照方式的静态路由策略,对低轨卫星网络进行路由仿真,验证了平台的有效性。     

Packet routing algorithm for polar orbit LEO satellite constellation network

The proliferation of Internet motivates the need of integrating IP with Low Earth Orbit (LEO) satellite networks that are well known for their global coverage and their ability of providing services with different QoS specifications. There is no doubt tha…     

LEO卫星通信网的鲁棒路由算法

针对使用星际链路ISL的LEO卫星系统,许多学者提出基于面向连接结构的路由算法,但这些算法的性能很大程度上依赖于初始路径的建立,健壮性差。该文提出一种基于面向连接结构的增强路由算法,只要源卫星与目的卫星之间存在一条通路,源卫星便可以与目的卫星通信。若源卫星与目的卫星之间存在多条路径,通过该算法一定能在线找到其中的最佳路径。通过仿真实验评价了算法的性能,证明算法比已有的基于面向连接结构的路由算法具有更高的鲁棒性。     

LEO/MEO卫星网络中的一种新型分布式动态路由算法

分析了离线路由算法抗毁性差，在部分星际链路出现故障时性能显著下降的特点，指出了传统的最短路径算法难以直接应用于卫星网络的原因，提出了一种适用于LEO／MEO网络的新型分布式路由算法-链路反转算法．该算法利用卫星运行的周期性和可预知性，对路由策略进行了优化，并且在部分星际链路出现故障时通过路由信令对路由进行调整，避开故障链路．在LEONET卫星网络上的仿真数据和分析显示，与传统的链路状态算法相比链路反转算法具有更小的信令开销、更短的收敛时间．     

基于ns2的LEO卫星网络路由算法模拟

空间组网技术是卫星技术发展的重要方向之一，它能够提供全球覆盖并支持多种业务，其关键技术之一是在具有星间链路的卫星网络中进行分组路由。本文简单分析了LEO卫星网络的路由特性，讨论了在卫星环境下进行模拟仿真的方法，具体介绍了ns2对卫星网络模拟的支持，并针对两种不同的路由算法进行了模拟与分析。     

Dynamic radio resource allocation for 3G and beyond mobile wireless networks

Next generation of wireless cellular networks aim at supporting a diverse range of multimedia services to mobile users with guaranteed quality of service (QoS). Resource allocation and call admission control (CAC) are key management functions in future 3G and 4G cellular networks, in order to provide multimedia applications to mobile users with QoS guarantees and efficient resource utilization. There are two main strategies for radio resource allocations in cellular wireless networks known as complete partitioning (CP) and complete sharing (CS). In this paper, theses strategies are extended for operation in 3G and beyond network. First, two CS-based call admission controls, referred to herein as queuing priority call admission control (QP-CAC) and hybrid priority call admission control (HP-CAC), and one CP-based call admission control referred to as complete partitioning call admission control (CP-CAC) are presented. Then, this study proposes a novel dynamic procedure, referred to as the dynamic prioritized uplink call admission control (DP-CAC) designed to overcome the shortcomings of CS and CP-based CACs. Results indicate the superiority of DP-CAC as it is able to achieve a better balance between system utilization, revenue, and quality of service provisioning. CS-based algorithms achieve the best system utilization and revenue at the expense of serious unfairness for the traffic classes with diverse QoS requirements. DP-CAC manages to attain equal system utilization and revenue to CS-based algorithms without the drawbacks in terms of fairness and service differentiation.     

LEO卫星网络中的一种分布式路由算法

在LEO卫星网络中，由于卫星高速运动导致的网络拓扑变化和不同卫星覆盖城内流量的非规整性给设计其特殊路由算法带来很大挑战。结合卫星网络的固有特点，本文提出一种基于路径信息压缩的分布式路由算法CPDR（Compressed Path Information based Distributed Routing）。该算法使用分布式分层链路状态收集策略和简洁的路径信息编码机制，能够在不引入额外信令开销基础之上提供多路径路由能力，实现卫星网路中的流量负载平衡、优化网络带宽应用、提高星际链路利用率。     

基于SDN的高性能QoS保障低轨道卫星星间路由算法

低轨道卫星通信系统具有全球覆盖性、移动性、可扩展性等优势,在提供全球互联网服务、灾难应急处理等方面发挥重要作用,但由于星上有限的存储和计算资源,传统路由算法不适用于低轨道卫星通信网络。结合软件定义网络架构,提出一种支持服务质量（QoS）的高性能低轨道卫星星间路由算法。根据剩余链路持续时间定义星间链路生存时间,确定每条星间链路的稳定度,缓解由于链路切换导致的业务路径重构问题。基于高轨道卫星得到的星间链路的流量状态,定义链路负载矩阵,给出星间链路负载度函数,并利用标签交换路径集合获得每条路径的负载度,避免节点拥塞,实现网络负载均衡。针对不同要求的业务服务类型定义权重因子矩阵,通过调整因子来减小瓶颈节点对路由算法的影响,满足多用户的QoS要求。仿真结果表明,在不同的QoS要求下,该算法在业务时延、系统吞吐量、网络负载均衡等方面均具有明显优势,且算法复杂度低,大幅节省了有限的星上存储与计算资源。     

Providing End-to-End Quality of Service with Optimal Least Weight Routing in Next-Generation Multiservice High-Speed Networks

Routing algorithms play a critical role in meeting both the stringent quality of service (QoS) requirements of guaranteed services and the certain QoS requirement of assured services over next-generation multiservice high-speed networks. In this paper, we propose the use of optimal least weight routing (OLWR) algorithm for routing QoS flows in high-speed networks. The main principle of our algorithm is that the choice of the most appropriate route is based on a set of parameters (least weight parameters) that estimate and consider the impact that the acceptance and routing decision of a call request belonging to a specific class would have on the network and other classes of service. Effective bandwidth, bandwidth and trunk reservation techniques, along with load balancing and packing trade-off considerations, are also introduced in the proposed routing algorithm. The performance evaluation of our algorithm is achieved via modeling and simulation of multiclass service routing in various network topologies. The performance results demonstrated that OLWR outperforms both the multihop least-loaded routing algorithms and the multihop most-loaded routing algorithms in terms of both revenue and carried load.     

宽带卫星网络边界路由技术研究

在中低轨道卫星星座中,利用星间链路组网是宽带卫星网络技术发展的一个主要方向。卫星网络中的边界路由主要解决卫星网络和地面网络之间在网络层的互操作性问题,实现网络层的互相融合,使端用户能够通过异构网络来透明地通信。在分析已有研究的基础上,结合地面网络使用的边界路由技术,给出了地面网络与卫星网络的互连模型,分析了具有星间链路的卫星网络中边界路由问题的实质,并介绍了一种基于BGP4协议的卫星网络边界路由机制,进而指出了后续的研究方向。     

基于OPNET的LEO卫星网络协议仿真平台研究

在OPNET仿真环境下,通过对LEO卫星网络协议构架分析,合理简化协议体系结构,构建通用卫星节点模块,实现了LEO卫星网络协议仿真平台。该平台能够模拟无连接LEO卫星网络路由表的建立更新和数据包选路等过程,以及切换、长时延等一些卫星网络特性给其他协议带来的影响。最后通过对作者提出的一种路由算法进行仿真,验证了该仿真平台能够在一定精度上模拟LEO卫星网络环境。     

LEO卫星网QoS遗传算法路由协议

为了满足多媒体应用的QoS要求,卫星路由协议应该更有效地利用网络资源,提供更好的QoS保障。为此提出了一个基于遗传算法的LEO卫星网络QoS路由协议,称为遗传卫星路由协议（GSRP）。改进了新的操作函数,如适应度函数、终止函数,以及变异率和路由表。仿真结果表明,GSRP能够实现较少CBP和HBP的可靠的点对点时延约束,以及比传统的算法更有效的负载平衡。     

LEO卫星网中基于地理位置的分布式动态路由算法的研究

LEO卫星网络中进行信息交换，首先要解决的就是星际链路网络上路由问题，而运行于地面网络的路由算法，在卫星网络中并不适用．将针对LEO卫星网络星际链路的特点进行深入研究，提出一种新型的符合LEO卫星网络拓扑高速变化等特点的基于地理位置的分布式动态路由算法，并构建地面网络对该算法和现在流行的路由算法的性能进行仿真验证和比较，证明我们提出的新型动态路由算法能适应LEO卫星网络环境，能够提供较好的通信质量，就有较短的通信时延．     

QoS based multicast routing algorithms for real time applications

In recent years, there has been a lot of interest in providing real-time multimedia services like digital audio and video over packet-switched networks such as Internet and ATM. These services require certain quality of service (QoS) from the network. The routing algorithm should take QoS factor for an application into account while selecting the most suitable route for the application. In this paper, we introduce a new routing metric and use it with two different heuristics to compute the multicast tree for guaranteed QoS applications that need firm end-to-end delay bound. We then compare the performance of our algorithms with the other proposed QoS-based routing algorithms. Simulations were run over a number of random networks to measure the performance of different algorithms. We studied routing algorithms along with resource reservation and admission control to measure the call throughput over a number of random networks. Simulation results show that our algorithms give a much better performance in terms of call throughput over other proposed schemes.     

Agent-based load balancing routing for LEO satellite networks

To ensure an intelligent engineering of traffic over entire satellite networks, a distributed routing scheme for low-earth orbit (LEO) satellite networks, agent-based load balancing routing (ALBR), is presented. Two kinds of agents are used. Mobile agents migrate autonomously to explore the path connecting source and destination, to gather inter-satellite link (ISL) cost, identifier and latitude of visited satellites. Meanwhile, stationary agents employ exponential forgetting function to estimate ISL queueing delay, calculate ISL cost using the sum of propagation and queueing delays; evaluate path cost considering satellite geographical position as well as ISL cost, finally update routing items. Through simulations on a Courier-like system, the proposed scheme is shown to achieve better load balancing, and can especially decrease packet loss ratio efficiently, guarantee better throughput and end-to-end delay bound in case of high traffic load. Furthermore, results from the implementation complexity analysis demonstrate that with the aid of agent technology, ALBR has lower on-board computation, storage, signaling requirements than other on-board routing schemes.     

Distributed on-demand routing for LEO satellite systems

Notwithstanding the limited commercial success of the first narrowband low earth orbit (LEO) satellite systems, the interest of the scientific community in this type of systems has been revived on the basis of the current trend toward the migration to all IP-based services. LEO systems can play a pivotal role in providing services to areas where there is no substantial terrestrial infrastructure. Above all, LEO satellite systems can be used as backbone networks to interconnect autonomous systems worldwide. Such an approach provides flexibility in managing the resulting integrated network infrastructure and supporting innovative applications. In this context, routing data from the source all the way to the destination constitutes a daunting challenge. In this paper, a location-assisted on-demand routing (LAOR) protocol is proposed and evaluated. The proposed protocol introduces for the first time in satellite systems the concept of on-demand routing. However, its implementation is tailored to the requirements imposed by the characteristics of the topology of LEO satellite systems. The performance of the LAOR protocol is assessed for different link-cost metrics and compared to the one of centralized routing protocols proposed in the literature so far. Simulation studies further document and confirm the positive characteristics of the proposed protocol.     

一种基于时隙划分的三层卫星网络QoS路由协议

提出了一种基于低轨/中轨/高轨（LEO/MEO/GEO）卫星网络体系结构（TLSN）和时空分割思想的QoS路由协议（TDRP）,详细阐述了时空分割思想和时隙优化方法,重点研究了QoS路由的实现框架和路由算法（BDA）的实现原理.在此基础上,卫星网络体系结构和路由协议的性能得到了详细分析和仿真验证.相同负载情况下,TLSN中端到端时延和时延抖动性能明显好于LEO卫星网络;同Dijkstra算法相比,BDA算法在端到端时延、时延抖动、丢包率、吞吐量方面具有更好的QoS保证能力.     

面向LEO卫星网的轻量级按需QoS源路由算法

接入卫星切换、流量分布不均匀和星上处理能力受限等因素使LEO卫星网的QoS路由面临巨大挑战。提出了一种引入移动代理技术的轻量级按需QoS源路由算法。首先结合星际链路队列占用情况设计了星际链路可用指数;接着基于卫星网承载流量分布特点提出了卫星可用指数;综合星际链路和卫星可用指数给出了移动代理迁移策略、星际QoS路由及其重建算法。仿真结果表明,提出的路由算法信令开销低,时延抖动、新呼叫阻塞率和切换呼叫阻塞率等QoS性能明显优于传统路由算法。