• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文OA文献 >Localized Quality of Service Routing Algorithms for Communication Networks. The Development and Performance Evaluation of Some New Localized Approaches to Providing Quality of Service Routing in Flat and Hierarchical Topologies for Computer Networks.
【2h】

Localized Quality of Service Routing Algorithms for Communication Networks. The Development and Performance Evaluation of Some New Localized Approaches to Providing Quality of Service Routing in Flat and Hierarchical Topologies for Computer Networks.

机译：通信网络的本地化服务质量路由算法。在计算机网络的平面和分层拓扑中提供服务质量路由的一些新的本地化方法的开发和性能评估。

页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Quality of Service (QoS) routing considered as one of the major components of the QoS framework in communication networks. The concept of QoS routing has emerged from the fact that routers direct traffic from source to destination, depending on data types, network constraints and requirements to achieve network performance efficiency. It has been introduced to administer, monitor and improve the performance of computer networks. Many QoS routing algorithms are used to maximize network performance by balancing traffic distributed over multiple paths. Its major components include bandwidth, delay, jitter, cost, and loss probability in order to measure the end users¿ requirements, optimize network resource usage and balance traffic load. The majority of existing QoS algorithms require the maintenance of the global network state information and use it to make routing decisions. The global QoS network state needs to be exchanged periodically among routers since the efficiency of a routing algorithm depends on the accuracy of link-state information. However, most of QoS routing algorithms suffer from scalability problems, because of the high communication overhead and the high computation effort associated with marinating and distributing the global state information to each node in the network.The goal of this thesis is to contribute to enhancing the scalability of QoS routing algorithms. Motivated by this, the thesis is focused on localized QoS routing that is proposed to achieve QoS guarantees and overcome the problems of using global network state information such as high communication overhead caused by frequent state information updates, inaccuracy of link-state information for large QoS state update intervals and the route oscillating due to the view of state information. Using such an approach, the source node makes its own routing decisions based on the information that is local to each node in the path. Localized QoS routing does not need the global network state to be exchanged among network nodes because it infers the network state and avoids all the problems associated with it, like high communication and processing overheads and oscillating behaviour. In localized QoS routing each source node is required to first determine a set of candidate paths to each possible destination.udIn this thesis we have developed localized QoS routing algorithms that select a path based on its quality to satisfy the connection requirements. In the first part of the thesis a localized routing algorithm has been developed that relies on the average residual bandwidth that each path can support to make routing decisions. In the second part of the thesis, we have developed a localized delay-based QoS routing (DBR) algorithm which relies on a delay constraint that each path satisfies to make routing decisions. We also modify credit-based routing (CBR) so that this uses delay instead of bandwidth. Finally, we have developed a localized QoS routing algorithm for routing in two levels of a hierarchal network and this relies on residual bandwidth to make routing decisions in a hierarchical network like the internet.udWe have compared the performance of the proposed localized routing algorithms with other localized and global QoS routing algorithms under different ranges of workloads, system parameters and network topologies. Simulation results have indicated that the proposed algorithms indeed outperform algorithms that use the basics of schemes that currently operate on the internet, even for a small update interval of link state. The proposed algorithms have also reduced the routing overhead significantly and utilize network resources efficiently.
机译：服务质量（QoS）路由被视为通信网络中QoS框架的主要组成部分之一。 QoS路由的概念源自以下事实：路由器根据数据类型，网络约束和实现网络性能效率的要求将流量从源引导到目的地。已引入它来管理，监视和改善计算机网络的性能。许多QoS路由算法用于通过平衡分布在多条路径上的流量来最大化网络性能。它的主要组件包括带宽，延迟，抖动，成本和丢失概率，以便衡量最终用户的需求，优化网络资源的使用并平衡流量负载。现有的大多数QoS算法都需要维护全局网络状态信息，并使用它来做出路由决策。由于路由算法的效率取决于链路状态信息的准确性，因此需要在路由器之间定期交换全局QoS网络状态。但是，由于将大量的全局状态信息分配和分配给网络中的每个节点，通信开销大，计算量大，因此大多数QoS路由算法都存在可伸缩性问题。 QoS路由算法的可扩展性。以此为出发点，本文重点研究了局部QoS路由，旨在实现QoS保证，克服使用全局网络状态信息的问题，如频繁更新状态信息导致通信开销大，大型QoS链路状态信息不准确等。状态更新间隔和由于状态信息的视图而引起的路由振荡。使用这种方法，源节点将根据路径中每个节点本地的信息做出自己的路由决策。本地化的QoS路由不需要在网络节点之间交换全局网络状态，因为它可以推断网络状态并避免了与之相关的所有问题，例如高通信和处理开销以及振荡行为。在本地化QoS路由中，要求每个源节点首先确定到每个可能目的地的一组候选路径。 ud本文中，我们开发了本地化QoS路由算法，该算法根据其质量选择一条路径以满足连接要求。在论文的第一部分，开发了一种局部路由算法，该算法依赖于每个路径可以支持的平均剩余带宽来做出路由决策。在论文的第二部分，我们开发了一种基于局部延迟的QoS路由（DBR）算法，该算法依赖于每个路径都满足的延迟约束来做出路由决策。我们还修改了基于信用的路由（CBR），以便它使用延迟而不是带宽。最后，我们开发了一种本地化QoS路由算法，用于在两个层次的层次网络中进行路由，并且它依赖于剩余带宽来在诸如Internet之类的分层网络中做出路由决策。 ud我们将拟议的本地化路由算法的性能与其他在不同工作负载范围，系统参数和网络拓扑范围内的本地和全局QoS路由算法。仿真结果表明，即使对于较小的链路状态更新间隔，所提出的算法的性能确实优于使用当前在互联网上运行的方案的基础的算法。所提出的算法还大大减少了路由开销，并有效地利用了网络资源。

著录项

  • 作者

    Alzahrani Ahmed S.;

  • 作者单位
  • 年度 2009
  • 总页数
  • 原文格式 PDF
  • 正文语种 en
  • 中图分类
  • 入库时间 2022-08-20 20:21:48

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号