Please use this identifier to cite or link to this item: https://scholarhub.balamand.edu.lb/handle/uob/1993
Title: A Fair QoS-Based Resource Allocation Scheme for a Time-Slotted Optical OV-CDMA Network : A Unified Approach
Authors: Inaty, Elie 
Raad, Robert
Fortier, Paul
Shalaby, Hossam M. H.
Affiliations: Department of Electrical Engineering 
Department of Electrical Engineering 
Keywords: Capacity
Multiclass
Multirate
Optical overlapped code-division multiple-access (OV-CDMA
Overlapping coefficient
Power control
Rate control
Issue Date: 2009
Part of: IEEE journal of lightwave technology
Volume: 26
Issue: 21
Start page: 1
End page: 10
Abstract: 
In this paper, we develop a fair resource allocation scheme for a multiclass time-slotted optical overlapped code-division multiple-access (OV-CDMA) network. The resource management scheme is fair in the sense that the users have their power and rate allotted according to their multiclass time-slotted optical overlapped code-division multiple-access quality of service (QoS) requirements. In addition, no class of users can dominate over the other classes. A unified framework for the resource controlling scheme is proposed. It consists of simply finding a single control parameter based on which the optimal transmission rate and power are obtained for every class of users. Analytical results show that the maximum transmission rate for a given class of users is only achievable when the users in that class are transmitting with the highest possible laser transmission power. In addition, we have demonstrated that the optimal transmission rates can be obtained via the solution of the rate characteristic polynomial. It is shown that our proposed scheme provides a substantial improvement in the system capacity while preserving the required fairness criteria.
URI: https://scholarhub.balamand.edu.lb/handle/uob/1993
Ezproxy URL: Link to full text
Type: Journal Article
Appears in Collections:Department of Electrical Engineering

Show full item record

Record view(s)

49
checked on Nov 21, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.