Skip to main navigation Skip to search Skip to main content

On Sequential Dispatching Policies

  • Esa Hyytia
  • , Rhonda Righter

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Job dispatching appears in many communication and computer systems. In this paper, we present a classification of dispatching policies according to their scalability, and introduce the class of sequential dispatching policies. These, highly scalable policies are a special case of index policies. By means of numerical examples, we show that efficient, practically optimal, dispatching may be achieved by a sequential policy, or a simple dynamic variant of such a policy, under heavy load. These numerical examples suggests that efficient and scalable load balancing can often be realized by simple primitive dispatching elements amenable also for machine learning based approaches.

Original languageEnglish
Title of host publication2022 32nd International Telecommunication Networks and Applications Conference, ITNAC 2022
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages335-340
Number of pages6
ISBN (Electronic)9781665471039
DOIs
Publication statusPublished - 2022
Event32nd International Telecommunication Networks and Applications Conference, ITNAC 2022 - Wellington, New Zealand
Duration: 30 Nov 20222 Dec 2022

Publication series

Name2022 32nd International Telecommunication Networks and Applications Conference, ITNAC 2022

Conference

Conference32nd International Telecommunication Networks and Applications Conference, ITNAC 2022
Country/TerritoryNew Zealand
CityWellington
Period30/11/222/12/22

Bibliographical note

Publisher Copyright: © 2022 IEEE.

Fingerprint

Dive into the research topics of 'On Sequential Dispatching Policies'. Together they form a unique fingerprint.

Cite this