Abstract. In this paper we consider Skorokhod Problems on polyhedral domains with a constant and possibly oblique constraint direction specified on each face of the domain, and with a corresponding cone of constraint directions at the intersection of faces. In part one of this paper we used convex duality to develop new methods for the construction of solutions to such Skorokhod Problems, and for proving Lipschitz continuity of the associated Skorokhod Maps. The main alternative approach to Skorokhod Problems of this type is the reflection mapping technique introduced by Harrison and Reiman [8]. In this part of the paper we apply the theory developed in part one to show that the reflection mapping technique of [8] is restricted to a slight generalization of the class of problems originally considered in [8]. We further illustrate the power of the duality approach by applying it to two other classes of Skorokhod Problems – those with normal directions of constraint, and a new class that arises from a model of processor sharing in communication networks. In particular, we prove existence of solutions to and Lipschitz continuity of the Skorokhod Maps associated with each of these Skorokhod Problems.
[1]
A. F. Veinott.
Discrete Dynamic Programming with Sensitive Discount Optimality Criteria
,
1969
.
[2]
Nicolas Bourbaki,et al.
Groupes et algèbres de Lie
,
1971
.
[3]
Martin I. Reiman,et al.
Open Queueing Networks in Heavy Traffic
,
1984,
Math. Oper. Res..
[4]
Abhay Parekh,et al.
A generalized processor sharing approach to flow control in integrated services networks: the single-node case
,
1993,
TNET.
[5]
Donald F. Towsley,et al.
Statistical Analysis of Generalized Processor Sharing Scheduling Discipline
,
1995,
IEEE J. Sel. Areas Commun..
[6]
Ioannis Ch. Paschalidis.
Large deviations in high speed communication networks
,
1996
.
[7]
Kavita Ramanan,et al.
A Skorokhod Problem formulation and large deviation analysis of a processor sharing model
,
1998,
Queueing Syst. Theory Appl..