科研之友
微信
新浪微博
Facebook
分享链接
摘要
DiffServ (Differentiated service) model possesses excellent scalability, which makes it applicable in the future Internet. However, the scheme of DiffServ accompanies with a new problem. Since core routers in DiffServ networks do not classify individual user flows and only know their service classes, the QoS (Quality of service) of the user flow even with the highest priority, may be not deterministically guaranteed. This paper considers the problem of providing deterministic end-to-end delay guarantees in DiffServ networks. Firstly, a user flow';s delay upper bound in a DiffServ network is induced by the theoretical analyses. According to this result, an optimization programming is built to compute the bandwidth on all path links allocated for the corresponding service class. Based on the optimal solution to this programming, an admission control algorithm for guaranteeing delay bound of delay sensitive service class, ACD (Admission control in diffServ networks), is developed in this paper. Not only can it prevent the end-to-end delay of admitted user flows from violating the allowed upper bound, but have the scalability consistent with DiffServ model. Simulation results show that the performance of ACD algorithm is comparable with that of the similar algorithm in IntServ (Integrated service) networks despite no maintenance of per-flow state. Due to its efficiency and scalability, ACD algorithm can support resource management in DiffServ networks.
- 出版日期2006-7
- 单位西安电子科技大学
