Y. Korilis and A. Lazar, "Why is Flow Control Hard: Optimality, Fairness, Partial and Delayed Information," Proc. 2nd ORSA Telecommunications Conference, March 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Nonlinear Instabilities in TCP-RED - Ranjan, Abed, La (2002) (2 citations) (Correct)
....the bifurcations observed in the system are the period doubling bifurcation and border collision bifurcations. The bifurcations are studied analytically, numerically, and experimentally. I. INTRODUCTION Computer networks are highly complicated systems, both in their temporal and spatial behavior [1]. Although they have traditionally been modeled and analyzed using stochastic methods, there have recently been several papers that use deterministic nonlinear modeling and analysis (e.g. 6] 7] 8] 16] 14] 5] In this paper, we study a modified deterministic dynamical model of a ....
Y. Korilis and A. Lazar, "Why is Flow Control Hard: Optimality, Fairness, Partial and Delayed Information," Proc. 2nd ORSA Telecommunications Conference, March 1992.
Nonlinear Instabilities in TCP-RED - Ranjan, Abed (2002) (2 citations) (Correct)
....of this kind of anomalous behavior. An explicit stability condition in terms of different parameters is given. Keywords Congestion, computer networks, chaos, bifurcation, control I. INTRODUCTION Computer networks are highly complicated systems, both in their temporal and spatial behavior [1]. Although they have traditionally been modeled and analyzed using stochastic methods, there have recently been several papers that use deterministic nonlinear modeling and analysis (e.g. 6] 7] 8] 16] 14] 5] In this paper, we study a modified deterministic dynamical model of a simple ....
Y. Korilis and A. Lazar, "Why is Flow Control Hard: Optimality, Fairness, Partial and Delayed Information," Proc. 2nd ORSA Telecommunications Conference, March 1992.
Making Greed Work in Networks: A Game-Theoretic Analysis of.. - Shenker (1994) (116 citations) (Correct)
....algorithms to compute, Pareto optimal allocations for a given vector of utility functions. Achieving efficiency in this approach relies on cooperative algorithms, and so the results are not relevant to the selfish user population considered here. Another segment of this literature, represented by [1, 4, 10, 17, 18], discusses the nature of Nash equilibria in networks using the FIFO service discipline. While these papers considers the incentive issues we are concerned with, their approach is essentially descriptive in that they consider the traditional network architecture and then describe the equilibria ....
Y. Korilis and A. Lazar, "Why is Flow Control Hard: Optimality, Fairness, Partial and Delayed Information", preprint, 1992. (available from ftp.ctr.columbia.edu as CTRResearch /comet/public/papers/92/KOR92.ps.z)
An Architecture for Noncooperative QoS Provision in Many-Switch .. - Chen, Park (1998) (20 citations) (Correct)
....architecture performs favourably when compared to the aforementioned QoS provision schemes. C. Related Work Significant work has been carried out in formulating resource allocation problems spanning a number of different domains using tools from microeconomics and game theory [10] 11] 12] [13], 14] 15] 16] 17] 18] 19] The models and approaches proposed in the literature differ along several dimensions, some of the important ones being whether applications or users are assumed to be cooperative or selfish, whether pricing is used or not, and how much computing responsibility ....
Y. Korilis and A. Lazar, "Why is flow control hard: Optimality, fairness, partial and delayed information," in Proc. 2nd ORSA Telecommunications Conference, March 1992.
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