-
作者：Borst, Sem; Egorova, Regina; Zwart, Bert
作者单位：AT&T; Alcatel-Lucent; Eindhoven University of Technology; Vrije Universiteit Amsterdam; University System of Georgia; Georgia Institute of Technology
摘要：Bandwidth-sharing networks as considered by Roberts and Massoulie [28] (Roberts JW, Massoulie L (1998) Bandwidth sharing and admission control for elastic traffic. Proc. ITC Specialist Seminar, Yokohama, Japan) provide a natural modeling framework for describing the dynamic flow-level interaction among elastic data transfers. Under mild assumptions, it has been established that a wide family of so-called alpha-fair bandwidth-sharing strategies achieve stability in such networks provided that n...
-
作者：Alon, Shiri
作者单位：Bar Ilan University
摘要：An axiomatic model is presented in which a utility function over consequences, unique up to location and unit, is derived. The assumptions apply to a binary relation over purely subjective acts, namely, no exogenous probabilities are assumed. The main assumption used is a weak trade-off consistency condition. The model generalizes the biseparable model of Ghirardato and Marinacci [Ghirardato P, Marinacci M (2001) Risk, ambiguity, and the separation of utility and beliefs. Math. Oper. Res. 26(4...
-
作者：Budhiraja, Amarjit; Chen, Jiang; Rubenthaler, Sylvain
作者单位：University of North Carolina; University of North Carolina Chapel Hill; Universite Cote d'Azur; Centre National de la Recherche Scientifique (CNRS)
摘要：Reflected diffusions in polyhedral domains are commonly used as approximate models for stochastic processing networks in heavy traffic. Stationary distributions of such models give useful information on the steady-state performance of the corresponding stochastic networks, and thus it is important to develop reliable and efficient algorithms for numerical computation of such distributions. In this work we propose and analyze a Monte-Carlo scheme based on an Euler type discretization of the ref...
-
作者：Segev, Danny
作者单位：University of Haifa
摘要：The main contribution of this paper is to propose a new dynamic-programming approach that epsilon-approximates the joint replenishment problem, with stationary demands and holding costs, in its discrete-time finite-horizon setting. Our first and foremost objective is to show that the computation time of classical dynamic-programming algorithms can be improved on by orders of magnitude when one is willing to lose an epsilon-factor in optimality. Based on synthesizing ideas such as commodity agg...
-
作者：Olver, Neil; Shepherd, F. Bruce
作者单位：Massachusetts Institute of Technology (MIT); McGill University
摘要：We consider robust (undirected) network design (RND) problems where the set of feasible demands may be given by an arbitrary convex body. This model, introduced by Ben-Ameur and Kerivin [ Ben-Ameur W, Kerivin H (2003) New economical virtual private networks. Comm. ACM 46(6):69-73], generalizes the well-studied virtual private network (VPN) problem. Most research in this area has focused on constant factor approximations for specific polytope of demands, such as the class of hose matrices used ...
-
作者：Vegh, Laszlo A.
作者单位：University of London; London School Economics & Political Science
摘要：We consider a nonlinear extension of the generalized network flow model, with the flow leaving an arc being an increasing concave function of the flow entering it, as proposed by Truemper [Truemper K (1978) Optimal flows in nonlinear gain networks. Networks 8(1): 17-36] and by Shigeno [Shigeno M (2006) Maximum network flows with concave gains. Math. Programming 107(3): 439-459]. We give a polynomial time combinatorial algorithm for solving corresponding flow maximization problems, finding an e...
