首页> 外文OA文献 >Topology-Based Optimization of Maximal Sustainable Throughput in a Latency-Insensitive System
【2h】

Topology-Based Optimization of Maximal Sustainable Throughput in a Latency-Insensitive System

机译:延迟不敏感的系统中基于拓扑的最大可持续吞吐量优化

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

We consider the problem of optimizing the performance of a latency-insensitive system (LIS) where the addition of backpressure has caused throughput degradation. Previous works have addressed the problem of LIS performance in different ways. In particular, the insertion of relay stations and the sizing of the input queues in the shells are the two main optimization techniques that have been proposed. We provide a unifying framework for this problem by outlining which approaches work for different system topologies, and highlighting counterexamples where some solutions do not work. We also observe that in the most difficult class of topologies, instances with the greatest throughput degradation are typically very amenable to simplifications. The contributions of this paper include a characterization of topologies that maintain optimal throughput with fixed-size queues and a heuristic for sizing queues that produces solutions close to optimal in a fraction of the time.
机译:我们考虑优化对时延不敏感的系统(LIS)的性能的问题,在该系统中,背压的增加已导致吞吐量下降。先前的工作以不同的方式解决了LIS性能的问题。特别是,中继站的插入和外壳中输入队列的大小是已提出的两种主要的优化技术。通过概述适用于不同系统拓扑的方法,并突出显示某些解决方案不起作用的反例,我们为该问题提供了一个统一的框架。我们还观察到,在最困难的拓扑类别中,吞吐量下降最大的实例通常非常易于简化。本文的贡献包括:通过固定大小的队列来维持最佳吞吐量的拓扑结构的表征;以及用于确定队列大小的启发式方法,该方法可在短时间内产生接近最佳值的解决方案。

著录项

  • 作者单位
  • 年度 2007
  • 总页数
  • 原文格式 PDF
  • 正文语种 {"code":"en","name":"English","id":9}
  • 中图分类

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号