Routing and admission control of real-time channels

Two important aspects that any study of message communication has to address are routing and admission control. The routing problem seeks to find a route for a channel and admission control involves assessing the ability to meet the demands of a channel along the chosen route. Most efforts in the area of real-time communication have been directed, primarily towards the admission control problem, not many have been targeted rewards the routing problem. The authors show that these two problems are inter-related. They address these two problems in a general framework that can abstract many practical scenarios. They assume the use of an arbitrary dynamic/fixed priority link level scheduling, thereby increasing the utility of the derived results. Their approaches for both routing and admission control are based on extending a result we have derived in a different context, viz., task scalability. A simulation study, was performed to study the effectiveness of their approach in improving both utilization of the link and admissibility of channels