citefile3-EN.bib

@comment{{This file has been generated by bib2bib 1.98}}
@comment{{Command line: /usr/bin/bib2bib -oc citefile3-EN -ob citefile3-EN.bib -s year -r -c "$type= 'ARTICLE'" -q biblio-EN.bib}}
@article{BertinHLT14,
  author = {R{\'{e}}mi Bertin and
               Sascha Hunold and
               Arnaud Legrand and
               Corinne Touati},
  title = {Fair scheduling of bag-of-tasks applications using distributed Lagrangian
               optimization},
  journal = {J. Parallel Distrib. Comput.},
  year = {2014},
  volume = {74},
  number = {1},
  pages = {1914--1929},
  url = {http://dx.doi.org/10.1016/j.jpdc.2013.08.011}
}
@article{DBLP:KamedaATL12,
  author = {Hisao Kameda and
               Eitan Altman and
               Corinne Touati and
               Arnaud Legrand},
  title = {Nash equilibrium based fairness},
  journal = {Math. Meth. of {OR}},
  year = {2012},
  volume = {76},
  number = {1},
  pages = {43--65}
}
@article{DTW_perf_07,
  author = {Dube, Parijat and Touati, Corinne and Wynter, Laura},
  title = {Capacity planning, Quality-of-Service and Price Wars},
  journal = {ACM Sigmetrics Performance Evaluation Review},
  year = 2007,
  volume = 35,
  number = 3,
  pages = {31-33},
  month = dec,
  note = {Special issue: Performance 2007 posters},
  keywords = {pricing, Stackelberg equilibrium}
}
@article{TAG_comnet_06,
  author = {Touati, Corinne and Altman, Eitan and Galtier,
                  Jérôme},
  title = {Generalized {N}ash Bargaining Solution for Bandwidth
                  Allocation},
  journal = {Computer Networks},
  year = 2006,
  volume = 50,
  number = 17,
  pages = {3242--3263},
  month = dec,
  keywords = {Nash Bargaining Solution, bandwidth allocation, fairness},
  abstract = {For over a decade, the Nash Bargaining Solution (NBS)
                  concept from cooperative game theory has been used in
                  networks to share resources fairly. Due to its many
                  appealing properties, it has recently been used for
                  assigning bandwidth in a general topology network between
                  applications that have linear utility functions. In this
                  paper, we use this concept for allocating the bandwidth
                  between applications with general concave utilities. Our
                  framework includes in fact several other fairness criteria,
                  such as the max-min criteria. We study the impact of
                  concavity on the allocation and present computational
                  methods for obtaining fair allocations in a general
                  topology, based on a dual Lagrangian approach and on
                  Semi-Definite Programming.},
  pdf = {http://www-id.imag.fr/Laboratoire/Membres/Touati_Corinne/Articles/comnet-preprint.pdf},
  ps = {http://www-id.imag.fr/Laboratoire/Membres/Touati_Corinne/Articles/comnet-preprint.ps},
  comment = {sel}
}
@article{IKT_CoR_06,
  author = {Inoie, Atsushi and Kameda, Hisao and Touati, Corinne},
  title = {A paradox in Optimal Flow Control of {M/M/n} Queues},
  journal = {Computers \& {O}peration {R}esearch},
  year = 2006,
  volume = 33,
  number = 2,
  pages = {356--368},
  pdf = {http://www-id.imag.fr/Laboratoire/Membres/Touati_Corinne/Articles/MMm.pdf},
  keywords = {queuing theory, Braess paradox, flow control},
  comment = {sel}
}
@article{TAG_games_03,
  author = {Touati, Corinne and Altman, Eitan and Galtier,
                  Jérôme},
  title = {Semi-Definite Programming Approach for Bandwidth
                  Allocation and Routing in Networks},
  journal = {Game {T}heory and {A}pplications},
  year = 2003,
  volume = 9,
  pages = {169--179},
  month = dec,
  note = {Nova publisher},
  pdf = {http://www-id.imag.fr/Laboratoire/Membres/Touati_Corinne/Articles/},
  keywords = {Semi-Definite Programming, bandwidth allocation, routing, fairness}
}