{"title":"A real-time call admission control algorithm in high-speed networks","authors":"Shanzeng Guo, N. Georganas","doi":"10.1109/ICC.1995.525181","DOIUrl":null,"url":null,"abstract":"A real-time call admission control algorithm is developed for admitting real time traffic streams with quality of service (QoS) constraints in high-speed networks operating in a packet-switched mode under a fixed routing strategy. The theory developed is based on a calculus for network delay at each network node with general traffic arrival process at the network edge. The authors give the necessary and sufficient conditions for the schedulability of real-time connections at each network node under non-preemptive earliest-due date scheduling policy for deterministic QoS guarantees. These necessary and sufficient conditions form the mathematical basis for the deterministic QoS guarantees in real-time communication services. The manner in which the end-to-end delay bound is to be divided into local delay bounds which together satisfy the end-to-end QoS requirements is finally proposed.","PeriodicalId":241383,"journal":{"name":"Proceedings IEEE International Conference on Communications ICC '95","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Communications ICC '95","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1995.525181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
A real-time call admission control algorithm is developed for admitting real time traffic streams with quality of service (QoS) constraints in high-speed networks operating in a packet-switched mode under a fixed routing strategy. The theory developed is based on a calculus for network delay at each network node with general traffic arrival process at the network edge. The authors give the necessary and sufficient conditions for the schedulability of real-time connections at each network node under non-preemptive earliest-due date scheduling policy for deterministic QoS guarantees. These necessary and sufficient conditions form the mathematical basis for the deterministic QoS guarantees in real-time communication services. The manner in which the end-to-end delay bound is to be divided into local delay bounds which together satisfy the end-to-end QoS requirements is finally proposed.