{"title":"Distributed quality-of-service routing in high-speed networks based on selective probing","authors":"Shigang Chen, K. Nahrstedt","doi":"10.1109/LCN.1998.727649","DOIUrl":null,"url":null,"abstract":"We propose an integrated QoS routing framework based on selective probing for high-speed packet-switching networks. The framework is fully distributed and depends only on the local state maintained at every individual node. By using controlled diffusion computations, the framework captures the common messaging and computational structure of distributed QoS routing, and allows an efficient implementation due to its simplicity. Different distributed routing algorithms (DRAs) can be quickly developed by specifying only a few well-defined constraint-dependent parameters within the framework. Our simulation shows that the overhead of the proposed algorithms is stable and modest.","PeriodicalId":211490,"journal":{"name":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"112","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 23rd Annual Conference on Local Computer Networks. LCN'98 (Cat. No.98TB100260)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1998.727649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 112
Abstract
We propose an integrated QoS routing framework based on selective probing for high-speed packet-switching networks. The framework is fully distributed and depends only on the local state maintained at every individual node. By using controlled diffusion computations, the framework captures the common messaging and computational structure of distributed QoS routing, and allows an efficient implementation due to its simplicity. Different distributed routing algorithms (DRAs) can be quickly developed by specifying only a few well-defined constraint-dependent parameters within the framework. Our simulation shows that the overhead of the proposed algorithms is stable and modest.