{"id":"https://openalex.org/W1565464677","doi":"https://doi.org/10.1109/cdc.2002.1184717","title":"Saddle policies for secure routing in communication networks","display_name":"Saddle policies for secure routing in communication networks","publication_year":2003,"publication_date":"2003-08-27","ids":{"openalex":"https://openalex.org/W1565464677","doi":"https://doi.org/10.1109/cdc.2002.1184717","mag":"1565464677"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2002.1184717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2002.1184717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE Conference on Decision and Control, 2002.","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/A5050916576","display_name":"Stephan Bohacek","orcid":"https://orcid.org/0000-0001-5424-4586"},"institutions":[{"id":"https://openalex.org/I1174212","display_name":"University of Southern California","ror":"https://ror.org/03taz7m60","country_code":"US","type":"education","lineage":["https://openalex.org/I1174212"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Bohacek","raw_affiliation_strings":["Department of Mathematics, University of Southern California, Los Angeles, CA, USA","Dept. of Math., Univ. of Southern California, Los Angeles, CA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Southern California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I1174212"]},{"raw_affiliation_string":"Dept. of Math., Univ. of Southern California, Los Angeles, CA, USA#TAB#","institution_ids":["https://openalex.org/I1174212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065218317","display_name":"Jo\u00e3o P. Hespanha","orcid":"https://orcid.org/0000-0003-2809-4718"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.P. Hespanha","raw_affiliation_strings":["Department Electrical & Computer Engineering, University of California, Santa Barbara, CA, USA","University of California,Santa Barbara,"],"affiliations":[{"raw_affiliation_string":"Department Electrical & Computer Engineering, University of California, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California,Santa Barbara,","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067832138","display_name":"Katia Obraczka","orcid":"https://orcid.org/0000-0001-9720-1690"},"institutions":[{"id":"https://openalex.org/I185103710","display_name":"University of California, Santa Cruz","ror":"https://ror.org/03s65by71","country_code":"US","type":"education","lineage":["https://openalex.org/I185103710"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Obraczka","raw_affiliation_strings":["Computer Engineering Department, University of California, Santa Cruz, CA, USA","University of California/Santa Cruz"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, University of California, Santa Cruz, CA, USA","institution_ids":["https://openalex.org/I185103710"]},{"raw_affiliation_string":"University of California/Santa Cruz","institution_ids":["https://openalex.org/I185103710"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5050916576"],"corresponding_institution_ids":["https://openalex.org/I1174212"],"apc_list":null,"apc_paid":null,"fwci":1.0903,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.75576061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"2","issue":null,"first_page":"1416","last_page":"1421"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9983999729156494,"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.9976999759674072,"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.7577451467514038},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7141550183296204},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.6803362369537354},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6339221000671387},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.6288217306137085},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5867629051208496},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5728805065155029},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.570252537727356},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.5698717832565308},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.4848264455795288},{"id":"https://openalex.org/keywords/zone-routing-protocol","display_name":"Zone Routing Protocol","score":0.4835043251514435},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.4744842052459717},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4570879638195038},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4385703206062317},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.42821961641311646},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.425260454416275},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.41076481342315674},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.0774017870426178}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7577451467514038},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7141550183296204},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.6803362369537354},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6339221000671387},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.6288217306137085},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5867629051208496},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5728805065155029},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.570252537727356},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.5698717832565308},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.4848264455795288},{"id":"https://openalex.org/C189884158","wikidata":"https://www.wikidata.org/wiki/Q8073926","display_name":"Zone Routing Protocol","level":5,"score":0.4835043251514435},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.4744842052459717},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4570879638195038},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4385703206062317},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.42821961641311646},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.425260454416275},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.41076481342315674},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0774017870426178},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/cdc.2002.1184717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2002.1184717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 41st IEEE Conference on Decision and Control, 2002.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.115.7025","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.115.7025","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.ucsb.edu/~hespanha/published/tr_routing02.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.131.9715","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.131.9715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecis.udel.edu/~bohacek/Papers/CDC02-INV0605.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.76.252","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.76.252","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://inrg.cse.ucsc.edu/katia-pubs/saddle.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W13083931","https://openalex.org/W1549732571","https://openalex.org/W1565464677","https://openalex.org/W2118949809","https://openalex.org/W2169246522","https://openalex.org/W2610857016","https://openalex.org/W6600537268"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W2148093630","https://openalex.org/W4253436398","https://openalex.org/W2068473861","https://openalex.org/W1655019438","https://openalex.org/W2002267183","https://openalex.org/W1538003338","https://openalex.org/W2364686261","https://openalex.org/W2556128816","https://openalex.org/W2607223747"],"abstract_inverted_index":{"In":[0],"this":[1,32],"paper":[2],"we":[3,34],"formalize":[4],"routing":[5,17,37,66,83],"in":[6,42,89],"communication":[7],"networks":[8],"as":[9],"a":[10,98],"game":[11],"between":[12],"the":[13,16,43,52,61],"designer":[14],"of":[15,54],"algorithm":[18],"and":[19,74,84,94],"an":[20],"attacker":[21],"that":[22,39,45,60],"attempts":[23],"to":[24,31,50,72],"intercept":[25],"packets.":[26],"By":[27],"computing":[28],"saddle-point":[29],"solutions":[30],"game,":[33],"obtain":[35],"stochastic":[36],"policies":[38,62,77],"are":[40],"secure":[41,65,82],"sense":[44],"they":[46],"utilize":[47],"multiple":[48],"paths":[49],"minimize":[51],"probability":[53],"packet":[55],"interception.":[56],"We":[57],"also":[58],"show":[59],"obtained":[63],"for":[64],"can":[67],"be":[68],"optimal":[69],"with":[70],"respect":[71],"flow-maximization":[73],"load-balancing.":[75],"These":[76],"thus":[78],"have":[79],"applications":[80],"beyond":[81],"may":[85],"proof":[86],"useful,":[87],"e.g.,":[88],"wireless":[90],"networks,":[91],"where":[92],"bandwidth":[93],"power":[95],"is":[96],"at":[97],"premium.":[99]},"counts_by_year":[{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}