Performance of bus allocation policies for an ATM switch under bursty arrivals and correlated destinations

First IEEE Symposium on Global Data Networking Pub Date : 1993-12-12 DOI:10.1109/GDN.1993.336588

A. Zaghloul, H. Perros, I. Viniotis

{"title":"Performance of bus allocation policies for an ATM switch under bursty arrivals and correlated destinations","authors":"A. Zaghloul, H. Perros, I. Viniotis","doi":"10.1109/GDN.1993.336588","DOIUrl":null,"url":null,"abstract":"Studies, via simulation, the performance of different bus allocation policies for a generic shared-medium ATM switch with input and output queueing. The policies differ in the amount of information used by the bus arbitrator to decide which input queue to serve next. Classical polling systems (e.g. Round-Robin) consider only the state of the input queues. This may waste bus bandwidth on cells that are destined to output queues which are full. The present authors consider a range of bus service policies that are based on the state of the input queues, or the state of both the input and the output queues. The performance of the switch is analyzed under realistic system characteristics such as bursty traffic, limited buffer size, asymmetric load conditions, and nonuniform destinations. Input traffic is modelled by an interrupted Bernoulli process (IBP). Furthermore, it is assumed that the destinations of the arriving cells within the same burst are correlated. Two types of destination correlations are introduced and their effect on the performance of the switch is analyzed. The performance measures considered are: cell loss probability, and mean cell delay.<<ETX>>","PeriodicalId":206154,"journal":{"name":"First IEEE Symposium on Global Data Networking","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First IEEE Symposium on Global Data Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GDN.1993.336588","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

Abstract

Studies, via simulation, the performance of different bus allocation policies for a generic shared-medium ATM switch with input and output queueing. The policies differ in the amount of information used by the bus arbitrator to decide which input queue to serve next. Classical polling systems (e.g. Round-Robin) consider only the state of the input queues. This may waste bus bandwidth on cells that are destined to output queues which are full. The present authors consider a range of bus service policies that are based on the state of the input queues, or the state of both the input and the output queues. The performance of the switch is analyzed under realistic system characteristics such as bursty traffic, limited buffer size, asymmetric load conditions, and nonuniform destinations. Input traffic is modelled by an interrupted Bernoulli process (IBP). Furthermore, it is assumed that the destinations of the arriving cells within the same burst are correlated. Two types of destination correlations are introduced and their effect on the performance of the switch is analyzed. The performance measures considered are: cell loss probability, and mean cell delay.<>

查看原文本刊更多论文

突发到达和相关目的地情况下ATM交换机总线分配策略的性能

通过仿真研究了具有输入输出队列的通用共享介质ATM交换机的不同总线分配策略的性能。这些策略的不同之处在于总线仲裁器决定下一个要服务哪个输入队列所使用的信息量。经典的轮询系统(例如轮询)只考虑输入队列的状态。这可能会在注定要输出已满队列的单元上浪费总线带宽。本文作者考虑了一系列总线服务策略，这些策略基于输入队列的状态，或者输入和输出队列的状态。在突发流量、有限缓冲区大小、非对称负载条件和非均匀目的地等实际系统特性下，分析了交换机的性能。输入流量采用中断伯努利过程(IBP)建模。此外，假设在同一脉冲内到达的细胞的目的地是相关的。介绍了两种类型的目标关联，并分析了它们对交换机性能的影响。考虑的性能指标是:单元丢失概率和平均单元延迟。

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

求助全文

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

来源期刊

First IEEE Symposium on Global Data Networking

自引率

0.00%

发文量