Abstract
We propose a novel admission control strategy called the Tentative Accommodating and Congestion Confirming Strategy (TACCS). The main idea is to accommodate incoming flows tentatively and confirm congestion after a certain period. TACCS makes it possible to control admission without collecting resources information in advance. Our simulation results demonstrated that TACCS enabled a domain to control admission without a centralized management agent.
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
Yasukawa, K., Baba, K., Yamaoka, K.: Drop Precedence Mapping on Dynamic Class Assignment Method. In: Proc. of CSNDSP 2004, July 2004, pp. 416–419 (2004)
Yasukawa, K., Baba, K., Yamaoka, K.: Dynamic Class Assignment for Stream Flows Considering Characteristics of Non-stream Flow Classes. IEICE Trans. on Communications, November 2004 E87-B(11), 3242–3254 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yasukawa, K., Baba, Ki., Yamaoka, K. (2005). Concept of Admission Control in Packet Switching Networks Based on Tentative Accommodation of Incoming Flows. In: de Meer, H., Bhatti, N. (eds) Quality of Service – IWQoS 2005. IWQoS 2005. Lecture Notes in Computer Science, vol 3552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499169_29
Download citation
DOI: https://doi.org/10.1007/11499169_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26294-7
Online ISBN: 978-3-540-31659-6
eBook Packages: Computer ScienceComputer Science (R0)