{"id":"https://openalex.org/W2072713897","doi":"https://doi.org/10.1109/pimrc.2013.6666732","title":"Novel fuzzy non-dominance shortest path routing and path ordering for QoS aware routing","display_name":"Novel fuzzy non-dominance shortest path routing and path ordering for QoS aware routing","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W2072713897","doi":"https://doi.org/10.1109/pimrc.2013.6666732","mag":"2072713897"},"language":"en","primary_location":{"id":"doi:10.1109/pimrc.2013.6666732","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2013.6666732","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","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/A5101341855","display_name":"Jing An","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Jing An","raw_affiliation_strings":["Institute of Telecommunications, King's College London, UK","Inst. of Telecommun., King's Coll. London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications, King's College London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Inst. of Telecommun., King's Coll. London, London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022369117","display_name":"Paul Pangalos","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Paul Pangalos","raw_affiliation_strings":["Institute of Telecommunications, King's College London, UK","Inst. of Telecommun., King's Coll. London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications, King's College London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Inst. of Telecommun., King's Coll. London, London, UK","institution_ids":["https://openalex.org/I183935753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065296493","display_name":"A.H. Aghvami","orcid":null},"institutions":[{"id":"https://openalex.org/I183935753","display_name":"King's College London","ror":"https://ror.org/0220mzb33","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I183935753"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"A. H. Aghvami","raw_affiliation_strings":["Institute of Telecommunications, King's College London, UK","Inst. of Telecommun., King's Coll. London, London, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications, King's College London, UK","institution_ids":["https://openalex.org/I183935753"]},{"raw_affiliation_string":"Inst. of Telecommun., King's Coll. London, London, UK","institution_ids":["https://openalex.org/I183935753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7545,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.76461533,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"3381","last_page":"3385"},"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.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"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994999766349792,"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.9988999962806702,"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.7503635883331299},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6471366882324219},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6011118292808533},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.5181787610054016},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5002021789550781},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4986135959625244},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.49368223547935486},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4782463610172272},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.46868330240249634},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.4654695689678192},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.4366455078125},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.2874096632003784},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.28030285239219666}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7503635883331299},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6471366882324219},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6011118292808533},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5181787610054016},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5002021789550781},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4986135959625244},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.49368223547935486},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4782463610172272},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.46868330240249634},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.4654695689678192},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4366455078125},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.2874096632003784},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.28030285239219666}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/pimrc.2013.6666732","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pimrc.2013.6666732","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)","raw_type":"proceedings-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/35101079-de69-4a4a-a191-b201ddd2f4f8","is_oa":false,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/35101079-de69-4a4a-a191-b201ddd2f4f8","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"An , J , Pangalos , P & Aghvami , A H 2013 , Novel fuzzy non-dominance shortest path routing and path ordering for QoS aware routing . in IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, PIMRC . , 6666732 , pp. 3381-3385 , 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications, PIMRC 2013 , London , United Kingdom , 8/09/2013 . https://doi.org/10.1109/PIMRC.2013.6666732","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.7400000095367432,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1985178674","https://openalex.org/W1986955201","https://openalex.org/W1994937951","https://openalex.org/W1997300857","https://openalex.org/W2042010570","https://openalex.org/W2065621669","https://openalex.org/W2068758895","https://openalex.org/W2103438486","https://openalex.org/W2111022489","https://openalex.org/W2119007268","https://openalex.org/W2161201881","https://openalex.org/W2163907500","https://openalex.org/W2165775873","https://openalex.org/W2911906969"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2751383119","https://openalex.org/W4253436398","https://openalex.org/W2068473861","https://openalex.org/W1538003338","https://openalex.org/W2364686261","https://openalex.org/W2556128816","https://openalex.org/W3125210154","https://openalex.org/W2351878639","https://openalex.org/W2607223747"],"abstract_inverted_index":{"In":[0,102],"this":[1,103,232],"paper":[2],"a":[3,56,60,124,172,190,204],"novel":[4,129],"fuzzy":[5,125,132,147,150,185],"non-dominance":[6,186],"routing":[7,17,44,69,74,121,153,187],"and":[8,33,135,154,179,219],"path":[9,98,134,152,155],"ordering":[10,156],"algorithm":[11,157],"is":[12,45,53,87,111,158,201,233],"presented":[13],"for":[14,18,39,95,160],"quality-of-service":[15],"(QoS)":[16],"networks":[19,241],"with":[20,167,176,242],"inaccurate":[21,116,168],"information.":[22,117,169],"As":[23],"one":[24],"of":[25,29,42,62,72,81,131,146,240],"the":[26,36,49,82,100,120,165,198,209,214],"essential":[27],"characteristic":[28],"both":[30],"mobile":[31,228],"wireless":[32],"fixed":[34],"networks,":[35],"information":[37,52],"available":[38,199],"decision":[40,57],"making":[41],"QoS":[43,97,162,175],"always":[46],"inaccurate[1][2].":[47],"Typically":[48],"link":[50,109],"state":[51],"collected":[54],"by":[55],"maker":[58],"as":[59,76,78,203],"result":[61],"dynamic":[63],"traffic":[64],"demand,":[65],"channel":[66],"quality,":[67],"mobility,":[68],"aggregation,":[70],"out":[71],"date":[73],"updates":[75],"well":[77],"any":[79],"combination":[80,145],"above":[83],"factors.":[84],"Therefore":[85],"it":[86],"very":[88],"difficult":[89],"to":[90,115,207,235,237],"model":[91,193],"an":[92],"exact":[93],"cost":[94],"individual":[96],"across":[99],"network.":[101],"paper,":[104],"we":[105],"consider":[106],"that":[107],"network":[108,142,166,174,210],"weight":[110],"naturally":[112],"uncertain":[113],"due":[114],"We":[118,182,212],"define":[119],"problem":[122],"in":[123],"weighted":[126],"graph.":[127],"A":[128,144],"concept":[130],"shortest":[133,151],"non-dominated":[136],"multi-path":[137],"will":[138],"be":[139],"introduced":[140],"into":[141],"routing.":[143],"controller,":[148],"link-state":[149],"developed":[159],"finding":[161],"paths":[163],"through":[164],"It":[170],"supports":[171],"better":[173],"less":[177],"computational":[178],"management":[180],"cost.":[181],"examine":[183],"our":[184,221],"scheme":[188],"under":[189],"rate-based":[191],"service":[192],"in[3].":[194],"Under":[195],"such":[196],"circumstance":[197],"bandwidth":[200],"considered":[202],"main":[205],"parameter":[206],"guarantee":[208],"QoS.":[211],"develop":[213],"simulation":[215],"on":[216,224],"OPNET":[217],"Modeler":[218],"demonstrate":[220],"results":[222],"based":[223],"randomized":[225],"partial":[226],"meshed":[227],"access":[229],"networks.":[230],"However":[231],"easy":[234],"extend":[236],"other":[238],"type":[239],"different":[243],"key":[244],"metrics.":[245]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}