Boulogne, T. and E. Altman. (2002). "Competitive Routing in Multicast Communications." Submitted. Available at http://www-sop.inria.fr/mistral/personnel/Thomas.Boulogne/ Cohen, G. and F. Chaplais. (1988). "Nested Monotony for Variational Inequalities over Product of Spaces and Convergence of Iterative Algorithms." Journal of Optimization Theory and Applications 59(3). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Selfish Routing - Roughgarden (2002) (3 citations) (Correct)
.... allow players to split their flow among several routes but disallow randomization, and then give necessary and su#cient conditions (on the network topology, the amount of flow that users control, and on the edge latency functions) for the existence and uniqueness of (pure strategy) Nash equilibria [4, 8, 25, 59, 138] and for convergence to a Nash equilibrium under natural models of user behavior [5, 138] Some of these results have been extended to networks in which users cannot split flow and must instead route all of their tra#c on a single path [117] Finally, the game theory community has generalized the ....
....In this section we extend the basic model to the case of finitely many network users, each of whom controls a strictly positive amount of tra#c. In this section we allow a network user to split flow among any number of paths; this model has been studied extensively in the networking literature [4, 5, 8, 25, 59, 138]. In the next section we will investigate the setting in which each network user must route all of its flow on a single path. We are given a network G with continuous nondecreasing latency functions # as before, and in addition k users. We assume that user i intends to send r i units of flow from ....
T. Boulogne and E. Altman. Competitive routing in multicast communications. Manuscript, 2001.
Equilibrium, Games, and Pricing in Transportation and.. - Altman, Wynter (2002) Self-citation (Altman) (Correct)
No context found.
Boulogne, T. and E. Altman. (2002). "Competitive Routing in Multicast Communications." Submitted. Available at http://www-sop.inria.fr/mistral/personnel/Thomas.Boulogne/ Cohen, G. and F. Chaplais. (1988). "Nested Monotony for Variational Inequalities over Product of Spaces and Convergence of Iterative Algorithms." Journal of Optimization Theory and Applications 59(3).
Equilibrium, Games, and Pricing in Transportation and.. - Altman, Wynter (2002) Self-citation (Altman) (Correct)
....contains nite bu er queues. We note that in this case there is no longer ow conservation at the nodes . This model has been Note that ow conservation fails even in the case of in nite queues when one considers multicast applications in which packets are duplicated at some nodes, see [11]. 12 dealt with by light trac approximations which are additive and separable [13, 19] Another performance measure (already mentioned in the previous subsection) that has been studied in the context of network equilibrium is that of rejection probabilities. The network consists of resources at ....
T. Boulogne, E. Altman, "Competitive Routing in Multicast Communications", submitted, 2001. Available at http://wwwsop. inria.fr/mistral/personnel/Thomas.Boulogne/ 18
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC