• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Multicast routing with QoS constraints.
【24h】

Multicast routing with QoS constraints.

机译：具有QoS约束的组播路由。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

As it was originally designed, the Internet or an IP-based network in general provides “best-effort” service which doesn't guarantee timely or actual delivery of data packets. While many traditional datagram applications still work well despite the unpredictability in service quality, predictable and controllable service quality is a necessity to effectively support emerging real-time applications for which there are growing interest and demand. Meanwhile, as the Internet evolves into a global commercial infrastructure, QoS support must become an integrated part of it. QoS provisioning involves almost all elements in a network system. One key component for QoS support is constraint-based routing, or the so-called QoS routing which can enable more effective and efficient QoS support by allowing dynamic route selection based on network resource availability and QoS requirements. IP multicast utilizes a tree structure to deliver data, and the new challenge imposed by QoS support is how to build multicast trees subject to QoS constraints.; This dissertation proposes and studies algorithms and strategies for QoS-constrained multicast routing. First we introduce an algebraic notation for QoS metrics, which not only simplifies problem formulation and solution presentation, but also helps us in developing our solutions. We also propose a family of “smart-forwarding”-based algorithms which enable fast, table-driven computation of QoS-constrained routes. We then propose a comprehensive set of algorithms and strategies for multicast. For single-source one-to-many type of multicast applications, we propose a receiver initiated joining mechanism to construct QoS-feasible multicast trees dynamically and incrementally. For many-to-many type of applications, we propose an algorithm to build bi-directional shared-trees. For inter-domain shared-tree QoS multicast, we propose a QoS information propagation mechanism and an alternative join point search strategy to address some limitations and the excessive overhead drawback of existing flooding-based strategies. For fast restoration of multicast connections in face of network node or link failure required by some applications, we propose a scheme based on a “dual-tree” structure in which a secondary tree for fault-tolerance purpose is built as a complement to the primary multicast tree. We conduct simulation studies to evaluate our algorithms and strategies and compare with other similar or related approaches, and we see improved or comparable performance in most cases.
机译：按照最初的设计，Internet或基于IP的网络通常会提供“尽力而为”的服务，这不能保证及时或实际地传送数据包。尽管尽管服务质量具有不可预测性，但许多传统的数据报应用程序仍然可以很好地运行，但是可预测和可控制的服务质量是有效支持不断增长的兴趣和需求的新兴实时应用程序的必要条件。同时，随着Internet向全球商业基础架构的发展，QoS支持必须成为其不可或缺的一部分。 QoS设置几乎涉及网络系统中的所有元素。 QoS支持的一个关键组件是基于约束的路由，即所谓的QoS路由，它可以通过允许基于网络资源可用性和QoS要求进行动态路由选择，从而实现更有效的QoS支持。 IP多播利用树结构来传递数据，而QoS支持所带来的新挑战是如何构建受QoS约束的多播树。本文提出并研究了QoS约束的组播路由算法和策略。首先，我们引入了QoS度量的代数表示法，它不仅简化了问题表述和解决方案表示，而且还帮助我们开发了解决方案。我们还提出了一系列基于“智能转发”的算法，这些算法可以实现表驱动的QoS受限路由的快速计算。然后，我们提出了一套全面的组播算法和策略。对于单源一对多类型的多播应用程序，我们提出了一种接收器启动的加入机制，以动态，增量地构造QoS可行的多播树。对于多对多类型的应用程序，我们提出了一种构建双向共享树的算法。对于域间共享树QoS多播，我们提出了QoS信息传播机制和替代的连接点搜索策略，以解决现有基于泛洪策略的某些限制和过度开销的缺点。为了在面对网络节点或某些应用程序所需的链路故障时快速恢复多播连接，我们提出了一种基于“双树”结构的方案，其中构建了一个用于容错目的的辅助树，作为对主要树的补充。多播树。我们进行仿真研究，以评估我们的算法和策略，并与其他类似或相关的方法进行比较，并且在大多数情况下，我们发现性能得到改善或可比。

著录项

  • 作者

    Fei, Aiguo.;

  • 作者单位

    University of California, Los Angeles.;

  • 授予单位 University of California, Los Angeles.;
  • 学科 Computer Science.
  • 学位 Ph.D.
  • 年度 2001
  • 页码 186 p.
  • 总页数 186
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 自动化技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号