• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Delay Constrained Subtree Homeomorphism Problem with Applications
【24h】

Delay Constrained Subtree Homeomorphism Problem with Applications

机译：时滞约束子树同胚问题及其应用

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

摘要

Virtual world and other collaborative applications are increasingly becoming popular among Internet users. In such applications, users interact with each other through digital entities or avatars. In order to preserve the user experience, it is important that certain Quality of Service (QoS) requirements (e.g., delay and bandwidth) are satisfied by the interactions. These QoS requirements are usually defined by the application designer. When applications with such QoS requirements are being deployed on a network of servers, an appropriate set of servers capable of satisfying the QoS constraints of the interactions must be identified. This identification process is nothing, but the subgraph homeomorphism problem. In this paper, we present polynomial-time solutions for a special case of this problem viz. subtree homeomorphism problem, wherein the guest and the host graphs are both trees. We also discuss generalizations of the subtree homeomorphism problem and present polynomial-time solutions.
机译：虚拟世界和其他协作应用程序在Internet用户中越来越受欢迎。在这样的应用中，用户通过数字实体或化身彼此交互。为了保留用户体验，交互必须满足某些服务质量（QoS）要求（例如，延迟和带宽），这一点很重要。这些QoS要求通常由应用程序设计人员定义。当具有此类QoS要求的应用程序部署在服务器网络上时，必须确定一组能够满足交互的QoS约束的服务器。该识别过程不过是子图同胚问题。在本文中，我们针对此问题的特殊情况提出多项式时间解。子树同胚问题，其中来宾图和主体图都是树。我们还将讨论子树同胚问题的一般化，并给出多项式时间解。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号