]> BibSonomy publications for /author/Korilis http://www.bibsonomy.org/burst/author/Korilis BibSonomy BuRST Feed for /author/Korilis 2008-10-08T11:13:20+02:00 Capacity Allocation under Nooncooperative Routing http://www.bibsonomy.org/bibtex/2cc0d7ae96621bb59635d7ec93be423a5/idsia idsia 2008-03-11T14:52:34+01:00 juergen
Capacity Allocation under Nooncooperative Routing
Y. A. Korilis and A. A. Lazar and A. Orda IEEE Transactions on Automatic Control (1998)
to juergen by idsia on 2008-03-11 14:52:34 ]]> IEEE Transactions on Automatic ControlCapacity Allocation under Nooncooperative Routing1998juergen 2008-03-11 14:52:34.0 Achieving Network Optima Using Stackelberg Routing Strategies http://www.bibsonomy.org/bibtex/2df42e111ebd6e0ebed6577b844df8cd7/idsia idsia 2008-03-11T14:52:34+01:00 juergen
Achieving Network Optima Using Stackelberg Routing Strategies
Y. A. Korilis and A. A. Lazar and A. Orda IEEE/ACM Transactions on Networking 5 161--173 (1997)
to juergen by idsia on 2008-03-11 14:52:34 ]]> IEEE/ACM Transactions on Networking1161--173Achieving Network Optima Using {S}tackelberg Routing Strategies51997juergen 2008-03-11 14:52:34.0 Capacity Allocation under Nooncooperative Routing idsiahttp://www.bibsonomy.org/bibtex/2cc0d7ae96621bb59635d7ec93be423a5/schaul schaul 2008-02-26T11:58:58+01:00 juergen
Capacity Allocation under Nooncooperative Routing
Y. A. Korilis and A. A. Lazar and A. Orda IEEE Transactions on Automatic Control (1998)
to juergen by schaul on 2008-02-26 11:58:58 ]]> IEEE Transactions on Automatic ControlCapacity Allocation under Nooncooperative Routing1998juergen 2008-02-26 11:58:58.0 Achieving Network Optima Using Stackelberg Routing Strategies idsiahttp://www.bibsonomy.org/bibtex/2df42e111ebd6e0ebed6577b844df8cd7/schaul schaul 2008-02-26T11:58:58+01:00 juergen
Achieving Network Optima Using Stackelberg Routing Strategies
Y. A. Korilis and A. A. Lazar and A. Orda IEEE/ACM Transactions on Networking 5 161--173 (1997)
to juergen by schaul on 2008-02-26 11:58:58 ]]> IEEE/ACM Transactions on Networking1161--173Achieving Network Optima Using {S}tackelberg Routing Strategies51997juergen 2008-02-26 11:58:58.0 A market-based architecture for management of geographically dispersed, replicated Web servers. dblphttp://www.bibsonomy.org/bibtex/2cf0ed601ce3103a9d64b8ee7b92c2920/dblp dblp 2007-11-12T00:00:00+01:00 dblp
A market-based architecture for management of geographically dispersed, replicated Web servers.
Mehmet Karaul and Yannis A. Korilis and Ariel Orda Decision Support Systems 28 191-204 (2000)
to dblp by dblp on 2007-11-12 00:00:00 ]]> Decision Support Systems1-2191-204A market-based architecture for management of geographically dispersed, replicated Web servers.282000dblp 2007-11-12 00:00:00.0 Architecting Noncooperative Networks JMM master bibtexhttp://www.bibsonomy.org/bibtex/2e73eaee9a8a2bedc78128f5bc25da43a/jmm jmm 2006-09-13T17:44:28+02:00 Network Pricing architecture design mechanism network
Architecting Noncooperative Networks
Yannis A. Korilis and Aurel A. Lazar and Ariel Orda IEEE Journal on Selected Areas in Communications 13 1241-1251 (1995)
to Network Pricing architecture design mechanism network by jmm on 2006-09-13 17:44:28 ]]> IEEE Journal on Selected Areas in Communications71241-1251Architecting Noncooperative Networks131995Network Pricing architecture design mechanism network 2006-09-13 17:44:28.0 WebSeAl: Web Server Allocation JMM master bibtexhttp://www.bibsonomy.org/bibtex/2281ece65fb737b4b46a963788b644832/jmm jmm 2006-09-13T17:44:28+02:00 MARX,web caching computational markets,
WebSeAl: Web Server Allocation
Mehmet Karaul and Yannis Korilis and Ariel Orda (1997)
to MARX,web caching computational markets, by jmm on 2006-09-13 17:44:28 ]]> OctoberWebSeAl: Web Server Allocationworking paper1997MARX,web caching computational markets, 2006-09-13 17:44:28.0We propose a technique which pushes the server allocation functionality onto the client. We argue that his approach scales well and may result in increased performance in many cases. Building on theoretical work based on game theory, we show that the usage of individual replicas can be effectively controlled with cost functions even when the clients are noncooperative. We present the design and implementation of WebSeAl, our prototype system realizing these techniques. WebSeAl does not require any changes to existing client and server code, conforms to HTTP standards, and does not generate any control messages. Preliminary experiment results utilizing servers on six continents and in a controlled setting indicate that WebSeAl improves performance while imposing little overhead. A Market-Based Architecture for Management of Geographically Dispersed, Replicated Web Servers JMM master bibtexhttp://www.bibsonomy.org/bibtex/258f922771eb89deb879ac90434259f17/jmm jmm 2006-09-13T17:44:28+02:00 Allocation, Balancing, Computing, Game Load Market-Based Pricing, Resource Theory
A Market-Based Architecture for Management of Geographically Dispersed, Replicated Web Servers
Mehmet Karaul and Yannis A. Korilis and Ariel Orda First International Conference on Information and Computation Economies 158-165 (1998)
to Allocation, Balancing, Computing, Game Load Market-Based Pricing, Resource Theory by jmm on 2006-09-13 17:44:28 ]]> Charleston, SCFirst International Conference on Information and Computation Economies158-165A Market-Based Architecture for Management of Geographically Dispersed, Replicated Web Servers1998Allocation, Balancing, Computing, Game Load Market-Based Pricing, Resource Theory 2006-09-13 17:44:28.0Many popular Web sites employ a set of geographically dispersed, replicated servers to address the issue of overloaded servers and network congestion. Such distributed Web sites require allocation mechanisms to dispatch request in a way such that any desired load distribution can be enforced. Unlike most traditional approaches, we propose a technique which pushes the allocation functionality onto the client. We argue that this approach scales well and may result in increased performance in many cases. Building on theoretical work based on game theory, we show that the usage of individual replicas can be affectively controlled with cost functions even when the clients are noncooperative. We present the design and implementation of WebSeAl, our prototype system realizing these techniques. WebSeAl does not require any changes to existing client and server code, conforms to HTTP standards, and does not generate any control messages. Experiment results indicate that WebSeAl improves performance while imposing little overhead. Incentive-compatible pricing strategies in noncooperative networks JMM master bibtexhttp://www.bibsonomy.org/bibtex/2dc9ab989f24381b988be13f164932f86/jmm jmm 2006-09-13T17:44:28+02:00 imported
Incentive-compatible pricing strategies in noncooperative networks
Y.A. Korilis and T.A. Varvarigou and S.R. Ahuja Proc. IEEE Infocom 439-446 (1998)
to imported by jmm on 2006-09-13 17:44:28 ]]> Proc. IEEE Infocom 439-446Incentive-compatible pricing strategies in noncooperative networks1998imported 2006-09-13 17:44:28.0 Achieving network optima using Stackelberg routing strategies. dblphttp://www.bibsonomy.org/bibtex/20032e0d0e80bcc2d2779e30a092466bf/dblp dblp 2006-03-02T00:00:00+01:00 dblp
Achieving network optima using Stackelberg routing strategies.
Yannis A. Korilis and Aurel A. Lazar and Ariel Orda IEEE/ACM Trans. Netw. 5 161-173 (1997)
to dblp by dblp on 2006-03-02 00:00:00 ]]> IEEE/ACM Trans. Netw.1161-173Achieving network optima using Stackelberg routing strategies.51997dblp 2006-03-02 00:00:00.0