Energy efficient delay leap routing in multicast using feed back neural networks

Mohammad Uruj Jaleel, Mohammad Asghar Jamil, Kashiful Haq
{"title":"Energy efficient delay leap routing in multicast using feed back neural networks","authors":"Mohammad Uruj Jaleel, Mohammad Asghar Jamil, Kashiful Haq","doi":"10.1109/ISIAS.2011.6122828","DOIUrl":null,"url":null,"abstract":"The Hopfield Neural Network is a parallel, distributed information processing structure consisting of many processing elements connected via weighted connections. The objective function was then expressed as quadratic energy function and the associated weights between neurons were computed using the gradient descent of energy function. This paper reports a development of a Hopfield type neural network model to solve minimum cost delay leap multicast routing problem. The multicast tree is obtained by recursively obtaining the delay leap optimized path from source to various destinations and combining them by union operator. The union operator ensures that a link is appearing only once in the multicast tree. The minimum energy function is obtained with minimization of constrained parameter as per a defined annealing schedule, which increases the probability of visiting lower energy states. Finally, the goal of minimization of objective function (minimum cost delay leap route) is achieved by using mean filed approximation with stochastic annealing process of reducing constrained parameter.","PeriodicalId":139268,"journal":{"name":"2011 7th International Conference on Information Assurance and Security (IAS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 7th International Conference on Information Assurance and Security (IAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIAS.2011.6122828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Hopfield Neural Network is a parallel, distributed information processing structure consisting of many processing elements connected via weighted connections. The objective function was then expressed as quadratic energy function and the associated weights between neurons were computed using the gradient descent of energy function. This paper reports a development of a Hopfield type neural network model to solve minimum cost delay leap multicast routing problem. The multicast tree is obtained by recursively obtaining the delay leap optimized path from source to various destinations and combining them by union operator. The union operator ensures that a link is appearing only once in the multicast tree. The minimum energy function is obtained with minimization of constrained parameter as per a defined annealing schedule, which increases the probability of visiting lower energy states. Finally, the goal of minimization of objective function (minimum cost delay leap route) is achieved by using mean filed approximation with stochastic annealing process of reducing constrained parameter.
基于反馈神经网络的组播节能延迟跳跃路由
Hopfield神经网络是一种并行的、分布式的信息处理结构,由多个处理单元通过加权连接连接而成。将目标函数表示为二次能量函数,利用能量函数梯度下降法计算神经元间的关联权值。本文提出了一种Hopfield型神经网络模型,用于解决最小时延跳跃组播路由问题。通过递归获得从源到各目的的时延跳跃优化路径,并通过联合算子进行组合,得到组播树。联合操作符确保一个链接在多播树中只出现一次。根据确定的退火程序,以约束参数最小化的方式得到最小能量函数,增加了到达低能量态的概率。最后,利用均值场近似和约束参数约简的随机退火过程,实现了目标函数(时延最小)的最小化目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信