{"id":"https://openalex.org/W1510576097","doi":"https://doi.org/10.1109/icnp.2004.1348079","title":"Trail blazer: a routing algorithm inspired by ants","display_name":"Trail blazer: a routing algorithm inspired by ants","publication_year":2004,"publication_date":"2004-11-08","ids":{"openalex":"https://openalex.org/W1510576097","doi":"https://doi.org/10.1109/icnp.2004.1348079","mag":"1510576097"},"language":"en","primary_location":{"id":"doi:10.1109/icnp.2004.1348079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp.2004.1348079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004.","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/A5054185733","display_name":"Eran Gabber","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E. Gabber","raw_affiliation_strings":["Google, Inc., New York, NY, USA","Google Inc., NY, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google, Inc., New York, NY, USA","institution_ids":["https://openalex.org/I1291425158"]},{"raw_affiliation_string":"Google Inc., NY, USA#TAB#","institution_ids":["https://openalex.org/I1291425158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089336554","display_name":"Matt Smith","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M.A. Smith","raw_affiliation_strings":["Bell Laboratories, Lucent Technologies (Lucent Worldwide Services), Murray Hill, NJ, USA","Lucent Technologies, Bell Labs, Murray Hill, NJ#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Bell Laboratories, Lucent Technologies (Lucent Worldwide Services), Murray Hill, NJ, USA","institution_ids":[]},{"raw_affiliation_string":"Lucent Technologies, Bell Labs, Murray Hill, NJ#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7486,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.76684126,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"2328","issue":null,"first_page":"36","last_page":"47"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":1.0,"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":1.0,"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.9997000098228455,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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-network","display_name":"Computer network","score":0.7263264656066895},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7250024080276489},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.647826075553894},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5992485880851746},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.5426680445671082},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4953373968601227},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.49333229660987854},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4556484818458557},{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.4336376190185547},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4197109043598175},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.35413551330566406},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13531416654586792},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.0818762481212616}],"concepts":[{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7263264656066895},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7250024080276489},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.647826075553894},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5992485880851746},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.5426680445671082},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4953373968601227},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.49333229660987854},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4556484818458557},{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.4336376190185547},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4197109043598175},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.35413551330566406},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13531416654586792},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0818762481212616}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icnp.2004.1348079","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnp.2004.1348079","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.379.7983","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.379.7983","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ieee-icnp.org/2004/papers/1-4.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":31,"referenced_works":["https://openalex.org/W35071001","https://openalex.org/W1664011265","https://openalex.org/W1948092788","https://openalex.org/W1971663816","https://openalex.org/W1985382559","https://openalex.org/W1997996213","https://openalex.org/W2018908443","https://openalex.org/W2040634542","https://openalex.org/W2043226657","https://openalex.org/W2053225543","https://openalex.org/W2092480587","https://openalex.org/W2096655151","https://openalex.org/W2096704096","https://openalex.org/W2103556250","https://openalex.org/W2105808107","https://openalex.org/W2107941094","https://openalex.org/W2142793498","https://openalex.org/W2150519657","https://openalex.org/W2159049132","https://openalex.org/W2171299282","https://openalex.org/W2248064281","https://openalex.org/W2996893651","https://openalex.org/W3161268770","https://openalex.org/W3161295396","https://openalex.org/W4243144664","https://openalex.org/W4248384603","https://openalex.org/W4250536665","https://openalex.org/W6640611774","https://openalex.org/W6643403933","https://openalex.org/W6685007669","https://openalex.org/W6691190440"],"related_works":["https://openalex.org/W2122302754","https://openalex.org/W2113362813","https://openalex.org/W104942727","https://openalex.org/W1993229082","https://openalex.org/W2150868791","https://openalex.org/W2081873092","https://openalex.org/W2351097701","https://openalex.org/W2101319396","https://openalex.org/W2330484436","https://openalex.org/W1924167960"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,29,32,49,60,126,165,184,210,218],"new":[3,84],"intra-domain":[4],"IP":[5],"routing":[6,36,220],"algorithm":[7,221],"called":[8],"trail":[9,127],"blazer":[10],"(TB)":[11],"that":[12,52,222],"alleviates":[13],"network":[14,110],"congestion":[15],"by":[16,24,67,86,116,120,170],"local":[17],"decisions":[18],"based":[19,38],"on":[20,39],"latency":[21],"measurements":[22],"collected":[23],"scout":[25,69,72,81,122],"packets.":[26,70],"TB":[27,44,132,190,208,233],"is":[28,65,133],"member":[30],"of":[31,34,42,56,98,108,128,139,158,167,172,202,217],"class":[33],"traffic-aware":[35],"algorithms":[37],"the":[40,54,99,109,154,198],"behavior":[41],"ants.":[43],"maintains":[45],"in":[46,90,161],"every":[47],"router":[48],"probability":[50,77,117,130,155],"table":[51,64],"controls":[53],"selection":[55],"outgoing":[57],"links":[58],"for":[59,176],"given":[61],"destination.":[62],"This":[63],"modified":[66],"passing":[68],"Some":[71],"packets":[73,82,102],"follow":[74],"existing":[75,140],"high":[76],"paths,":[78],"and":[79,124,174,178,229,239],"other":[80],"explore":[83],"paths":[85,228],"making":[87],"random":[88],"\"mistakes\"":[89],"order":[91],"to":[92,135,152,213],"find":[93],"detours":[94],"around":[95],"congested":[96,162],"areas":[97],"network.":[100],"Scout":[101],"do":[103],"not":[104],"have":[105],"global":[106],"knowledge":[107],"topology.":[111],"Rather,":[112],"they":[113],"are":[114],"influenced":[115],"trails":[118],"left":[119],"previous":[121],"packets,":[123],"leave":[125],"updated":[129],"information.":[131],"meant":[134],"be":[136],"an":[137],"extension":[138],"link-state":[141],"protocols":[142],"such":[143],"as":[144],"OSPF":[145],"or":[146],"IS-IS,":[147],"which":[148,195],"provide":[149],"shortest-path":[150,180,214],"information":[151],"initialize":[153],"table.":[156],"Simulations":[157],"UDP":[159,230,240],"traffic":[160,205,225,231],"networks":[163],"show":[164,234],"reduction":[166],"packet":[168,193],"drops":[169],"factors":[171],"3.4-38.4":[173],"1.8-8.2,":[175],"single-path":[177],"multi-path":[179],"routing,":[181],"respectively,":[182],"with":[183],"bounded":[185],"reordering":[186,194],"window.":[187],"Even":[188],"though":[189],"may":[191,196],"cause":[192],"affect":[197],"congesting":[199],"control":[200],"mechanisms":[201],"TCP,":[203],"TCP":[204,224,238],"sent":[206],"over":[207,226,232],"has":[209],"similar":[211],"bandwidth":[212],"routing.":[215],"Simulation":[216],"hybrid":[219],"routes":[223],"shortest":[227],"reduced":[235],"interference":[236],"between":[237],"traffic.":[241]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}