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}
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.