通过路由功能实现比例差分服务

16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06) Pub Date : 2006-02-27 DOI:10.1109/CONIELECOMP.2006.49

R. Salles, E. A. Santos

{"title":"通过路由功能实现比例差分服务","authors":"R. Salles, E. A. Santos","doi":"10.1109/CONIELECOMP.2006.49","DOIUrl":null,"url":null,"abstract":"This work studies the implementation of Proportional Differentiated Services (PDS) under a routing perspective. Network nodes are simply modeled as priority queuing systems so that there is no need to use special scheduling algorithms on routers to enforce PDS. Instead, the routing function is the one responsible to distribute trafic loads in such a way to achieve PDS goals. Our proposal is based on standard Dijkstra 's algorithms and simulation results conJim a good peformance of our approach.","PeriodicalId":371526,"journal":{"name":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Realizing Proportional DiffServ through the Routing Function\",\"authors\":\"R. Salles, E. A. Santos\",\"doi\":\"10.1109/CONIELECOMP.2006.49\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work studies the implementation of Proportional Differentiated Services (PDS) under a routing perspective. Network nodes are simply modeled as priority queuing systems so that there is no need to use special scheduling algorithms on routers to enforce PDS. Instead, the routing function is the one responsible to distribute trafic loads in such a way to achieve PDS goals. Our proposal is based on standard Dijkstra 's algorithms and simulation results conJim a good peformance of our approach.\",\"PeriodicalId\":371526,\"journal\":{\"name\":\"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONIELECOMP.2006.49\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONIELECOMP.2006.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文从路由的角度研究了比例差异化服务(PDS)的实现。网络节点被简单地建模为优先级排队系统，因此不需要在路由器上使用特殊的调度算法来执行PDS。相反，路由功能是负责以这种方式分配流量负载以实现PDS目标的功能。我们的方案基于标准的Dijkstra算法，仿真结果表明我们的方法具有良好的性能。

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

查看原文本刊更多论文

Realizing Proportional DiffServ through the Routing Function

This work studies the implementation of Proportional Differentiated Services (PDS) under a routing perspective. Network nodes are simply modeled as priority queuing systems so that there is no need to use special scheduling algorithms on routers to enforce PDS. Instead, the routing function is the one responsible to distribute trafic loads in such a way to achieve PDS goals. Our proposal is based on standard Dijkstra 's algorithms and simulation results conJim a good peformance of our approach.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

16th International Conference on Electronics, Communications and Computers (CONIELECOMP'06)

自引率

0.00%

发文量