Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
Abstract
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
arrow_leftView TOC
Email/Printer Friendly Format  
 

Response time guarantees for ATM-networked control systems

Hansson, H.   Sjodin, M.  
Dept. of Comput. Syst., Uppsala Univ.;

This paper appears in: Factory Communication Systems, 1997. Proceedings. 1997 IEEE International Workshop on
Publication Date: 1-3 Oct 1997
On page(s): 213-222
Meeting Date: 10/01/1997 - 10/03/1997
Location: Barcelona, Spain
ISBN: 0-7803-4182-1
References Cited: 24
INSPEC Accession Number: 5767778
Digital Object Identifier: 10.1109/WFCS.1997.634301
Posted online: 2002-08-06 21:09:13.0

Abstract
We present the Response-Time Analysis (RTA) method for providing real time guarantees in asynchronous transfer mode (ATM) communication networks, and evaluates its suitability for use in hard real time factory type environments. RTA provides an analysis of the network traffic which can be used by an admission control mechanism to determine if the timing requirements of a new connection can be guaranteed without violating the requirements of already admitted connections. This type of admission control is required by several multimedia and almost all real time control applications. RTA is based on traditional fixed priority/rate monotonic real time CPU schedulability analysis. This makes it possible to combine communication analysis with CPU schedulability analysis, thus allowing system designers to use the same technique for assessing the timely behaviour of the entire system, including both CPU and network scheduling. The only assumption RTA makes about the ATM network is that the switches should be equipped with prioritised output queues, something which is true for many commercial switches. The main focus of the paper is on evaluating RTA. In the evaluation we compare RTA with Weighted Fair Queueing (WFQ) and the Calculus of Network Delays (CND). WFQ is the currently most popular method for providing performance guarantees, and CND provides an alternative analysis for prioritised queueing. The comparison shows that RTA outperforms both WFQ and CND for a set of realistic traffic scenarios

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML
Login
Username
Password
» Forgot your password?
Please remember to log out when you have finished your session.
Access this document
Full Text: PDF (900 KB)
» Buy this document now
»  Learn more about
» Learn more about
Download this citation
Available to subscribers and IEEE members.
 
arrow_leftView TOC   |  Back to toparrow_up
Indexed by IEE Inspec
© Copyright 2009 IEEE – All Rights Reserved