{"id":"https://openalex.org/W1995433772","doi":"https://doi.org/10.1109/icccn.2013.6614107","title":"An Optimal Algorithm for Time-Slot Assignment in SS/TDMA Satellite Systems","display_name":"An Optimal Algorithm for Time-Slot Assignment in SS/TDMA Satellite Systems","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W1995433772","doi":"https://doi.org/10.1109/icccn.2013.6614107","mag":"1995433772"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2013.6614107","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","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/A5058933449","display_name":"Xili Wan","orcid":"https://orcid.org/0000-0001-9160-8246"},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xili Wan","raw_affiliation_strings":["University of Missouri, Kansas City, MO, USA","#N#                  University of Missouri, Kansas City, MO, USA#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Missouri, Kansas City, MO, USA","institution_ids":["https://openalex.org/I75421653"]},{"raw_affiliation_string":"#N#                  University of Missouri, Kansas City, MO, USA#N#","institution_ids":["https://openalex.org/I75421653"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007711808","display_name":"Feng Shan","orcid":"https://orcid.org/0000-0001-7398-8265"},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Feng Shan","raw_affiliation_strings":["University of Missouri, Kansas City, MO, USA","#N#                  University of Missouri, Kansas City, MO, USA#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Missouri, Kansas City, MO, USA","institution_ids":["https://openalex.org/I75421653"]},{"raw_affiliation_string":"#N#                  University of Missouri, Kansas City, MO, USA#N#","institution_ids":["https://openalex.org/I75421653"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076110710","display_name":"Xiaojun Shen","orcid":"https://orcid.org/0000-0001-6950-3974"},"institutions":[{"id":"https://openalex.org/I75421653","display_name":"University of Missouri\u2013Kansas City","ror":"https://ror.org/01w0d5g70","country_code":"US","type":"education","lineage":["https://openalex.org/I75421653"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Xiaojun Shen","raw_affiliation_strings":["University of Missouri, Kansas City, MO, USA","#N#                  University of Missouri, Kansas City, MO, USA#N#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Missouri, Kansas City, MO, USA","institution_ids":["https://openalex.org/I75421653"]},{"raw_affiliation_string":"#N#                  University of Missouri, Kansas City, MO, USA#N#","institution_ids":["https://openalex.org/I75421653"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3773,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.65057294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":null,"first_page":"1","last_page":"6"},"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/T12042","display_name":"Satellite Communication Systems","score":0.9980000257492065,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9915000200271606,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/time-division-multiple-access","display_name":"Time division multiple access","score":0.8926663398742676},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7165288329124451},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6143232583999634},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6019439101219177},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.6013281345367432},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5385032892227173},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4926353096961975},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4281787574291229},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4124152958393097},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2706908583641052},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1982596516609192}],"concepts":[{"id":"https://openalex.org/C117313154","wikidata":"https://www.wikidata.org/wiki/Q878344","display_name":"Time division multiple access","level":2,"score":0.8926663398742676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7165288329124451},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6143232583999634},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6019439101219177},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.6013281345367432},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5385032892227173},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4926353096961975},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4281787574291229},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4124152958393097},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2706908583641052},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1982596516609192},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2013.6614107","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2013.6614107","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 22nd International Conference on Computer Communication and Networks (ICCCN)","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":18,"referenced_works":["https://openalex.org/W1487100867","https://openalex.org/W1977545325","https://openalex.org/W1989364677","https://openalex.org/W2046277660","https://openalex.org/W2073270225","https://openalex.org/W2099069270","https://openalex.org/W2106522282","https://openalex.org/W2112380628","https://openalex.org/W2112421563","https://openalex.org/W2115727218","https://openalex.org/W2120000070","https://openalex.org/W2136798856","https://openalex.org/W2137789333","https://openalex.org/W2151632247","https://openalex.org/W2169752995","https://openalex.org/W4213060235","https://openalex.org/W6662160296","https://openalex.org/W6676796955"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2353618196","https://openalex.org/W2348074676","https://openalex.org/W2385033175","https://openalex.org/W2374043190","https://openalex.org/W4307865488","https://openalex.org/W2137811827"],"abstract_inverted_index":{"Packet":[0],"scheduling":[1],"in":[2,8,36,77,96,125,149,172],"switches":[3],"plays":[4],"an":[5,139,153],"important":[6],"role":[7],"providing":[9],"guaranteed":[10],"service":[11],"to":[12,53,102,109],"meet":[13],"Quality-of-Service":[14],"(QoS)":[15],"requirements.":[16],"In":[17],"this":[18,126,143],"paper,":[19,98,127],"we":[20,128],"revisit":[21],"a":[22,50],"historical":[23],"Maximum":[24],"Traffic":[25],"Time-slot":[26,92],"Scheduling":[27],"(MTTS)":[28],"problem":[29,87,107,118,132,171],"for":[30,142,163,177],"both":[31],"circuit-":[32],"and":[33,67,99,185],"packet-switched":[34,72],"traffic":[35,62,73,148],"SS/TDMA":[37],"satellite":[38],"systems":[39],"proposed":[40],"two":[41],"decades":[42],"ago":[43],"by":[44,120],"Bonuccelli":[45],"et":[46],"al..":[47],"They":[48],"developed":[49,162],"two-step":[51,122],"approach":[52],"solve":[54,168],"the":[55,60,113,114,147,169,178,190],"MTTS":[56,106,131,164,170],"problem,":[57,165],"which":[58,166],"scheduled":[59,79,150],"circuit-switched":[61],"first":[63],"into":[64,74],"TDMA":[65,80,151],"frames":[66,81],"then":[68],"inserted":[69],"packets":[70],"from":[71],"empty":[75],"slots":[76],"these":[78],"as":[82,84,90],"many":[83],"possible.":[85],"This":[86],"was":[88,100],"referred":[89],"Incremental":[91],"Assignment":[93],"(ITSA)":[94],"Problem":[95],"their":[97,121],"proved":[101],"be":[103,110],"NP-hard.":[104],"Therefore,":[105],"seems":[108],"NP-hard":[111],"due":[112],"NP-hardness":[115],"of":[116,180,192],"ITSA":[117],"induced":[119],"approach.":[123],"However,":[124],"show":[129],"that":[130],"is":[133,161,183],"NOT":[134],"NP-hard,":[135],"since":[136],"there":[137],"exists":[138],"optimal":[140,154],"algorithm":[141,155,182],"problem.":[144],"By":[145],"aggregating":[146],"frames,":[152],"based":[156],"on":[157],"network":[158],"flow":[159],"method":[160],"can":[167],"polynomial":[173],"time.":[174],"Theoretic":[175],"proof":[176],"optimality":[179],"our":[181,193],"given":[184],"simulations":[186],"results":[187],"further":[188],"validate":[189],"correctness":[191],"algorithm.":[194]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}