{"title":"Dynamic Unattended Measurement Based Routing Algorithm for DiffServ architecture","authors":"M. Czarkowski, S. Kaczmarek","doi":"10.1109/NETWKS.2010.5624909","DOIUrl":null,"url":null,"abstract":"Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks. Presented algorithm DUMBRA, Dynamic Unattended Measurement Based Routing Algorithm allows using k-shortest path mechanism for streaming and elastic traffic classes. It has been verified many different traffic scenarios in many different network topologies by simulation that has been realized using Omnet++ simulation environment. It has been confirmed that for most of analyzed network topologies the algorithm gave the significant gain in the amount of serviced traffic via existing network resources.","PeriodicalId":202408,"journal":{"name":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2010.5624909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should apply to today's packet networks. Presented algorithm DUMBRA, Dynamic Unattended Measurement Based Routing Algorithm allows using k-shortest path mechanism for streaming and elastic traffic classes. It has been verified many different traffic scenarios in many different network topologies by simulation that has been realized using Omnet++ simulation environment. It has been confirmed that for most of analyzed network topologies the algorithm gave the significant gain in the amount of serviced traffic via existing network resources.