{"id":"https://openalex.org/W2744506091","doi":"https://doi.org/10.1109/ict.2017.7998248","title":"A novel reliable routing scheme for Tactile-oriented Internet traffic","display_name":"A novel reliable routing scheme for Tactile-oriented Internet traffic","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2744506091","doi":"https://doi.org/10.1109/ict.2017.7998248","mag":"2744506091"},"language":"en","primary_location":{"id":"doi:10.1109/ict.2017.7998248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ict.2017.7998248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 24th International Conference on Telecommunications (ICT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://kclpure.kcl.ac.uk/ws/files/68575875/ICT_2017_Tactile_MPR_final.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049480346","display_name":"Mohammad Farhoudi","orcid":"https://orcid.org/0000-0002-7427-1722"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mohammad Farhoudi","raw_affiliation_strings":["Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK"],"affiliations":[{"raw_affiliation_string":"Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064856244","display_name":"Panagiotis Palantas","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Panagiotis Palantas","raw_affiliation_strings":["Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK"],"affiliations":[{"raw_affiliation_string":"Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038681407","display_name":"Benyamin Abrishamchi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benyamin Abrishamchi","raw_affiliation_strings":["Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK"],"affiliations":[{"raw_affiliation_string":"Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061953901","display_name":"Andrej Mihailovi\u0107","orcid":"https://orcid.org/0000-0001-5067-6234"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrej Mihailovic","raw_affiliation_strings":["Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK"],"affiliations":[{"raw_affiliation_string":"Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065296493","display_name":"A.H. Aghvami","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A.Hamid Aghvami","raw_affiliation_strings":["Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK"],"affiliations":[{"raw_affiliation_string":"Faculty of Natural and Mathematical Sciences, Centre for Telecommunications Research, London, UK","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5049480346"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4237,"has_fulltext":true,"cited_by_count":11,"citation_normalized_percentile":{"value":0.80516966,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11687","display_name":"Teleoperation and Haptic Systems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11687","display_name":"Teleoperation and Haptic Systems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9879999756813049,"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/T12216","display_name":"Network Time Synchronization Technologies","score":0.9872000217437744,"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.7979863882064819},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7327646017074585},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5364454984664917},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.529762327671051},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.5247093439102173},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.5044797658920288},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.4660910665988922},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.45873963832855225},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45371517539024353},{"id":"https://openalex.org/keywords/packet-loss","display_name":"Packet loss","score":0.41040870547294617},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.382683128118515}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7979863882064819},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7327646017074585},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5364454984664917},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.529762327671051},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.5247093439102173},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.5044797658920288},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.4660910665988922},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.45873963832855225},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45371517539024353},{"id":"https://openalex.org/C54108766","wikidata":"https://www.wikidata.org/wiki/Q391064","display_name":"Packet loss","level":3,"score":0.41040870547294617},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.382683128118515},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ict.2017.7998248","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ict.2017.7998248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 24th International Conference on Telecommunications (ICT)","raw_type":"proceedings-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/6640bfde-a7e2-42d6-acd0-3c7207ce1129","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/6640bfde-a7e2-42d6-acd0-3c7207ce1129","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/68575875/ICT_2017_Tactile_MPR_final.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Farhoudi , M H , Palantas , P , Abrishamchi , B , Mihailovic , A & Aghvami , A-H 2017 , A novel reliable routing scheme for Tactile-oriented Internet traffic . in International Conference on Telecommunications : ICT 2017, Limassol, Cyprus . https://doi.org/10.1109/ICT.2017.7998248","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/6640bfde-a7e2-42d6-acd0-3c7207ce1129","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/6640bfde-a7e2-42d6-acd0-3c7207ce1129","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/68575875/ICT_2017_Tactile_MPR_final.pdf","source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Farhoudi , M H , Palantas , P , Abrishamchi , B , Mihailovic , A & Aghvami , A-H 2017 , A novel reliable routing scheme for Tactile-oriented Internet traffic . in International Conference on Telecommunications : ICT 2017, Limassol, Cyprus . https://doi.org/10.1109/ICT.2017.7998248","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[{"score":0.6299999952316284,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2744506091.pdf","grobid_xml":"https://content.openalex.org/works/W2744506091.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1520218182","https://openalex.org/W1967040861","https://openalex.org/W2030619083","https://openalex.org/W2097858624","https://openalex.org/W2099133753","https://openalex.org/W2136943229","https://openalex.org/W2144256528","https://openalex.org/W2156639545","https://openalex.org/W2167947101","https://openalex.org/W2221147950","https://openalex.org/W2261274654","https://openalex.org/W2273872505","https://openalex.org/W2288063925","https://openalex.org/W2294721440","https://openalex.org/W2464244641","https://openalex.org/W3103060003","https://openalex.org/W4389346166","https://openalex.org/W6688685907","https://openalex.org/W6696301321","https://openalex.org/W6785876401"],"related_works":["https://openalex.org/W2061699822","https://openalex.org/W2119673702","https://openalex.org/W3160281244","https://openalex.org/W947546393","https://openalex.org/W4220949317","https://openalex.org/W2122925822","https://openalex.org/W1993229082","https://openalex.org/W1977412657","https://openalex.org/W2531225563","https://openalex.org/W2541249923"],"abstract_inverted_index":{"Over":[0],"the":[1,35,39,66,71,169,172,180],"past":[2],"few":[3],"years,":[4],"many":[5],"scientists":[6],"have":[7],"envisioned":[8],"an":[9],"Internet":[10,29,158],"generation":[11],"that":[12,46,63,88,118,140],"will":[13,47,136],"not":[14,147],"only":[15],"provide":[16],"voice":[17],"and":[18,44,96,108,132,187],"data":[19],"communications":[20,155],"but":[21],"can":[22,31,64,146],"also":[23,137],"support":[24],"Haptic":[25,77,112,154],"communications.":[26,78,113],"This":[27],"new":[28,42,72],"dimension":[30],"be":[32,148],"beneficial":[33],"for":[34,168],"society":[36],"by":[37],"facilitating":[38],"development":[40],"of":[41,51,70,171,179],"technologies":[43],"applications":[45],"improve":[48],"our":[49,119],"standards":[50],"living.":[52],"In":[53],"this":[54,102],"study,":[55],"we":[56,162],"propose":[57],"a":[58,164],"novel":[59],"traffic":[60,73],"engineering":[61],"policy":[62,81,121],"satisfy":[65],"extremely":[67],"strict":[68],"requirements":[69],"class":[74],"associated":[75],"with":[76],"Our":[79,114],"proposed":[80,120],"is":[82],"based":[83],"on":[84],"Multi-Plane":[85],"Routing":[86,174],"(MPR)":[87],"consolidates":[89],"various":[90],"aspects":[91],"in":[92,150,156,177],"all-IP":[93],"access":[94],"infrastructures":[95],"enables":[97],"network-wide":[98],"path":[99],"diversity.":[100],"To":[101],"end,":[103],"MPR":[104],"has":[105],"been":[106],"remodeled":[107],"extended":[109],"to":[110,152],"facilitate":[111],"simulation":[115],"results":[116],"demonstrate":[117],"outperforms":[122],"intra-domain":[123],"routing":[124],"protocols":[125],"namely":[126],"Open":[127],"Shortest":[128],"Path":[129],"First":[130],"(OSPF)":[131],"performs":[133],"near-optimally.":[134],"It":[135],"become":[138],"apparent":[139],"shortest-path":[141],"solutions":[142],"such":[143,183],"as":[144,184],"OSPF":[145],"used":[149],"order":[151],"handle":[153],"typical":[157],"network":[159,181],"topologies.":[160],"Finally,":[161],"formulate":[163],"binary":[165],"optimization":[166],"problem":[167],"selection":[170],"optimal":[173],"Plane":[175],"(RP)":[176],"terms":[178],"effects":[182],"delay,":[185],"jitter":[186],"packet":[188],"loss.":[189]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}