1 resultado para Full scale testing
em Boston University Digital Common
Filtro por publicador
- Repository Napier (1)
- Aberdeen University (3)
- Academic Archive On-line (Karlstad University; Sweden) (1)
- Academic Research Repository at Institute of Developing Economies (2)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (13)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (13)
- Aquatic Commons (13)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (2)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (1)
- Aston University Research Archive (39)
- Biblioteca de Teses e Dissertações da USP (7)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (14)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (1)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (4)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (22)
- Boston University Digital Common (1)
- Brock University, Canada (4)
- Bucknell University Digital Commons - Pensilvania - USA (8)
- Bulgarian Digital Mathematics Library at IMI-BAS (1)
- CaltechTHESIS (5)
- Cambridge University Engineering Department Publications Database (35)
- CentAUR: Central Archive University of Reading - UK (33)
- Central European University - Research Support Scheme (2)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (15)
- Coffee Science - Universidade Federal de Lavras (1)
- Collection Of Biostatistics Research Archive (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (1)
- CORA - Cork Open Research Archive - University College Cork - Ireland (7)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (2)
- CUNY Academic Works (2)
- Dalarna University College Electronic Archive (5)
- Deakin Research Online - Australia (47)
- Digital Commons - Michigan Tech (8)
- Digital Commons at Florida International University (19)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (6)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (8)
- Duke University (3)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (9)
- Glasgow Theses Service (3)
- Greenwich Academic Literature Archive - UK (18)
- Helda - Digital Repository of University of Helsinki (10)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (2)
- Indian Institute of Science - Bangalore - Índia (28)
- Institutional Repository of Leibniz University Hannover (1)
- Instituto Politécnico do Porto, Portugal (2)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (2)
- Open University Netherlands (1)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (8)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- Publishing Network for Geoscientific & Environmental Data (4)
- QSpace: Queen's University - Canada (3)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (96)
- Queensland University of Technology - ePrints Archive (179)
- Repositório Científico da Universidade de Évora - Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (2)
- Repositório do Centro Hospitalar de Lisboa Central, EPE - Centro Hospitalar de Lisboa Central, EPE, Portugal (1)
- Repositório Institucional da Universidade de Aveiro - Portugal (4)
- Repositório Institucional da Universidade de Brasília (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (31)
- Research Open Access Repository of the University of East London. (5)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (3)
- SAPIENTIA - Universidade do Algarve - Portugal (1)
- Universidad de Alicante (5)
- Universidad del Rosario, Colombia (3)
- Universidad Politécnica de Madrid (48)
- Universidade dos Açores - Portugal (1)
- Universidade Federal do Pará (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (10)
- Université de Lausanne, Switzerland (3)
- Université de Montréal (2)
- Université de Montréal, Canada (7)
- University of Connecticut - USA (2)
- University of Michigan (37)
- University of Queensland eSpace - Australia (36)
- University of Washington (2)
- Worcester Research and Publications - Worcester Research and Publications - UK (2)
Resumo:
The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The classical, centralized approach to determining the latter would amount to formulating and solving the uncapacitated k-median (UKM) problem (if the requested number of facilities is fixed), or the uncapacitated facility location (UFL) problem (if the number of facilities is also to be optimized). Clearly, such centralized approaches require knowledge of global topological and demand information, and thus do not scale and are not practical for large networks. The key question posed and answered in this paper is the following: "How can we determine in a distributed and scalable manner the number and location of service facilities?" We propose an innovative approach in which topology and demand information is limited to neighborhoods, or balls of small radius around selected facilities, whereas demand information is captured implicitly for the remaining (remote) clients outside these neighborhoods, by mapping them to clients on the edge of the neighborhood; the ball radius regulates the trade-off between scalability and performance. We develop a scalable, distributed approach that answers our key question through an iterative reoptimization of the location and the number of facilities within such balls. We show that even for small values of the radius (1 or 2), our distributed approach achieves performance under various synthetic and real Internet topologies that is comparable to that of optimal, centralized approaches requiring full topology and demand information.