ECMS 2009 Proceedings Edited by J. Otamendi, A. Bargiela, J. L. Montes, L. M. Doncel Pedrera 2009
DOI: 10.7148/2009-0664-0672
|View full text |Cite
|
Sign up to set email alerts
|

Towards The Automated Inference Of Queueing Network Models From High-Precision Location Tracking Data

Abstract: Traditional methods for deriving performance models of customer flow in real-life systems are manual, timeconsuming and prone to human error. This paper proposes an automated four-stage data processing pipeline which takes as input raw high-precision location tracking data and which outputs a queueing network model of customer flow. The pipeline estimates both the structure of the network and the underlying interarrival and service time distributions of its component service centres. We evaluate our method's e… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
3
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
3
1
1

Relationship

2
3

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 8 publications
1
3
0
Order By: Relevance
“…Earlier work conducted by Horng et al [10] is the most closely related to ours. The authors present a methodology designed to infer simple Queueing Network performance models from high-precision location tracking data.…”
Section: Related Worksupporting
confidence: 53%
See 1 more Smart Citation
“…Earlier work conducted by Horng et al [10] is the most closely related to ours. The authors present a methodology designed to infer simple Queueing Network performance models from high-precision location tracking data.…”
Section: Related Worksupporting
confidence: 53%
“…This place of the PNPM represents the entry/exit point of the underlying system and thus, is actually not part of any service cycle. To avoid such unwanted cycles to be detected by the algorithm we examine the subgraph of G induced by the set of vertices |I − (Server 0, t 4 )(black) = 1 I + (Interm., t 4 )(black) = 1 I − (Server 0, t 4 )(red) = 1 I + (Interm., t 4 )(red) = 1 t 7 |I − (Travel 2, t 7 )(black) = 1 I + (Server 0, t 7 )(black) = 1 I − (Travel 2, t 7 )(black) = 1 I + (Server 0, t 7 )(red) = 1 t 10 |I − (Interm., t 10 )(black) = 1 I + (Rep., t 10 )(black) = 1 I − (Interm., t 10 )(red) = 1 I + (Rep., t 10 )(black) = 1 Figure 6 to enable the accurate representation of the underlying system's customer flow (Figure 7). Interm.…”
Section: Service Cycles and Customer Routingmentioning
confidence: 97%
“…Our work is mostly closely related to earlier work by Horng et al [12]. This work proposed a methodology for inferring simple Queueing Network performance models from highprecision location tracking data.…”
Section: Related Workmentioning
confidence: 80%
“…Based on the customer's location traces, the first appearance time corresponds to the first timestamp when the customer is identified to be inside the server's service area; the last disappearance time is defined as the last timestamp when the customer is considered to be outside the service area. The customer's exit time is computed in a similar way, by taking the average of the timestamps of the two location updates that correspond to the last appearance and first disappearance [12]. We maintain two time-ordered lists at each service area to store the customers' entry and exit times.…”
Section: Stagementioning
confidence: 99%