Localized QoS routing and admission control: Performance evaluation

2009 International Conference on Innovations in Information Technology (IIT) Pub Date : 2009-12-15 DOI:10.1109/IIT.2009.5413369

A. H. Mohammad, M. E. Woodward

{"title":"Localized QoS routing and admission control: Performance evaluation","authors":"A. H. Mohammad, M. E. Woodward","doi":"10.1109/IIT.2009.5413369","DOIUrl":null,"url":null,"abstract":"Localized Quality of Service (QoS) routing has been recently proposed for supporting the requirements of multimedia applications and satisfying QoS constraints. Localized algorithms avoid the problems associated with the maintenance of global network state by using statistics of flow blocking probabilities. Using local information for routing avoids the overheads of global information with other nodes. However, localized QoS routing algorithms perform routing decision based on information updated from path request to path request. This paper proposes to tackle a combined localized routing and admission control in order to avoid congestion. We introduce a Congestion Avoidance Routing algorithm (CAR) in localized QoS routing which make a decision of routing in each connection request using an admission control to route traffic away from congestion. Simulations of various network topologies are used to illustrate the performance of the CAR. We compare the performance of the CAR algorithm against the Credit Based Routing (CBR) algorithm and the Quality Based Routing (QBR) under various ranges of traffic loads.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Innovations in Information Technology (IIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIT.2009.5413369","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

Abstract

Localized Quality of Service (QoS) routing has been recently proposed for supporting the requirements of multimedia applications and satisfying QoS constraints. Localized algorithms avoid the problems associated with the maintenance of global network state by using statistics of flow blocking probabilities. Using local information for routing avoids the overheads of global information with other nodes. However, localized QoS routing algorithms perform routing decision based on information updated from path request to path request. This paper proposes to tackle a combined localized routing and admission control in order to avoid congestion. We introduce a Congestion Avoidance Routing algorithm (CAR) in localized QoS routing which make a decision of routing in each connection request using an admission control to route traffic away from congestion. Simulations of various network topologies are used to illustrate the performance of the CAR. We compare the performance of the CAR algorithm against the Credit Based Routing (CBR) algorithm and the Quality Based Routing (QBR) under various ranges of traffic loads.

查看原文本刊更多论文

本地化QoS路由和准入控制:性能评估

为了支持多媒体应用的需求和满足QoS约束，最近提出了本地化服务质量(QoS)路由。局部化算法利用流阻塞概率的统计信息，避免了维护全局网络状态的问题。使用本地信息进行路由可以避免使用其他节点的全局信息带来的开销。然而，本地化的QoS路由算法根据从路径请求到路径请求的更新信息执行路由决策。为了避免拥塞，本文提出了一种结合局部路由和准入控制的方法。本文在局部QoS路由中引入了一种拥塞避免路由算法(CAR)，该算法利用允许控制对每个连接请求进行路由决策，使流量远离拥塞。各种网络拓扑的仿真被用来说明CAR的性能。我们比较了CAR算法与基于信用的路由(CBR)算法和基于质量的路由(QBR)算法在不同流量负载范围下的性能。

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

求助全文

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

来源期刊

2009 International Conference on Innovations in Information Technology (IIT)

自引率

0.00%

发文量