无线移动多媒体业务的最优路由方法

Asma BEN LETAIFA, T. Bejaoui, S. Tabbane, Z. Choukair
{"title":"无线移动多媒体业务的最优路由方法","authors":"Asma BEN LETAIFA, T. Bejaoui, S. Tabbane, Z. Choukair","doi":"10.1109/CCNC.2007.220","DOIUrl":null,"url":null,"abstract":"In reconfiguration process, dynamic service deployment needs to find at anytime the best way to lead data from source to destination. In this paper, we propose an optimization approach for routing in mobile radio networks. Three main algorithms are proposed. At first, a genetic algorithm based approach is used to find an optimal way in sub-network, when nodes number is low, but when this number is increasing, we used an algorithm based on flow deviation method indicating which link will be used and how much bytes will be leaded on this link. Finally, we give an hybrid solution that solve routing problem when linear solution doesn't succeed. This heuristic approach is based on load balancing techniques which maximise the use of network resources to offer as much as possible new available bandwidth. This paper gives at first the network model and used approach from commonly used algorithms in transport problem, simulates the three proposed algorithm and highlights the conclusion and future work.","PeriodicalId":166361,"journal":{"name":"2007 4th IEEE Consumer Communications and Networking Conference","volume":"240 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Optimal Routing Approaches for Radio Mobile Multimedia Services\",\"authors\":\"Asma BEN LETAIFA, T. Bejaoui, S. Tabbane, Z. Choukair\",\"doi\":\"10.1109/CCNC.2007.220\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In reconfiguration process, dynamic service deployment needs to find at anytime the best way to lead data from source to destination. In this paper, we propose an optimization approach for routing in mobile radio networks. Three main algorithms are proposed. At first, a genetic algorithm based approach is used to find an optimal way in sub-network, when nodes number is low, but when this number is increasing, we used an algorithm based on flow deviation method indicating which link will be used and how much bytes will be leaded on this link. Finally, we give an hybrid solution that solve routing problem when linear solution doesn't succeed. This heuristic approach is based on load balancing techniques which maximise the use of network resources to offer as much as possible new available bandwidth. This paper gives at first the network model and used approach from commonly used algorithms in transport problem, simulates the three proposed algorithm and highlights the conclusion and future work.\",\"PeriodicalId\":166361,\"journal\":{\"name\":\"2007 4th IEEE Consumer Communications and Networking Conference\",\"volume\":\"240 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 4th IEEE Consumer Communications and Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC.2007.220\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 4th IEEE Consumer Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC.2007.220","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在重新配置过程中,动态服务部署需要随时找到将数据从源引导到目标的最佳方式。本文提出了一种移动无线网络路由优化方法。提出了三种主要算法。首先,采用基于遗传算法的方法在子网络中寻找最优路径,当节点数量较少时,当节点数量增加时,采用基于流量偏差法的算法来指示使用哪条链路以及该链路将引导多少字节。最后给出了在线性解不成功的情况下求解路由问题的混合解。这种启发式方法基于负载平衡技术,它最大限度地利用网络资源,提供尽可能多的新可用带宽。本文首先给出了运输问题中常用算法的网络模型和使用方法,并对所提出的三种算法进行了仿真,重点介绍了结论和未来的工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal Routing Approaches for Radio Mobile Multimedia Services
In reconfiguration process, dynamic service deployment needs to find at anytime the best way to lead data from source to destination. In this paper, we propose an optimization approach for routing in mobile radio networks. Three main algorithms are proposed. At first, a genetic algorithm based approach is used to find an optimal way in sub-network, when nodes number is low, but when this number is increasing, we used an algorithm based on flow deviation method indicating which link will be used and how much bytes will be leaded on this link. Finally, we give an hybrid solution that solve routing problem when linear solution doesn't succeed. This heuristic approach is based on load balancing techniques which maximise the use of network resources to offer as much as possible new available bandwidth. This paper gives at first the network model and used approach from commonly used algorithms in transport problem, simulates the three proposed algorithm and highlights the conclusion and future work.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Utility Constrained Energy Minimization In Aloha Networks Ensuring Cache Freshness in On-Demand Routing Protocols for Mobile Ad Hoc Network: A Cross-layer Framework Fuzzy Logic for Cross-layer Optimization in Cognitive Radio Networks Automated Trustworthiness Management for Database Software Components Combining VoiceXML with CCXML: A Comparative Study
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1