1 resultado para lean strategy selection, leanness assessment, optimisation
em Boston University Digital Common
Filtro por publicador
- JISC Information Environment Repository (1)
- Repository Napier (2)
- Aberystwyth University Repository - Reino Unido (4)
- Academic Archive On-line (Jönköping University; Sweden) (3)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (7)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (18)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (3)
- Archive of European Integration (17)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (5)
- Aston University Research Archive (57)
- Avian Conservation and Ecology - Eletronic Cientific Hournal - Écologie et conservation des oiseaux: (4)
- Biblioteca de Teses e Dissertações da USP (1)
- Biblioteca Digital | Sistema Integrado de Documentación | UNCuyo - UNCUYO. UNIVERSIDAD NACIONAL DE CUYO. (2)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (12)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (3)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (34)
- Boston University Digital Common (1)
- Brock University, Canada (4)
- Bulgarian Digital Mathematics Library at IMI-BAS (2)
- Cambridge University Engineering Department Publications Database (19)
- CentAUR: Central Archive University of Reading - UK (32)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (3)
- Cochin University of Science & Technology (CUSAT), India (2)
- Coffee Science - Universidade Federal de Lavras (2)
- Collection Of Biostatistics Research Archive (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (13)
- CORA - Cork Open Research Archive - University College Cork - Ireland (7)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (16)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (3)
- Deakin Research Online - Australia (80)
- Department of Computer Science E-Repository - King's College London, Strand, London (1)
- Digital Commons - Michigan Tech (1)
- Digital Commons - Montana Tech (2)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (12)
- Digital Repository at Iowa State University (1)
- DigitalCommons@The Texas Medical Center (6)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (4)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (18)
- FUNDAJ - Fundação Joaquim Nabuco (4)
- Glasgow Theses Service (2)
- Greenwich Academic Literature Archive - UK (10)
- Helda - Digital Repository of University of Helsinki (3)
- Hospital Prof. Dr. Fernando Fonseca - Portugal (1)
- Indian Institute of Science - Bangalore - Índia (17)
- Instituto Gulbenkian de Ciência (1)
- Instituto Nacional de Saúde de Portugal (1)
- Instituto Politécnico do Porto, Portugal (6)
- Iowa Publications Online (IPO) - State Library, State of Iowa (Iowa), United States (3)
- Laboratório Nacional de Energia e Geologia - Portugal (1)
- Massachusetts Institute of Technology (4)
- National Center for Biotechnology Information - NCBI (10)
- Nottingham eTheses (6)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (13)
- Portal de Revistas Científicas Complutenses - Espanha (4)
- QSpace: Queen's University - Canada (4)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (56)
- Queensland University of Technology - ePrints Archive (106)
- RCAAP - Repositório Científico de Acesso Aberto de Portugal (1)
- RDBU - Repositório Digital da Biblioteca da Unisinos (2)
- Repositorio Académico de la Universidad Nacional de Costa Rica (2)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (2)
- Repositório Científico da Universidade de Évora - Portugal (3)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (5)
- Repositório digital da Fundação Getúlio Vargas - FGV (8)
- Repositório Digital da UNIVERSIDADE DA MADEIRA - Portugal (1)
- 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 (5)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (33)
- Repositorio Institucional Universidad de Medellín (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (11)
- SAPIENTIA - Universidade do Algarve - Portugal (2)
- School of Medicine, Washington University, United States (1)
- Universidad de Alicante (5)
- Universidad del Rosario, Colombia (18)
- Universidad Politécnica de Madrid (15)
- Universidade Complutense de Madrid (1)
- Universidade de Lisboa - Repositório Aberto (2)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (3)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (4)
- Université de Lausanne, Switzerland (6)
- Université de Montréal (2)
- Université de Montréal, Canada (11)
- Université Laval Mémoires et thèses électroniques (1)
- University of Michigan (11)
- University of Queensland eSpace - Australia (28)
- University of Washington (6)
- WestminsterResearch - UK (5)
Resumo:
In a typical overlay network for routing or content sharing, each node must select a fixed number of immediate overlay neighbors for routing traffic or content queries. A selfish node entering such a network would select neighbors so as to minimize the weighted sum of expected access costs to all its destinations. Previous work on selfish neighbor selection has built intuition with simple models where edges are undirected, access costs are modeled by hop-counts, and nodes have potentially unbounded degrees. However, in practice, important constraints not captured by these models lead to richer games with substantively and fundamentally different outcomes. Our work models neighbor selection as a game involving directed links, constraints on the number of allowed neighbors, and costs reflecting both network latency and node preference. We express a node's "best response" wiring strategy as a k-median problem on asymmetric distance, and use this formulation to obtain pure Nash equilibria. We experimentally examine the properties of such stable wirings on synthetic topologies, as well as on real topologies and maps constructed from PlanetLab and AS-level Internet measurements. Our results indicate that selfish nodes can reap substantial performance benefits when connecting to overlay networks composed of non-selfish nodes. On the other hand, in overlays that are dominated by selfish nodes, the resulting stable wirings are optimized to such great extent that even non-selfish newcomers can extract near-optimal performance through naive wiring strategies.