{"title":"Novel traffic engineering scheme based upon application flows for QoS enhancement","authors":"M. Hashimoto, A. Fukuda, K. Yukimatsu","doi":"10.1109/ITNEWS.2008.4488148","DOIUrl":null,"url":null,"abstract":"This paper proposes a traffic control scheme that uses application flows as identified by application information in the packets being transferred. The proposal increases flexibility in terms of IP packet routing. First, it is confirmed that individual application flows can be routed through their own minimum-cost paths. Cost is determined, for each flow, from one or more QoS parameters, for example, delay and availability. Next, it facilitates traffic engineering, namely the efficient utilization of network resources. In this situation, one source-destination traffic demand is satisfied by setting one or more flows as needed for traffic grooming. Numerical results show that the proposal allows the network to accommodate more traffic even if the cost-routed traffic create a bottleneck link.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNEWS.2008.4488148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
This paper proposes a traffic control scheme that uses application flows as identified by application information in the packets being transferred. The proposal increases flexibility in terms of IP packet routing. First, it is confirmed that individual application flows can be routed through their own minimum-cost paths. Cost is determined, for each flow, from one or more QoS parameters, for example, delay and availability. Next, it facilitates traffic engineering, namely the efficient utilization of network resources. In this situation, one source-destination traffic demand is satisfied by setting one or more flows as needed for traffic grooming. Numerical results show that the proposal allows the network to accommodate more traffic even if the cost-routed traffic create a bottleneck link.