区分服务模型中的一种动态队列管理算法

在对区分服务模型和RED算法进行分析的基础上，提出了一种基于RED算法的动态队列管理算法。实验结果证明，我们提出的算法在不损害高优先级数据流量的情况下，能较好地实时调整各优先级的门限值，减少网络资源的消耗，提高网络资源的利用率。     

一种支持QoS的多播路由算法

对支持ＱｏＳ（服务质量）的多播路由技术作了较详细的分析,提出了一种后向搜索最小生成树算法作为有实时笥要求的多播业务的路由算法,并模拟分析了该算法的优越性。     

一种改进的多簇头路由协议

传统分簇路由协议轮叫调度算法(RRCH)只进行一次簇的建立过程,当需要更换簇头时,在每个簇内选举一个剩余能量最高的成员节点作为下一轮的簇头。但是每轮只为每个簇选择一个簇头,且可能分布在簇的边缘,这将导致簇头节点能量浪费。提出了一种多簇头路由算法(MCHB),其主要思想是在簇的形成阶段为每个簇中选择2个簇头,由这2个簇头承担能耗,防止了单一簇头节点过早死亡。算法仿真结果表明,与传统算法RRCH相比,改进后的多簇头路由协议延长了约30%的网络寿命,大大降低了能耗。     

一种基于改进蚁群算法的选播路由算法

为了在网络负载较大的情况下实现多目标多路径的选播路由,该文根据蚂蚁寻径与选播路由的相似性,提出了一种基于改进蚁群算法的选播路由算法。在运用数据包传输的历史信息来模拟路径信息素的基础上,增加了目标地址泛洪负载信息来模拟食物气味散发的过程,使得各个节点可以获得服务器和链路的最新信息。节点根据路径上的信息素、食物的气味以及链路的可见度等综合生成概率表,作为后继蚂蚁路径选择的依据。运用NS-2对该算法进行仿真,测试结果表明它可以减少传输时延,降低服务器负载的波动幅度,实现链路的负载均衡,增加网络的容量,提高选播服务的可扩展性。     

一种改进的CSCW组播通信路由算法

组播通信路由算法是CSCW重要研究领域。文章提出了剪枝型改进算法BCSPST，在一定程度上避免了原算法分枝节点分组复制集中而易发生负载过重或拥塞的缺点，同时证明了BCSPST算法的时间复杂度。     

一种基于SDN的改进路由算法的研究

针对传统互联网调度无法满足工业业务QoS(Quality of Service)需求的问题,文中在基于SDN的新型网络架构上提出了一种改进的路由算法,并对其中使用的Floodlight控制器模块进行扩展与修改。根据信息收集单元模块提供的带宽信息与链路发现模块提供的网络拓扑信息,路由计算模块对进入的数据流计算出更优化的最短路径。仿真实验结果表明,改进后的路由算法有效降低了数据的传输时延,增强了网络的稳定性。     

一种改进的Steiner树启发式算法

最小Steiner树问题是NP完全问题，关于Steiner问题的启发式算法的研究具有重要理论和实际意义。本文在MPH算法基础上，对于经过某些关键节点的短路径优先考虑，提出了KBMPH算法，从而实现更多链路的共享。在随机网络上的仿真结果表明，极大多数情况下，在准Steiner树的网络费用KBMPH算法优于MPH算法，KBMPH算法的复杂度为O（n^3）。     

一种改进的蚁群WSN路由算法

针对能量控制和拥塞控制在无线传感器网络路由上的特殊要求,利用蚁群算法(Ant Colony System,ACS)对路由中最短路径加速收敛。为了促使网络节点能量消耗相对均衡,提出一种改进的蚁群路由算法。该算法将多蚁群挥发的信息素与网络节点剩余能量结合成算法控制因子,并且引入了多蚁群竞争机制来避免单一收敛。此算法能有效地控制网络拥塞,并使网络节点能量消耗相对均衡,延长了整个网络的生命周期,实现了高效路由与能量消耗的较优权衡。最后通过Matlab仿真实验验证了该方法的可行性,并给出实验结果。     

基于蚂蚁算法的分布式QoS路由选择算法

本文基于蚂蚁的自组织能力描述了一种新的分布动态路由选择方法,针对当前通信网中存在的服务质量问题提出了QoS保证的分布式路由选择算法（DQRA）。DRQA能以并行的方式解决网络中呼叫的时延和带宽分配问题,避免了NP－完全问题,算法简单,易于实现,能有效地解决大型网络的负载平衡问题,本文选择了OPNET仿真环境对网络进行实时仿真,通过和最小代价算法的比较,进一步表明了算法的有效性。     

一种四阶段可恢复QoS路由机制

容错性和可恢复能力被认为是QoS(服务质量)路由的又一重要方面。针对QoS路由的可恢复性问题，提出了一种使用增强Hello协议的以四阶段为基础的可恢复QoS路由处理机制，并详细描述了每一阶段涉及的关键问题．同时，还对此机制进行了仿真试验，以验证其可行性、最后得出结论：此机制的使用可以为通信网络增加一定的智能性，     

A Composite Service Provision Method Based on Novel Node Model in Mobile Ad Hoc Networks

Composite service provision in mobile ad hoc networks encounters great challenges and its success rate is not satisfactory because the nodes＇ locations are dynamic and the nodes maybe unavailable at any time. Composite service is built through the service composition. In mobile ad hoc networks, the factors influencing the success rate of service composition are mainly the number of nodes and the time spent for the composition. The node＇s failure probability is proportional to the length of time the node exist in the networks. In order to improve the success rate of service composition, we take several measures. First, we split the service requirement into several segments and cluster the nodes, so that the nodes＇ waiting time for service composition can be reduced. Second, we propose a new node model of ＂one node contains multiple services＂ in mobile ad hoc networks. Using this type of nodes model, the number of nodes required for service composition can be reduced. These means can increase the success rate of service composition.     

非实时业务下认知网络的频谱共享

根据某种特定业务的QoS要求制定相应的频谱共享策略,可以在这种情况下提高系统的频谱利用率,增加用户平均收益。对非实时业务下的认知网络的频谱共享策略进行了研究,考虑各非授权用户业务量和信道质量对系统频谱效率的影响,提出了一种非实时业务专用的NRT-dedicate频谱共享算法。仿真结果表明,在非实时业务情况下,该算法可以获得比通用业务的频谱共享算法的频谱利用率。     

A Comprehensive Service Discovery Solution for Mobile Ad Hoc Networks

Service discovery is an integral part of constructing self-configuring Mobile Ad Hoc Networks (MANETs). While several service discovery protocols have been developed, most of them are designed for infrastructure-based networks and thus not suitable to be used in MANETs. Due the volatile nature of MANET, service discovery protocols designed for MANETs often suffer from problems. Firstly, they have limited scalability due to the extensive use of broadcast communication. Secondly, they usually lack context-aware selection mechanisms and feature only reduced interaction standards. This paper proposes a network layer supported comprehensive service discovery solution that addresses the above issues and provides a solution in two parts. First it discusses a location-aware network layer routing protocol that groups mobile nodes into clusters while a gateway in each cluster is responsible for routing. Secondly, this paper proposes a service discovery protocol that utilizes directories for service discovery that interact with lower network layer gateway configurations. In this architecture, gateways are also used as directories for service discovery to improve performance. In doing so, we improve the system’s overall efficiency by eliminating the use of complex graph-based algorithms for maintaining clusters and establishing virtual backbones. Furthermore, this service discovery solution includes an agent-based context-aware service selection, and provides standard mechanisms for different types of service interaction. Jerry Tyan is a graduate student in the Department of Computing and Information Science at the University of Guelph in Guelph, Canada. Jerry holds a B.Sc. in Computer Science from Simon Fraser University in Vancouver, Canada. His research interests are in the area of service discovery protocols for mobile ad hoc networks. Qusay H. Mahmoud is an Assistant Professor in the Department of Computing and Information Science at the University of Guelph, and Associate Chair of the Distributed Computing and Wireless & Telecommunications Systems Technology program at the University of Guelph-Humber in Toronto, Canada. He received a B.Sc. in Data Analysis and an M.Sc. in Computer Science, both from the University of New Brunswick (Canada), and a Ph.D. in Computer Science from Middlesex University (UK). Dr. Mahmoud has published dozens of research papers and two books. Also, he has organized several research events, edited their proceedings, and presented tutorials at several international conferences worldwide. His research interests include wireless computing, agent technology, service discovery protocols, and Web-based systems. He is a member of the ACM and the IEEE Computer Society.This revised version was published online in August 2005 with a corrected cover date.     

A Limited Deflection Routing Algorithm Based on Burst Loss Threshold in OBS Networks

1 Introduction The increase in the demand of transport capacity duetothe explosive growth of the Internet IP-based traffichas fueled the development of high-speed transmissionsystems andthe emergence of Wavelength Division Mul-tiplexing ( WDM) technology[1].Soin the near future ,it will be possible to support hundreds of wavelengths ofseveral Gigabit/s each. A new approach called OpticalBurst Switching (OBS)[2]that combines the best of op-tical circuit switching and optical packet switch…     

A Novel Routing Protocol for Supporting QoS for Ad Hoc Mobile Wireless Networks

The main purposes of this article are to lessen the influence of the fastchanging network topology, rapidly varying bandwidth information, and the increasing size of routing tables onquality of service routing. Based on DSDV (Destination-Sequenced Distance-Vector) routing protocol formaintaining up-to-date routing information, the related research has to update routing tables when networktopology changes; moreover, the routing tables must be updated periodically even though the networktopology has not changed. To put emphasis on QoS routing, they also have to exchange routing tables by thetime of bandwidth information changes. Furthermore, the size of routing tables increases with the numberof mobile nodes; therefore, the precious wireless bandwidth is wasted on transmitting the large-scalerouting tables. In this article, we propose an on-demand-based QoS routing protocol to mitigate theseproblems and to achieve the QoS requirement. The goal of this article is to discover an optimal routewith minimum time delay for transmitting real-time data from a source node hop by hop to adestination node under some predefined constraints. Our contributions are as follows: our researchprovides a rigorous bandwidth definition and bandwidth application, a broad view of bandwidth calculationand reservation, minimizing the size of control packets and the number of control packet transmissions,and an efficient QoS routing protocol.     

Multimedia Service Discrimination Based on Fair Resource Allocation Using Bargaining Solutions

We deal with a resource allocation problem for multimedia service discrimination in wireless networks. We assume that a service provider allocates network resources to users who can choose and access one of the discriminated services. To express the rational service selection of users, the utility function of users is devised to reflect both service quality and cost. Regarding the utility function of a service provider, total profit and efficiency of resource usage have been considered. The proposed service discrimination framework is composed of two game models. An outer model is a repeated Stackelberg game between a service provider and a user group, while an inner model is a service selection game among users, which is solved by adopting the Kalai‐Smorodinsky bargaining solution. Through simulation experiments, we compare the proposed framework with existing resource allocation methods according to user cost sensitivity. The proposed framework performed better than existing frameworks in terms of total profit and fairness.     

稳定服务质量水平的动态路由算法

本文介绍判定服务质量状态的质量水平涨落函数,以及与用户需求和服务资源变化相适 应的动态质量路由算法。仿真实验表明该算法具有稳定服务质量、平衡网络负载等特点。     

基于多项服务质量的域间路由方案

针对广域网中节点数量多,范围广的特点,提出了一种将节点划分成域,并以带宽、时延作为服务质量（ＱｏＳ）指标在域间寻找可行路径的路由方案。该方案由两个算法组成,它们在把真实网络映射成为具有分级结构图的同时给出了满足服务质量要求的可行路径。     

一种改进的静态资源优化利用路由算法

提出了一种基于遗传算法的静态资源优化利用路由算法,该算法在考虑网络资源消耗的基础上,以网络负载平衡为优化目标,从而达到合理利用网络资源,增强网络生存性的目的。最后给出了仿真实验结果,并对结果进行了分析。     

一种基于共享路由的传感器网络能量感知服务选择算法(英文)

This paper presents a novel energy-aware algorithm for service composition based on sharing routes in Wireless Sensor Networks (WSNs). The method integrates the resource of the overlapping WSNs to a virtual resource pool in the execution cycles of the workflow. This approach chooses the suitable service instances according to the current execution environment and user requirements with minimum energy consumption. Finally, the performance of sharing routes service composition selection in WSNs has been evalu...