具有两个丢弃级别的共享内存优先级队列分析

Shlomi Bergida, Y. Shavitt
{"title":"具有两个丢弃级别的共享内存优先级队列分析","authors":"Shlomi Bergida, Y. Shavitt","doi":"10.1109/EEEI.2006.321079","DOIUrl":null,"url":null,"abstract":"Two rate SLAs become increasingly popular in today¿s Internet, allowing a customer to save money by paying one price for committed traffic and a much lower price for additional traffic which is not guaranteed. These type of SLAs are suggested for all types of traffic from best effort to QoS constraint applications. In access networks, where these SLAs are prevalent, shared memory switches is a common architecture. Thus, dimensioning and management of shared memory queues for multiple priorities each with two levels of guarantees becomes an interesting challenge. We present a simple analysis of a multipriority multi discard level system controlled by a buffer occupancy threshold policy aimed at assuring service level agree- ment compliance for conforming (i.e., committed) traffic, and performance maximization for non-conforming (i.e., excess) traffic. Our analysis shows how the different system parameters: total buffer size, threshold position, and offered load control performance for the committed and excess traffic. Our results allow assuring high service level agreement compliance for conforming traffic, and performance maximization for non-conforming traffic.","PeriodicalId":142814,"journal":{"name":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Analysis of Shared Memory Priority Queues with Two Discard Levels\",\"authors\":\"Shlomi Bergida, Y. Shavitt\",\"doi\":\"10.1109/EEEI.2006.321079\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two rate SLAs become increasingly popular in today¿s Internet, allowing a customer to save money by paying one price for committed traffic and a much lower price for additional traffic which is not guaranteed. These type of SLAs are suggested for all types of traffic from best effort to QoS constraint applications. In access networks, where these SLAs are prevalent, shared memory switches is a common architecture. Thus, dimensioning and management of shared memory queues for multiple priorities each with two levels of guarantees becomes an interesting challenge. We present a simple analysis of a multipriority multi discard level system controlled by a buffer occupancy threshold policy aimed at assuring service level agree- ment compliance for conforming (i.e., committed) traffic, and performance maximization for non-conforming (i.e., excess) traffic. Our analysis shows how the different system parameters: total buffer size, threshold position, and offered load control performance for the committed and excess traffic. Our results allow assuring high service level agreement compliance for conforming traffic, and performance maximization for non-conforming traffic.\",\"PeriodicalId\":142814,\"journal\":{\"name\":\"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EEEI.2006.321079\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE 24th Convention of Electrical & Electronics Engineers in Israel","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EEEI.2006.321079","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

摘要

双费率sla在当今的互联网中越来越流行,它允许客户为已承诺的流量支付一个价格,而为不能保证的额外流量支付更低的价格,从而节省资金。建议将这些类型的sla用于从最佳努力到QoS约束应用程序的所有类型的流量。在这些sla普遍存在的接入网络中,共享内存交换机是一种常见的体系结构。因此,对具有两级保证的多个优先级的共享内存队列进行维化和管理成为一项有趣的挑战。我们对一个由缓冲区占用阈值策略控制的多优先级多丢弃级系统进行了简单的分析,该策略旨在确保符合(即已承诺)流量的服务级别协议遵从性,以及不符合(即超额)流量的性能最大化。我们的分析显示了不同的系统参数:总的缓冲区大小、阈值位置,以及为已提交的和多余的流量提供的负载控制性能。我们的结果可以确保符合要求的流量符合高服务水平协议,以及不符合要求的流量的性能最大化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Analysis of Shared Memory Priority Queues with Two Discard Levels
Two rate SLAs become increasingly popular in today¿s Internet, allowing a customer to save money by paying one price for committed traffic and a much lower price for additional traffic which is not guaranteed. These type of SLAs are suggested for all types of traffic from best effort to QoS constraint applications. In access networks, where these SLAs are prevalent, shared memory switches is a common architecture. Thus, dimensioning and management of shared memory queues for multiple priorities each with two levels of guarantees becomes an interesting challenge. We present a simple analysis of a multipriority multi discard level system controlled by a buffer occupancy threshold policy aimed at assuring service level agree- ment compliance for conforming (i.e., committed) traffic, and performance maximization for non-conforming (i.e., excess) traffic. Our analysis shows how the different system parameters: total buffer size, threshold position, and offered load control performance for the committed and excess traffic. Our results allow assuring high service level agreement compliance for conforming traffic, and performance maximization for non-conforming traffic.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信