• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>2011 Seventh ACM/IEEE Symposium on Architectures for Networking and Communications Systems >FIFO Service with Differentiated Queueing
【24h】

FIFO Service with Differentiated Queueing

机译：区分排队的FIFO服务

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

摘要

This paper presents a novel approach to minimally invasive service differentiation in packet-switched networks. Instead of actively managing service allocation, a simple differentiated queueing algorithm provides traffic classes with essentially the same best-effort service that would result from plain FIFO service using a single queue for all traffic. However, each class is served from a separate virtual queue, which is configured with an individual deterministic delay bound that is enforced in the presence of dynamically varying packet arrival rates. The main advantage of such a scheme for service differentiation is administrative simplicity, because it only needs minimal configuration by a network operator and does not necessarily require control plane functionality. Further, it does not inherently prefer some traffic classes over others and thus satisfies even the most radical definitions of network neutrality. In the paper, the basic approach is motivated with the help of various use case scenarios. A fairly simple and efficient algorithm is presented to implement the differentiated queueing scheme. Finally, a number of simulation experiments and results are shown that confirm the intuitive functionality of the algorithm.
机译：本文提出了一种在分组交换网络中微创服务区分的新颖方法。代替主动管理服务分配，一种简单的差异排队算法为流量类别提供了与尽力而为服务相同的尽力而为服务，这与使用单个队列处理所有流量的普通FIFO服务会产生。但是，每个类均由单独的虚拟队列提供服务，该虚拟队列配置有单独的确定性延迟范围，该延迟范围在动态变化的数据包到达速率的情况下强制执行。这种用于服务区分的方案的主要优点是管理简便，因为它仅需要网络运营商的最少配置，并且不一定需要控制平面功能。此外，它并不是天生就喜欢某些流量类别而不是其他流量类别，因此甚至可以满足网络中立性的最根本定义。在本文中，基本方法是在各种用例场景的帮助下进行的。提出了一种相当简单而有效的算法来实现差分排队方案。最后，显示了许多仿真实验和结果，证实了该算法的直观功能。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号