Providing absolute differentiated services for real-timeapplications in static-priority scheduling networks
Shengquan Wang; Dong Xuan; Riccardo Bettati; Wei Zhao
INFOCOM 2001. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings. IEEE
Volume 2, Issue , 2001 Page(s):669 - 678 vol.2
Digital Object Identifier 10.1109/INFCOM.2001.916255
Summary:We propose and analyze a methodology for providing absolute
differentiated services for real-time applications in networks that use
static-priority schedulers. We extend previous work on worst-case delay
analysis and develop a method that can be used to derive delay bounds
without specific information on flow population. With this new method,
we are able to successfully employ a utilization-based admission control
approach for flow admission. This approach does not require explicit
delay computation at admission time and hence is scalable to large
systems. We assume the underlying network to use static-priority
schedulers. We design and analyze several priority assignment
algorithms, and investigate their ability to achieve higher utilization
bounds. Traditionally, schedulers in differentiated services networks
assign priorities on a class-by-class basis, with the same priority for
each class on each router. We show that relaxing this requirement, that
is, allowing different routers to assign different priorities to
classes, achieves significantly higher utilization bounds
View citation and abstract |
Cart
