| 1. |
- Kattge, Jens, et al.
(författare)
-
TRY plant trait database - enhanced coverage and open access
- 2020
-
Ingår i: Global Change Biology. - : Wiley-Blackwell. - 1354-1013 .- 1365-2486. ; 26:1, s. 119-188
-
Tidskriftsartikel (refereegranskat)abstract
- Plant traits-the morphological, anatomical, physiological, biochemical and phenological characteristics of plants-determine how plants respond to environmental factors, affect other trophic levels, and influence ecosystem properties and their benefits and detriments to people. Plant trait data thus represent the basis for a vast area of research spanning from evolutionary biology, community and functional ecology, to biodiversity conservation, ecosystem and landscape management, restoration, biogeography and earth system modelling. Since its foundation in 2007, the TRY database of plant traits has grown continuously. It now provides unprecedented data coverage under an open access data policy and is the main plant trait database used by the research community worldwide. Increasingly, the TRY database also supports new frontiers of trait-based plant research, including the identification of data gaps and the subsequent mobilization or measurement of new data. To support this development, in this article we evaluate the extent of the trait data compiled in TRY and analyse emerging patterns of data coverage and representativeness. Best species coverage is achieved for categorical traits-almost complete coverage for 'plant growth form'. However, most traits relevant for ecology and vegetation modelling are characterized by continuous intraspecific variation and trait-environmental relationships. These traits have to be measured on individual plants in their respective environment. Despite unprecedented data coverage, we observe a humbling lack of completeness and representativeness of these continuous traits in many aspects. We, therefore, conclude that reducing data gaps and biases in the TRY database remains a key challenge and requires a coordinated approach to data mobilization and trait measurements. This can only be achieved in collaboration with other initiatives.
|
|
| 2. |
- Moreno, N. R., et al.
(författare)
-
CCID5 : An implementation of the BBR congestion control algorithm for DCCP and its impact over multi-path scenarios
- 2021
-
Ingår i: ANRW 2021 - Proceedings of the 2021 Applied Networking Research Workshop. - New York, NY, USA : Association for Computing Machinery (ACM). - 9781450386180 ; , s. 52-58
-
Konferensbidrag (refereegranskat)abstract
- Providing multi-connectivity services is an important goal for next generation wireless networks, where multiple access networks are available and need to be integrated into a coherent solution that efficiently supports both reliable and non reliable traffic. Based on virtual network interfaces and per path congestion controlled tunnels, the MP-DCCP based multiaccess aggregation framework presents a novel solution that flexibly supports different path schedulers and congestion control algorithms as well as reordering modules. The framework has been implemented within the Linux kernel space and has been tested over different prototypes. Experimental results have shown that the overall performance strongly depends upon the congestion control algorithm used on the individual DCCP tunnels, denoted as CCID. In this paper, we present an implementation of the BBR (Bottleneck Bandwidth Round Trip propagation time) congestion control algorithm for DCCP in the Linux kernel. We show how BBR is integrated into the MP-DCCP multi-access framework and evaluate its performance over both single and multi-path environments. Our evaluation results show that BBR improves the performance compared to CCID2 (TCPlike Congestion Control) for multi-path scenarios due to the faster response to changes in the available bandwidth, which reduces latency and increases performance, especially for unreliable traffic. The MP-DCCP framework code, including the new CCID5 is available as OpenSource1.
|
|
