NDLI: Computationally Efficient Dynamic Code Assignment Schemes With Call Admission Control (DCA-CAC) for OVSF-CDMA Systems

Content Provider	IEEE Xplore Digital Library
Author	Jun-Seong Park Lei Huang Kuo, C.-C.J.
Copyright Year	1967
Abstract	This paper investigates computationally efficient suboptimal dynamic code assignment (DCA) schemes with call admission control (CAC) for orthogonal variable spreading factor code-division multiple-access systems. We examine two different approaches. The first approach reduces the complexity of the DCA scheme by partitioning the total resource (either capacity or service class) into several mutually exclusive subsets and assigns each subset of resource to a group of users in proportion to the corresponding traffic load. The second approach reduces the complexity of the optimal CAC scheme with the Markov decision process over an infinite time horizon by a suboptimal CAC policy, which is designed by observing the behavior of system dynamics over only two consecutive stages upon the arrival of a call. It is demonstrated by numerical evaluation that the proposed schemes achieve an average data throughput close to that of the optimal DCA-CAC performance while demanding a much lower computational complexity in their design and implementation.
Sponsorship	IEEE Vehicular Technology Society
Starting Page	286
Ending Page	296
Page Count	11
File Size	537686
File Format	PDF
ISSN	00189545
Volume Number	57
Issue Number	1
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Call admission control Multiaccess communication Throughput Computational complexity Error correction Telecommunication traffic Admission control Wideband Multimedia systems Research and development orthogonal variable spreading factor (OVSF) Call admission control (CAC) code-division multiple access (CDMA) dynamic code assignment (DCA) Markov decision process (MDP) OVSF CDMA OVSF-CDMA dynamic code assignment call admission control
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Automotive Engineering Computer Networks and Communications Electrical and Electronic Engineering Aerospace Engineering

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Computationally Efficient Dynamic Code Assignment Schemes With Call Admission Control (DCA-CAC) for OVSF-CDMA Systems

Scalable dynamic code assignment for OVSF-CDMA systems

Optimal code assignment and call admission control for OVSF-CDMA systems constrained by blocking probabilities

Markov-Based OVSF Code Assignment Scheme and Call Admission Control for Wideband-CDMA Communication Systems

MDP-based OVSF code assignment scheme and call admission control for wideband-CDMA communications

Call admission and code allocation strategies for WCDMA systems with multirate traffic

Design and evaluation of suboptimal call admission control policy for OVSF code assignment in CDMA networks

Optimal code assignment and call admission control for OVSF-CDMA systems constrained by blocking probabilities (2004)

Reduction in code blocking using scattered vacant codes for orthogonal variable spreading factor-based wideband code division multiple access networks

Computationally Efficient Dynamic Code Assignment Schemes With Call Admission Control (DCA-CAC) for OVSF-CDMA Systems

Similar Documents

Computationally Efficient Dynamic Code Assignment Schemes With Call Admission Control (DCA-CAC) for OVSF-CDMA Systems

Scalable dynamic code assignment for OVSF-CDMA systems

Optimal code assignment and call admission control for OVSF-CDMA systems constrained by blocking probabilities

Markov-Based OVSF Code Assignment Scheme and Call Admission Control for Wideband-CDMA Communication Systems

MDP-based OVSF code assignment scheme and call admission control for wideband-CDMA communications

Call admission and code allocation strategies for WCDMA systems with multirate traffic

Design and evaluation of suboptimal call admission control policy for OVSF code assignment in CDMA networks

Optimal code assignment and call admission control for OVSF-CDMA systems constrained by blocking probabilities (2004)

Reduction in code blocking using scattered vacant codes for orthogonal variable spreading factor-based wideband code division multiple access networks

Computationally Efficient Dynamic Code Assignment Schemes With Call Admission Control (DCA-CAC) for OVSF-CDMA Systems