{"id":"https://openalex.org/W2140984197","doi":"https://doi.org/10.1109/ipdps.2004.1303185","title":"Request-service scheduling in dynamic communication networks","display_name":"Request-service scheduling in dynamic communication networks","publication_year":2004,"publication_date":"2004-06-10","ids":{"openalex":"https://openalex.org/W2140984197","doi":"https://doi.org/10.1109/ipdps.2004.1303185","mag":"2140984197"},"language":"en","primary_location":{"id":"doi:10.1109/ipdps.2004.1303185","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303185","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","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/A5028286618","display_name":"Seyed H. Roosta","orcid":null},"institutions":[{"id":"https://openalex.org/I127845322","display_name":"University of South Carolina Upstate","ror":"https://ror.org/00t9hhv14","country_code":"US","type":"education","lineage":["https://openalex.org/I127845322"]},{"id":"https://openalex.org/I155781252","display_name":"University of South Carolina","ror":"https://ror.org/02b6qw903","country_code":"US","type":"education","lineage":["https://openalex.org/I155781252"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S.H. Roosta","raw_affiliation_strings":["Department of Computer Science, University of South Carolina Spartanburg, USA","Dept. of Comput. Sci., South Carolina Univ., Spartanburg, SC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of South Carolina Spartanburg, USA","institution_ids":["https://openalex.org/I127845322"]},{"raw_affiliation_string":"Dept. of Comput. Sci., South Carolina Univ., Spartanburg, SC, USA","institution_ids":["https://openalex.org/I155781252"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5028286618"],"corresponding_institution_ids":["https://openalex.org/I127845322","https://openalex.org/I155781252"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20661099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"8","issue":null,"first_page":"178","last_page":"185"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"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.9994000196456909,"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9961000084877014,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9955000281333923,"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/computer-science","display_name":"Computer science","score":0.8119585514068604},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.7126637697219849},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.672177255153656},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6534554362297058},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.6473537683486938},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.6155871748924255},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.5669749975204468},{"id":"https://openalex.org/keywords/earliest-deadline-first-scheduling","display_name":"Earliest deadline first scheduling","score":0.5101035237312317},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5089478492736816},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.47236090898513794},{"id":"https://openalex.org/keywords/deadline-monotonic-scheduling","display_name":"Deadline-monotonic scheduling","score":0.43886199593544006},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.2099299430847168},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.11867862939834595},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.059966444969177246}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8119585514068604},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.7126637697219849},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.672177255153656},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6534554362297058},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.6473537683486938},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.6155871748924255},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.5669749975204468},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.5101035237312317},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5089478492736816},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.47236090898513794},{"id":"https://openalex.org/C76774629","wikidata":"https://www.wikidata.org/wiki/Q1146103","display_name":"Deadline-monotonic scheduling","level":5,"score":0.43886199593544006},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.2099299430847168},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.11867862939834595},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.059966444969177246}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdps.2004.1303185","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdps.2004.1303185","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th International Parallel and Distributed Processing Symposium, 2004. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1524804355","https://openalex.org/W1604797152","https://openalex.org/W1655990431","https://openalex.org/W2010184593","https://openalex.org/W2021517448","https://openalex.org/W2063317370","https://openalex.org/W2085319748","https://openalex.org/W2120758364","https://openalex.org/W2144402837","https://openalex.org/W2160907067"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2393789493","https://openalex.org/W2167574351","https://openalex.org/W4300092030","https://openalex.org/W1935185185","https://openalex.org/W2372008037","https://openalex.org/W2912206708","https://openalex.org/W2732220466","https://openalex.org/W2377321505","https://openalex.org/W2139562329"],"abstract_inverted_index":{"Summary":[0],"form":[1],"only":[2],"given.":[3],"We":[4],"investigate":[5],"the":[6,38,45,62,66,69,75,84,100],"problem":[7,64],"of":[8,10,16,27,53,68,72,87],"propagating":[9],"data":[11,22],"to":[12,31,74,92],"nodes":[13,18],"and":[14,56,104],"scheduling":[15,28,35,63],"available":[17],"in":[19,48,79,99],"a":[20,33,80,88],"dynamic":[21],"communication":[23,40,81],"network.":[24],"The":[25],"goal":[26],"algorithm":[29],"is":[30,42],"find":[32],"request-service":[34],"such":[36,95],"that":[37,96],"total":[39],"cost":[41],"minimized.":[43],"In":[44],"special":[46],"case":[47],"which":[49],"all":[50,57],"requests":[51,73],"are":[52,102,106],"equal":[54,60],"priorities":[55],"services":[58],"have":[59],"performance,":[61],"becomes":[65],"mapping":[67,89],"maximum":[70],"number":[71],"free":[76,93],"service-nodes.":[77],"Scheduling":[78],"network":[82,101],"entails":[83],"efficient":[85],"search":[86],"from":[90],"request-nodes":[91],"service-nodes":[94,105],"circuit":[97],"blockage":[98],"minimized":[103],"maximally":[107],"utilized.":[108]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}