Share Email Print
cover

Proceedings Paper

End-to-end QoS bounds for RTP-based service subnetworks
Author(s): Jonathan M. Pitts; John A. Schormans
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

With the increasing focus on traffic prioritization to support voice-data integration in corporate intranets, practical methods are needed to dimension and manage cost efficient service partitions. This is particularly important for the provisioning of real time, delay sensitive services such as telephony and voice/video conferencing applications. Typically these can be provided over RTP/UDP/IP or ATM DBR/SBR bearers but, irrespective of the specific networking technology, the switches or routers need to implement some form of virtual buffer management with queue scheduling mechanisms to provide partitioning. The key requirement is for operators of such networks to be able to dimension the partitions and virtual buffer sizes for efficient resource utilization, instead of simply over-dimensioning. This paper draws on recent work at Queen Mary, University of London, supported by the UK Engineering and Physical Sciences Research Council, to investigate approximate analytical methods for assessing end to end delay variation bounds in cell based and packet based networks.

Paper Details

Date Published: 5 November 1999
PDF: 8 pages
Proc. SPIE 3842, Internet II: Quality of Service and Future Directions, (5 November 1999); doi: 10.1117/12.368327
Show Author Affiliations
Jonathan M. Pitts, Queen Mary and Westfield College (United Kingdom)
John A. Schormans, Queen Mary and Westfield College (United Kingdom)


Published in SPIE Proceedings Vol. 3842:
Internet II: Quality of Service and Future Directions
Raif O. Onvural; Seyhan Civanlar; James V. Luciani, Editor(s)

© SPIE. Terms of Use
Back to Top