一种基于MPLS业务量工程的选路机制

分析了诸如受限路由等传统QoS路由机制业务震荡现象出现的原因给出了呼叫级QoS路由和分组级QoS路由的概念在此基础上提出了多标签QoS路由机制(MLR)作为一种分组级QoS路由机制多标签QoS路由机制不仅能够从理论上避免业务震荡现象的出现同时由于采用了业务量工程的业务均衡的思想从而提高了全网的业务性能指标仿真的数据结果可以在同时运行实时业务和非实时业务下得到     

功能性能分离的可信服务构件模型

为了向分布式实时嵌入式系统(DRES)的运行过程提供可信保障服务,方便上层应用程序的开发,提出了一种针对DRES的可信构件服务模型QUOCCM。该模型将系统功能实现与性能确保分离开,把应用程序的性能确保模块抽象成通用的服务确保构件,为运行于动态环境下的应用程序提供自适应的可信保障服务。该文以一个模拟实现的飞行控制系统验证了QUOCCM模型的可行性和灵活性。     

Reliable Ad Hoc Routing Based on Mobility Prediction

Reliability is a very important issue in Mobile Ad hoc NETworks (MANETs). Shortest paths are usually used to route packets in MANETs. However, a shortest path may fail quickly, because some of the wireless links along a shortest path may be broken shortly after the path is established due to mobility of mobile nodes. Rediscovering routes may result in substantial data loss and message exchange overhead. In this paper, we study reliable ad hoc routing in the urban environment. Specifically, we formulate and study two optimization problems. In the minimum Cost Duration-bounded Path (CDP) routing problem, we seek a minimum cost source to destination path with duration no less than a given threshold. In the maximum Duration Cost-bounded Path (DCP) routing problem, we seek a maximum duration source to destination path with cost no greater than a given threshold. We use a waypoint graph to model the working area of a MANET and present an offline algorithm to compute a duration prediction table for the given waypoint graph. An entry in the duration prediction table contains the guaranteed worst-case duration of the corresponding wireless link. We then present an efficient algorithm which computes a minimum cost duration-bounded path, using the information provided in the duration prediction table. We also present a heuristic algorithm for the DCP routing problem. In addition, we show that the proposed prediction and routing schemes can be easily applied for designing reliable ad hoc routing protocols. Simulation results show that our mobility prediction based routing algorithms lead to higher network throughput and longer average path duration, compared with the shortest path routing. This research was supported in part by ARO grant W911NF-04-1-0385 and NSF grant CCF-0431167. The information reported here does not reflect the position or the policy of the federal government.     

A New delay control method for real-time flows

This paper presents a novel control algorithm to decrease the worst-case delay bound for high rate homogeneous and heterogeneous real-time flows when the network traffic load becomes heavy. The algorithm is adaptive based on the instantaneous network situations. It employs a generalized form of traditional (σ,ρ) regulator called the generalized (σ,ρ,λ) regulator that operates like the (σ,ρ) regulator under the normal network traffic load situation, but provides more regulations for the heavy network traffic load situation. For a set of real-time flows, we can show that D _rg ≤D _g where D _rg and D _g are the worst-case delay bounds with the (σ,ρ,λ) regulator and the (σ,ρ) regulator respectively. More specifically, we have developed a set of formulas to set the parameters for the new regulator so as to reduce the worst-case delay bounds for the real-time flows. We can prove that there exists a threshold input rate ρ^* such that D _rg = D _g for ρ≤ρ^* and D _rg < D _g for ρ > ρ^*. When the average input rate of real-time flows is very high, the generalized regulator can effectively control the delay. The extensive experiment data match our theoretical results. The part of this paper has been appeared in The 23 ^rd IEEE International Conference on Distributed Computing Systems, 2003. The work is supported by CityU strategic grant Nos: 7001777 and 7001709 and CityU ARP Project No. 9610027. H. Wang was partially supported by National Natural Science Foundation of China (10471088, 60572126) and CityU strategic grant no. 7001709. Wanqing Tu is now with Department of Computer Science, The Hong Kong University of Science and Technology. Clear Water Bay, New Territories, Kowloon, Hong Kong.     

蚁群算法在QoS单播路由中的应用研究

QoS路由问题被证明是一个NP-C问题,而传统的路由算法很难有效地解决NP-C问题。该文提出了一种基于蚁群算法、用于解决带宽和时延约束问题的QoS单播路由算法,利用蚁群算法中蚂蚁通过信息素寻找最优路径的机制,并以网络吞吐量和数据报的平均时延等性能为最优的准则,来定义蚂蚁的转移概率、路由表和信息素更新方式,实现基于蚁群算法的路由选择算法.这种算法具有较强全局最优解搜索能力,较强的灵活性,以及潜在的并行性。     

无线通信网中的新型移动性模型

提出了无线蜂窝网中考虑突发事件影响的移动性模型,该模型包括了用户由于受到突发事件影响而改变其移动模式的情况。针对高、中、低三种截然不同的用户移动模式,根据理论分析提出了一种新型移动性模型,新模型能够较好地模拟现实生活里不同移动环境中人们的移动行为。研究了移动对与系统容量有关的各种系统性能参数的影响。该文的结论可用于在无线蜂窝网中充分利用用户的移动特性调整系统提供QoS保障所涉及的配置参数,并且动态地调整系统的切换呼叫请求的保留门限,以提高系统的性能、容量和无线资源的使用效率。     

云制造环境下基于本体和模糊QoS的供应商匹配方法

云制造环境下的服务匹配具有资源数量大、语义信息不对称、QoS多样化和模糊化的特点,同时企业有自主选择匹配结果的需求。为此,提出基于本体和模糊QoS聚类的三阶段供应商匹配模型。首先构建本体模型和供应商服务描述模型,运用语义本体既消除了信息的不对称性,又增加了语义信息的完整性。此外,对QoS的多属性信息进行三角模糊化处理,结合模糊偏好和优化的模糊C均值聚类（FCM）算法按需聚类,提高了收敛速度和精度,得出基于匹配度排序的结果集合。实例验证结果表明：本文匹配方法较传统方法有更高的适应性和查准率。     

支持Windows2000服务质量机制的多媒体会议系统

论述了实现Internet综合服务体系结构和Windows2000在体系结构及协议中支持Internet实时业务的QoS技术,使Windows2000可以支持远程会议、远程教育、VOD等多媒体服务。借助这些机制,设计出了基于IP QoS技术的多媒体桌式会议系统,详细分析了系统中媒体流的指标参数。     

基于RSM模型的端到端QoS管理系统

基于RSM模型构建了适合于IPv6网络的QoS管理系统架构,详细介绍了边界路由器和QoS管理器的功能模块和工作流程,研究了资源预留方案,并通过NS2仿真实验验证了RSM模型对高优先级通信流能确保交付,以及该系统有较好的可扩展和灵活性.