14.1 Introduction
14.2 Preliminaries
14.2.1 Gap Sequences
14.2.2 Balanced Sequences
14.2.3 Regularity and Schur Convexity
14.3 Application 1: Maximal Waiting Times in Networks
14.3.1 The D/D/1 Model
14.3.2 Characterization using regular preserving functions
14.3.3 The average waiting time is not regular preserving
14.3.4 The G/G/1 Model
14.3.5 The Event Graph Model
14.3.6 Routing Problem
14.3.7 Computational Problems
14.3.8 A routing example
14.4 Application 2: Assignment to queues with no buffer with redundancy
14.5 Appendix: properties of the gap sequences
14.6 Appendix: relations between regularity and multimodularity