Application of artificial intelligence to improve quality of service in computer networks

Resource sharing between book-ahead (BA) and instantaneous request (IR) reservation often results in high preemption rates for ongoing IR calls in computer networks. High IR call preemption rates cause interruptions to service continuity, which is considered detrimental in a QoS-enabled network. A number of call admission control models have been proposed in the literature to reduce preemption rates for ongoing IR calls. Many of these models use a tuning parameter to achieve certain level of preemption rate. This paper presents an artificial neural network (ANN) model to dynamically control the preemption rate of ongoing calls in a QoS-enabled network. The model maps network traffic parameters and desired operating preemption rate by network operator providing the best for the network under consideration into appropriate tuning parameter. Once trained, this model can be used to automatically estimate the tuning parameter value necessary to achieve the desired operating preemption rates. Simulation results show that the preemption rate attained by the model closely matches with the target rate.     

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.     

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.     

Analyzing the performance of deferred reservations

This paper studies the performance of deferred resource reservation in data networks. Conventional resource reservation protocols, such as PNNI and RSVP adopt an all-or-nothing approach, where partially acquired resources must be released if resources are not available at all links on the chosen path. During periods of high network load, this leads users to retry requests repeatedly, adding control traffic at exactly the time when the network’s capacity to process that control traffic is exhausted. Deferred REServation (DRES) can significantly improve performance by reducing the overall call rejection probability, allowing more traffic to be carried, using the same resources. Call admissibility is increased by deferring requests at routers for a limited period of time until resources become available. The paper includes analytical models that predict the blocking probability on a DRES multiplexor and on a multi-hop path, and simulation results for substantial network configurations, using several QoS routing methods. The results show that DRES can provide substantial performance gains over traditional reservations (upto 50% with QoS routing enabled and upto an order of magnitude for non-QoS traditional routing).     

Dynamic rerouting of guaranteed Quality-of-Service connections

To support the widespread demands for integrated services various solutions have been proposed to provide guaranteed Quality-of-Service (QoS) services in packetswitched networks. These solutions usually require fixed route selection and resource reservation on a per connection basis. The routing and reservation decisions, combined with load fluctuations, introduce the problems of network unavailability and loss of network management flexibility. We believe that these problems can be alleviated by transparently rerouting connections to properly balance the network load. In this paper, we present a solution that supportstransparent route modification ofguaranteed QoS connections during the life time of the connections. As the emphasis of this work is to support transparency we must ensure that during and after the rerouting, the QoS guarantees made to the client are preserved, and the interface instances at both the sender and receiver are unaltered. Our solution includes the mechanisms that support the transparent rerouting of connections, and a routing algorithm that is based on the traffic characteristics, the delay, and the jitter requirements of a connection. This routing algorithm can also use various administrative constraints and facilitate the reuse of resources currently reserved by the connection. To optimize the solution, additional mechanisms have been introduced to reduce the time needed to reroute a connection and to support rerouting of segments of a connection. The solution has been implemented in the context of the Tenet scheme and route changes can be observed and controlled by using the Simple Network Management Protocol (SNMPv 1). Simulation experiments and some initial measurements of the implementation demonstrate that such a scheme is useful, practical, and can be achieved with load overhead.     

无线多媒体网络中一种基于测量网络状态的动态呼叫接纳控制算法

提出了一种无线多媒体网络中基于测量网络状态的动态呼叫接纳控制算法.它区分了实时和非实时业务,在网络带宽资源不足时可通过降低非实时业务带宽确保实时业务呼叫连接的可靠性;还可根据当前网络状况调整预留带宽大小,使小区实时业务切换呼叫掉线率低于设定的门限值.大量仿真结果显示该算法具有低实时业务切换呼叫掉线率和与固定预留方案相当的带宽利用率,而只以略高的新呼叫阻塞率为代价,适合各种不同概率发生时实际应用的情况.     

MQ: an integrated mechanism for multimedia multicasting

This paper studies the integration of multimedia multicasting, with the consideration of multicast with end-to-end QoS guarantees by resource reservation, dynamic join and departure of participants, user heterogeneity, scalability, robustness, and loop-free control. A protocol called MQ, Multicast with QoS, is proposed to support multimedia group communications with QoS guarantees for heterogeneous recipients. With MQ, while resource reservation is de-coupled from QoS multicast routing, they are integrated in a way to avoid the problem of “sender-oriented” path determination, a problem that occurs when RSVP is used in conjunction with QoS routing for heterogeneous reservations. Being a truly receiver-oriented and integrated scheme for multimedia multicasting, MQ supports such integration in a robust, scalable and loop-free way. It also accommodates heterogeneous users with varied QoS, dynamically adjusts QoS trees to improve resource utilization, and guarantees end-to-end QoS requirements. We have conducted simulations to evaluate the performance of the proposed mechanism. MQ demonstrates its advantages over the conventional loosely coupled integration of TP multicasting, resource reservation and QoS routing, in terms of better accommodation of heterogeneous users, higher scalability, lower blocking probability for users to join groups with service guarantees, and more efficient resource utilization to enhance system performance     

适应QoS路由机制的网络模型研究

目前的网络模型,大都对网络的边（链路）加权,如两点间的距离、链路带宽以及延迟等。作为ＩＥＴＦ提出的网络集成服务框架下资源管理的一个重要组件,ＱｏＳ路由问题越来受到人们的重视,为了保证网络服务质量,路由选择不再仅仅以“可达”和“最短路径”为衡量标准,而是希望根据多个ＱｏＳ约束的尺度（ｍｅｔｒｉｃｓ）来选择可行的路由以满足应用所需的延迟、延迟抖动、带宽和丢失率等要求,为此,作者提出了新的网络模型,更加     

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

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

定向天线卫星网络空间重用的带宽预留算法

基于无线网络中设计提供服务质量(quality of service,QoS)的路由协议是一项具有挑战性的工作,提出无线卫星网络中基于定向天线的服务质量保证的空间重用的带宽预留算法。卫星网络中许多音/视频会议、远程教育等重要应用,需要服务质量保证。无线网络中的定向天线技术提供了显著增加空间重用性的能力,提高无线网络中的数据传输效率。研究使用定向天线的无线卫星网络中基于时分多址的带宽预留算法,该算法给不同方向的地面终端分配相同时隙来提高带宽资源的空间重用性,提高通信效率。通过模拟实验分析研究证明,该算法在服务质量调用成功率、吞吐量和延迟方面有比较好的性能。     

移动自组网中基于路径稳定性的QoS路由协议

随着多媒体应用日益普及，在移动自组网中提供QoS已经逐渐成为自组网研究的热点问题，然而现有的自组网QoS路由协议主要集中研究如何找到满足QoS条件的可行路径而没有考虑可行路径的稳定性，针对移动自组网的特点，提出了基于路径稳定性的QoS路由协议PSQRP，该协议基于路径稳定性PSF来选择路由，减少了链路断开的概率，同时协议采用了主次预约技术来预约网络资源，进一步提高了协议的请求成功率，模拟结果表明，在动态的网络环境下，PSQRP协议能够取得良好的性能。     

基于CDMA-over-TDMA的多路带宽预留算法

讨论了在进行有QoS保证的路由选择的研究中所遇到的一些问题,并提出了一种新的带宽预留的路由选择算法MBR。MBR算法把路由选择分为两个阶段：路由发现和带宽预留。在路由发现阶段,算法首先寻找多条到达目的节点的路径,然后在带宽预留阶段,对寻找到的路径进行带宽预留,最后由目的节点决定使用哪些路径进行传输。由于MBR算法是采用同时寻找多条路径来进行带宽预留,因此它与其它带宽预留算法相比,具有更高的成功率。     

与资源预留相结合的QoS路由问题研究

1 引言十年前,结合快速的处理器、光纤链路和分组交换机制,开发和部署综合电话网络和传统数据网络的能力,建立一个可提供综合服务网络的单一的基础网络结构,这种最初的概念导致了ATM网络的出现。ATM在QoS、有效资源的使用和拥塞控制方面有独到的解决方法,是对分组交换和多路复用技术的一大     

Path selection with preemption and re-routing control for multi-protocol label switching networks

Multi Protocol Label Switching (MPLS) networks enhance the services of conventional best-effort IP networks by providing end-to-end Quality of Service (QoS) guaranteed Label Switched Paths (LSP) between customer sites. The LSP has to be set up in advance before carrying the traffic. Contention for network resources may happen if many LSPs try to use a common network link with limited bandwidth. In this paper, we investigate the problem of providing services to high priority LSPs whereby existing LSPs with lower priority may be preempted. The consequent interruption of the services of preempted LSPs would detrimentally affect users’ perception on the QoS provided. Therefore, the preemption strategies may incorporate additional re-routing mechanisms to provide alternative paths for the LSPs which are to-be-preempted so that their services remain unaffected. A newly arrived high priority LSP in an MPLS network may find M possible paths between its source and destination. It may select the shortest path which may trigger preemption or choose a longer path which however utilizes more resources. We begin by formulating preemption strategies with global re-routing. Our investigations include the effects of routing of high priority LSPs on the shortest path and its alternative paths. We show that by persistently routing the high priority LSP on the shortest path, more preempted LSPs can be re-routed which would reduce the negative effects of preemption. However, as excessive re-routing may degrade the network performance as well, a re-routing control strategy is proposed to constrain the length of these re-routed paths. Finally, a decentralized preemption strategy with local re-routing is also presented to approximate the performance of the proposed strategy with significantly lower control overheads. Simulations show that with this approach, high priority LSPs can gain better access to network resources while simultaneously ensuring that, as compared to the existing preemption strategies, the network throughput and the ongoing connection services are not adversely affected.     

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

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

A distributed-request-based CDMA CAC for DiffServ multimedia services in wireless cellular mobile networks

In this paper, a distributed-request-based CDMA DiffServ (differentiated service) call admission control (CAC) scheme is proposed to provide various multimedia services seamlessly in wireless mobile Internet. Conventional CDMA CAC schemes cannot fully support DiffServ QoS (Quality of Service) and seamless handoff due to lack of consideration on service priority and seamless mobility. Therefore, in order to achieve QoS guarantee for each service class, seamless fast-handoff, and high utilization of the scarce wireless resource, we define a code assignment policy and an adaptive access permission scheme taking each user’s service priority and mobility into consideration. For that purpose, in the proposed scheme, the DQRUMA/CDMA is combined with the new code assignment scheme and the adaptive access permission probability (APP). Numerical examples show that the forced termination ratio of handoff calls is guaranteed to be much less than the blocking ratio of new calls for a seamless fast-handoff while proposed scheme provides QoS guarantee for each service class efficiently.     

Implementation of call admission control scheme in next generation mobile communication networks using particle swarm optimization and fuzzy logic systems

In the present and next generation wireless networks, cellular system remains the major method of telecommunication infrastructure. Since the characteristic of the resource constraint, call admission control is required to address the limited resource problem in wireless network. The call dropping probability and call blocking probability are the major performance metrics for quality of service (QoS) in wireless network. Many call admission control mechanisms have been proposed in the literature to decrease connection dropping probability for handoffs and new call blocking probability in cellular communications. In this paper, we proposed an adaptive call admission control and bandwidth reservation scheme using fuzzy logic control concept to reduce the forced termination probability of multimedia handoffs. Meanwhile, we adopt particle swarm optimization (PSO) technique to adjust the parameters of the membership functions in the proposed fuzzy logic systems. The simulation results show that the proposed scheme can achieve satisfactory performance when performance metrics are measured in terms of the forced termination probability for the handoffs, the call blocking probability for the new connections and bandwidth utilization.     

Complexity and design of QoS routing algorithms in wireless mesh networks

Quality of service (QoS) provisioning in wireless mesh networks (WMNs) is an open issue to support emerging multimedia services. In this paper, we study the problem of QoS provisioning in terms of end-to-end bandwidth allocation in WMNs. It is challenging due to interferences in the networks. We consider widely used interference models and show that except a few special cases, the problem of finding a feasible path is NP-complete under the models. We propose a k-shortest path based algorithmic framework to solve this problem. We also consider the problem of optimizing network performance by on-line dynamic routing, and adapt commonly used conventional QoS routing metrics to be used in WMNs. We find the optimal solutions for these problems through formulating them as optimization models. A model is developed to check the existence of a feasible path and another to find the optimal path for a demand; moreover, an on-line optimal QoS routing algorithm is developed. Comparing the algorithms implemented by the proposed framework with the optimization models shows that our solution can find existing feasible paths with high probability, efficiently optimizes path lengths, and has a comparable performance to the optimal QoS routing algorithm. Furthermore, our results show that contrary to wireline networks, minimizing resource consumption should be preferred over load distribution even in lightly loaded WMNs.     

一种有效的端到端延迟保证的资源预约策略

从把全局的延迟界QoS需求划分为各链路局部的QoS需求的角度出发,讨论了满足端到端的延迟界进行资源预约的限制条件,提出一种新的资源分配代价函数和按分配代价最小化的原则进行各链路资源分配的方法,并且给出了一种分布式的三遍搜索资源预约算法.其目标是使网络资源使用更均衡、更合理,以利于接纳更多的调用请求.同时,还介绍了将这种资源预约法应用于多点通信连接建立资源预约处理过程中的情况.最后,给出该资源预约法的模拟结果,显示了该方法的有效性.     

Optimization for adaptive bandwidth reservation in wireless multimedia networks

In future wireless multimedia networks, user mobility management for seamless connection regarding realtime multimedia applications is one of the most important problems. In this paper we propose an opportunity-cost concept-based approach for adaptive bandwidth reservation with admission control for handover calls utilizing network traffic information. Excessive reservation guarantees low blocking probability of handover calls at the cost of high blocking probability of new calls. According to our survey, however, it may degrade bandwidth utilization while no prioritization for handover admissions degrades quality of service (QoS) for ongoing calls. We consider both QoS assurance and bandwidth utilization in order to optimize the amount of bandwidth to reserve for handover admissions. We believe that our scheme could be utilized as a guideline for cost-effective radio resource allocation in mobile multimedia networks.