{"title":"多媒体无线DS-CDMA系统的自学习呼叫接纳控制","authors":"F. Vázquez-Abad, V. Krishnamurthy","doi":"10.1109/WODES.2002.1167717","DOIUrl":null,"url":null,"abstract":"The call admission problem for wireless CDMA systems is formulated as a semi-Markov decision process with constraints on the blocking probabilities and SIR (signal to interference ratio). We show that the optimal call admission policy can be computed via a stochastic gradient algorithm. Similar to neuro-dynamic programming algorithms, the algorithms proposed are s simulation based and do not require explicit knowledge of the underlying parameters such as transition probabilities (or equivalently invariant distributions). However, unlike Q-learning or temporal difference methods, the algorithms proposed here can straightforwardly handle constraints.","PeriodicalId":435263,"journal":{"name":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","volume":"407 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Self learning call admission control for multimedia wireless DS-CDMA systems\",\"authors\":\"F. Vázquez-Abad, V. Krishnamurthy\",\"doi\":\"10.1109/WODES.2002.1167717\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The call admission problem for wireless CDMA systems is formulated as a semi-Markov decision process with constraints on the blocking probabilities and SIR (signal to interference ratio). We show that the optimal call admission policy can be computed via a stochastic gradient algorithm. Similar to neuro-dynamic programming algorithms, the algorithms proposed are s simulation based and do not require explicit knowledge of the underlying parameters such as transition probabilities (or equivalently invariant distributions). However, unlike Q-learning or temporal difference methods, the algorithms proposed here can straightforwardly handle constraints.\",\"PeriodicalId\":435263,\"journal\":{\"name\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"volume\":\"407 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-10-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2002.1167717\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth International Workshop on Discrete Event Systems, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2002.1167717","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Self learning call admission control for multimedia wireless DS-CDMA systems
The call admission problem for wireless CDMA systems is formulated as a semi-Markov decision process with constraints on the blocking probabilities and SIR (signal to interference ratio). We show that the optimal call admission policy can be computed via a stochastic gradient algorithm. Similar to neuro-dynamic programming algorithms, the algorithms proposed are s simulation based and do not require explicit knowledge of the underlying parameters such as transition probabilities (or equivalently invariant distributions). However, unlike Q-learning or temporal difference methods, the algorithms proposed here can straightforwardly handle constraints.