{"id":"https://openalex.org/W2154618393","doi":"https://doi.org/10.1109/icc.2009.5199379","title":"QoS Swarm State Dependent Routing for Irregular Traffic in Telecommunication Networks","display_name":"QoS Swarm State Dependent Routing for Irregular Traffic in Telecommunication Networks","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2154618393","doi":"https://doi.org/10.1109/icc.2009.5199379","mag":"2154618393"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2009.5199379","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5199379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063072962","display_name":"Farid Baguenine","orcid":null},"institutions":[{"id":"https://openalex.org/I2800365227","display_name":"Paris-Est Sup","ror":"https://ror.org/0268ecp52","country_code":"FR","type":"education","lineage":["https://openalex.org/I2800365227"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"F. Baguenine","raw_affiliation_strings":["LiSSi Laboratory, IUT Creteil-Vitry, University of Paris, Vitry sur Seine, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LiSSi Laboratory, IUT Creteil-Vitry, University of Paris, Vitry sur Seine, France","institution_ids":["https://openalex.org/I2800365227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045421775","display_name":"Abdelhamid Mellouk","orcid":"https://orcid.org/0000-0002-6886-7394"},"institutions":[{"id":"https://openalex.org/I2800365227","display_name":"Paris-Est Sup","ror":"https://ror.org/0268ecp52","country_code":"FR","type":"education","lineage":["https://openalex.org/I2800365227"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. Mellouk","raw_affiliation_strings":["LiSSi Laboratory, IUT Creteil-Vitry, University of Paris, Vitry sur Seine, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LiSSi Laboratory, IUT Creteil-Vitry, University of Paris, Vitry sur Seine, France","institution_ids":["https://openalex.org/I2800365227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.21156782,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"33","issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11158","display_name":"Wireless Networks and Protocols","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7672488689422607},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6137591600418091},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5816651582717896},{"id":"https://openalex.org/keywords/swarm-behaviour","display_name":"Swarm behaviour","score":0.5464495420455933},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5292030572891235},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.516499936580658},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5120940208435059},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.49589499831199646},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.45714831352233887},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4502972960472107},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.440211683511734},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4209189713001251},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.416140079498291},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.36847472190856934},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26075953245162964},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10121515393257141}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7672488689422607},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6137591600418091},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5816651582717896},{"id":"https://openalex.org/C181335050","wikidata":"https://www.wikidata.org/wiki/Q14915018","display_name":"Swarm behaviour","level":2,"score":0.5464495420455933},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5292030572891235},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.516499936580658},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5120940208435059},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.49589499831199646},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.45714831352233887},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4502972960472107},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.440211683511734},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4209189713001251},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.416140079498291},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.36847472190856934},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26075953245162964},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10121515393257141}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2009.5199379","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5199379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W83952242","https://openalex.org/W394832661","https://openalex.org/W1631888268","https://openalex.org/W1816929975","https://openalex.org/W2014411916","https://openalex.org/W2025512607","https://openalex.org/W2092796322","https://openalex.org/W2098339238","https://openalex.org/W2132940773","https://openalex.org/W2146354236","https://openalex.org/W2152170792","https://openalex.org/W2156666755","https://openalex.org/W2171299282","https://openalex.org/W2949715023","https://openalex.org/W2985192867","https://openalex.org/W4285719527","https://openalex.org/W6679800765","https://openalex.org/W6681606746","https://openalex.org/W6685007669","https://openalex.org/W7015497765"],"related_works":["https://openalex.org/W1997091564","https://openalex.org/W3035942111","https://openalex.org/W2138640781","https://openalex.org/W2102655743","https://openalex.org/W2740434786","https://openalex.org/W1998255551","https://openalex.org/W2372626604","https://openalex.org/W2024984474","https://openalex.org/W2607223747","https://openalex.org/W2081964190"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,56,60,69,101],"polynomial":[4],"time":[5],"approximation":[6],"quality":[7],"of":[8,85,91],"service":[9],"(QoS)":[10],"routing":[11,17,52],"algorithm":[12,21,43],"and":[13,54,68],"constructs":[14],"dynamic":[15,103],"state-dependent":[16],"policies.":[18],"The":[19,42],"proposed":[20],"uses":[22,55],"an":[23],"inductive":[24],"approach":[25,71,93],"based":[26,47],"on":[27,48],"trial/error":[28],"paradigm":[29],"combined":[30],"with":[31,79],"swarm":[32],"adaptive":[33,51,98],"approaches":[34],"to":[35],"optimize":[36],"the":[37,65,73,95],"end-to-end":[38],"delay":[39],"packet":[40],"transmission.":[41],"presented":[44],"here":[45],"is":[46],"our":[49,92],"earlier":[50],"system":[53],"model":[57],"combining":[58],"both":[59],"stochastic":[61],"planned":[62],"pre-navigation":[63],"for":[64,72,82],"exploration":[66],"phase":[67],"deterministic":[70],"backward":[74],"phase.":[75],"Numerical":[76],"results":[77],"obtained":[78],"OPNET":[80],"simulator":[81],"different":[83],"levels":[84],"traffic's":[86],"load":[87],"show":[88],"good":[89],"performances":[90],"compared":[94],"classical":[96],"non":[97],"algorithms":[99],"in":[100],"high":[102],"environment.":[104]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}