Solving bandwidth and priority domination problems of DQDB metropolitan area networks

[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications Pub Date : 1992-06-14 DOI:10.1109/ICC.1992.268143

N.-F. Huang, S.-T. Sheu

{"title":"Solving bandwidth and priority domination problems of DQDB metropolitan area networks","authors":"N.-F. Huang, S.-T. Sheu","doi":"10.1109/ICC.1992.268143","DOIUrl":null,"url":null,"abstract":"The bandwidth domination problem (BDP) in the distributed queue dual bus (DQDB) medium access control (MAC) protocol could occur if the network bandwidth is dominated by a single node when it is active early and other nodes having heavy traffic demands are active later. The priority domination problem (PDP) is the problem that the network bandwidth may be dominated by an upstream node with lower priority when it is active early and other nodes with higher priorities are active later. To solve the BDP a mechanism is provided such that the bandwidth can be shared among all active nodes. To solve the PDP a mechanism is provided such that nodes with higher priority can capture all the bandwidth. The authors propose two adaptive algorithms to solve the BDP and a priority mechanism to solve the PDP. The adaptive algorithms and priority mechanism were evaluated by simulation. It is also shown that if the adaptive algorithms and priority mechanism are combined together, then the nodes with highest priority can use all the bandwidth and the bandwidth can be balanced among these nodes rapidly.<<ETX>>","PeriodicalId":170618,"journal":{"name":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1992.268143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

Abstract

The bandwidth domination problem (BDP) in the distributed queue dual bus (DQDB) medium access control (MAC) protocol could occur if the network bandwidth is dominated by a single node when it is active early and other nodes having heavy traffic demands are active later. The priority domination problem (PDP) is the problem that the network bandwidth may be dominated by an upstream node with lower priority when it is active early and other nodes with higher priorities are active later. To solve the BDP a mechanism is provided such that the bandwidth can be shared among all active nodes. To solve the PDP a mechanism is provided such that nodes with higher priority can capture all the bandwidth. The authors propose two adaptive algorithms to solve the BDP and a priority mechanism to solve the PDP. The adaptive algorithms and priority mechanism were evaluated by simulation. It is also shown that if the adaptive algorithms and priority mechanism are combined together, then the nodes with highest priority can use all the bandwidth and the bandwidth can be balanced among these nodes rapidly.<>

查看原文本刊更多论文

解决DQDB城域网的带宽和优先级控制问题

分布式队列双总线(DQDB)介质访问控制(MAC)协议中，如果网络带宽在一个节点较早活跃时被其控制，而其他有较大流量需求的节点活动较晚，就会出现带宽支配问题(BDP)。PDP (priority domination problem)是指网络带宽可能被较低优先级的上游节点在较早活跃时占据主导地位，而其他较高优先级节点较晚活跃的问题。为了解决BDP问题，提供了一种机制，使带宽可以在所有活动节点之间共享。为了解决PDP问题，提供了一种机制，使具有较高优先级的节点可以捕获所有带宽。作者提出了两种自适应算法来求解BDP，并提出了一种优先级机制来求解PDP。通过仿真对自适应算法和优先级机制进行了评价。结果表明，将自适应算法与优先级机制相结合，可以使优先级最高的节点占用所有带宽，并且可以快速地在这些节点之间实现带宽均衡。

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

求助全文

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

来源期刊

[Conference Record] SUPERCOMM/ICC '92 Discovering a New World of Communications

自引率

0.00%

发文量