Abstract
In this paper, the end-to-end delay objective allocation problem for networks supporting Switched Multi-megabit Data Service (SMDS) is considered. Traditionally, for engineering tractability, end-to-end service objectives are allocated to network elements in such a way that, if the allocated service objective for each network element is satisfied then the end-to-end service objectives are satisfied. Such an objective allocation strategy is referred to as a feasible objective allocation strategy.
For networks supporting SMDS, the delay objectives state that 95% of the packets delivered from the origin Subscriber Network Interface (SNI) to the destination SNI should be within a given time threshold. From network monitoring point of view, this percentile type of delay objectives makes it complicated to compute feasible allocation strategies so that network elements instead of each origin-destination pair should be monitored. From network planning point of view, these end-to-end percentile-type delay objectives usually impose an excessively large number of nonconvex and complicated constraints (delay distributions are convolved, assuming delays are mutually independent).
The emphasis of this paper is three fold: (i) to propose an efficient and generic approach to replacing the set of end-to-end percentile-type delay constraints by a simpler set of network element utilization constraints (small size and convex), (ii) to investigate how this approach could be adopted in conjunction with a number of possible allocation schemes and (iii) to compare the relative effectiveness (in terms of the utilization thresholds determined) using M/M/1 and M/D/1 queueing models. The significance of this work is to provide a general and effective way to calculate engineering thresholds on the network element utilization factors when percentile types of end-to-end delay objectives are considered. This work lays a foundation to help the system planners/administrators monitor, service, expand and plan networks supporting SMDS.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
F.Y.S. Lin, “Link Set Sizing for Networks Supporting SMDS,” Second IEEE Network Management and Control Workshop, September 1993.
Bell Communications Research, “Generic System Requirements in Support of SMDS,” Bellcore technical reference, TR-TSV-000772, Issue 1, May 1991.
J.L. Wang, “An Integrated Methodology for Supporting Network Planning and Traffic Engineering with Considerations to SMDS Service,” Proc. IEEE Globecom, December 1991.
J.F.C. Kingman, “Inequalities in the Theory of Queues,” Journal of the Royal Statistical Society, Series B, 32, pp. 102-110, 1970.
J.F.C. Kingman, “On Queues in Heavy Traffic,” Journal of the Royal Statistical Society, Series B, 24, pp. 383-392, 1962.
F.Y.S. Lin and J.R. Yee, “A Real-time Distributed Routing and Admission Control Algorithm for ATM Networks,” Proc. IEEE Infocom’93, April 1993.
L. Kleinrock, Queueing Systems, Volume 1, New York: Wiley Interscience, 1975.
J.F. Hayes, Modeling and Analysis of Computer Communications Networks, 1984.
D. Gross and CM. Harris, Fundamentals of Queueing Theory, John Wiley & Sons, 1974.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lin, F.Y.S. (1994). Allocation of End-to-End Delay Objectives for Networks Supporting SMDS. In: Frisch, I.T., Malek, M., Panwar, S.S. (eds) Network Management and Control. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-1298-5_17
Download citation
DOI: https://doi.org/10.1007/978-1-4899-1298-5_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-1300-5
Online ISBN: 978-1-4899-1298-5
eBook Packages: Springer Book Archive