Convex duality and the Skorokhod problem. II (Q1963836)

A number of applications is presented to show how it is working the method developed in the first part of this paper (reviewed above). The method is based on using convex duality in the case of the domain being a convex polyhedron. Among the models described there is a class of Skorokhod problems which arise from a model of processor sharing in communication networks.