{"id":"https://openalex.org/W2057958834","doi":"https://doi.org/10.1109/lanman.2014.7028625","title":"An entropy maximization problem in shortest path routing networks","display_name":"An entropy maximization problem in shortest path routing networks","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2057958834","doi":"https://doi.org/10.1109/lanman.2014.7028625","mag":"2057958834"},"language":"en","primary_location":{"id":"doi:10.1109/lanman.2014.7028625","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman.2014.7028625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 20th International Workshop on Local & Metropolitan Area Networks (LANMAN)","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/A5089818907","display_name":"Vanniarajan Chellappan","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Vanniarajan Chellappan","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India-600036"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India-600036","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087560555","display_name":"Krishna M. Sivalingam","orcid":"https://orcid.org/0000-0001-8425-3432"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Krishna M. Sivalingam","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India-600036"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India-600036","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088534812","display_name":"Kamala Krithivasan","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"facility","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Kamala Krithivasan","raw_affiliation_strings":["Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India-600036"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Indian Institute of Technology Madras, Chennai, India-600036","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089818907"],"corresponding_institution_ids":["https://openalex.org/I24676775"],"apc_list":null,"apc_paid":null,"fwci":0.2345,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.56396279,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"106","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9708999991416931,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9409000277519226,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8056066036224365},{"id":"https://openalex.org/keywords/centrality","display_name":"Centrality","score":0.6647886037826538},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5887379050254822},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5582836866378784},{"id":"https://openalex.org/keywords/entropy-maximization","display_name":"Entropy maximization","score":0.5411130785942078},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.46979889273643494},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.4607487916946411},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.44358253479003906},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.4337673783302307},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42814862728118896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37937435507774353},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3280262053012848},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.24014267325401306},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.23295709490776062},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11226785182952881},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11046558618545532}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8056066036224365},{"id":"https://openalex.org/C53811970","wikidata":"https://www.wikidata.org/wiki/Q5062194","display_name":"Centrality","level":2,"score":0.6647886037826538},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5887379050254822},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5582836866378784},{"id":"https://openalex.org/C127233936","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Entropy maximization","level":3,"score":0.5411130785942078},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.46979889273643494},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.4607487916946411},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.44358253479003906},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.4337673783302307},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42814862728118896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37937435507774353},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3280262053012848},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.24014267325401306},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.23295709490776062},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11226785182952881},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11046558618545532},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lanman.2014.7028625","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lanman.2014.7028625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE 20th International Workshop on Local & Metropolitan Area Networks (LANMAN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1488914642","https://openalex.org/W1971937094","https://openalex.org/W1981535236","https://openalex.org/W1988944600","https://openalex.org/W1995875735","https://openalex.org/W2032558547","https://openalex.org/W2034921015","https://openalex.org/W2059033281","https://openalex.org/W2070319296","https://openalex.org/W2081979535","https://openalex.org/W2088506653","https://openalex.org/W2098618940","https://openalex.org/W2110600607","https://openalex.org/W2114158004","https://openalex.org/W2121815792","https://openalex.org/W2130522879","https://openalex.org/W2151234786","https://openalex.org/W2161718593","https://openalex.org/W2336057092","https://openalex.org/W2493479721","https://openalex.org/W3098114694","https://openalex.org/W4285719527","https://openalex.org/W6629238955"],"related_works":["https://openalex.org/W2388051136","https://openalex.org/W2357391150","https://openalex.org/W2156431668","https://openalex.org/W2370345607","https://openalex.org/W2996337372","https://openalex.org/W2161960576","https://openalex.org/W2134900907","https://openalex.org/W2144050074","https://openalex.org/W2300956438","https://openalex.org/W1992129517"],"abstract_inverted_index":{"In":[0],"the":[1,13,19,28,33,43,64,89,96,102,113,126],"context":[2],"of":[3,12,21,35,45,70,98,104],"an":[4,9],"IP":[5],"network,":[6,27],"we":[7,61],"investigate":[8],"interesting":[10],"case":[11],"inverse":[14,65],"shortest":[15,46,66,105],"path":[16],"problem":[17,67,129],"using":[18],"concept":[20],"network":[22,37],"centrality.":[23],"For":[24],"a":[25,36,77,99,121,136],"given":[26],"centrality":[29,78,114,122],"distribution":[30,57,79,123],"associated":[31],"with":[32],"links":[34],"can":[38],"be":[39,133],"determined":[40],"based":[41],"on":[42],"number":[44,103],"paths":[47,106],"passing":[48],"through":[49,109],"each":[50],"link.":[51],"An":[52,92,141],"entropy":[53],"measure":[54],"for":[55],"this":[56,72],"is":[58,81,118,130,139,154],"defined,":[59],"and":[60,135],"then":[62,75],"forumulate":[63],"in":[68,95,148],"terms":[69],"maximizing":[71],"entropy.":[73,127],"We":[74],"obtain":[76,120],"that":[80,107,124],"as":[82,85],"broadly":[83],"distributed":[84],"possible":[86],"subject":[87],"to":[88,119,132,143],"topology":[90],"constraints.":[91],"appropriate":[93],"change":[94],"weight":[97],"link":[100,145],"alters":[101],"pass":[108],"it,":[110],"thereby":[111],"modifying":[112],"distribution.":[115],"The":[116],"idea":[117],"maximizes":[125],"This":[128],"shown":[131],"NP-hard,":[134],"heuristic":[137],"approach":[138],"proposed.":[140],"application":[142],"handling":[144],"failure":[146],"scenarios":[147],"Open":[149],"Shortest":[150],"Path":[151],"First":[152],"routing":[153],"discussed.":[155]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}