A QoS-Based scheduling mechanism for overlay aggregate traffics

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a control mechanism in SON(Service Overlay Network) architecture to provide delay guarantees of different aggregate traffics over IP network. In addition to the bandwidth provision problem of aggregate-traffic in service overlay network, queuing delay in the service gateway is another critical QoS parameter, and diverse multimedia flows have different delay requirements. To assure the delay requirements of aggregate flows in service overlay network, we present a simple but effective adaptable control mechanism, which consists of two-queues with exhausitive service in cyclic order and characterizes the abilities to ensure delay requirements of various aggregate flows according to their burstiness. Moreover, Associated performance is analyzed by the Markov chain and probability generation function, and simulations validate this analysis. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Wu, Y., Li, Z., Chen, Z., Wu, Y., Wang, L., & Lu, T. (2005). A QoS-Based scheduling mechanism for overlay aggregate traffics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3779 LNCS, pp. 449–452). Springer Verlag. https://doi.org/10.1007/11577188_64

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free