{"id":"https://openalex.org/W1990439406","doi":"https://doi.org/10.1109/dft.2014.6962104","title":"Security methods in fault tolerant modified line graph based networks","display_name":"Security methods in fault tolerant modified line graph based networks","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W1990439406","doi":"https://doi.org/10.1109/dft.2014.6962104","mag":"1990439406"},"language":"en","primary_location":{"id":"doi:10.1109/dft.2014.6962104","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dft.2014.6962104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)","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/A5018353269","display_name":"Prashant D. Joshi","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Prashant D. Joshi","raw_affiliation_strings":["Austin, Texas"],"affiliations":[{"raw_affiliation_string":"Austin, Texas","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005739146","display_name":"Said Hamdioui","orcid":"https://orcid.org/0000-0002-8961-0387"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Said Hamdioui","raw_affiliation_strings":["Delft University of Technology, Delft, The Netherlands","Delft Univ. of Tech., Delft, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]},{"raw_affiliation_string":"Delft Univ. of Tech., Delft, The Netherlands#TAB#","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018353269"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09187892,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":null,"first_page":"57","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9991999864578247,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9987999796867371,"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/computer-science","display_name":"Computer science","score":0.8120032548904419},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7076771855354309},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.642362117767334},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6360032558441162},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5347301959991455},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5157211422920227},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5144162774085999},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.49143731594085693},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4512344002723694},{"id":"https://openalex.org/keywords/routing-domain","display_name":"Routing domain","score":0.4360368251800537},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.42340704798698425},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.4153786301612854},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.40092480182647705},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36724722385406494},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.32160794734954834},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30351120233535767},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14427760243415833}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8120032548904419},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7076771855354309},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.642362117767334},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6360032558441162},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5347301959991455},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5157211422920227},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5144162774085999},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.49143731594085693},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4512344002723694},{"id":"https://openalex.org/C94600068","wikidata":"https://www.wikidata.org/wiki/Q7371621","display_name":"Routing domain","level":5,"score":0.4360368251800537},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.42340704798698425},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.4153786301612854},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.40092480182647705},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36724722385406494},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.32160794734954834},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30351120233535767},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14427760243415833}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dft.2014.6962104","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dft.2014.6962104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems (DFT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6899999976158142}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1550619482","https://openalex.org/W1637557868","https://openalex.org/W1729503770","https://openalex.org/W1829285233","https://openalex.org/W1876506647","https://openalex.org/W1967656199","https://openalex.org/W1971937118","https://openalex.org/W1974540633","https://openalex.org/W1975203667","https://openalex.org/W1981159511","https://openalex.org/W1998050844","https://openalex.org/W2003590000","https://openalex.org/W2016158083","https://openalex.org/W2055402279","https://openalex.org/W2069387689","https://openalex.org/W2085406987","https://openalex.org/W2105447142","https://openalex.org/W2107096560","https://openalex.org/W2107527903","https://openalex.org/W2108673686","https://openalex.org/W2112819731","https://openalex.org/W2113113620","https://openalex.org/W2125732536","https://openalex.org/W2128090945","https://openalex.org/W2132877272","https://openalex.org/W2136747096","https://openalex.org/W2145344665","https://openalex.org/W2149482504","https://openalex.org/W2155061423","https://openalex.org/W2167303353","https://openalex.org/W2168509479","https://openalex.org/W4249439007","https://openalex.org/W4251598715","https://openalex.org/W6632905408"],"related_works":["https://openalex.org/W2607223747","https://openalex.org/W2082566976","https://openalex.org/W2613682624","https://openalex.org/W2286025681","https://openalex.org/W2369989480","https://openalex.org/W2944616377","https://openalex.org/W1585786976","https://openalex.org/W2096480024","https://openalex.org/W3163333513","https://openalex.org/W2619478018"],"abstract_inverted_index":{"Many":[0],"routing":[1,11,94],"protocols":[2],"make":[3],"some":[4],"assumptions":[5],"on":[6,35],"the":[7,10,14,25,44,49,56,73,79,90,93,98],"correctness":[8],"of":[9,32,48,55,68,100],"information":[12,95],"in":[13,24],"router.":[15],"This":[16,27,76],"at":[17],"times":[18],"allows":[19],"faults":[20],"and":[21,46,52,59,72,86,92],"malicious":[22,103],"attacks":[23],"networks.":[26],"paper":[28],"describes":[29],"a":[30],"class":[31,67],"networks":[33,71],"based":[34],"modified":[36],"line":[37],"graphs":[38],"with":[39],"many":[40],"features":[41],"to":[42,96],"authenticate":[43],"data":[45,91],"controls":[47],"message":[50],"routing,":[51],"having":[53],"properties":[54],"shortest":[57,61],"diameters":[58],"easy":[60],"path":[62],"calculations.":[63],"We":[64],"describe":[65],"this":[66],"fault":[69],"tolerant":[70],"relevant":[74],"properties.":[75],"helps":[77],"understand":[78],"security":[80],"mechanism,":[81],"WISH":[82],"('What":[83],"I":[84],"See":[85],"Hear')":[87],"that":[88],"probes":[89],"reduce":[97],"possibility":[99],"router":[101],"problems,":[102],"or":[104],"otherwise.":[105]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}