| S. Lalis, C. Nikolaou, D. Papadakis, and M. Marazakis. Market-driven service allocation in a qos-capable environment. In Proccedings of ICE98, pages 92--100, 1998. |
....be seen in [10] There have also been auction methods proposed for the different processes assigned to a uniprocessor machine. An example of such an algorithm can be found in [63] We also see auctions in other areas. For example controlling resources on an ATM switch to ensure Quality of Service [41], or simulating a large manufacturing system [61] These auction solutions are similar in the sense that they progress in time. That is, if a task loses an auction, it can use its money to win some other auction that will come along in the future. In the field of routing, there are some limited ....
S. Lalis, C. Nikolaou, D. Papadakis, and M. Marazakis. Market-driven service allocation in a qos-capable environment. In Proccedings of ICE98, pages 92--100, 1998.
.... instruments of resource allocation also in non traditional domains, such as ne grained markets for electric power[10]and communication bandwidth, selling excess CPU time or storage capacity( 14] 15] 16] constraining peak usage of networked resources and improving network utilization([17], 19] 18] Future work, in form of applying our framework to these non traditional domains, could be carried out. That to evolve, agents will have to learn, adapt, and anticipate is a statement that needs but little re ection to agree with. For this, they would have to use a variety of ....
Spyros Lalis, Christos Nikolaou, Dimitris Papadakis and Manolis Marazakis, Market- driven Service Allocation in a QoS-capable Environment, Proceedings of the First Int. Conf. on Information and Computation Economics ICE'98, Charleston, SC, USA, October, 1998.
....a distributed system. A similar solution is seen in [2] In a single processor machine, we also can have auctions between different processes competing for the CPU, as seen in [19] We also see auctions in other areas, for example controlling resources on an ATM switch to ensure Quality of Service [9], or simulating a large manufacturing system [17] All these auctions are similar in the sense that they progress in time. If, for example, a task loses an auction, it can save its money and have a chance to win another auction which will come along in the near future. As will be seen, this ....
Spyros Lalis, Christos Nikolaou, Dimitris Papadakis, and Manolis Marazakis. Market-driven service allocation in a qos-capable environment. In Proccedings of ICE98, pages 92--100, 1998.
....where the prices are highest lowest, resources will generally be allocated to where they are expected to be of most use. The paradigm has been proven applicable and efficient for a range of domains. Work presented at conferences in 1998 includes . Selling excess CPU time or other resources [3, 4, 5, 6] . Constraining peak usage of networked resources [7, 8] Improving network utilization and economic efficiency [7, 9, 10] Differentiated network service levels [11,12] Work flow and task allocation [13, 14] Data replication and mirroring [15, 16, 17] Information searching selling ....
....reroute traffic. This gives consumers a possibility to speculate and the price taking assumption will not hold. In computational economies, sellers are almost always modeled as setting their prices according to a predetermined function, increasing prices with demand, rather than maximizing profit [3, 4, 16, 17]. This results in a nice and smooth dynamic behavior, but the increasing margin cost pricing strategy is not necessarily a rational choice for the resource providers, since the often exponential increase in marginal costs results in some of the resources not being sold. Lowering prices just enough ....
[Article contains additional citation context not shown here]
Spyros Lalis, Christos Nikolaou, Dimitris Papadakis and Manolis Marazakis, Marketdriven Service Allocation in a QoS-capable Environment, Proceedings of the First Int. Conf. on Information and Computation Economics ICE'98, Charleston, SC, USA, October, 1998.
.... appropriate scheduling tools, mechanisms, and functionalities with Quality of Service (QoS) o#erings (for example, bandwidth reservation schemes, packet loss probability enforcement schemes, Service Level Agreement mechanisms provided by networks and operating systems) Use of market mechanisms [11, 18] should be investigated in addition to other possible paradigms for on the fly resource allocation. Any e#ective load balancing and scheduling mechanism should rely on extensive monitoring and tracking of workflow states, transitions, and events. Research should be conducted on how to trace ....
S. Lalis, C. N. Nikolaou, and M. Marazakis. Market-driven service allocation in a QoS-capable environment. In First International Conference on Information and Computation Economies, ICE-98, October 25-28 1998.
.... appropriate scheduling tools, mechanisms, and functionalities with Quality of Service (QoS) o#erings (for example, bandwidth reservation schemes, packet loss probability enforcement schemes, Service Level Agreement mechanisms provided by networks and operating systems) Use of market mechanisms [8, 11] should be investigated in addition to other possible paradigms for on the fly resource allocation. Any e#ective load balancing and scheduling mechanism should rely on extensive monitoring and tracking of workflow states, transitions, and events. Research should be conducted on how to trace ....
S. Lalis, C. N. Nikolaou, and M. Marazakis. Market-driven service allocation in a QoS-capable environment. In First International Conference on Information and Computation Economies, ICE-98, October 25-28 1998.
No context found.
S. Lalis, C. N. Nikolaou, and M. Marazakis. "Market-driven service allocation in a QoS-capable environment." In First International Conference on Information and Computation Economies, ICE-98 , October 25--28, 1998.
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