Please use this identifier to cite or link to this item:
|Title:||Assured end-to-end QoS through adaptive marking in multi-domain differentiated services networks||Authors:||Tham, C.-K.
|Keywords:||Differentiated services architectures
End-to-end quality of service
Packet classification and marking
Reinforcement learning/neuro-dynamic programming
|Issue Date:||1-Nov-2005||Citation:||Tham, C.-K., Liu, Y. (2005-11-01). Assured end-to-end QoS through adaptive marking in multi-domain differentiated services networks. Computer Communications 28 (18) : 2009-2019. ScholarBank@NUS Repository. https://doi.org/10.1016/j.comcom.2004.07.033||Abstract:||The issue of resource management in multi-domain Differentiated Services (DiffServ) networks has attracted a lot of attention from researchers who have proposed various provisioning, adaptive marking and admission control schemes. In this paper, we propose a Reinforcement Learning-based Adaptive Marking (RLAM) approach for providing assured end-to-end quality of service (QoS) in the form of end-to-end delay and throughput assurances, while minimizing packet transmission cost since 'expensive' Per Hop Behaviors like Expedited Forwarding (EF) are used only when necessary. The proposed scheme tries to satisfy per flow end-to-end QoS through control action,s which act on flow aggregates in the core of the network. Using an ns2 simulation of a multi-domain DiffServ network with multimedia traffic, the RLAM scheme is shown to be effective in significantly lowering packet transmission costs without sacrificing end-to-end QoS, when compared to the commonly used static marking scheme. © 2004 Elsevier B.V. All rights reserved.||Source Title:||Computer Communications||URI:||http://scholarbank.nus.edu.sg/handle/10635/55150||ISSN:||01403664||DOI:||10.1016/j.comcom.2004.07.033|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 29, 2023
WEB OF SCIENCETM
checked on Jan 19, 2023
checked on Jan 26, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.