Dynamics of priority-queue networks

Byung Joon Min, Kwang-Il Goh, In Mook Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this Work-in-Progress paper, we study the dynamics of priority-queue networks by generalizing the interacting priority queue model of Oliveira and Vazquez [Physica A 388, 187 (2009)]. We show that the original AND-type protocol for interacting tasks is not scalable for the queue networks with more than two queues. We then introduce a scalable interaction protocol, an OR-type one, and examine the effects of the number of queues and the network topology on the waiting time dynamics of the priority-queue networks. We also study the effect of synchronicity in task executions to the waiting time dynamics in the priority-queue networks.

Original languageEnglish
Title of host publicationLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Pages2229-2231
Number of pages3
Volume5 LNICST
EditionPART 2
DOIs
Publication statusPublished - 2009 Dec 1
Event1st International Conference on Complex Sciences: Theory and Applications, Complex 2009 - Shanghai, China
Duration: 2009 Feb 232009 Feb 25

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
NumberPART 2
Volume5 LNICST
ISSN (Print)18678211

Other

Other1st International Conference on Complex Sciences: Theory and Applications, Complex 2009
CountryChina
CityShanghai
Period09/2/2309/2/25

Fingerprint

Topology

Keywords

  • Human dynamics
  • Priority queue
  • Social network

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Min, B. J., Goh, K-I., & Kim, I. M. (2009). Dynamics of priority-queue networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (PART 2 ed., Vol. 5 LNICST, pp. 2229-2231). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 5 LNICST, No. PART 2). https://doi.org/10.1007/978-3-642-02469-6_99

Dynamics of priority-queue networks. / Min, Byung Joon; Goh, Kwang-Il; Kim, In Mook.

Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. Vol. 5 LNICST PART 2. ed. 2009. p. 2229-2231 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 5 LNICST, No. PART 2).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Min, BJ, Goh, K-I & Kim, IM 2009, Dynamics of priority-queue networks. in Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. PART 2 edn, vol. 5 LNICST, Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, no. PART 2, vol. 5 LNICST, pp. 2229-2231, 1st International Conference on Complex Sciences: Theory and Applications, Complex 2009, Shanghai, China, 09/2/23. https://doi.org/10.1007/978-3-642-02469-6_99
Min BJ, Goh K-I, Kim IM. Dynamics of priority-queue networks. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. PART 2 ed. Vol. 5 LNICST. 2009. p. 2229-2231. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; PART 2). https://doi.org/10.1007/978-3-642-02469-6_99
Min, Byung Joon ; Goh, Kwang-Il ; Kim, In Mook. / Dynamics of priority-queue networks. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering. Vol. 5 LNICST PART 2. ed. 2009. pp. 2229-2231 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; PART 2).
@inproceedings{cb7a9dd754f6495791b7f2d0a9103ac4,
title = "Dynamics of priority-queue networks",
abstract = "In this Work-in-Progress paper, we study the dynamics of priority-queue networks by generalizing the interacting priority queue model of Oliveira and Vazquez [Physica A 388, 187 (2009)]. We show that the original AND-type protocol for interacting tasks is not scalable for the queue networks with more than two queues. We then introduce a scalable interaction protocol, an OR-type one, and examine the effects of the number of queues and the network topology on the waiting time dynamics of the priority-queue networks. We also study the effect of synchronicity in task executions to the waiting time dynamics in the priority-queue networks.",
keywords = "Human dynamics, Priority queue, Social network",
author = "Min, {Byung Joon} and Kwang-Il Goh and Kim, {In Mook}",
year = "2009",
month = "12",
day = "1",
doi = "10.1007/978-3-642-02469-6_99",
language = "English",
isbn = "3642024688",
volume = "5 LNICST",
series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",
number = "PART 2",
pages = "2229--2231",
booktitle = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",
edition = "PART 2",

}

TY - GEN

T1 - Dynamics of priority-queue networks

AU - Min, Byung Joon

AU - Goh, Kwang-Il

AU - Kim, In Mook

PY - 2009/12/1

Y1 - 2009/12/1

N2 - In this Work-in-Progress paper, we study the dynamics of priority-queue networks by generalizing the interacting priority queue model of Oliveira and Vazquez [Physica A 388, 187 (2009)]. We show that the original AND-type protocol for interacting tasks is not scalable for the queue networks with more than two queues. We then introduce a scalable interaction protocol, an OR-type one, and examine the effects of the number of queues and the network topology on the waiting time dynamics of the priority-queue networks. We also study the effect of synchronicity in task executions to the waiting time dynamics in the priority-queue networks.

AB - In this Work-in-Progress paper, we study the dynamics of priority-queue networks by generalizing the interacting priority queue model of Oliveira and Vazquez [Physica A 388, 187 (2009)]. We show that the original AND-type protocol for interacting tasks is not scalable for the queue networks with more than two queues. We then introduce a scalable interaction protocol, an OR-type one, and examine the effects of the number of queues and the network topology on the waiting time dynamics of the priority-queue networks. We also study the effect of synchronicity in task executions to the waiting time dynamics in the priority-queue networks.

KW - Human dynamics

KW - Priority queue

KW - Social network

UR - http://www.scopus.com/inward/record.url?scp=84885889585&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84885889585&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02469-6_99

DO - 10.1007/978-3-642-02469-6_99

M3 - Conference contribution

SN - 3642024688

SN - 9783642024689

VL - 5 LNICST

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

SP - 2229

EP - 2231

BT - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

ER -