Call admission control algorithms for tandem generalized processor sharing networks
Tóm tắt
This paper proposes several call admission control (CAC) algorithms for tandem networks that employ the generalized processor sharing (GPS) scheduling discipline, and also points out important network issues that are crucial in the design of network level CAC algorithms for GPS. Sessions are considered to be leaky bucket constrained and are regulated by traffic shapers at each network node. The end-to-end service curve approach of Barta et al. (2001) is used to carry out the analytical framework of our algorithms. Different CAC algorithms are developed to support different session treatment strategies and diverse server capacities. The proposed algorithms follow different end-to-end delay provisioning strategies whose performance is compared through numerical examples.
Từ khóa
#Call admission control #Global Positioning System #Network servers #Telecommunication traffic #Algorithm design and analysis #Scheduling algorithm #Processor scheduling #Computer networks #Gold #DelayTài liệu tham khảo
10.1109/INFCOM.2000.832509
zhang, 1994, Rate-controlled service disciplines, Journal of High Speed Networks, 10.3233/JHS-1994-3405
10.1109/90.298432
10.1109/INFCOM.2000.832509
10.1109/ISCC.2002.1021763
10.1109/ISCC.2001.935388
10.1109/90.234856
10.1109/ICC.2001.937014
10.1109/INFCOM.1999.751679
dukkipati, 2001, Optimal call admission control in generalized processor sharing (GPS) schedulers, Proc of IEEE INFOCOM
10.1109/ICC.2001.937033
10.1109/18.61110
10.1007/3-540-45512-4_32
le boudec, 1998, Selected Lecture Notes