S. Krasser, Henry L. Owen, J. Grimminger, Hans-Peter Huth, J. Sokol
{"title":"Online Traffic Engineering and Connection Admission Control Based on Path Queue States","authors":"S. Krasser, Henry L. Owen, J. Grimminger, Hans-Peter Huth, J. Sokol","doi":"10.1109/SECON.2004.1287927","DOIUrl":null,"url":null,"abstract":"In this paper, we outline a new connection admission control and online traffic engineering framework for small networks using differentiated services. Decisions are made at the edge routers of the network. Multiple label switched paths are set up between each pair of edge routers. When a new connection arrives at an edge router, each path is evaluated to see whether it is able to carry the connection. Then, the best path of the remaining ones is picked. The evaluation of paths is based on state information gathered from the queues on each path. We show the results this scheme achieves based on simulations.","PeriodicalId":324953,"journal":{"name":"IEEE SoutheastCon, 2004. Proceedings.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE SoutheastCon, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.2004.1287927","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In this paper, we outline a new connection admission control and online traffic engineering framework for small networks using differentiated services. Decisions are made at the edge routers of the network. Multiple label switched paths are set up between each pair of edge routers. When a new connection arrives at an edge router, each path is evaluated to see whether it is able to carry the connection. Then, the best path of the remaining ones is picked. The evaluation of paths is based on state information gathered from the queues on each path. We show the results this scheme achieves based on simulations.