Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/28896
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHu, A-
dc.contributor.authorGan, L-
dc.contributor.authorGuo, L-
dc.contributor.authorYan, H-
dc.contributor.authorHu, J-
dc.date.accessioned2024-04-30T11:56:14Z-
dc.date.available2024-04-30T11:56:14Z-
dc.date.issued2024-02-09-
dc.identifierORCiD: Anqi Hu https://orcid.org/0000-0001-7162-7693-
dc.identifierORCiD: Lu Gan https://orcid.org/0000-0003-1056-7660-
dc.identifier.citationHu, A. et al. (2024) 'Convex optimization-based high-speed and security joint optimization scheme in optical access networks', Optics Express, 32 (4), pp. 6748 - 6748. doi: 10.1364/oe.512191.en_US
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/28896-
dc.descriptionData availability: Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.en_US
dc.description.abstractData rate and security are essential performance metrics for passive optical networks (PON). However, existing optical access networks lack standardized metrics to evaluate rate and security performance uniformly. This paper introduces a high-speed and security joint optimization scheme for optical access networks using convex optimization. Evaluation metrics for data rate and security performance in PON are established. According to the evaluation metrics, the security optimization objective function <i>U</i><inf>s</inf>, high-speed optimization objective function <i>GMI</i>, and high-speed security joint-optimization objective function <i>H</i><inf>s</inf> are established. An optimization problem is formulated to maximize weighted rate and security indicators, factoring in constraints such as maximum power, probability, amplifier capacity, normalized mutual information, and key and frame lengths. An alternating optimization method is applied to iteratively address sub-problems by exploiting successive convex approximations and differences of convex functions. This transforms non-convex sub-problems into convex optimizations. Experimental results highlight notable improvements in objective function values, confirming the effectiveness of the proposed high-speed security optimization algorithm for optical access networks.en_US
dc.description.sponsorshipChongqing Postdoctoral Funding Project (2112012727685993); China Postdoctoral Science Foundation (2021M700563); Chongqing Municipal Education Commission (CXQT21019, KJQN202100643); National Natural Science Foundation of China (62025105, 62071076, 62205043).en_US
dc.format.extent6748 - 6748-
dc.format.mediumElectronic-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherOptica Publishing Groupen_US
dc.rightsCopyright © 2024 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement (https://doi.org/10.1364/OA_License_v2#VOR-OA).-
dc.rights.urihttps://opg.optica.org/resources/author/CopyrightTransferOpenAccessAgreement-2021-09-20.pdf-
dc.titleConvex optimization-based high-speed and security joint optimization scheme in optical access networksen_US
dc.typeArticleen_US
dc.date.dateAccepted2024-01-30-
dc.identifier.doihttps://doi.org/10.1364/oe.512191-
dc.relation.isPartOfOptics Express-
pubs.issue4-
pubs.publication-statusPublished-
pubs.volume32-
dc.identifier.eissn1094-4087-
dc.rights.licensehttps://doi.org/10.1364/OA_License_v2#VOR-OA-
dc.rights.holderOptica Publishing Group under the terms of the Optica Open Access Publishing Agreement-
Appears in Collections:Dept of Electronic and Electrical Engineering Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2024 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement (https://doi.org/10.1364/OA_License_v2#VOR-OA).3.9 MBAdobe PDFView/Open


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