1 resultado para Categories of impact
em Boston University Digital Common
Filtro por publicador
- JISC Information Environment Repository (1)
- KUPS-Datenbank - Universität zu Köln - Kölner UniversitätsPublikationsServer (1)
- Abertay Research Collections - Abertay University’s repository (1)
- Aberystwyth University Repository - Reino Unido (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 (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (8)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (6)
- Aquatic Commons (20)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (15)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (5)
- Aston University Research Archive (40)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (21)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (8)
- Biblioteca Digital de Teses e Dissertações Eletrônicas da UERJ (1)
- Bioline International (1)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (54)
- Boston University Digital Common (1)
- Brock University, Canada (5)
- Bucknell University Digital Commons - Pensilvania - USA (6)
- Bulgarian Digital Mathematics Library at IMI-BAS (3)
- CaltechTHESIS (4)
- Cambridge University Engineering Department Publications Database (53)
- CentAUR: Central Archive University of Reading - UK (32)
- Central European University - Research Support Scheme (3)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (21)
- Cochin University of Science & Technology (CUSAT), India (7)
- Coffee Science - Universidade Federal de Lavras (1)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (3)
- CORA - Cork Open Research Archive - University College Cork - Ireland (6)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (4)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (6)
- Deakin Research Online - Australia (122)
- Digital Commons - Michigan Tech (1)
- Digital Commons @ DU | University of Denver Research (2)
- Digital Commons at Florida International University (3)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (21)
- DigitalCommons@University of Nebraska - Lincoln (3)
- Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland (1)
- DRUM (Digital Repository at the University of Maryland) (4)
- Duke University (5)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (9)
- Glasgow Theses Service (2)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (16)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (21)
- Instituto Politécnico de Santarém (1)
- Instituto Politécnico do Porto, Portugal (2)
- Instituto Superior de Psicologia Aplicada - Lisboa (2)
- Massachusetts Institute of Technology (2)
- National Center for Biotechnology Information - NCBI (9)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (2)
- Portal de Revistas Científicas Complutenses - Espanha (2)
- Publishing Network for Geoscientific & Environmental Data (8)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (54)
- Queensland University of Technology - ePrints Archive (145)
- ReCiL - Repositório Científico Lusófona - Grupo Lusófona, Portugal (2)
- Repositório digital da Fundação Getúlio Vargas - FGV (11)
- Repositório Institucional da Universidade de Aveiro - Portugal (2)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (54)
- Research Open Access Repository of the University of East London. (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (2)
- SAPIENTIA - Universidade do Algarve - Portugal (3)
- Universidad de Alicante (7)
- Universidad del Rosario, Colombia (4)
- Universidad Politécnica de Madrid (19)
- Universidade de Lisboa - Repositório Aberto (2)
- Universidade Federal do Pará (7)
- Universidade Federal do Rio Grande do Norte (UFRN) (2)
- Universitat de Girona, Spain (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (22)
- University of Connecticut - USA (3)
- University of Michigan (6)
- University of Queensland eSpace - Australia (15)
- University of Washington (5)
- WestminsterResearch - UK (4)
Resumo:
To serve asynchronous requests using multicast, two categories of techniques, stream merging and periodic broadcasting have been proposed. For sequential streaming access where requests are uninterrupted from the beginning to the end of an object, these techniques are highly scalable: the required server bandwidth for stream merging grows logarithmically as request arrival rate, and the required server bandwidth for periodic broadcasting varies logarithmically as the inverse of start-up delay. However, sequential access is inappropriate to model partial requests and client interactivity observed in various streaming access workloads. This paper analytically and experimentally studies the scalability of multicast delivery under a non-sequential access model where requests start at random points in the object. We show that the required server bandwidth for any protocols providing immediate service grows at least as the square root of request arrival rate, and the required server bandwidth for any protocols providing delayed service grows linearly with the inverse of start-up delay. We also investigate the impact of limited client receiving bandwidth on scalability. We optimize practical protocols which provide immediate service to non-sequential requests. The protocols utilize limited client receiving bandwidth, and they are near-optimal in that the required server bandwidth is very close to its lower bound.