{"id":"https://openalex.org/W1521245696","doi":null,"title":"Scheduling and dropping algorithms to support integrated services in packet-switched networks","display_name":"Scheduling and dropping algorithms to support integrated services in packet-switched networks","alternate_titles":[],"publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W1521245696","mag":"1521245696"},"language":"en","primary_location":{"id":"mag:1521245696","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=145628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W1521245696"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5016120217","display_name":"Jon M. Peha","orcid":"https://orcid.org/0000-0003-4915-306X","observed_orcids":["https://orcid.org/0000-0003-4915-306X"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Jon M. Peha","raw_affiliation_strings":["Stanford University Stanford CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stanford University Stanford CA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016120217"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":18,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9990000128746033,"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":0.9990000128746033,"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.00019999999494757503,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/integrated-services","display_name":"integrated services","score":0.7990000247955322},{"id":"https://openalex.org/keywords/packet-switched-networks","display_name":"packet-switched networks","score":0.9480000138282776},{"id":"https://openalex.org/keywords/queue-scheduling","display_name":"queue scheduling","score":0.7950000166893005},{"id":"https://openalex.org/keywords/packet-dropping","display_name":"packet dropping","score":0.9829999804496765},{"id":"https://openalex.org/keywords/cost-based-scheduling","display_name":"cost-based scheduling","score":0.9419999718666077},{"id":"https://openalex.org/keywords/queueing-delay","display_name":"queuing delay","score":0.8140000104904175},{"id":"https://openalex.org/keywords/cost-function","display_name":"cost function","score":0.8299999833106995},{"id":"https://openalex.org/keywords/network-access-points","display_name":"network access points","score":0.6439999938011169},{"id":"https://openalex.org/keywords/heuristic-algorithms","display_name":"heuristic algorithms","score":0.7279999852180481}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8114944696426392},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.648606538772583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.591307520866394},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5836203098297119},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5791051983833313},{"id":"https://openalex.org/C29722447","wikidata":"https://www.wikidata.org/wiki/Q17097321","display_name":"Maximum throughput scheduling","level":5,"score":0.5229799747467041},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5197605490684509},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.47921425104141235},{"id":"https://openalex.org/C32310161","wikidata":"https://www.wikidata.org/wiki/Q666365","display_name":"Earliest deadline first scheduling","level":5,"score":0.47822636365890503},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.47317272424697876},{"id":"https://openalex.org/C143647952","wikidata":"https://www.wikidata.org/wiki/Q1392979","display_name":"Fair queuing","level":5,"score":0.46582290530204773},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.4417654275894165},{"id":"https://openalex.org/C102486512","wikidata":"https://www.wikidata.org/wiki/Q457762","display_name":"Weighted fair queueing","level":3,"score":0.4369966983795166},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.42006075382232666},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3535062372684479},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.32802116870880127},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24010786414146423},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.19762465357780457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10613441467285156}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:1521245696","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=145628","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.884.2226","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.884.2226","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://repository.cmu.edu/cgi/viewcontent.cgi?article%3D1049%26context%3Depp","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W1995078276","https://openalex.org/W2120510527","https://openalex.org/W1537337699","https://openalex.org/W2399091069","https://openalex.org/W1485358275","https://openalex.org/W2167916293","https://openalex.org/W4400199603","https://openalex.org/W2948501131","https://openalex.org/W3021805971","https://openalex.org/W7095599064"],"abstract_inverted_index":{"Applications":[0],"with":[1],"diverse":[2],"performance":[3,50,88,126],"objectives":[4,51],"must":[5],"be":[6,19,153],"supported":[7],"on":[8],"a":[9,70,159],"single":[10],"packet-switched":[11],"network.":[12,45],"The":[13],"eciency":[14],"of":[15,24,57,161],"such":[16],"networks":[17],"can":[18],"greatly":[20],"improved":[21],"through":[22],"use":[23],"sophisticated":[25,150,156],"scheduling":[26,77,151],"and":[27,40,79,112],"dropping":[28,81,113,157],"algorithms":[29,114,131],"within":[30],"the":[31,36,44,55,62,92,96,137],"queues":[32],"that":[33,124,149],"form":[34,56],"at":[35],"network":[37,87,125],"access":[38],"points":[39],"in":[41,54],"switches":[42],"throughout":[43],"In":[46],"our":[47],"approach,":[48],"arbitrary":[49],"are":[52,106,115,132],"expressed":[53],"cost":[58,71,98,104,119],"functions,":[59],"which":[60],"map":[61],"queueing":[63],"delay":[64],"experienced":[65],"by":[66,91,94,100],"each":[67],"packet":[68],"to":[69,85,136,142,155],"incurred.":[72],"Our":[73],"heuristic":[74],"algorithms,":[75],"cost-based":[76,80],"(CBS)":[78],"(CBD),":[82],"then":[83],"attempt":[84],"optimize":[86],"as":[89,134,158],"perceived":[90],"applications":[93],"minimizing":[95],"total":[97],"incurred":[99],"all":[101],"packets.":[102],"Appropriate":[103],"functions":[105],"presented":[107,148],"for":[108],"common":[109,138],"applications.":[110],"Scheduling":[111],"dened":[116],"from":[117],"these":[118,130],"functions.":[120],"It":[121],"is":[122,127,147],"demonstrated":[123],"better":[128],"when":[129],"used":[133],"opposed":[135],"alternatives.":[139],"Also,":[140],"contrary":[141],"conventional":[143],"wisdom,":[144],"some":[145],"evidence":[146],"may":[152],"preferable":[154],"means":[160],"adjusting":[162],"loss":[163],"rates.":[164],"1":[165]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1521245696","counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
