Next‐generation energy‐efficient optical networking: DQ‐RGK algorithm for dynamic quality of service and adaptive resource allocation
Summary In green optical networking, designing an adaptive energy‐saving scheme plays a vital role, in optimizing energy consumption by dynamically adjusting resources based on network traffic and environmental conditions, to a more sustainable and efficient optical communication infrastructure. Tra...
Gespeichert in:
Veröffentlicht in: | Concurrency and computation 2024-07, Vol.36 (16), p.n/a |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | n/a |
---|---|
container_issue | 16 |
container_start_page | |
container_title | Concurrency and computation |
container_volume | 36 |
creator | Swamidoss, Mathumohan Samiayya, Duraimurugan Gunasekar, Manikandan |
description | Summary
In green optical networking, designing an adaptive energy‐saving scheme plays a vital role, in optimizing energy consumption by dynamically adjusting resources based on network traffic and environmental conditions, to a more sustainable and efficient optical communication infrastructure. Traditional methods in optical networking face challenges such as static resource allocation, limited adaptability, inefficient power usage, environmental insensitivity, and scalability issues. Therefore this article proposed a novel method named Dynamic Quality of Service based Random update Genghis Khan (DQ‐RGK) algorithm, the proposed model can tackle the abovementioned complexities. In this study, cluster head dynamic placement is utilized to optimize the network's performance by adapting the placement of cluster heads to the current topology, load distribution, and energy levels in the network nodes. Additionally, Dynamic Quality of Service (QoS) is employed to respond dynamically to changes in network conditions, adapting to varying traffic patterns and resource availability. In this work, the Genghis Khan Shark optimization with a random update strategy is implemented for hyperparameter optimization to enhance the performance of the DQ‐RGK method. The DQ‐RGK adjusts the parameters of QoS in real‐time, and this ensures that network resources based on the requirements changed and priorities of applications, which ultimately optimizes performance and enhances user experience. By dynamically assigning and reallocating resources based on the current demand the algorithm enhances overall network efficiency and reduces energy consumption. Then, this work analyzes the experimental results, where some evaluation measures estimate the DQ‐RGK method's performance. Routing efficiency, latency, scalability, spectral efficiency, Packet Delivery Ratio, throughput, network lifetime, energy consumption, jitter, and energy consumption are the measures employed by the DQ‐RGK model. In The results, other routing models that do not provide efficiency are utilized, a comparison of these other routing models is represented in results. The overall DQ‐RGK model's effectiveness is represented in the experimental results and its effectiveness is greater among other methods. |
doi_str_mv | 10.1002/cpe.8070 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3071608065</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3071608065</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2540-f61bae1934b0c0cd23c00cfd09315e2f1b10e6369033f2029aebbca45a08f3da3</originalsourceid><addsrcrecordid>eNp1kM1OwzAQhCMEEqUg8QiWuHBJWcdJ2nBDpRRExZ_gbDnOOrikduukLblx58Iz8iQkLeLGaUejTzOr8bxjCj0KEJzJOfYG0Icdr0MjFvgQs3D3TwfxvndQllMASoHRjvd5h-_V98dXjgadqLQ1pFV53XiolJYaTUXsvNJSFMRgtbbuTZv8nFw-NsjT-JaIIrdOV68zoqwjWW3ETEuyWIpCVzWxipToVloiESYjIhNN1gqJw9IuXesWhZWb5kNvT4mixKPf2_VerkbPw2t_cj--GV5MfBlEIfgqpqlAmrAwBQkyC5gEkCqDhNEIA0VTChizOAHGVABBIjBNpQgjAQPFMsG63sk2d-7sYollxafNK6ap5Az6NIYBxFFDnW4p6WxZOlR87vRMuJpT4O3UvJmat1M3qL9F17rA-l-ODx9GG_4HVheFHw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3071608065</pqid></control><display><type>article</type><title>Next‐generation energy‐efficient optical networking: DQ‐RGK algorithm for dynamic quality of service and adaptive resource allocation</title><source>Wiley Online Library Journals Frontfile Complete</source><creator>Swamidoss, Mathumohan ; Samiayya, Duraimurugan ; Gunasekar, Manikandan</creator><creatorcontrib>Swamidoss, Mathumohan ; Samiayya, Duraimurugan ; Gunasekar, Manikandan</creatorcontrib><description>Summary
In green optical networking, designing an adaptive energy‐saving scheme plays a vital role, in optimizing energy consumption by dynamically adjusting resources based on network traffic and environmental conditions, to a more sustainable and efficient optical communication infrastructure. Traditional methods in optical networking face challenges such as static resource allocation, limited adaptability, inefficient power usage, environmental insensitivity, and scalability issues. Therefore this article proposed a novel method named Dynamic Quality of Service based Random update Genghis Khan (DQ‐RGK) algorithm, the proposed model can tackle the abovementioned complexities. In this study, cluster head dynamic placement is utilized to optimize the network's performance by adapting the placement of cluster heads to the current topology, load distribution, and energy levels in the network nodes. Additionally, Dynamic Quality of Service (QoS) is employed to respond dynamically to changes in network conditions, adapting to varying traffic patterns and resource availability. In this work, the Genghis Khan Shark optimization with a random update strategy is implemented for hyperparameter optimization to enhance the performance of the DQ‐RGK method. The DQ‐RGK adjusts the parameters of QoS in real‐time, and this ensures that network resources based on the requirements changed and priorities of applications, which ultimately optimizes performance and enhances user experience. By dynamically assigning and reallocating resources based on the current demand the algorithm enhances overall network efficiency and reduces energy consumption. Then, this work analyzes the experimental results, where some evaluation measures estimate the DQ‐RGK method's performance. Routing efficiency, latency, scalability, spectral efficiency, Packet Delivery Ratio, throughput, network lifetime, energy consumption, jitter, and energy consumption are the measures employed by the DQ‐RGK model. In The results, other routing models that do not provide efficiency are utilized, a comparison of these other routing models is represented in results. The overall DQ‐RGK model's effectiveness is represented in the experimental results and its effectiveness is greater among other methods.</description><identifier>ISSN: 1532-0626</identifier><identifier>EISSN: 1532-0634</identifier><identifier>DOI: 10.1002/cpe.8070</identifier><language>eng</language><publisher>Hoboken, USA: John Wiley & Sons, Inc</publisher><subject>adaptive energy‐saving scheme ; Algorithms ; cluster head dynamic placement ; Clusters ; Communications traffic ; dynamic quality of service ; Effectiveness ; Efficiency ; Energy consumption ; Energy distribution ; Energy levels ; Genghis Khan (1162?-1227) ; Genghis Khan shark optimization ; green optical networking random update strategy ; Load distribution (forces) ; Optimization ; Placement ; Quality of service ; Quality of service architectures ; Resource allocation ; Topology ; User experience</subject><ispartof>Concurrency and computation, 2024-07, Vol.36 (16), p.n/a</ispartof><rights>2024 John Wiley & Sons Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c2540-f61bae1934b0c0cd23c00cfd09315e2f1b10e6369033f2029aebbca45a08f3da3</cites><orcidid>0000-0001-5561-7364 ; 0000-0002-1184-8387 ; 0000-0003-3178-3143</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fcpe.8070$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fcpe.8070$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,777,781,1412,27905,27906,45555,45556</link.rule.ids></links><search><creatorcontrib>Swamidoss, Mathumohan</creatorcontrib><creatorcontrib>Samiayya, Duraimurugan</creatorcontrib><creatorcontrib>Gunasekar, Manikandan</creatorcontrib><title>Next‐generation energy‐efficient optical networking: DQ‐RGK algorithm for dynamic quality of service and adaptive resource allocation</title><title>Concurrency and computation</title><description>Summary
In green optical networking, designing an adaptive energy‐saving scheme plays a vital role, in optimizing energy consumption by dynamically adjusting resources based on network traffic and environmental conditions, to a more sustainable and efficient optical communication infrastructure. Traditional methods in optical networking face challenges such as static resource allocation, limited adaptability, inefficient power usage, environmental insensitivity, and scalability issues. Therefore this article proposed a novel method named Dynamic Quality of Service based Random update Genghis Khan (DQ‐RGK) algorithm, the proposed model can tackle the abovementioned complexities. In this study, cluster head dynamic placement is utilized to optimize the network's performance by adapting the placement of cluster heads to the current topology, load distribution, and energy levels in the network nodes. Additionally, Dynamic Quality of Service (QoS) is employed to respond dynamically to changes in network conditions, adapting to varying traffic patterns and resource availability. In this work, the Genghis Khan Shark optimization with a random update strategy is implemented for hyperparameter optimization to enhance the performance of the DQ‐RGK method. The DQ‐RGK adjusts the parameters of QoS in real‐time, and this ensures that network resources based on the requirements changed and priorities of applications, which ultimately optimizes performance and enhances user experience. By dynamically assigning and reallocating resources based on the current demand the algorithm enhances overall network efficiency and reduces energy consumption. Then, this work analyzes the experimental results, where some evaluation measures estimate the DQ‐RGK method's performance. Routing efficiency, latency, scalability, spectral efficiency, Packet Delivery Ratio, throughput, network lifetime, energy consumption, jitter, and energy consumption are the measures employed by the DQ‐RGK model. In The results, other routing models that do not provide efficiency are utilized, a comparison of these other routing models is represented in results. The overall DQ‐RGK model's effectiveness is represented in the experimental results and its effectiveness is greater among other methods.</description><subject>adaptive energy‐saving scheme</subject><subject>Algorithms</subject><subject>cluster head dynamic placement</subject><subject>Clusters</subject><subject>Communications traffic</subject><subject>dynamic quality of service</subject><subject>Effectiveness</subject><subject>Efficiency</subject><subject>Energy consumption</subject><subject>Energy distribution</subject><subject>Energy levels</subject><subject>Genghis Khan (1162?-1227)</subject><subject>Genghis Khan shark optimization</subject><subject>green optical networking random update strategy</subject><subject>Load distribution (forces)</subject><subject>Optimization</subject><subject>Placement</subject><subject>Quality of service</subject><subject>Quality of service architectures</subject><subject>Resource allocation</subject><subject>Topology</subject><subject>User experience</subject><issn>1532-0626</issn><issn>1532-0634</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp1kM1OwzAQhCMEEqUg8QiWuHBJWcdJ2nBDpRRExZ_gbDnOOrikduukLblx58Iz8iQkLeLGaUejTzOr8bxjCj0KEJzJOfYG0Icdr0MjFvgQs3D3TwfxvndQllMASoHRjvd5h-_V98dXjgadqLQ1pFV53XiolJYaTUXsvNJSFMRgtbbuTZv8nFw-NsjT-JaIIrdOV68zoqwjWW3ETEuyWIpCVzWxipToVloiESYjIhNN1gqJw9IuXesWhZWb5kNvT4mixKPf2_VerkbPw2t_cj--GV5MfBlEIfgqpqlAmrAwBQkyC5gEkCqDhNEIA0VTChizOAHGVABBIjBNpQgjAQPFMsG63sk2d-7sYollxafNK6ap5Az6NIYBxFFDnW4p6WxZOlR87vRMuJpT4O3UvJmat1M3qL9F17rA-l-ODx9GG_4HVheFHw</recordid><startdate>20240725</startdate><enddate>20240725</enddate><creator>Swamidoss, Mathumohan</creator><creator>Samiayya, Duraimurugan</creator><creator>Gunasekar, Manikandan</creator><general>John Wiley & Sons, Inc</general><general>Wiley Subscription Services, Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0001-5561-7364</orcidid><orcidid>https://orcid.org/0000-0002-1184-8387</orcidid><orcidid>https://orcid.org/0000-0003-3178-3143</orcidid></search><sort><creationdate>20240725</creationdate><title>Next‐generation energy‐efficient optical networking: DQ‐RGK algorithm for dynamic quality of service and adaptive resource allocation</title><author>Swamidoss, Mathumohan ; Samiayya, Duraimurugan ; Gunasekar, Manikandan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2540-f61bae1934b0c0cd23c00cfd09315e2f1b10e6369033f2029aebbca45a08f3da3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>adaptive energy‐saving scheme</topic><topic>Algorithms</topic><topic>cluster head dynamic placement</topic><topic>Clusters</topic><topic>Communications traffic</topic><topic>dynamic quality of service</topic><topic>Effectiveness</topic><topic>Efficiency</topic><topic>Energy consumption</topic><topic>Energy distribution</topic><topic>Energy levels</topic><topic>Genghis Khan (1162?-1227)</topic><topic>Genghis Khan shark optimization</topic><topic>green optical networking random update strategy</topic><topic>Load distribution (forces)</topic><topic>Optimization</topic><topic>Placement</topic><topic>Quality of service</topic><topic>Quality of service architectures</topic><topic>Resource allocation</topic><topic>Topology</topic><topic>User experience</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Swamidoss, Mathumohan</creatorcontrib><creatorcontrib>Samiayya, Duraimurugan</creatorcontrib><creatorcontrib>Gunasekar, Manikandan</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Concurrency and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Swamidoss, Mathumohan</au><au>Samiayya, Duraimurugan</au><au>Gunasekar, Manikandan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Next‐generation energy‐efficient optical networking: DQ‐RGK algorithm for dynamic quality of service and adaptive resource allocation</atitle><jtitle>Concurrency and computation</jtitle><date>2024-07-25</date><risdate>2024</risdate><volume>36</volume><issue>16</issue><epage>n/a</epage><issn>1532-0626</issn><eissn>1532-0634</eissn><abstract>Summary
In green optical networking, designing an adaptive energy‐saving scheme plays a vital role, in optimizing energy consumption by dynamically adjusting resources based on network traffic and environmental conditions, to a more sustainable and efficient optical communication infrastructure. Traditional methods in optical networking face challenges such as static resource allocation, limited adaptability, inefficient power usage, environmental insensitivity, and scalability issues. Therefore this article proposed a novel method named Dynamic Quality of Service based Random update Genghis Khan (DQ‐RGK) algorithm, the proposed model can tackle the abovementioned complexities. In this study, cluster head dynamic placement is utilized to optimize the network's performance by adapting the placement of cluster heads to the current topology, load distribution, and energy levels in the network nodes. Additionally, Dynamic Quality of Service (QoS) is employed to respond dynamically to changes in network conditions, adapting to varying traffic patterns and resource availability. In this work, the Genghis Khan Shark optimization with a random update strategy is implemented for hyperparameter optimization to enhance the performance of the DQ‐RGK method. The DQ‐RGK adjusts the parameters of QoS in real‐time, and this ensures that network resources based on the requirements changed and priorities of applications, which ultimately optimizes performance and enhances user experience. By dynamically assigning and reallocating resources based on the current demand the algorithm enhances overall network efficiency and reduces energy consumption. Then, this work analyzes the experimental results, where some evaluation measures estimate the DQ‐RGK method's performance. Routing efficiency, latency, scalability, spectral efficiency, Packet Delivery Ratio, throughput, network lifetime, energy consumption, jitter, and energy consumption are the measures employed by the DQ‐RGK model. In The results, other routing models that do not provide efficiency are utilized, a comparison of these other routing models is represented in results. The overall DQ‐RGK model's effectiveness is represented in the experimental results and its effectiveness is greater among other methods.</abstract><cop>Hoboken, USA</cop><pub>John Wiley & Sons, Inc</pub><doi>10.1002/cpe.8070</doi><tpages>19</tpages><orcidid>https://orcid.org/0000-0001-5561-7364</orcidid><orcidid>https://orcid.org/0000-0002-1184-8387</orcidid><orcidid>https://orcid.org/0000-0003-3178-3143</orcidid></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1532-0626 |
ispartof | Concurrency and computation, 2024-07, Vol.36 (16), p.n/a |
issn | 1532-0626 1532-0634 |
language | eng |
recordid | cdi_proquest_journals_3071608065 |
source | Wiley Online Library Journals Frontfile Complete |
subjects | adaptive energy‐saving scheme Algorithms cluster head dynamic placement Clusters Communications traffic dynamic quality of service Effectiveness Efficiency Energy consumption Energy distribution Energy levels Genghis Khan (1162?-1227) Genghis Khan shark optimization green optical networking random update strategy Load distribution (forces) Optimization Placement Quality of service Quality of service architectures Resource allocation Topology User experience |
title | Next‐generation energy‐efficient optical networking: DQ‐RGK algorithm for dynamic quality of service and adaptive resource allocation |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T09%3A37%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Next%E2%80%90generation%20energy%E2%80%90efficient%20optical%20networking:%20DQ%E2%80%90RGK%20algorithm%20for%20dynamic%20quality%20of%20service%20and%20adaptive%20resource%20allocation&rft.jtitle=Concurrency%20and%20computation&rft.au=Swamidoss,%20Mathumohan&rft.date=2024-07-25&rft.volume=36&rft.issue=16&rft.epage=n/a&rft.issn=1532-0626&rft.eissn=1532-0634&rft_id=info:doi/10.1002/cpe.8070&rft_dat=%3Cproquest_cross%3E3071608065%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=3071608065&rft_id=info:pmid/&rfr_iscdi=true |