Optimal service schedule for CBR traffic in a high speed network

IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462) Pub Date : 1999-05-24 DOI:10.1109/ATM.1999.786903

N. Sai, Shankaramma Shivaprasad

{"title":"Optimal service schedule for CBR traffic in a high speed network","authors":"N. Sai, Shankaramma Shivaprasad","doi":"10.1109/ATM.1999.786903","DOIUrl":null,"url":null,"abstract":"This paper studies the optimal service schedule of CBR traffic when the server rate is modelled according to a Markov process. The CBR traffic is mixed with traffic of another session (interfering traffic) which might be either CBR or VBR (variable bit rate) or both. The CBR traffic can suffer a maximum delay of T. The scheduler must decide which session must be scheduled for service based on future server rate, estimated from the currently available information. The objective of this paper is to find an optimal time t/sub s/<T for switching the service from interfering traffic to CBR traffic. This switching of the scheduler from one traffic to another traffic takes into account the stochastic variation of the server rate. Three cases of variation of the source rate are considered, namely: (1) when the server rate is a constant; (2) when the server rate jumps randomly between two values; and (3) when the variation of server rate follows a diffusion process. In all three cases, this paper shows that there exists an optimal switching time t/sub s/ after which the low-priority CBR traffic can be scheduled for service. The maximum delay and the cell loss rate are determined.","PeriodicalId":266412,"journal":{"name":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1999-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATM.1999.786903","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

This paper studies the optimal service schedule of CBR traffic when the server rate is modelled according to a Markov process. The CBR traffic is mixed with traffic of another session (interfering traffic) which might be either CBR or VBR (variable bit rate) or both. The CBR traffic can suffer a maximum delay of T. The scheduler must decide which session must be scheduled for service based on future server rate, estimated from the currently available information. The objective of this paper is to find an optimal time t/sub s/

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

高速网络中CBR流量的最优业务调度

本文研究了基于马尔可夫过程的服务器速率模型下CBR流量的最优服务调度问题。CBR流量与另一个会话(干扰流量)的流量混合，该会话可能是CBR或VBR(可变比特率)，或者两者都是。CBR流量的最大延迟可能为t。调度器必须根据从当前可用信息估计的未来服务器速率来决定必须为服务调度哪个会话。本文的目标是找到从干扰业务切换到CBR业务的最优时间t/sub s/< t。调度器从一个流量切换到另一个流量时，考虑到服务器速率的随机变化。考虑源速率变化的三种情况，即:(1)当服务器速率为常数时;(2)服务器速率在两个值之间随机跳转;(3)服务器速率的变化遵循扩散过程。在这三种情况下，本文都证明了存在一个最优交换时间t/sub /，在此时间之后，低优先级的CBR业务可以被调度服务。确定最大时延和小区损失率。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

IEEE ATM Workshop '99 Proceedings (Cat. No. 99TH8462)

自引率

0.00%

发文量

期刊最新文献

Performance evaluation of multiplexing AAL2 voice traffic and TCP/IP data at the ATM cell level Interoperability control between heterogeneous ATCs in ATM public networks Performance analysis of an ATM-based local area network Native ATM interfaces in C and Java: implementation and experiences Testing techniques for next-generation IP networks