Guaranteeing Real-Time Traffic Through an ATM Network

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Hans Hansson Articles by Mikael Sjodin Articles by Ken Tindell

30th Hawaii International Conference on System Sciences (HICSS) Volume 5: Advanced Technology Track

Guaranteeing Real-Time Traffic Through an ATM Network (PDF)

Maui, Hawaii

January 03-January 06

ISBN: 0-8186-7743-0

	ASCII Text	x
	Hans Hansson, Mikael Sjodin, Ken Tindell, "Guaranteeing Real-Time Traffic Through an ATM Network," Hawaii International Conference on System Sciences, vol. 5, pp. 44, 30th Hawaii International Conference on System Sciences (HICSS) Volume 5: Advanced Technology Track, 1997.

	BibTex	x
	@article{ 10.1109/HICSS.1997.663158, author = {Hans Hansson and Mikael Sjodin and Ken Tindell}, title = {Guaranteeing Real-Time Traffic Through an ATM Network}, journal ={Hawaii International Conference on System Sciences}, volume = {5}, year = {1997}, issn = {1060-3425}, pages = {44}, doi = {http://doi.ieeecomputersociety.org/10.1109/HICSS.1997.663158}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Hawaii International Conference on System Sciences TI - Guaranteeing Real-Time Traffic Through an ATM Network SN - 1060-3425 SP EP A1 - Hans Hansson, A1 - Mikael Sjodin, A1 - Ken Tindell, PY - 1997 KW - null VL - 5 JA - Hawaii International Conference on System Sciences ER -

Hans Hansson, Dept. of Computer Systems, Uppsala University

Mikael Sjodin, Dept. of Computer Systems, Uppsala University

Ken Tindell, Dept. of Computer Systems, Uppsala University

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.1997.663158

We present a method for providing hard real-time guarantees for traffic through an Asynchronous Transfer Mode (ATM) network. Guaranteed delivery Also implies that we have to guarantee that no cells are lost due to over-full buyers in the network.

By using priority queues in the output buyers we allow urgent messages short end-to-end delays, while still guaranteeing end-to-end delays for low-priority messages.

We can determine _a priori if message deadlines will be met by calculating maximum end-to-end delays and buyer-needs. Analysis is based on CPU schedulability analysis, which means that it provides a framework for analysing an entire system, including both CPU and network scheduling.

Citation:

Hans Hansson, Mikael Sjodin, Ken Tindell, "Guaranteeing Real-Time Traffic Through an ATM Network," hicss, vol. 5, pp.44, 30th Hawaii International Conference on System Sciences (HICSS) Volume 5: Advanced Technology Track, 1997

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.