Ferguson D., C. Nikolaou, and Y. Yemimi, "An economy for flow control in computer networks," IEEE INFOCOM, pp. 110-118, Apr. 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....in addition to peers whom they do not have direct bartering relationships with. Given the bartering economy as a base, we envision an evolutionary path towards more complex scenarios by layering richer functionality at higher layers. 1 Introduction Over the last two decades, numerous proposals [16, 14, 3, 12, 9, 17] have emerged for economic based distributed resource management in large scale distributed systems. Still, we have yet to observe the widespread deployment and use of such systems in practice. We argue that a key reason for such lack of adoption is the initial complexity of the proposals. The ....

D. F. Ferguson, C. Nikolau, and Y. Yemini. An economy for flow control in computer networks. In Proc. of INFOCOM '89, Apr. 1989.

....the computer science literature traditionally did the opposite. The emergence of the Internet as a standard platform for distributed computation has changed this state of a#airs. Incentives have become an increasingly important consideration in network protocol design (see, for example, [FNY89, FS97, HA88, KLO95, KS89, S88, S90, S95]) More recently, the work of Nisan and Ronen [NR01] has inspired the design of algorithmic mechanisms for, e.g. scheduling, load balancing, lowest cost paths, and combinatorial auctions that satisfy both the traditional economic definitions of incentive compatibility and the traditional TCS ....

Ferguson, D., Nikolaou, C., and Yemini, Y. (1989). "An economy for flow control in computer networks," in Proceedings of the 8th Infocom, pp. 100--118, IEEE Computer Society Press, Los Alamitos.

....as those of a computer. This development requires that these previously separable concerns incentive compatibility and computational tractability be jointly addressed. Although many subdisciplines of computer science have a long history of using game theory such as networking (e.g. [21, 25, 35]) distributed artificial intelligence (e.g. 55, 61] and marketbased computation (e.g. 65] the first work in TCS to address incentives and computational complexity simultaneously was Nisan and Ronen s seminal paper [52] on algorithmic mechanism design (AMD) This paper put forth a ....

D. Ferguson, C. Nikolaou, and Y. Yemini, "An Economy for Flow Control in Computer Networks," in Proceedings of the 8th Infocom, IEEE Computer Society Press, Los Alamitos, pages 100--118, 1989.

....by a certain increment. This can reduce both network dynamics and signaling overhead in the core network, and has been discussed in greater detail in [20] VII. RELATED WORK Microeconomic principles have been applied to various network traffic management problems. The studies in [15] 14] 11][7] are based on a maximization process to determine the optimal resource allocation such that the utility (a function that maps a resource amount to a satisfaction level) of a group of users is maximized. These approaches normally rely on a centralized optimization process, which does not scale. ....

....is maximized. These approaches normally rely on a centralized optimization process, which does not scale. Also, some of the algorithms assume some knowledge of the user s utility curves by the network and truthful revelation by users of their utility curves, which may not be practical. In [5] 4][7][8] 17] the resources are priced to reflect demand and supply. The pricing model in these approaches is usagesensitive it has been shown that usage sensitive pricing results in higher utilization than traditional flat (single) pricing [5] Some of these methods are limited by their reliance on ....

D. F. Ferguson, C. Nikolaou, and Y. Yemini. An economy for flow control in computer networks. In Conference on Computer Communications (IEEE Infocom), (Ottawa, Canada), April 1989.

....workloads. We show, using simulations, that revenue using the adaptive pricing scheme matches closely with the expectation of revenue, given the probabilistic customer willingness to pay. Pricing mechanisms have been suggested earlier for managing resource allocation and congestion control [1, 2]. Researchers have also suggested differentiated pricing schemes based on service and quality [3, 4] These differentiated schemes propose creation of service classes with different quality 3 guarantees. In this paper, we assume one single service class for content delivery. Goldberg et al. 5] ....

D. F. Ferguson, C. Nikolaou, and Y. Y., "An economy for flow control in computer networks," in Conference on Computer Communications, (Ottawa, Canada), April 1989.

....workloads. We show, using simulations, that revenue using the adaptive pricing scheme matches closely with the expectation of revenue, given the probabilistic customer willingness to pay. Pricing mechanisms have been suggested earlier for managing resource allocation and congestion control [1, 2]. Researchers have also suggested differentiated pricing schemes based on service and quality [3, 4] These differentiated schemes propose creation of service classes with different quality guarantees. In this paper, we assume one single service class for content delivery. Goldberg et al. 5] ....

D. F. Ferguson, C. Nikolaou, and Y. Y., "An economy for flow control in computer networks," in Conference on Computer Communications, (Ottawa, Canada), April 1989.

....used. With admission control, the dynamics of the network price can also be better controlled, so that users have a more reliable expectation of the price. VII. RELATED WORK Microeconomic principles have been applied to various network traffic management problems. The studies in [25] 26][27] are based on a maximization process to determine the optimal resource allocation such that the utility (a function that maps a resource amount to a satisfaction level) of a group of users is maximized. In [28] 29] 27] 30] the resources are priced to reflect demand and supply. Some of these ....

....applied to various network traffic management problems. The studies in [25] 26] 27] are based on a maximization process to determine the optimal resource allocation such that the utility (a function that maps a resource amount to a satisfaction level) of a group of users is maximized. In [28] 29][27][30] the resources are priced to reflect demand and supply. Some of these methods are limited by their reliance on a well defined statistical model of source traffic, and are generally not intended to adapt to changing traffic demands. The study in [28] shows that compared to traditional flat ....

D. F. Ferguson, C. Nikolaou, and Y. Yemini, "An economy for flow control in computer networks," in Conference on Computer Communications (IEEE Infocom), (Ottawa, Canada), Apr 1989.

....entity to determine the optimal allocation amount. This is undesirable because the economy relies on one entity, which is not reliable or fault tolerant. In a congestion pricing approach, users are charged for the resources they use and resources are priced to reflect supply and demand [2] [4] [11] 15] With such a model, prices can be set to encourage high utilization of network resources as well as a fair distribution (reactive flow control approach) Users act independently, attempting to maximize their own utility and prices are set based on local resource conditions. It has been ....

....utility and prices are set based on local resource conditions. It has been shown that pricing based on supply and demand results in higher utilization than traditional flat (single) pricing [2] 11] 15] Ferguson, et al. proposed a flow control mechanism based on the pricing of network resources [4] [3] Prices of links in the system were iteratively adjusted until a equilibrium of supply and demand was reached. They were able to prove that the system achieved a Nash equilibrium; yet they required demands to be constant until the equilibrium price was determined. If the demands changed, the ....

D. F. Ferguson, C. Nikolaou, and Y. Yemini. An Economy for Flow Control in Computer Networks. In IEEE INFOCOM'89, pages 110 -- 118, 1989.

.... importance to understand incentive issues on the Internet and there has been a growing body of work on this topic, e.g. 31, 37, 5, 41, 42, 24, 25, 39, 38, 4, 3, 30, 29, 36, 32] To address these issues, many theorists have begun to model the Internet as a noncooperative game (see, e.g. [7, 6, 17, 19, 26, 25]) Most of these analyses assume that the outcome of a game is a Nash equilibrium, the standard outcome analyzed in economics [16] Given the decentralized and complex structure of the Internet it is not realistic that players would just know (from detailed mathematical analysis) what the ....

Donald F. Ferguson, Christos Nikolaou, and Yechiam Yemini. An economy for flow control in computer networks. In Infocom, pages 110--118, Ottawa, Canada, April 1989. IEEE.

....[3] Note that most of the time, centralized markets are considered and mobile code is not taken into account at all. Furthermore, experiments concentrate on processing time and disregard non preemptible resources. Applying microeconomics to problems in the area of networks is also not a new idea [1, 6], to cite just a few, although this too was not applied to mobile code yet (but this may change: watch Yemeni s Web page on the announced netscript ) Distributed systems: Distributed control in general is an old topic, also the question of stability in such a setting. Just for two arbitrary ....

D. F. Ferguson, C. Nikolaou, and Y. Yemini. An economy for flow control in computer networks. In Proceedings of the IEEE Infocom-89, pages 110--118, 1989.

....the execution of the whole algorithm; ideally, this number will be O(1) with each round of computation triggered by a round of incoming messages. COST SHARING 9 at Nash equilibrium. Still others adopt the mechanism design approach and modify network designs to cope with user selfishness (e.g. [6, 16, 30, 32, 33]) There is also significant use of mechanism design in distributed artificial intelligence (e.g. 29, 34] and in market based computation (e.g. 37] Despite their increasing role in some of the more applied areas in computer science, incentives have rarely been an important consideration in ....

Ferguson, D., C. Nikolaou, and Y. Yemini (1989). An economy for flow control in computer networks, in "Proceedings of the 8th Infocom," pp. 100--118, IEEE Computer Society Press, Los Alamitos.

....is considerably simplified, compared to higher level information services in a digital library. Most of the literature related to resource allocation for distributed systems have been concerned with allocation of a single item , such as processing time [WaHoHuKeSt92] communication bandwidth [Fe89], access to data [Fe93] or network information services [MuWe95] Our work is concerned with allocating multiple resources in a single bundle , as this is the type of resource allocation problem arising in the realization of composite services in open environments. In [HaBoDs95] a negotiation ....

D.F. Ferguson, C. Nikolaou, and Y. Yemini. "An Economy for Flow Control in Computer Networks". In Proceedings of IEEE Infocom '89, pages 110-118, Washington, DC, 1989. IEEE Computer Society Press.

....the filling in effect [25] Recently, microeconomic game theoretic approaches to resource allocation have received significant interest with application domains spanning a number of different con 4 We will use the terms users, applications, and sometimes, players, interchangeably. texts [7,15,16,19,21,24,26,30,34,38,41,42,45,46]. The overall goal of this area is to formulate a resource allocation problem in the framework of microeconomics and game theory, and show that under certain conditions, the system achieves desirable allocations from stabilibity, fairness, and optimality points of view. The latter are important ....

.... approaches to resource allocation where ideas and tools from microeconomics and game theory have been applied in the formulation and solution of problems arising in flow control, routing, file allocation, load balancing, multi commodity flow, and quality of service provision, among others [15,42,22,21,34,24,26,16,45,46,30,7,41,38]. A collection of papers covering a broad range of topics can be found in [6] A brief survey of some of the literature is provided in [14] Some standard references to game theory and microeconomics include [1,17,40,43,44] Many of the earlier papers, including some recent ones [16,15,26,31,41] ....

[Article contains additional citation context not shown here]

D. Ferguson, C. Nikolaou, and Y. Yemini. An economy for flow control in computer networks. In Proc. IEEE INFOCOM '89, pages 110--118, 1989.

....the optimal allocation amount. This is undesirable because the economy relies on one entity, which is not reliable or fault tolerant. Another microeconomic approach, congestion pricing, charges users for their consumption of resources and resources are priced to reflect supply and demand [9] 10] [11] [12] 13] 7] 14] Alternatively, prices can be set with respect to marginal costs [15] With such a model, prices can be set to encourage high utilization of network resources as well as a fair distribution. Users act independently, attempting to maximize their own utility and prices are set ....

....utility and prices are set based on local resource conditions. It has been shown that pricing based on supply and demand results in higher utilization than traditional flat (single) pricing [10] 7] Ferguson, et al. is an example of virtual circuit flow control based on pricing network resources [11] [12] Prices of links in the system were iteratively adjusted until an equilibrium of supply and demand was reached. They were able to prove that the system achieved a Pareto equilibrium, as long as demands remained constant. Limitations of these methods of congestion pricing include reliance on ....

[Article contains additional citation context not shown here]

D. F. Ferguson, C. Nikolaou, and Y. Yemini, "An economy for flow control in computer networks," in IEEE INFOCOM'89, pp. 110 -- 118, 1989.

....single resources, such as disk, memory and CPU. However, they do not give any algorithm(s) to coordinate tickets allocation among multiple resources. Ferguson et al. proposed a flow control economy to allocate network resources such as links and buffers among competing virtual circuits (VCs) [7, 8]. In this model, each VC is endowed certain funds for buying resources. The VC s goal is to buy a minimum capacity on all links along its path, and use the extra money to minimize the average end to end delay. The resource prices are set so that the supply and the demand are balanced. It has been ....

D. F. Ferguson, C. K. Nikolau, and Y. Yemini. An economy flow control in computer networks. In Proceedings of INFOCOM '90, 1990.

No context found.

D.F. Ferguson, C. Nikolaou, and Y. Yemini. "An economy for flow control in computer networks". In Proceedings of IEEE Infocom '89, pages 110-118, Washington, DC, 1989. IEEE Computer Society Press.

....per session in ATM (Asynchronous Transfer Mode) networks [19, 21, 18, 20] Nagarajan et. al [15] have investigated transient and steady state models for appropriate QoS parameter definitions per session in a network. A few researchers have used economic models for QoS provisioning in networks [14, 13, 4, 5, 7, 8, 11, 12]. In such models, users 1 compete for resources and try to obtain maximal benefit by purchasing the appropriate amount of resources (under their wealth constraint) In the economy, resources are not only utilized efficiently, but also allocated in such a way that users with diverse requirements ....

....in networks based on utility functions which represented throughput delay trade offs of sessions. Kurose et al. 7, 8] used an exchange economy 2 model to design multiple access protocols, and verified that competitive equilibrium exists. This work was extended by Don Ferguson et al. [4, 5, 6] to study flow control in packet networks and resource allocation in distributed systems. Ron et.al. 12] have developed pricing schemes for networks (Internet) to support multiple services. In their model, prices are set based on service classes. Their pricing schemes are static and do not take ....

[Article contains additional citation context not shown here]

D. F. Ferguson, C. Nikolau and Y. Yemini, "An Economy for Flow Control in Computer Networks," Proc. of the INFOCOM, 1990.

No context found.

Ferguson D., C. Nikolaou, and Y. Yemimi, "An economy for flow control in computer networks," IEEE INFOCOM, pp. 110-118, Apr. 1989.

No context found.

D. Ferguson, C. Nikolaou, and Y. Yemini, "An economy for flow control in computer networks," in Proceedings of INFOCOM'89, pp. 110--118, 1989.

No context found.

Ferguson, D., C. Nikolaou, and Y. Yemini (1989). An economy for flow control in computer networks, in "Proceedings of the 8th Infocom," pp. 100--118, IEEE Computer Society Press, Los Alamitos.

No context found.

D. Ferguson et al., "An Economy for Flow Control in Computer Networks," Proc. IEEE INFOCOM, Ottawa, Canada, 1989, pp. 110--18.

No context found.

D. F. Ferguson, C. Nikolaou, and Y. Yemini, "An economy for flow control in computer networks," in Proceedings of the Conference on Computer Communications (IEEE Infocom) , (Ottawa, Canada), pp. 110-118, IEEE, Apr. 1989.

No context found.

D. Ferguson, C. Nikolaou, and Y. Yemini. An economy for flow control in computer networks. In Infocom, pages 110--118, Ottawa, Canada, April 1989. IEEE.

No context found.

D. Ferguson, C. Nikolaou, and Y. Yemini, An economy for flow control in computer networks, in "Proceedings of the 8th Infocom," pp. 100--118, IEEE Computer Society Press, Los Alamitos, 1989.

No context found.

D. F. Ferguson, C. Nikolaou, and Y. Yemini, "An economy for flow control in computer networks," in Proceedings of the Conference on Computer Communications (IEEE Infocom) , (Ottawa, Canada), pp. 110-118, IEEE, Apr. 1989.

First 50 documents

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