{"title":"具有衰落的DS-CDMA系统的接纳控制","authors":"Sumeetpal S. Singh, V. Krishnamurthy, H. Poor","doi":"10.1109/GLOCOM.2001.965207","DOIUrl":null,"url":null,"abstract":"This paper considers the call admission control problem for multi-service wireless CDMA cellular systems with buffering. The call admission problem is formulated as a semi-Markov decision process with constraints on the blocking probabilities and SIR. By using recent results in large random matrices, the SIR constraints incorporate multi-class voice/data services and fading channels. We show that the optimal call admission policy can be computed via a linear programming based algorithm.","PeriodicalId":346622,"journal":{"name":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Admission control for DS-CDMA systems with fading\",\"authors\":\"Sumeetpal S. Singh, V. Krishnamurthy, H. Poor\",\"doi\":\"10.1109/GLOCOM.2001.965207\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the call admission control problem for multi-service wireless CDMA cellular systems with buffering. The call admission problem is formulated as a semi-Markov decision process with constraints on the blocking probabilities and SIR. By using recent results in large random matrices, the SIR constraints incorporate multi-class voice/data services and fading channels. We show that the optimal call admission policy can be computed via a linear programming based algorithm.\",\"PeriodicalId\":346622,\"journal\":{\"name\":\"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)\",\"volume\":\"115 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2001.965207\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2001.965207","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper considers the call admission control problem for multi-service wireless CDMA cellular systems with buffering. The call admission problem is formulated as a semi-Markov decision process with constraints on the blocking probabilities and SIR. By using recent results in large random matrices, the SIR constraints incorporate multi-class voice/data services and fading channels. We show that the optimal call admission policy can be computed via a linear programming based algorithm.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
