EAEric Angel
Eric Angel
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Eric Angel has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Evripidis Bampis
Université d’Évry Val d’Essonne
3 shared publications - Fanny Pascual
LIP6, Sorbonne Université
2 shared publications Gerasimos G. Pollatos
Department of Informatics and Telecommunications University of Athens Greece
1 shared publication- Vassilis Zissimopoulos
National and Kapodistrian University of Athens
1 shared publication
Latest Publications
- Open Access
Optimal Data Placement on Networks With Constant Number of Clients
We introduce optimal algorithms for the problems of data placement (DP) and page placement (PP) in networks with a constant number of clients each of which has limited storage availability and issues requests for data objects. The objective for both problems is to efficiently utilize each client's storage (deciding where to place replicas of objects) so that the total incurred access and installation cost over all clients is minimized. In the PP problem an extra constraint on the maximum number of clients served by a single client must be satisfied. Our algorithms solve both problems optimally when all objects have uniform lengths. When objects lengths are non-uniform we also find the optimal solution, albeit a small, asymptotically tight violation of each client's storage size by $\epsilon$lmax where lmax is the maximum length of the objects and $\epsilon$ some arbitrarily small positive constant. We make no assumption on the underlying topology of the network (metric, ultrametric etc.), thus obtaining the first non-trivial results for non-metric data placement problems.Open AccessOptimal Data Placement on Networks With Constant Number of Clients
We introduce optimal algorithms for the problems of data placement (DP) and page placement (PP) in networks with a constant number of clients each of which has limited storage availability and issues requests for data objects. The objective for both problems is to efficiently utilize each client's storage (deciding where to place replicas of objects) so that the total incurred access and installation cost over all clients is minimized. In the PP problem an extra constraint on the maximum number of clients served by a single client must be satisfied. Our algorithms solve both problems optimally when all objects have uniform lengths. When objects lengths are non-uniform we also find the optimal solution, albeit a small, asymptotically tight violation of each client's storage size by $\epsilon$lmax where lmax is the maximum length of the objects and $\epsilon$ some arbitrarily small positive constant. We make no assumption on the underlying topology of the network (metric, ultrametric etc.), thus obtaining the first non-trivial results for non-metric data placement problems. - 4 June 2008
- Published by Springer Nature in Journal of Scheduling
- Vol. 11 (5) , 311-322
The impact of local policies on the quality of packet routing in paths, trees, and rings
- 4 June 2008
- Published by Springer Nature in Journal of Scheduling
- Vol. 11 (5) , 311-322
The impact of local policies on the quality of packet routing in paths, trees, and rings
- 1 December 2007
- Published by Springer Nature in Annals of Operations Research
- Vol. 159 (1) , 53-64
How good are SPT schedules for fair optimality criteria
- 1 December 2007
- Published by Springer Nature in Annals of Operations Research
- Vol. 159 (1) , 53-64
How good are SPT schedules for fair optimality criteria