{"id":"https://openalex.org/W1490762913","doi":"https://doi.org/10.1109/ict.2015.7124715","title":"A buffer-limited maximum throughput routing algorithm for satellite network","display_name":"A buffer-limited maximum throughput routing algorithm for satellite network","publication_year":2015,"publication_date":"2015-04-01","ids":{"openalex":"https://openalex.org/W1490762913","doi":"https://doi.org/10.1109/ict.2015.7124715","mag":"1490762913"},"language":"en","primary_location":{"id":"doi:10.1109/ict.2015.7124715","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ict.2015.7124715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 22nd International Conference on Telecommunications (ICT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100301544","display_name":"Bing Lin","orcid":null},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bing Lin","raw_affiliation_strings":["State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, P. R. China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100455600","display_name":"Hongyan Li","orcid":"https://orcid.org/0000-0003-1464-5128"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongyan Li","raw_affiliation_strings":["State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, P. R. China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091745362","display_name":"Yan Long","orcid":"https://orcid.org/0000-0002-3772-5369"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yan Long","raw_affiliation_strings":["State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, P. R. China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an, P. R. China","institution_ids":["https://openalex.org/I149594827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I149594827"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"378","last_page":"383"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","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/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","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/T12042","display_name":"Satellite Communication Systems","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T13553","display_name":"Age of Information Optimization","score":0.9918000102043152,"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.8445752263069153},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6835863590240479},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.629371166229248},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5687547922134399},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5541080832481384},{"id":"https://openalex.org/keywords/delay-tolerant-networking","display_name":"Delay-tolerant networking","score":0.5435873866081238},{"id":"https://openalex.org/keywords/routing-algorithm","display_name":"Routing algorithm","score":0.5279507040977478},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5205134749412537},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.475885272026062},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.37410983443260193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3648308515548706},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.10698607563972473},{"id":"https://openalex.org/keywords/wireless-routing-protocol","display_name":"Wireless Routing Protocol","score":0.10466885566711426},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09306895732879639}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8445752263069153},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6835863590240479},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.629371166229248},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5687547922134399},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5541080832481384},{"id":"https://openalex.org/C53264328","wikidata":"https://www.wikidata.org/wiki/Q55320","display_name":"Delay-tolerant networking","level":5,"score":0.5435873866081238},{"id":"https://openalex.org/C2984173633","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Routing algorithm","level":4,"score":0.5279507040977478},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5205134749412537},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.475885272026062},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.37410983443260193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3648308515548706},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.10698607563972473},{"id":"https://openalex.org/C47318570","wikidata":"https://www.wikidata.org/wiki/Q8026863","display_name":"Wireless Routing Protocol","level":4,"score":0.10466885566711426},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09306895732879639},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ict.2015.7124715","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ict.2015.7124715","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 22nd International Conference on Telecommunications (ICT)","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":11,"referenced_works":["https://openalex.org/W1990569229","https://openalex.org/W1996965871","https://openalex.org/W2002531683","https://openalex.org/W2006890895","https://openalex.org/W2098746202","https://openalex.org/W2102499418","https://openalex.org/W2104724137","https://openalex.org/W2144509357","https://openalex.org/W2149959815","https://openalex.org/W2169530543","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2149224531","https://openalex.org/W4247716783","https://openalex.org/W2137646787","https://openalex.org/W2160885658","https://openalex.org/W2098791961","https://openalex.org/W2357943673","https://openalex.org/W2144164383","https://openalex.org/W2483530712","https://openalex.org/W4230539218","https://openalex.org/W2938528237"],"abstract_inverted_index":{"Satellite":[0],"network":[1,113],"has":[2],"played":[3],"an":[4],"important":[5],"role":[6],"in":[7,34,36],"the":[8,43,49,55,87,90,101,112,119,129],"future":[9],"global":[10,17],"network,":[11],"due":[12],"to":[13,110],"its":[14],"advantages":[15],"of":[16,26,31,89],"coverage":[18],"and":[19,41,60],"short":[20],"round-trip":[21],"time":[22],"(RTT).":[23],"Its":[24],"characteristic":[25],"intermittent":[27],"connection":[28],"causes":[29],"no-existence":[30],"end-to-end":[32],"path":[33,97,133],"general":[35],"Disruption":[37],"Tolerant":[38],"Network":[39],"(DTN),":[40],"thus":[42,61],"store-carry-forward":[44,50],"mechanism":[45,121],"is":[46,83],"adopted.":[47],"However,":[48],"routing":[51,64],"does":[52],"not":[53],"consider":[54],"buffer":[56,108],"constraint":[57,109],"on":[58,79,95],"nodes,":[59],"a":[62,75],"novel":[63,76],"scheme":[65],"should":[66],"be":[67],"designed":[68],"for":[69,104],"such":[70],"scenario.":[71],"In":[72],"this":[73],"paper,":[74],"model":[77],"based":[78],"time-varying":[80],"graph":[81],"(TVG)":[82],"devised,":[84],"which":[85,131],"keeps":[86],"richness":[88],"original":[91],"DTN":[92,105],"information.":[93],"Based":[94],"early-connect-early-select":[96],"mechanism,":[98],"we":[99],"design":[100],"labeling":[102],"algorithm":[103,130],"(LAD)":[106],"under":[107],"maximize":[111],"throughput.":[114],"Numerical":[115],"simulation":[116],"shows":[117],"that":[118],"proposed":[120],"can":[122],"effectively":[123],"achieve":[124],"better":[125],"throughput":[126],"performance":[127],"than":[128],"selects":[132],"randomly.":[134]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}